Pagini recente » Borderou de evaluare (job #1932518) | Borderou de evaluare (job #3293790) | Borderou de evaluare (job #3293652) | Borderou de evaluare (job #1933632) | Borderou de evaluare (job #2190753)
Borderou de evaluare (job #2190753)
Raport evaluator
Compilare:
user.cpp: In function ‘void d(int)’:
user.cpp:4:158: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;ifstream f("ctc.in");ofstream g("ctc.out");int n,m,k,sol,SZ,v[N];vector<int>A[N],B[N],Q[N];int G[N];void d(int R){v[R]=true;for(int i=0;i<A[R].size();++i)if(!v[A[R][i]])d(A[R][i]);G[++k]=R;}void a(int R){v[R]=true;for(int i=0;i<B[R].size();++i)if(!v[B[R][i]])a(B[R][i]);Q[sol].pb(R);}int main(){int i,j,x,y;f>>n>>m;for(i=1;i<=m;++i)f>>x>>y,A[x].pb(y),B[y].pb(x);for(i=1;i<=n;++i)if(!v[i])d(i);memset(v,0,sizeof(v));for(i=k;i>=1;--i)if(!v[G[i]])++sol,a(G[i]);g<<sol<<'\n';for(i=1;i<=sol;++i){for(j=0;j<Q[i].size();++j)g<<Q[i][j]<<' ';g<<'\n';}return 0;}
~^~~~~~~~~~~~
user.cpp: In function ‘void a(int)’:
user.cpp:4:248: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;ifstream f("ctc.in");ofstream g("ctc.out");int n,m,k,sol,SZ,v[N];vector<int>A[N],B[N],Q[N];int G[N];void d(int R){v[R]=true;for(int i=0;i<A[R].size();++i)if(!v[A[R][i]])d(A[R][i]);G[++k]=R;}void a(int R){v[R]=true;for(int i=0;i<B[R].size();++i)if(!v[B[R][i]])a(B[R][i]);Q[sol].pb(R);}int main(){int i,j,x,y;f>>n>>m;for(i=1;i<=m;++i)f>>x>>y,A[x].pb(y),B[y].pb(x);for(i=1;i<=n;++i)if(!v[i])d(i);memset(v,0,sizeof(v));for(i=k;i>=1;--i)if(!v[G[i]])++sol,a(G[i]);g<<sol<<'\n';for(i=1;i<=sol;++i){for(j=0;j<Q[i].size();++j)g<<Q[i][j]<<' ';g<<'\n';}return 0;}
~^~~~~~~~~~~~
user.cpp: In function ‘int main()’:
user.cpp:4:521: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;ifstream f("ctc.in");ofstream g("ctc.out");int n,m,k,sol,SZ,v[N];vector<int>A[N],B[N],Q[N];int G[N];void d(int R){v[R]=true;for(int i=0;i<A[R].size();++i)if(!v[A[R][i]])d(A[R][i]);G[++k]=R;}void a(int R){v[R]=true;for(int i=0;i<B[R].size();++i)if(!v[B[R][i]])a(B[R][i]);Q[sol].pb(R);}int main(){int i,j,x,y;f>>n>>m;for(i=1;i<=m;++i)f>>x>>y,A[x].pb(y),B[y].pb(x);for(i=1;i<=n;++i)if(!v[i])d(i);memset(v,0,sizeof(v));for(i=k;i>=1;--i)if(!v[G[i]])++sol,a(G[i]);g<<sol<<'\n';for(i=1;i<=sol;++i){for(j=0;j<Q[i].size();++j)g<<Q[i][j]<<' ';g<<'\n';}return 0;}
~^~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 4ms | 5480kb | Corect | 10 | 30 |
2 | 4ms | 5484kb | Corect | 10 |
3 | 4ms | 5492kb | Corect | 10 |
4 | 4ms | 5524kb | Corect | 10 | 30 |
5 | 8ms | 5632kb | Corect | 10 |
6 | 20ms | 5972kb | Corect | 10 |
7 | 32ms | 6292kb | Corect | 10 | 30 |
8 | 88ms | 7432kb | Corect | 10 |
9 | 176ms | 9220kb | Corect | 10 |
10 | 220ms | 10856kb | Corect | 10 | 10 |
Punctaj total | 100 |