Borderou de evaluare (job #3003948)

Utilizator AlexCroitoriuAlex Croitoriu AlexCroitoriu Data 16 martie 2023 00:53:57
Problema Concurs Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In function 'I k(I, I)': main.cpp:3:228: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses] 3 | using I=int;using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const I h=4e4;I p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;set<I> e[h];void z(I x){a[x]=++d;for(I y:e[x])z(y);b[x]=++d;}I k(I x,I y){L a[x]<=a[y]&b[y]<=b[x];}I o(I x,I y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}I main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=1;i<n;i++){f>>x>>y;t[y][0]=x;e[x].insert(y);}for(i=1;i<=n;i++)r=i*t[i][0];for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];t[i][j]=r*!t[i][j];}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c|q==c&x<s|q==c&x==s&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ~~~~^~~~~~ main.cpp: In function 'I main()': main.cpp:3:591: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses] 3 | using I=int;using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const I h=4e4;I p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;set<I> e[h];void z(I x){a[x]=++d;for(I y:e[x])z(y);b[x]=++d;}I k(I x,I y){L a[x]<=a[y]&b[y]<=b[x];}I o(I x,I y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}I main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=1;i<n;i++){f>>x>>y;t[y][0]=x;e[x].insert(y);}for(i=1;i<=n;i++)r=i*t[i][0];for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];t[i][j]=r*!t[i][j];}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c|q==c&x<s|q==c&x==s&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ~^~~ main.cpp:3:594: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses] 3 | using I=int;using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const I h=4e4;I p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;set<I> e[h];void z(I x){a[x]=++d;for(I y:e[x])z(y);b[x]=++d;}I k(I x,I y){L a[x]<=a[y]&b[y]<=b[x];}I o(I x,I y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}I main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=1;i<n;i++){f>>x>>y;t[y][0]=x;e[x].insert(y);}for(i=1;i<=n;i++)r=i*t[i][0];for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];t[i][j]=r*!t[i][j];}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c|q==c&x<s|q==c&x==s&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ~~~~^~~~ main.cpp:3:600: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses] 3 | using I=int;using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const I h=4e4;I p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;set<I> e[h];void z(I x){a[x]=++d;for(I y:e[x])z(y);b[x]=++d;}I k(I x,I y){L a[x]<=a[y]&b[y]<=b[x];}I o(I x,I y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}I main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=1;i<n;i++){f>>x>>y;t[y][0]=x;e[x].insert(y);}for(i=1;i<=n;i++)r=i*t[i][0];for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];t[i][j]=r*!t[i][j];}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c|q==c&x<s|q==c&x==s&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ~^~~ main.cpp:3:610: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses] 3 | using I=int;using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const I h=4e4;I p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;set<I> e[h];void z(I x){a[x]=++d;for(I y:e[x])z(y);b[x]=++d;}I k(I x,I y){L a[x]<=a[y]&b[y]<=b[x];}I o(I x,I y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}I main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=1;i<n;i++){f>>x>>y;t[y][0]=x;e[x].insert(y);}for(i=1;i<=n;i++)r=i*t[i][0];for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];t[i][j]=r*!t[i][j];}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c|q==c&x<s|q==c&x==s&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ~^~ main.cpp:3:608: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses] 3 | using I=int;using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const I h=4e4;I p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;set<I> e[h];void z(I x){a[x]=++d;for(I y:e[x])z(y);b[x]=++d;}I k(I x,I y){L a[x]<=a[y]&b[y]<=b[x];}I o(I x,I y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}I main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=1;i<n;i++){f>>x>>y;t[y][0]=x;e[x].insert(y);}for(i=1;i<=n;i++)r=i*t[i][0];for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];t[i][j]=r*!t[i][j];}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c|q==c&x<s|q==c&x==s&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ~~~~~~~~~^~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms184kbIncorect0
21ms184kbIncorect0
30ms184kbKilled by Signal 110
40ms184kbKilled by Signal 110
50ms184kbKilled by Signal 110
62ms3067kbKilled by Signal 110
715ms5656kbKilled by Signal 110
87ms4325kbKilled by Signal 110
914ms5296kbKilled by Signal 110
1019ms5697kbKilled by Signal 110
Punctaj total0

Ceva nu functioneaza?