# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
379938 | nikatamliani | Relay Marathon (NOI20_relaymarathon) | C++14 | 6081 ms | 114672 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;
int n, m, k;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int a, int b) {
return a + (unsigned long long)rng() % (b - a + 1);
}
const int oo = 1e9+10;
int calc(vector<int> &a, vector<int> &b, vector<vector<pair<int, int>>> &edges) {
priority_queue<pair<int,int>> q;
for(int x : a) {
q.push({0, x});
}
vector<bool> fix(n), seen(n);
for(int x : b) {
fix[x] = 1;
}
while(!q.empty()) {
pair<int,int> p = q.top(); q.pop();
if(fix[p.second]) return -p.first;
if(seen[p.second]) continue;
seen[p.second] = 1;
for(const pair<int,int> &to : edges[p.second]) {
q.push({p.first - to.second, to.first});
}
}
return oo;
}
int main() {
ios::sync_with_stdio(0); cin.tie(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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |