# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
417260 | Mlxa | Sky Walking (IOI19_walk) | C++14 | 4070 ms | 861780 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;
using ll = long long;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#include "walk.h"
namespace my {
const int N = 2e6 + 10;
map<pair<int, int>, int> was;
int id(int x, int y) {
auto p = mp(x, y);
if (was.count(p)) {
return was[p];
} else {
int v = (int)was.size();
assert(v < N);
return was[p] = v;
}
}
vector<pair<int, int>> g[N];
set<int> ys[N];
void edge(int v, int u, int w) {
g[v].emplace_back(u, w);
# | 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... |