Borderou de evaluare (job #1678554)

Utilizator sabauandrei98Sabau Andrei sabauandrei98 Data 7 aprilie 2016 13:46:12
Problema Markon Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

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
18ms6272kbOK!5
28ms6280kbOK!5
38ms6292kbOK!5
48ms6284kbOK!5
58ms6308kbOK!5
68ms6312kbOK!5
7136ms9084kbOK!5
8296ms11156kbOK!5
9488ms13012kbOK!5
10524ms14272kbOK!5
11664ms16068kbOK!5
12876ms17016kbOK!5
13904ms17484kbOK!5
14928ms17888kbOK!5
15920ms18268kbOK!5
16868ms18616kbOK!5
17836ms18980kbOK!5
18824ms19368kbOK!5
19808ms20492kbOK!5
20772ms22328kbOK!5
Punctaj total100

Ceva nu functioneaza?