# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568895 | tqbfjotld | Reconstruction Project (JOI22_reconstruction) | C++14 | 1106 ms | 60184 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;
set<pair<int,int> > mst[505];
int A[100005];
int B[100005];
int W[100005];
int find_min(int node, int dest, int pa){
if (node==dest) return -1;
for (auto x : mst[node]){
if (x.first==pa) continue;
int res = find_min(x.first,dest,node);
if (res!=-2){
if (res==-1) return x.second;
if (W[res]<W[x.second]) return res;
else return x.second;
}
}
return -2;
}
int n;
vector<pair<int,int> > add,del;
const long long INF = 1000000010;
long long fenw[2][1300005];
void upd(int pos, int val, int id){
Compilation message (stderr)
# | 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... |