# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140763 | WannnabeIOI | Bridges (APIO19_bridges) | C++14 | 2329 ms | 35272 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 <bits/stdc++.h>
using namespace std;
const int N = 50500;
const int M = N + N;
const int Q = N + N;
const int MAGIC = 800;
struct Edge {
int l, r;
int from, to, lim;
Edge(int l = 0, int r = 0, int from = 0, int to = 0, int lim = 0) :
l(l), r(r), from(from), to(to), lim(lim) {}
bool operator < (const Edge &e) const {
return lim > e.lim;
}
};
vector<Edge> es;
struct Query {
int from, cost, id;
Query(int from = 0, int cost = 0, int id = 0) :
from(from), cost(cost), id(id) {}
bool operator < (const Query &q) const {
return cost > q.cost;
}
};
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... |