Can someone help me to debug this C++ code? It got crash at 19th test-case.

#include<cstdio>
#include<vector>
#include<queue>
using namespace std;

vector<int> p[1005];
vector<int> idxs[10005];
int dist[10005];
int bef[10005];
queue<int> q;

void print(int n)
{
    if(n!=-1)
    {
        print(bef[n]);
        printf("%d ",n);
    }
}

int main()
{
    int n,m,c,d,awl,akh,tmp;
    bool sudah = false;
    scanf("%d%d",&m,&n);
    for(c=0;c<=n;c++)
    {
        dist[c] = 10000000;
        bef[c] = -1;
    }
    for(c=0;c<m;c++)
    {
        scanf("%d",&d);
        while(d--)
        {
            scanf("%d",&tmp);
            p[c].push_back(tmp);
            idxs[tmp].push_back(c);
        }
    }
    scanf("%d%d",&awl,&akh);
    dist[awl] = 0;
    q.push(awl);
    while(!q.empty())
    {
        tmp = q.front();
        q.pop();
        n = idxs[tmp].size();
        for(c=0;c<n;c++)
        {
            m = p[idxs[tmp][c]].size();
            for(d=0;d<m;d++) if(p[idxs[tmp][c]][d]!=tmp) if(dist[p[idxs[tmp][c]][d]] > dist[tmp]+1)
            {
                dist[p[idxs[tmp][c]][d]] = dist[tmp] + 1;
                bef[p[idxs[tmp][c]][d]] = tmp;
                if(p[idxs[tmp][c]][d]==akh) sudah = true;
                else q.push(p[idxs[tmp][c]][d]);
            }
            if(sudah) break;
        }
        if(sudah) break;
    }
    if(dist[akh]==10000000)
    {
        printf("-1\n");
        return 0;
    }
    printf("%d\n",dist[akh]);
    print(akh);
    printf("\n");
    return 0;
}

Thanks in advance.

http://acm.timus.ru/status.aspx?space=1&pos=1061981

I advise everyone to learn good memory usage despite large memory limits.

Edited by author 01.03.2006 14:37

I'm worn out already. Lasarus compiled code. FPC version - 2.6.0. Get the right result. Send in the check, get - Wrong answer (test 3).

var c: char;
    i:longint;
    l:extended;
    numbers: array of extended;
begin
    l:=-1;
    SetLength(numbers,0);
    while not Eof do
      begin
        Read(c);
        if c in ['0'..'9'] then
          begin
            if l=-1 then l:=Ord(c)-48
            else
              l:=l*10+Ord(c)-48;
          end
        else
          begin
            if l<>-1 then
              begin
                SetLength(numbers,length(numbers)+1);
                numbers[length(numbers)-1]:=sqrt(l);
              end;
            l:=-1;
          end;
      end;
    for i:=length(numbers)-1 downto 0 do
      writeln(numbers[i]:0:4);
end.

#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
using namespace std;

int main()
{
    ifstream f("input.txt");
    ofstream o("output.txt");
    int n=0;
    long double a[100];
    long double k;
    f >> k;
    while(!f.eof())
    {
    a[n] = sqrt(k);
    n++;
    f >> k;
    }

    for ( int i=n-1 ; i >= 0 ; i-- )
    o << fixed << setprecision(4) << a[i] << endl;
    return 0;
}

Memory limit exceeded    #7    time = 1.312    Memory used = 20 620 KB.
Why memory used too much???? :((


#include <iostream>
#include <math.h>
#include <iomanip>
#include <string>
#include <sstream>
using namespace std;

string d2s(double x)
{
    stringstream ii;
    ii << fixed << setprecision(4) << x;
    return ii.str();
}

int main( )
{
    double n;
        string s = "";
    while ((cin >> n))
    {
          s = d2s(sqrt(n)) + "\n" + s;
    }
    cout << s;

    return 0;
}

#include<math.h>
#include<stdio.h>
int main()
{
    double arr[1000];
    int i=0,count=0;
    while(scanf("%lf",&arr[i]))
    {
        arr[i] = sqrt(arr[i]);
        i++; count++;
    }
    for(i=count-1;i>=0;i--)
        printf("\n %0.4lf",arr[i]);
    return 0;
}

Heavy-Light-Decomposition -> GOOD data structure! thank you all!

here is my code:

#include <stdio.h>
int total(int count, int sum)
{
    int result = 0;
    if( count > 1 )
    {
        int i=0;
        for (; i <= 9; i++)
        {
            result += total(count - 1, sum     - i);
        }
    }
    else
    {
        return  sum     < 10 && sum >= 0 ? 1 : 0;
    }
    return result;
}

int main ()
{
    unsigned a;
    int n,i,c,b;

    scanf("%ud", &a);
    b = a / 2 * 9;
    for(i=0; i <= b; i++ )
    {
        c = total(a/2, i);
        n += c * c;
    }
    printf("%d", n);

    return 0;
}
i tried 2,4,6,8,the result is correct,but when i submit my solution,[wrong answer] is returned...

Edited by author 02.09.2011 14:58

In first line  trochee, and iamb both has. why no "not a poem" ?

Now, I understand, very easy :)

Edited by author 15.02.2012 19:38

q cago en el juez!

#include<stdio.h>

int main(void){
    int n,m;
    unsigned int k;
    scanf("%d %d",&n,&m);
    k=0;
    while(n>2 && m>2){
        k=k+4;
        n-=2;
        m-=2;
    }
    if(n==2 && m>=2)
        k=k+2;
    else
        if(m==2 && n>2)
            k=k+3;
    else
        if(m==1 && n>1)
            k++;
    printf("%d",k);
return 0;
}

check all x = p/q, rational numbers ( -100 <= p <= 100,  1 <= q <= 100),
find P'(x) = 0  roots , (v[0], v[1], .. v[k] ->  P'(v[i]) = 0).
try find roots with binary search in [ v[i] .. v[i+1] ] !!!!!

http://en.wikipedia.org/wiki/Casus_irreducibilis
http://en.wikipedia.org/wiki/Rational_root_test
http://en.wikipedia.org/wiki/Cubic_function

Please check my submission 4323013. It gets AC although to the input
4 3
1 2
2 4
4 3

it answers
1
2 4

when the right answer is clearly
2
1 2
3 4

Edited by author 23.06.2012 12:37

Используйте связные списки вместо массивов и не надо будет никаких извращений с предпроверкой считываемых символов. Более того, пройдет даже с использованием cin cout вместо scanf printf.

Does anybody has any idea?

use DFS with memorization

I don't understand the 2nd sample test.
Is a player go on the path from where the othe player reach?
Or are the players move on different path?

abcd
aaaaabcdaaaa
ans : a a a a abcd a a a a
When I print answers,I print them from the end)))
Sorry for my poor English))))

Edited by author 22.06.2012 15:47