# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50847 | Nicksechko | Evacuation plan (IZhO18_plan) | C++14 | 1069 ms | 45812 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 ll = long long;
using ld = long double;
using namespace std;
const int MAXN = 200001;
int dp[MAXN];
using Pair = pair<int, int>;
set <Pair> s;
vector<pair<int, int> > gid[MAXN];
vector<int> g[MAXN];
vector<pair<int, int>> e[MAXN];
constexpr int INF = 1 << 30;
void upd(int x, int y) {
if (dp[x] < y) {
return;
}
s.erase({ dp[x], x });
dp[x] = y;
s.emplace(y, x);
}
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... |