# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1926 | 1sm2000 | 고기잡이 (KOI13_fish) | C++98 | 120 ms | 1392 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 sum[10001][2], Planex[10001], Planey[10001], Fishx[10001][3], Fish[10001][3], Sum[10001][3];
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int n, i, j, l, m, k, a;
int cnt=0, min=999999, cntx=0, sumx=0;
scanf("%d %d %d", &n, &l, &m);
for (i=1; i<=m; i++)
{
scanf("%d %d", &Fish[i][1], &Fish[i][2]);
Fishx[i][1] = Fish[i][1];
Fishx[i][2] = Fish[i][2];
}
for (i=1; i<=l/2; i++)
{
for (j=1; j<=l/2; j++)
{
if ((i+j)*2 == l)
{
cnt++;
Sum[cnt][1] = i;
Sum[cnt][2] = j;
}
}
}
sumx=cnt;
cnt=0;
# | 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... |