Pagini recente » Borderou de evaluare (job #1681508) | Borderou de evaluare (job #2033569) | Borderou de evaluare (job #1548792) | Borderou de evaluare (job #2034659) | Borderou de evaluare (job #2132074)
Borderou de evaluare (job #2132074)
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 | 5392kb | Corect | 10 | 30 |
| 2 | 4ms | 5392kb | Corect | 10 |
| 3 | 4ms | 5404kb | Corect | 10 |
| 4 | 4ms | 5440kb | Corect | 10 | 30 |
| 5 | 8ms | 5556kb | Corect | 10 |
| 6 | 20ms | 5916kb | Corect | 10 |
| 7 | 32ms | 6264kb | Corect | 10 | 30 |
| 8 | 88ms | 7420kb | Corect | 10 |
| 9 | 172ms | 9160kb | Corect | 10 |
| 10 | 220ms | 11104kb | Corect | 10 | 10 |
| Punctaj total | 100 |