# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4482 | pl0892029 | 개구리 (KOI13_frog) | C++98 | 172 ms | 11052 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 <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define _N 100001
int max(int a,int b) { return a>b ? a:b; }
// include and define
int N, r, d;
int s[_N], e[_N];
// input
typedef struct coord {
int x, y, idx;
}coord;
bool cmpCoord(coord A,coord B) {
return (A.x==B.x) ? A.y < B.y : A.x < B.x;
}
coord frog[_N];
// frog
typedef struct edge {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |