Submission #867091

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
8670912023-10-27 16:47:44HossamHero7The Xana coup (BOI21_xanadu)C++14
100 / 100
125 ms45220 KiB
#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]);
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

xanadu.cpp: In function 'll solve(int, int, int, bool)':
xanadu.cpp:26:40: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   26 |                 dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
      |                                       ~^~
xanadu.cpp:26:70: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   26 |                 dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
      |                                                                     ~^~
xanadu.cpp:44:40: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   44 |                 dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
      |                                       ~^~
xanadu.cpp:44:70: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   44 |                 dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
      |                                                                     ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...