# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
342292 | 2021-01-01T18:34:36 Z | Hazem | Deblo (COCI18_deblo) | C++14 | 135 ms | 36336 KB |
/* ID: tmhazem1 LANG: C++14 TASK: pprime */ #include <bits/stdc++.h> using namespace std; #define S second #define F first #define LL long long const int N = 2e5+10; LL LINF = 100000000000000000; LL INF = 1000000000; int MOD = 1e9+7; int vals[N],par[N][30],sizes[N]; LL pr[N],ans; vector<int>adj[N]; vector<int>freq[N]; void dfs(int i,int pre){ sizes[i] = 1; freq[i] = vector<int>(30,0); pr[i] = pr[pre]^vals[i]; for(int j=0;j<30;j++) freq[i][j] += (pr[i]&(1<<j))!=0; for(auto x:adj[i]){ if(x==pre)continue; dfs(x,i); sizes[i] += sizes[x]; for(int j=0;j<30;j++) freq[i][j] += freq[x][j]; } for(auto x:adj[i]){ if(x==pre)continue; sizes[i] -= sizes[x]; for(int j=0;j<30;j++){ freq[i][j] -= freq[x][j]; if(vals[i]&(1<<j))freq[x][j] = sizes[x]-freq[x][j]; ans += (sizes[x]-freq[x][j])*(freq[i][j])*(1<<j)+freq[x][j]*(sizes[i]-freq[i][j])*(1<<j); if(vals[i]&(1<<j))freq[x][j] = sizes[x]-freq[x][j]; freq[i][j] += freq[x][j]; } } for(auto x:adj[i]) if(x==pre)continue; else sizes[i] += sizes[x]; return ; } int main() { // freopen("out.txt","w",stdout); int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&vals[i]),ans += vals[i]; for(int i=1;i<n;i++){ int u,v; scanf("%d%d",&u,&v); adj[u].push_back(v); adj[v].push_back(u); } dfs(1,1); printf("%lld\n",ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 9708 KB | Output isn't correct |
2 | Incorrect | 6 ms | 9708 KB | Output isn't correct |
3 | Incorrect | 6 ms | 9708 KB | Output isn't correct |
4 | Incorrect | 7 ms | 9964 KB | Output isn't correct |
5 | Incorrect | 7 ms | 9836 KB | Output isn't correct |
6 | Incorrect | 97 ms | 36336 KB | Output isn't correct |
7 | Incorrect | 92 ms | 36332 KB | Output isn't correct |
8 | Incorrect | 96 ms | 28656 KB | Output isn't correct |
9 | Incorrect | 100 ms | 28016 KB | Output isn't correct |
10 | Incorrect | 135 ms | 27116 KB | Output isn't correct |