# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1073 | tncks0121 | 개구리 (KOI13_frog) | C++98 | 183 ms | 11996 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 <set>
#include <algorithm>
#include <vector>
using namespace std;
FILE *in = stdin;
FILE *out = stdout;
#define MaxN 100000
#define MaxR 10000
#define MaxT 524287
int N, R, D;
struct point {
int x, y, index;
bool friend operator < (point a, point b){
if (a.x==b.x) return a.y < b.y;
return a.x < b.x;
}
} Frog[MaxN];
int tmp[2*MaxN];
int interval[2*MaxN], size;
int Tree[MaxT+1], T;
vector <int> connected[MaxN];
int queue[MaxN], visit[MaxN], head, tail;
int find_index(int a){
int left = 0, right = size-1;
int middle;
while (left<=right){
middle = (left+right)/2;
if (interval[middle]==a) break;
# | 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... |