11686 - Pick up sticks

[ymgve]

Hi, I'm trying to do the Pick up sticks problem and wonder if it's possible to do in Java with normal data structures. Just using one ArrayList for each node already gives me a TLE. Any suggestions?

[arifcsecu]

Remove Now wrong answer

[Tuz]

you can try this:
struct edge_t
{
int u;
int v;
int next;
};
int first[MAXN];
int tot;
void add_edge(int u, int v)
{
e[++tot].u = u; e[tot].v = v; e[tot].next = first; first = next;
}

[Chimed]

i solve the problem but getting Run Time error
Please any body help me
where the error occured

My code is :
#include<stdio.h>
int main()
{
long int s[1000001][2];
blah blah...
for(i=1;i<=n;i++)
if(s[1]==0)
{
j=i;
break;

}
printf("%ld\n",j);
a=s[j][0];
for(;1;)
{
if(a==0)
break;
printf("%ld\n",a);
a=s[a][0];
}
blah blah...
PLEASE ANY BODY HELP ME

1st. your program stack overflows I suggest you write the declaration of s before the main function.
2nd. does your solution is really correct here is the simple input
3 1
1 2
0 0
Expected answer is
1
2
3
or
3
1
2
or
1
3
2

[arifcsecu]

Code romove
After accepted

[ymgve]

That doesn't answer the question, though. If you have to reinvent data structures that are already in the language, you're not focusing on the right part of the problem.

[MRH]

TRY THIS CASE
4 3
4 1
1 2
3 2
MY Acc code give :
3
4
1
2

[arifcsecu]

remove

[helloneo]

Try "Topological Sort"

[arifcsecu]

remove

[arifcsecu]

Code remove
After Accepted

[Igor9669]

Try to change cin/cout to scanf/printf. May be this could help.

[arifcsecu]

Try to change cin/cout to scanf/printf. May be this could help.

Thanks
Accpted now
This problem makes me one third mad

Please Can u explain me what does it happen

[arifcsecu]

TRY THIS CASE
4 3
4 1
1 2
3 2
MY Acc code give :
3
4
1
2

Thanks
Accepted now

[Igor9669]

scanf/printf use another aproach how to read and how to write data, they are much more faster than cin/cout.