# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12889 | baneling100 | 개구리 (KOI13_frog) | C++98 | 632 ms | 63592 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>
#include <vector>
#include <queue>
#include <map>
#define INF 0x7fffffff
using namespace std;
struct leaf {
int X;
int Y;
} Leaf[100001];
struct line {
int X;
int Y;
int IO;
int Num;
bool operator < (line K) const {return X<K.X || (X==K.X && IO<K.IO);}
} Line[200001];
typedef pair <int,int> ppair;
multimap <ppair,int> Map;
multimap <ppair,int> :: iterator itLeft, itRight;
vector <int> Edge[100001];
queue <int> Q;
int N, R, D, S, Check[100001], Ans;
void makeLine(void) {
int i;
# | 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... |