# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5317 | baneling100 | 고기잡이 (KOI13_fish) | C++98 | 84 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>
#include <algorithm>
using namespace std;
pair <int,int> a[101];
int n, l, m, y[101], x[101], ans;
void input(void)
{
int i;
scanf("%d %d %d",&n,&l,&m);
l/=2;
for(i=1 ; i<=m ; i++)
{
scanf("%d %d",&y[i],&x[i]);
a[i]=make_pair(y[i],x[i]);
}
sort(a+1,a+m+1);
sort(y+1,y+m+1);
sort(x+1,x+m+1);
}
void process(void)
{
int i, j, k, o, p, cnt;
for(i=1 ; i<=m ; i++)
for(j=1 ; j<=m ; 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... |