# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
847295 | Ahmed57 | The Xana coup (BOI21_xanadu) | C++17 | 105 ms | 17372 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 dp[100001][2][2];
vector<int> adj[100001];
long long arr[100001];
//0 i make myself not toggole , 1 i make myself toggole
//0 i am not toggole , i am toggole
void solve(int i,int pr){
for(auto j:adj[i]){
if(j==pr)continue;
solve(j,i);
}
//0 0
long long check = 0 , sum =0 , mi = 1e9;
for(auto j:adj[i]){
if(j==pr)continue;
if(dp[j][0][arr[j]]<dp[j][1][arr[j]]){
sum+=dp[j][0][arr[j]];
check+=0;
}else{
sum+=dp[j][1][arr[j]];
check+=1;
}
mi = min(mi,abs(dp[j][0][arr[j]]-dp[j][1][arr[j]]));
}
if((check%2)){
sum+=mi;
}
dp[i][0][0] = sum;
//0 1
# | 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... |