# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1106232 | cabbit | Robot (JOI21_ho_t4) | C++14 | 585 ms | 74428 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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N = 1e5 + 5, MAX = 5e5 + 5;
const long long inf = 1e18;
int n, m;
long long d[MAX], sum[MAX];
map<array<int, 2>, long long> mp;
vector<pair<int, long long>> g[MAX];
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> n >> m;
int tot = n;
auto add = [&](int u, int c) {
if (!mp.count({u, c})) {
mp[{u, c}] = ++tot;
}
return mp[{u, c}];
};
for (int i = 1; i <= m; ++i) {
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... |