Pagini recente » Borderou de evaluare (job #827079) | Borderou de evaluare (job #492011) | Borderou de evaluare (job #162854) | Borderou de evaluare (job #1767024) | Borderou de evaluare (job #1449863)
Borderou de evaluare (job #1449863)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:8:267: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;struct HaHa{int suma,valoare,indice;};vector<HaHa> a,b;int w,q,n,i,x,y,i1,i2;bool marked[30006];bool cmp1(HaHa x,HaHa y){if(x.suma<y.suma) return 0;if(x.suma>y.suma) return 1;return(x.valoare>y.valoare);}int main(){freopen("gramezi.in","r",stdin);freopen("gramezi.out","w",stdout);scanf("%d",&n);HaHa X;for(i=1; i<=n; ++i){scanf("%d%d",&x,&y);X.suma=x+y;X.valoare=x;X.indice=i;a.pb(X);X.valoare=y;b.pb(X);}sort(a.begin(),a.end(),cmp1);sort(b.begin(),b.end(),cmp1);q=w=0;i=i1=i2=0;while(i<n){if(i%2==0){while(marked[a[i1].indice]) ++i1;marked[a[i1].indice]=1;q+=a[i1].valoare;}else{while(marked[b[i2].indice]) ++i2;marked[b[i2].indice]=1;w+=b[i2].valoare;}++i;}printf("%d %d\n",q,w);return 0;}
^
user.cpp:8:301: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;struct HaHa{int suma,valoare,indice;};vector<HaHa> a,b;int w,q,n,i,x,y,i1,i2;bool marked[30006];bool cmp1(HaHa x,HaHa y){if(x.suma<y.suma) return 0;if(x.suma>y.suma) return 1;return(x.valoare>y.valoare);}int main(){freopen("gramezi.in","r",stdin);freopen("gramezi.out","w",stdout);scanf("%d",&n);HaHa X;for(i=1; i<=n; ++i){scanf("%d%d",&x,&y);X.suma=x+y;X.valoare=x;X.indice=i;a.pb(X);X.valoare=y;b.pb(X);}sort(a.begin(),a.end(),cmp1);sort(b.begin(),b.end(),cmp1);q=w=0;i=i1=i2=0;while(i<n){if(i%2==0){while(marked[a[i1].indice]) ++i1;marked[a[i1].indice]=1;q+=a[i1].valoare;}else{while(marked[b[i2].indice]) ++i2;marked[b[i2].indice]=1;w+=b[i2].valoare;}++i;}printf("%d %d\n",q,w);return 0;}
^
user.cpp:8:316: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;struct HaHa{int suma,valoare,indice;};vector<HaHa> a,b;int w,q,n,i,x,y,i1,i2;bool marked[30006];bool cmp1(HaHa x,HaHa y){if(x.suma<y.suma) return 0;if(x.suma>y.suma) return 1;return(x.valoare>y.valoare);}int main(){freopen("gramezi.in","r",stdin);freopen("gramezi.out","w",stdout);scanf("%d",&n);HaHa X;for(i=1; i<=n; ++i){scanf("%d%d",&x,&y);X.suma=x+y;X.valoare=x;X.indice=i;a.pb(X);X.valoare=y;b.pb(X);}sort(a.begin(),a.end(),cmp1);sort(b.begin(),b.end(),cmp1);q=w=0;i=i1=i2=0;while(i<n){if(i%2==0){while(marked[a[i1].indice]) ++i1;marked[a[i1].indice]=1;q+=a[i1].valoare;}else{while(marked[b[i2].indice]) ++i2;marked[b[i2].indice]=1;w+=b[i2].valoare;}++i;}printf("%d %d\n",q,w);return 0;}
^
user.cpp:8:363: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;struct HaHa{int suma,valoare,indice;};vector<HaHa> a,b;int w,q,n,i,x,y,i1,i2;bool marked[30006];bool cmp1(HaHa x,HaHa y){if(x.suma<y.suma) return 0;if(x.suma>y.suma) return 1;return(x.valoare>y.valoare);}int main(){freopen("gramezi.in","r",stdin);freopen("gramezi.out","w",stdout);scanf("%d",&n);HaHa X;for(i=1; i<=n; ++i){scanf("%d%d",&x,&y);X.suma=x+y;X.valoare=x;X.indice=i;a.pb(X);X.valoare=y;b.pb(X);}sort(a.begin(),a.end(),cmp1);sort(b.begin(),b.end(),cmp1);q=w=0;i=i1=i2=0;while(i<n){if(i%2==0){while(marked[a[i1].indice]) ++i1;marked[a[i1].indice]=1;q+=a[i1].valoare;}else{while(marked[b[i2].indice]) ++i2;marked[b[i2].indice]=1;w+=b[i2].valoare;}++i;}printf("%d %d\n",q,w);return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 268kb | OK | 10 |
2 | 0ms | 272kb | OK | 10 |
3 | 0ms | 312kb | OK | 10 |
4 | 4ms | 404kb | OK | 10 |
5 | 12ms | 572kb | OK | 10 |
6 | 16ms | 604kb | OK | 10 |
7 | 24ms | 832kb | OK | 10 |
8 | 28ms | 1000kb | OK | 10 |
9 | 36ms | 1024kb | OK | 10 |
10 | 36ms | 1024kb | OK | 10 |
Punctaj total | 100 |