# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
792157 | bane | Synchronization (JOI13_synchronization) | C++17 | 0 ms | 0 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;
#include "factories.h"
struct weighted_graph{
int N;
vector<vector<pair<long long,long long>>>adj, GC;
vector<long long>in, depth, crnci, dist, dp, sz;
vector<vector<int>>lift;
inline void dec(int _N){
N = _N;
adj.resize(N+1);
in.resize(N+1);
lift.resize(N+1);
depth.resize(N+1);
crnci.resize(N+1);
dist.resize(N+1);
GC.resize(N+1);
dp.resize(N+1);
sz.resize(N+1);
for (int i = 1; i <= N; i++){
dp[i] = (long long)1e18;
}
for (int i = 1; i <= N; i++){
lift[i].resize(20);
}
}
inline void add_edge(int A, int B, int D){
adj[A].push_back({B,D});