# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375094 | daniel920712 | Naan (JOI19_naan) | C++14 | 370 ms | 200192 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[2005];
long long all[2005];
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);
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\n",i,M/(x*N));
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\n",i,M/(x*N));
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... |