# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531998 | amunduzbaev | Robot (JOI21_ho_t4) | C++17 | 245 ms | 46908 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;
#define ar array
#define int long long
const int N = 1e5 + 5;
struct node{
int a, b, c, p;
};
vector<int> edges[N];
vector<ar<int, 3>> ee[N];
map<int, vector<ar<int, 2>>> ed[N];
map<int, int> uu[N];
int d[N], used[N];
node e[N];
/*
5 5
1 2 2 0
2 3 1 2
3 4 1 2
4 5 3 0
2 4 1 3
4 3
1 2 1 2
2 3 1 1
3 4 1 2
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |