oj.uz

Submission #140086

# Submission time Handle Problem Language Result Execution time Memory
140086 2019-08-02T03:31:35 Z liwi Deblo (COCI18_deblo) C++11
90 / 90
 375 ms 17656 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 100005

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int num_nodes,vals[MAXN],tmp[MAXN],b,hb,mx;
bool vis[MAXN];
ll res,sum,dp[MAXN][2];
vector<int> connections[MAXN];

void dfs(int node, int prev){
	dp[node][tmp[node]] = 1;
	for(int check:connections[node]){
		if(check == prev) continue;
		dfs(check,node);
		dp[node][0]+=dp[check][tmp[node]];
		dp[node][1]+=dp[check][!tmp[node]];
	}
}

void solve(int node, int prev){
	res+=(dp[node][1]-tmp[node])*(1<<b);
	for(int check:connections[node]){
		if(check == prev) continue;
		ll a = dp[check][tmp[node]], b = dp[check][!tmp[node]];
		dp[node][0]-=a, dp[node][1]-=b;

		dp[check][0]+=dp[node][tmp[check]];
		dp[check][1]+=dp[node][!tmp[check]];
		solve(check,node);

		dp[node][0]+=a, dp[node][1]+=b;
	}
}

int main(){
	scanf("%d",&num_nodes);
	for(int i=1; i<=num_nodes; i++){
		scan(vals[i]);
		mx = max(mx,vals[i]);
	}
	for(int i=1; i<num_nodes; i++){
		int a,b; scan(a); scan(b);
		connections[a].pb(b);
		connections[b].pb(a);
	}
	hb = (int)log2(mx);
	for(b=0; b<=hb; b++){
		for(int i=1; i<=num_nodes; i++){
			vis[i] = false;
			tmp[i] = (vals[i]&(1<<b))?1:0;
			dp[i][0] = dp[i][1] = 0;
			if(tmp[i]) sum+=(1<<b);
		}
		dfs(1,-1);
		solve(1,-1);
	}
	printf("%lld\n",res/2+sum);
}
/*
8
1 2 3 4 5 6 7 8
1 2
1 3
1 4
1 5
2 8
5 6
6 7
 */

Compilation message

deblo.cpp: In function 'int main()':
deblo.cpp:76:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&num_nodes);
  ~~~~~^~~~~~~~~~~~~~~~~

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 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 5 ms 2808 KB Output is correct
5 Correct 5 ms 2680 KB Output is correct
6 Correct 169 ms 17656 KB Output is correct
7 Correct 161 ms 17656 KB Output is correct
8 Correct 179 ms 9976 KB Output is correct
9 Correct 189 ms 9236 KB Output is correct
10 Correct 375 ms 8312 KB Output is correct