# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
86289 | kraljlavova1 | Deblo (COCI18_deblo) | C++11 | 394 ms | 17196 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 ll;
typedef pair<int,int> pii;
const int MAXN=100010,MP=25;
int n;
int u,v;
int pot;
int val[MAXN],pref[MAXN];
int dp[MAXN][2];
vector<int>graf[MAXN];
ll sol,sum;
void calc_pref(int x,int par,int last){
pref[x]=last^val[x];
for(auto y:graf[x]){
if(y==par) continue;
calc_pref(y,x,pref[x]);
}
}
void calc_dp(int x,int par){
dp[x][0]=(((1<<pot)&pref[x])==0);
dp[x][1]=!dp[x][0];
for(auto y:graf[x]){
if(y==par) continue;
calc_dp(y,x);
dp[x][0]+=dp[y][0];
dp[x][1]+=dp[y][1];
}
}
int PREF(int x){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |