Pagini recente » Borderou de evaluare (job #2918113) | Borderou de evaluare (job #1910390) | Borderou de evaluare (job #1115587) | Borderou de evaluare (job #1675630) | Borderou de evaluare (job #2249400)
Borderou de evaluare (job #2249400)
Raport evaluator
Compilare:
user.cpp: In function ‘void solve()’:
user.cpp:2:144: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int maxgrouplength=0,domtypes=0;struct group{long long type;int grouplength=1;};void solve(){freopen("livada.in","r",stdin);int n,m;long long p;scanf("%d %d %lld",&m,&n,&p);int treenumber=n/2+1;bool checkformajority;for (int i=0;i<m;i++){checkformajority=1;group a[n];int k=0;long long x;scanf("%lld ",&x);a[k].type=x;for (int j=1;j<n;j++){scanf("%lld ",&x);if (a[k].type==x)a[k].grouplength++;else{if (a[k].grouplength >=treenumber){domtypes++;checkformajority=0;}if (a[k].grouplength > maxgrouplength)maxgrouplength=a[k].grouplength;k++;a[k].type=x;}}if (checkformajority){bool checked[k+1]={0};for (int i=0;i<=k;i++){if (!checked[i]){int s=a[i].grouplength;for (int j=i+1;j<=k;j++)if(!checked[j]){if (a[j].type==a[i].type){s+=a[j].grouplength;checked[j]=1;}}if (s >=treenumber){domtypes++;break;}}}}}}int main(){solve();freopen("livada.out","w",stdout);printf("%d\n%d",domtypes,maxgrouplength);return 0;}
^
user.cpp:2:193: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int maxgrouplength=0,domtypes=0;struct group{long long type;int grouplength=1;};void solve(){freopen("livada.in","r",stdin);int n,m;long long p;scanf("%d %d %lld",&m,&n,&p);int treenumber=n/2+1;bool checkformajority;for (int i=0;i<m;i++){checkformajority=1;group a[n];int k=0;long long x;scanf("%lld ",&x);a[k].type=x;for (int j=1;j<n;j++){scanf("%lld ",&x);if (a[k].type==x)a[k].grouplength++;else{if (a[k].grouplength >=treenumber){domtypes++;checkformajority=0;}if (a[k].grouplength > maxgrouplength)maxgrouplength=a[k].grouplength;k++;a[k].type=x;}}if (checkformajority){bool checked[k+1]={0};for (int i=0;i<=k;i++){if (!checked[i]){int s=a[i].grouplength;for (int j=i+1;j<=k;j++)if(!checked[j]){if (a[j].type==a[i].type){s+=a[j].grouplength;checked[j]=1;}}if (s >=treenumber){domtypes++;break;}}}}}}int main(){solve();freopen("livada.out","w",stdout);printf("%d\n%d",domtypes,maxgrouplength);return 0;}
^
user.cpp:2:326: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int maxgrouplength=0,domtypes=0;struct group{long long type;int grouplength=1;};void solve(){freopen("livada.in","r",stdin);int n,m;long long p;scanf("%d %d %lld",&m,&n,&p);int treenumber=n/2+1;bool checkformajority;for (int i=0;i<m;i++){checkformajority=1;group a[n];int k=0;long long x;scanf("%lld ",&x);a[k].type=x;for (int j=1;j<n;j++){scanf("%lld ",&x);if (a[k].type==x)a[k].grouplength++;else{if (a[k].grouplength >=treenumber){domtypes++;checkformajority=0;}if (a[k].grouplength > maxgrouplength)maxgrouplength=a[k].grouplength;k++;a[k].type=x;}}if (checkformajority){bool checked[k+1]={0};for (int i=0;i<=k;i++){if (!checked[i]){int s=a[i].grouplength;for (int j=i+1;j<=k;j++)if(!checked[j]){if (a[j].type==a[i].type){s+=a[j].grouplength;checked[j]=1;}}if (s >=treenumber){domtypes++;break;}}}}}}int main(){solve();freopen("livada.out","w",stdout);printf("%d\n%d",domtypes,maxgrouplength);return 0;}
^
user.cpp:2:378: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int maxgrouplength=0,domtypes=0;struct group{long long type;int grouplength=1;};void solve(){freopen("livada.in","r",stdin);int n,m;long long p;scanf("%d %d %lld",&m,&n,&p);int treenumber=n/2+1;bool checkformajority;for (int i=0;i<m;i++){checkformajority=1;group a[n];int k=0;long long x;scanf("%lld ",&x);a[k].type=x;for (int j=1;j<n;j++){scanf("%lld ",&x);if (a[k].type==x)a[k].grouplength++;else{if (a[k].grouplength >=treenumber){domtypes++;checkformajority=0;}if (a[k].grouplength > maxgrouplength)maxgrouplength=a[k].grouplength;k++;a[k].type=x;}}if (checkformajority){bool checked[k+1]={0};for (int i=0;i<=k;i++){if (!checked[i]){int s=a[i].grouplength;for (int j=i+1;j<=k;j++)if(!checked[j]){if (a[j].type==a[i].type){s+=a[j].grouplength;checked[j]=1;}}if (s >=treenumber){domtypes++;break;}}}}}}int main(){solve();freopen("livada.out","w",stdout);printf("%d\n%d",domtypes,maxgrouplength);return 0;}
^
user.cpp: In function ‘int main()’:
user.cpp:2:876: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int maxgrouplength=0,domtypes=0;struct group{long long type;int grouplength=1;};void solve(){freopen("livada.in","r",stdin);int n,m;long long p;scanf("%d %d %lld",&m,&n,&p);int treenumber=n/2+1;bool checkformajority;for (int i=0;i<m;i++){checkformajority=1;group a[n];int k=0;long long x;scanf("%lld ",&x);a[k].type=x;for (int j=1;j<n;j++){scanf("%lld ",&x);if (a[k].type==x)a[k].grouplength++;else{if (a[k].grouplength >=treenumber){domtypes++;checkformajority=0;}if (a[k].grouplength > maxgrouplength)maxgrouplength=a[k].grouplength;k++;a[k].type=x;}}if (checkformajority){bool checked[k+1]={0};for (int i=0;i<=k;i++){if (!checked[i]){int s=a[i].grouplength;for (int j=i+1;j<=k;j++)if(!checked[j]){if (a[j].type==a[i].type){s+=a[j].grouplength;checked[j]=1;}}if (s >=treenumber){domtypes++;break;}}}}}}int main(){solve();freopen("livada.out","w",stdout);printf("%d\n%d",domtypes,maxgrouplength);return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 808kb | OK! | 10 |
2 | 0ms | 792kb | OK! | 10 |
3 | 96ms | 800kb | OK! | 10 |
4 | 72ms | 808kb | OK! | 10 |
5 | 148ms | 804kb | OK! | 10 |
6 | 252ms | 880kb | OK! | 10 |
7 | 248ms | 936kb | OK! | 10 |
8 | 264ms | 2820kb | OK! | 10 |
9 | 252ms | 756kb | OK! | 10 |
10 | 276ms | 9364kb | OK! | 10 |
Punctaj total | 100 |