# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4568 | ansol4328 | 고기잡이 (KOI13_fish) | C++98 | 4 ms | 1088 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<stdio.h>
int n, l, m;
int fish[102][4];
int max;
int input()
{
int i, x=2100000000, y=2100000000;
scanf("%d %d %d",&n,&l,&m);
for(i=1 ; i<=n ; i++)
{
scanf("%d %d",&fish[i][1],&fish[i][2]);
if(fish[i][1]<x) x=fish[i][1];
if(fish[i][2]<y) y=fish[i][2];
}
fish[0][1]=x;
fish[0][2]=y;
return 0;
}
int process()
{
int i, j, k, r=0;
int a, b;
for(i=0 ; i<=m ; i++)
{
for(j=1 ; j<=l/2 ; j++)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |