# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
686488 | ethening | Robot (JOI21_ho_t4) | C++17 | 211 ms | 76912 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"
#include <queue>
#include <unordered_map>
using namespace std;
using ll = long long;
#define DEBUG 0
const ll INF = 1000'000'000'000'000'000ll;
const int MAXN = 100000;
const int MAXM = 200000;
int n, m;
unordered_map<int, int> s[MAXN + 5];
unordered_map<int, ll> csum[MAXN + 5];
int a[MAXN + 5][4];
struct edge {
int fr;
int to;
ll weight;
} e[4 * MAXM + 5];
vector<int> v[4 * MAXM + 5];
int main() {
cin.tie(0)->sync_with_stdio(0);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |