Borderou de evaluare (job #2249400)

Utilizator Catalin_BorzaBorza Catalin-Mihai Catalin_Borza Data 29 septembrie 2018 19:18:29
Problema Livada Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

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
10ms808kbOK!10
20ms792kbOK!10
396ms800kbOK!10
472ms808kbOK!10
5148ms804kbOK!10
6252ms880kbOK!10
7248ms936kbOK!10
8264ms2820kbOK!10
9252ms756kbOK!10
10276ms9364kbOK!10
Punctaj total100

Ceva nu functioneaza?