# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415898 | egod1537 | Robot (JOI21_ho_t4) | C++14 | 3055 ms | 94540 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 <unordered_map>
using namespace std;
typedef long long ll;
struct Line {
int to, col;
ll cost;
int cc;
};
struct Q {
int pos;
ll cost;
};
bool operator<(const Q& a, const Q& b) {
return a.cost > b.cost;
}
vector<vector<Line>> V;
vector<vector<int>> vc;
vector<vector<int>> vidx;
vector<vector<vector<Line>>> vcole;
vector<vector<int>> colcnt;
vector<vector<ll>> colsum;
vector<ll> dst;
int main() {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |