# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375081 | 2021-03-09T02:23:06 Z | daniel920712 | Naan (JOI19_naan) | C++14 | 83 ms | 70928 KB |
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <vector> using namespace std; vector < long long > sum[1005]; long long all[1005]; int main() { long long N,M,i,j,k,tt=0,t,x; scanf("%lld %lld",&N,&M); x=M; for(i=0;i<N;i++) { tt=0; sum[i].push_back(tt); for(j=0;j<M;j++) { scanf("%lld",&t); all[i]+=t; for(k=0;k<N*M;k++) { tt+=t; sum[i].push_back(tt); } } } M*=(N*M); //printf("%lld\n",M); for(i=1;i<M;i++) { if(sum[0][i]>=all[0]*x&&(sum[1][M]-sum[1][i])>=all[1]*x) { //printf("%lld %lld %lld %lld\n",sum[0][i],M,sum[0][M],i); printf("%lld %lld\n",i,M); printf("1 2\n"); return 0; } if(sum[1][i]>=all[1]*x&&(sum[0][M]-sum[0][i])>=all[0]*x) { //printf("%lld %lld %lld %lld\n",sum[1][i],M,sum[1][M],i); printf("%lld %lld\n",i,M); printf("2 1\n"); return 0; } } printf("-1\n"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Not a fair distribution. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 83 ms | 70928 KB | Not a fair distribution. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Not a fair distribution. |
2 | Halted | 0 ms | 0 KB | - |