# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056420 | user736482 | The Xana coup (BOI21_xanadu) | C++17 | 405 ms | 9580 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;
long long a,b,c,t,n;
int ans=1e9;
set<pair<int,int>>s;
vector<int>tree[100007];
vector<int>leaves;
vector<bool>st;
long long buttons[100007];
int cost[100007][2][2];//vertice, iflit,ifpressed
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n;
for(int i=1;i<n;i++){
cin>>a>>b;
tree[a].push_back(b);
tree[b].push_back(a);
buttons[a]+=1<<(b-1);
buttons[b]+=1<<(a-1);
}
for(int i=1;i<=n;i++){
if(tree[i].size()==1)
leaves.push_back(i);
buttons[i]+=1<<(i-1);
cin>>a;
st.push_back(a);
}
reverse(st.begin(),st.end());
int a=0;
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... |