# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867091 | HossamHero7 | The Xana coup (BOI21_xanadu) | C++14 | 125 ms | 45220 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 ll;
#define endl '\n'
vector<vector<int>> adj;
vector<int> on;
const int N = 1e5+5;
ll dp[N][3][2];
ll solve(int node,int par,int pressed,bool color){
ll &ret = dp[node][pressed][color];
if(~ret) return ret;
ret = 1e9;
if(pressed != 1){
int sz = adj[node].size();
if(node) sz --;
vector<vector<ll>> dp2(2,vector<ll>(2));
vector<pair<ll,ll>> ops;
for(auto ch : adj[node]){
if(ch == par) continue;
ops.push_back({solve(ch,node,1,on[ch]^1) + 1 , solve(ch,node,0,on[ch])});
}
dp2[sz&1][color] = 0;
dp2[sz&1][!color] = 1e9;
for(int i=sz-1;i>=0;i--){
for(int j=0;j<2;j++){
dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
}
}
ret = min(ret,dp2[0][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... |