# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375163 | daniel920712 | Naan (JOI19_naan) | C++14 | 1 ms | 364 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;
long long all[2005][2005];
long long sum[2005][2005]={0};
int main()
{
long long N,M,a,b,x1,x2,y1,y2,c,i,j,ok=1;
scanf("%lld %lld",&N,&M);
for(i=0;i<N;i++)
{
sum[i][0]=0;
for(j=1;j<=M;j++)
{
scanf("%lld",&all[i][j]);
sum[i][j]=sum[i][j-1]+all[i][j];
}
}
for(i=1;i<=M;i++)
{
ok=1;
a=sum[1][i-1];
b=all[1][i];
c=sum[1][M];
a*=2;
b*=2;
if(c-a>=0)
{
x1=c-a;
y1=b;
}
else ok=0;
a=sum[0][M]-sum[0][i];
b=all[0][i];
c=sum[0][M];
a*=2;
b*=2;
if(a+b-c>=0)
{
x2=a+b-c;
y2=b;
}
else ok=0;
if(x1*y2<=x2*y1&&ok&&x1<=y1)
{
//printf("%lld\n",i);
printf("%lld %lld\n",(i-1)*y1+x1,y1);
printf("2 1\n");
return 0;
}
ok=1;
a=sum[0][i-1];
b=all[0][i];
c=sum[0][M];
a*=2;
b*=2;
if(c-a>=0)
{
x1=c-a;
y1=b;
}
else ok=0;
a=sum[1][M]-sum[1][i];
b=all[1][i];
c=sum[1][M];
a*=2;
b*=2;
if(a+b-c>=0)
{
x2=a+b-c;
y2=b;
}
else ok=0;
if(x1*y2<=x2*y1&&ok&&x1<=y1)
{
printf("%lld %lld\n",(i-1)*y1+x1,y1);
printf("1 2\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... |