# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375071 | daniel920712 | Naan (JOI19_naan) | C++14 | 43 ms | 35636 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
vector < long long > sum[1005];
int main()
{
long long N,M,i,j,k,tt=0,t;
scanf("%lld %lld",&N,&M);
for(i=0;i<N;i++)
{
tt=0;
sum[i].push_back(tt);
for(j=0;j<M;j++)
{
scanf("%lld",&t);
for(k=0;k<M;k++)
{
tt+=t;
sum[i].push_back(tt);
}
}
}
N*=M;
for(i=1;i<N;i++)
{
if(sum[0][i]*N>=sum[0][N]*i&&(sum[1][N]-sum[1][i])*N>=sum[1][N]*(N-i))
{
printf("%lld 2\n",i);
printf("1 2\n");
return 0;
}
if(sum[1][i]*N>=sum[1][N]*i&&(sum[0][N]-sum[0][i])*N>=sum[0][N]*(N-i))
{
printf("%lld 2\n",i);
printf("2 1\n");
return 0;
}
}
printf("-1\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |