Pagini recente » Borderou de evaluare (job #150930) | Borderou de evaluare (job #2662649) | Borderou de evaluare (job #2741827) | Borderou de evaluare (job #2922439) | Borderou de evaluare (job #1678554)
Borderou de evaluare (job #1678554)
Raport evaluator
Compilare:
user.cpp: In function ‘void b(int)’:
user.cpp:8:220: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
ifstream f("markon.in");ofstream g("markon.out");int s[p],r[p],l[p],e[p],a[p],z=0;vector<int>v[p];void b(int o){queue<int>q;q.push(o);s[o]=1;int i,j,n,c;while(!q.empty()){n=q.front();q.pop();z++;a[z]=n;for(i=0;i<v[n].j();++i)--r[v[n][i]];if(r[n]<l[n]||l[n]== 0){for(i=0;i<v[n].j();++i)if(!s[v[n][i]]){q.push(v[n][i]);s[v[n][i]] = 1;}}else e[n]=1;for(i=0;i<v[n].j();++i){if(e[v[n][i]]==1&&r[v[n][i]]<l[v[n][i]]||l[v[n][i]]==0){c=v[n][i];e[v[n][i]]=0;for(j=0;j<v[v[n][i]].j();++j)if(!s[v[c][j]]){s[v[c][j]]=1;q.push(v[c][j]);}}}}}int main(){int n,m,s,i,x,y;f>>n>>m>>s;for(i=1;i<=n;i++)f>>l[i];for(i=1;i<=m;i++){f>>x>>y;v[x].pb(y);v[y].pb(x);}for(i=1;i<=n;i++)r[i]=v[i].j();b(s);g<<z<<'\n';for(i=1;i<=z;++i)g<<a[i]<<'\n';}
^
user.cpp:8:280: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
ifstream f("markon.in");ofstream g("markon.out");int s[p],r[p],l[p],e[p],a[p],z=0;vector<int>v[p];void b(int o){queue<int>q;q.push(o);s[o]=1;int i,j,n,c;while(!q.empty()){n=q.front();q.pop();z++;a[z]=n;for(i=0;i<v[n].j();++i)--r[v[n][i]];if(r[n]<l[n]||l[n]== 0){for(i=0;i<v[n].j();++i)if(!s[v[n][i]]){q.push(v[n][i]);s[v[n][i]] = 1;}}else e[n]=1;for(i=0;i<v[n].j();++i){if(e[v[n][i]]==1&&r[v[n][i]]<l[v[n][i]]||l[v[n][i]]==0){c=v[n][i];e[v[n][i]]=0;for(j=0;j<v[v[n][i]].j();++j)if(!s[v[c][j]]){s[v[c][j]]=1;q.push(v[c][j]);}}}}}int main(){int n,m,s,i,x,y;f>>n>>m>>s;for(i=1;i<=n;i++)f>>l[i];for(i=1;i<=m;i++){f>>x>>y;v[x].pb(y);v[y].pb(x);}for(i=1;i<=n;i++)r[i]=v[i].j();b(s);g<<z<<'\n';for(i=1;i<=z;++i)g<<a[i]<<'\n';}
^
user.cpp:8:364: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
ifstream f("markon.in");ofstream g("markon.out");int s[p],r[p],l[p],e[p],a[p],z=0;vector<int>v[p];void b(int o){queue<int>q;q.push(o);s[o]=1;int i,j,n,c;while(!q.empty()){n=q.front();q.pop();z++;a[z]=n;for(i=0;i<v[n].j();++i)--r[v[n][i]];if(r[n]<l[n]||l[n]== 0){for(i=0;i<v[n].j();++i)if(!s[v[n][i]]){q.push(v[n][i]);s[v[n][i]] = 1;}}else e[n]=1;for(i=0;i<v[n].j();++i){if(e[v[n][i]]==1&&r[v[n][i]]<l[v[n][i]]||l[v[n][i]]==0){c=v[n][i];e[v[n][i]]=0;for(j=0;j<v[v[n][i]].j();++j)if(!s[v[c][j]]){s[v[c][j]]=1;q.push(v[c][j]);}}}}}int main(){int n,m,s,i,x,y;f>>n>>m>>s;for(i=1;i<=n;i++)f>>l[i];for(i=1;i<=m;i++){f>>x>>y;v[x].pb(y);v[y].pb(x);}for(i=1;i<=n;i++)r[i]=v[i].j();b(s);g<<z<<'\n';for(i=1;i<=z;++i)g<<a[i]<<'\n';}
^
user.cpp:8:387: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
ifstream f("markon.in");ofstream g("markon.out");int s[p],r[p],l[p],e[p],a[p],z=0;vector<int>v[p];void b(int o){queue<int>q;q.push(o);s[o]=1;int i,j,n,c;while(!q.empty()){n=q.front();q.pop();z++;a[z]=n;for(i=0;i<v[n].j();++i)--r[v[n][i]];if(r[n]<l[n]||l[n]== 0){for(i=0;i<v[n].j();++i)if(!s[v[n][i]]){q.push(v[n][i]);s[v[n][i]] = 1;}}else e[n]=1;for(i=0;i<v[n].j();++i){if(e[v[n][i]]==1&&r[v[n][i]]<l[v[n][i]]||l[v[n][i]]==0){c=v[n][i];e[v[n][i]]=0;for(j=0;j<v[v[n][i]].j();++j)if(!s[v[c][j]]){s[v[c][j]]=1;q.push(v[c][j]);}}}}}int main(){int n,m,s,i,x,y;f>>n>>m>>s;for(i=1;i<=n;i++)f>>l[i];for(i=1;i<=m;i++){f>>x>>y;v[x].pb(y);v[y].pb(x);}for(i=1;i<=n;i++)r[i]=v[i].j();b(s);g<<z<<'\n';for(i=1;i<=z;++i)g<<a[i]<<'\n';}
^
user.cpp:8:473: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
ifstream f("markon.in");ofstream g("markon.out");int s[p],r[p],l[p],e[p],a[p],z=0;vector<int>v[p];void b(int o){queue<int>q;q.push(o);s[o]=1;int i,j,n,c;while(!q.empty()){n=q.front();q.pop();z++;a[z]=n;for(i=0;i<v[n].j();++i)--r[v[n][i]];if(r[n]<l[n]||l[n]== 0){for(i=0;i<v[n].j();++i)if(!s[v[n][i]]){q.push(v[n][i]);s[v[n][i]] = 1;}}else e[n]=1;for(i=0;i<v[n].j();++i){if(e[v[n][i]]==1&&r[v[n][i]]<l[v[n][i]]||l[v[n][i]]==0){c=v[n][i];e[v[n][i]]=0;for(j=0;j<v[v[n][i]].j();++j)if(!s[v[c][j]]){s[v[c][j]]=1;q.push(v[c][j]);}}}}}int main(){int n,m,s,i,x,y;f>>n>>m>>s;for(i=1;i<=n;i++)f>>l[i];for(i=1;i<=m;i++){f>>x>>y;v[x].pb(y);v[y].pb(x);}for(i=1;i<=n;i++)r[i]=v[i].j();b(s);g<<z<<'\n';for(i=1;i<=z;++i)g<<a[i]<<'\n';}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 8ms | 6272kb | OK! | 5 |
2 | 8ms | 6280kb | OK! | 5 |
3 | 8ms | 6292kb | OK! | 5 |
4 | 8ms | 6284kb | OK! | 5 |
5 | 8ms | 6308kb | OK! | 5 |
6 | 8ms | 6312kb | OK! | 5 |
7 | 136ms | 9084kb | OK! | 5 |
8 | 296ms | 11156kb | OK! | 5 |
9 | 488ms | 13012kb | OK! | 5 |
10 | 524ms | 14272kb | OK! | 5 |
11 | 664ms | 16068kb | OK! | 5 |
12 | 876ms | 17016kb | OK! | 5 |
13 | 904ms | 17484kb | OK! | 5 |
14 | 928ms | 17888kb | OK! | 5 |
15 | 920ms | 18268kb | OK! | 5 |
16 | 868ms | 18616kb | OK! | 5 |
17 | 836ms | 18980kb | OK! | 5 |
18 | 824ms | 19368kb | OK! | 5 |
19 | 808ms | 20492kb | OK! | 5 |
20 | 772ms | 22328kb | OK! | 5 |
Punctaj total | 100 |