Pagini recente » Borderou de evaluare (job #1780365) | Borderou de evaluare (job #1229208) | Borderou de evaluare (job #707370) | Borderou de evaluare (job #979386) | Borderou de evaluare (job #3003946)
Borderou de evaluare (job #3003946)
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++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}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:598: 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++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}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:601: 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++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}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:607: 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++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}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:617: 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++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}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:615: 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++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}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 |
1 | 0ms | 184kb | OK | 10 |
2 | 0ms | 184kb | OK | 10 |
3 | 0ms | 184kb | OK | 10 |
4 | 0ms | 184kb | OK | 10 |
5 | 0ms | 184kb | OK | 10 |
6 | 8ms | 3330kb | OK | 10 |
7 | 108ms | 6881kb | OK | 10 |
8 | 18ms | 4640kb | OK | 10 |
9 | 124ms | 5812kb | OK | 10 |
10 | 179ms | 6053kb | OK | 10 |
Punctaj total | 100 |