# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122023 | KLPP | Designated Cities (JOI19_designated_cities) | C++14 | 2047 ms | 75652 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;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
vector<pii> nei[200000];
vector<pii> inv[200000];
set<int> leaves;
map<int,lld> tree[200000];
int n;
vector<int> V;
void correct(){
rep(i,0,n){
if(tree[i].size()==2){
//cout<<i<<endl;
trav(x,tree[i]){
V.push_back(x.first);
}
//cout<<V[0]<<" "<<V[1]<<endl;
lld go=tree[V[0]][i]+tree[i][V[1]];
lld come=tree[V[1]][i]+tree[i][V[0]];
tree[V[0]].erase(tree[V[0]].find(i));
tree[V[1]].erase(tree[V[1]].find(i));
tree[V[0]][V[1]]=go;
tree[V[1]][V[0]]=come;
V.clear();
tree[i].clear();
}
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... |