11060 - Beverages

[lighted]

Post your code

[flashion]

Code: Select all

below

[lighted]

Your terminating condition doesnt work. Maybe it is because of some spaces at the end of file.

Change it to

Code: Select all

while(cin >> n) {
  name.clear();

After each test case you must print a blank line.

Don't forget to remove your code after getting accepted.

[flashion]

Thanks, but still WA

Code: Select all

AC

[lighted]

I repeat you again

After each test case you must print a blank line.

It must be

Code: Select all

cout << "." << endl << endl;

[flashion]

Thank you, you're my hero.

[nbacool2]

Ok, so I tested my code against all of the inputs in this topic and got correct outputs on all but I still get WA on the judge. Does anyone have any idea what's the problem?

Code: Select all

Removed after getting AC

[lighted]

After each test case you must print a blank line

Don't forget to remove your code after getting accepted.

[nbacool2]

After each test case you must print a blank line

Don't forget to remove your code after getting accepted.

Thanks, got AC now ! That's one of the things I hate about UVa - the fancy output and strict rules. I waste a lot of time wondering what's wrong with my code when it's the output formatting

[sreka11]

Why am I getting a runtime error ?

//Accepted

[brianfry713]

It looks like you figured it out.

[sreka11]

Thanks anyway

[z_shadow]

I can't seem to understand why I"m getting WA, I tried the cases I found here but my code passes them, here's my code http://ideone.com/YVyvZl

[lighted]

I sent you PM

[Rafiq123]

Code: Select all

#include<cstdio>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<iostream>
#define MAX 300

using namespace std;

int mat[MAX][MAX],indegree[MAX],cnt,color[MAX];
string a,X,Y,stor;
map<string,int>mymap;
map<int,string>my;

void TOP(int N)
{
    queue<int>Q;
    int t=0;
    while(cnt!=N)
    {
        for(int i=1; i<=N; i++)
        {
            if(indegree[i]==0&&color[i]==0)
            {
                if(t==0)
                    stor +=my[i];
                else
                    stor += " "+my[i];
                //hold[k++] = i;
                Q.push(i);
                cnt++;
                color[i] = 1;
                //cout<<cnt<<endl;
                t++;
            }
            if(cnt==N)
                break;
        }
        if(cnt==N)
            break;
        //cout<<stor<<endl;
        while(!Q.empty())
        {
            int frt = Q.front();
            Q.pop();
            for(int j=1; j<=N; j++)
            {
                if(mat[frt][j]==1)
                {
                    indegree[j] = indegree[j] - 1;
                    if(indegree[j]==0&&color[j]==0)
                    {
                        Q.push(j);
                        color[j] = 1;
                        stor += " "+my[j];
                        cnt++;
                    }
                }
                if(cnt==N)
                    break;
            }
            if(cnt==N)
                break;
        }
        if(cnt==N)
            break;
    }
}

int main()
{
    int N,M,top,cse=0;
    while(scanf("%d",&N)==1)
    {
        memset(mat,0,sizeof(mat));
        memset(indegree,0,sizeof(indegree));
        memset(color,0,sizeof(color));
        cse++;
        stor = "\0";
        //cout<<stor<<endl;
        cnt=0;
        top = 1;
        for(int i=1; i<=N; i++)
        {
            cin>>a;
            if(!mymap[a])
            {
                mymap[a] = top;
                my[top] = a;
                //cout<<"X "<<my[top]<<" "<<top<<endl;
                top++;
            }
        }
//        for(int i=1; i<=N; i++)
//            indegree[i] = 0;
        scanf("%d",&M);
        for(int i=1; i<=M; i++)
        {
            cin>>X>>Y;
            mat[mymap[X]][mymap[Y]] = 1;
            indegree[mymap[Y]] = indegree[mymap[Y]] + 1;
        }
//         for(int i=1; i<=N; i++){
//            printf("%d ",indegree[i]);
//            cout<<my[i]<<endl;
//         }

        TOP(N);

        cout<<"Case #"<<cse<<": Dilbert should drink beverages in this order: "<<stor<<"."<<"\n"<<endl;

        mymap.clear();
        my.clear();
    }

    return 0;
}