# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1732 | tncks0121 | Dreaming (IOI13_dreaming) | C++98 | 164 ms | 14316 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 "dreaming.h"
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <queue>
#include <memory.h>
#include <assert.h>
using namespace std;
const int N_ = 200005;
const int C = 10005;
const int inf = 1987654321;
struct Edge {
int v, c;
Edge(): v(0), c(0) { }
Edge(int v, int c): v(v), c(c) { }
};
struct Root {
int v, c;
Root(): v(0), c(0) { }
Root(int v, int c): v(v), c(c) { }
bool operator< (const Root &t) const { return c < t.c; }
};
int N, M, L;
vector<Edge> Gph[N_];
Compilation message (stderr)
# | 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... |