oj.uz

Submission #90281

# Submission time Handle Problem Language Result Execution time Memory
90281 2018-12-21T04:34:40 Z psmao Deblo (COCI18_deblo) C++14
90 / 90
 154 ms 37800 KB 
#include <bits/stdc++.h>
using namespace std;
#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define sf scanf
#define pf printf
typedef long long ll;
const int maxn = 100050;
int n, a[maxn], g[maxn][30][2];
ll ret[30][2], ans, sz[30][2];
vector<int> adj[maxn];
void dfs(int u, int fa=0)
{
	for(auto p : adj[u]) if(p != fa) dfs(p, u);
	fo(j,0,29) ret[j][0] = ret[j][1] = sz[j][0] = sz[j][1] = 0;
	fo(j,0,29) if(a[u]&(1<<j)) g[u][j][1] = 1; else g[u][j][0] = 1;
	for(auto p : adj[u]) if(p != fa)
	{
		fo(j,0,29) 
		{
			if(a[u]&(1<<j)) g[u][j][0] += g[p][j][1], g[u][j][1] += g[p][j][0];
			else g[u][j][0] += g[p][j][0], g[u][j][1] += g[p][j][1];
			ret[j][0] += sz[j][0] * g[p][j][0] + sz[j][1] * g[p][j][1];
			ret[j][1] += sz[j][1] * g[p][j][0] + sz[j][0] * g[p][j][1];
			sz[j][0] += g[p][j][0]; sz[j][1] += g[p][j][1];
		}
	}
	fo(i,0,29) ret[i][0] += sz[i][0], ret[i][1] += sz[i][1];
	fo(i,0,29) if(a[u]&(1<<i)) ans += (1<<i)*ret[i][0]; else ans += (1<<i)*ret[i][1];
	ans += a[u];
}
int main()
{
	sf("%d",&n);
	fo(i,1,n) sf("%d",&a[i]);
	fo(i,2,n) {int u, v; sf("%d%d",&u,&v); adj[u].emplace_back(v); adj[v].emplace_back(u);}
	dfs(1);
	cout << ans << endl;
	return 0;
}

Compilation message

deblo.cpp: In function 'int main()':
deblo.cpp:34:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sf("%d",&n);
    ^
deblo.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,n) sf("%d",&a[i]);
              ^
deblo.cpp:36:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fo(i,2,n) {int u, v; sf("%d%d",&u,&v); adj[u].emplace_back(v); adj[v].emplace_back(u);}
                         ^

Subtask #1
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2812 KB Output is correct
3 Correct 4 ms 2904 KB Output is correct
4 Correct 5 ms 3080 KB Output is correct
5 Correct 5 ms 3080 KB Output is correct
6 Correct 116 ms 37724 KB Output is correct
7 Correct 116 ms 37800 KB Output is correct
8 Correct 118 ms 37800 KB Output is correct
9 Correct 117 ms 37800 KB Output is correct
10 Correct 154 ms 37800 KB Output is correct