0_0_35106984_22074.cpp:5:10: error: #include expects "FILENAME" or <FILENAME>
#include
^
0_0_35106984_22074.cpp:6:11: error: #include expects "FILENAME" or <FILENAME>
#include
^
0_0_35106984_22074.cpp:8:10: error: #include expects "FILENAME" or <FILENAME>
#include
^
0_0_35106984_22074.cpp:9:10: error: #include expects "FILENAME" or <FILENAME>
#include
^
0_0_35106984_22074.cpp:10:10: error: #include expects "FILENAME" or <FILENAME>
#include
^
0_0_35106984_22074.cpp:19:1: error: invalid use of template-name 'std::vector' without an argument list
vector g[maxn];
^
0_0_35106984_22074.cpp:21:1: error: invalid use of template-name 'std::queue' without an argument list
queue q;
^
0_0_35106984_22074.cpp: In function 'void init()':
0_0_35106984_22074.cpp:43:3: error: 'g' was not declared in this scope
g[i].clear();
^
0_0_35106984_22074.cpp: In function 'int topsort()':
0_0_35106984_22074.cpp:67:8: error: 'q' was not declared in this scope
while(!q.empty())
^
0_0_35106984_22074.cpp:71:14: error: expected ';' before '{' token
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
^
0_0_35106984_22074.cpp:71:14: error: expected primary-expression before '{' token
0_0_35106984_22074.cpp:71:14: error: expected ')' before '{' token
0_0_35106984_22074.cpp:71:36: error: 'q' was not declared in this scope
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
^
0_0_35106984_22074.cpp:71:68: error: 'q' was not declared in this scope
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
^
0_0_35106984_22074.cpp:71:144: error: expected ';' before '{' token
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
^
0_0_35106984_22074.cpp:71:144: error: expected primary-expression before '{' token
0_0_35106984_22074.cpp:71:144: error: expected ')' before '{' token
0_0_35106984_22074.cpp:71:153: error: 'g' was not declared in this scope
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
^
0_0_35106984_22074.cpp:71:186: error: 'posreturn' was not declared in this scope
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
^
0_0_35106984_22074.cpp:71:196: error: expected ')' before numeric constant
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
^
0_0_35106984_22074.cpp: In function 'int main()':
0_0_35106984_22074.cpp:71:307: error: expected ';' before '{' token
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
^
0_0_35106984_22074.cpp:71:307: error: expected primary-expression before '{' token
0_0_35106984_22074.cpp:71:307: error: expected ')' before '{' token
0_0_35106984_22074.cpp:71:440: error: expected ';' before '{' token
for(int i=0;i{if(in[i]==0&&f[i]==i)q.push(i);}bool un=false;while(!q.empty()){if(q.size()>1)un=true;int t=q.front();q.pop();pos++;for(int i=0;i{if(--in[g[t][i]]==0)q.push(g[t][i]);}}if(posreturn 1;else if(un)return 2;return 3;}int main(){int x1,y1;while(scanf("%d%d",&n,&m)!=EOF){init();pos=0;for(int i=0;i{scanf("%d %c %d",&l[i].x,&l[i].o,&l[i].y);if(l[i].o=='='){x1=find(l[i].x);y1=find(l[i].y);if(x1!=y1){f[x1]=y1;pos++;}}}for(int i=0;i{ if(l[i].o!='='){ x1=find(l[i].x); y1=find(l[i].y); if(l[i].o=='>') {g[x1].push_back(y1);in[y1]++; } else if(l[i].o=='<') {g[y1].push_back(x1);in[x1]++; }}}int flag=topsort();if(flag==1)printf("CONFLICT\n");else if(flag==2)printf("UNCERTAIN\n");elseprintf("OK\n");}return 0;}
|