# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1152968 | fryingduc | Highway Tolls (IOI18_highway) | C++20 | 110 ms | 9544 KiB |
#include "bits/stdc++.h"
#include "highway.h"
using namespace std;
#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
assert(l <= r);
return uniform_int_distribution<int> (l, r)(rng);
}
const int maxn = 1e5 + 5;
int n, m, a, b;
int d[maxn], ord[maxn];
vector<int> g[maxn];
bool mark[maxn];
void bfs(int src) {
queue<int> q;
memset(d, 0x3f, sizeof(d));
d[src] = 0;
q.push(src);
while (!q.empty()) {
int u = q.front();
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |