oj.uz

답안 #633226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
633226 2022-08-22T01:20:11 Z iee Deblo (COCI18_deblo) C++17
90 / 90
 71 ms 35028 KB 
// iee
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using db = double;
using ld = long double;
#define py puts("YES")
#define pn puts("NO")
#define pf puts("-1")
#define hh puts("")
#define fi first
#define se second
#define mkp make_pair
#define re =RD()
#define rd RD()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define ep emplace
#define ci const int
#define vi vector<int>
#define fn for(int i=1;i<=n;++i)
#define rept(t) for(int I=t;I-->0;)
#define rep(stO,a,b) for(int stO=(a);stO<=(b);stO++)
#define Rep(stO,a,b) for(int stO=(a);stO<(b);stO++)
#define per(Orz,a,b) for(int Orz=(a);Orz>=(b);Orz--)
#define ina int n,a[N];
#define rna n=RD();fn a[i]=RD();
using namespace std;
void big(int &x,int y){if(y>x)x=y;}void sml(int &x,int y){if(y<x)x=y;}
int qpow(int a, int b, int p) { int res = 1 % p; while (b) { if (b % 2) res = 1ll * res * a % p; a = 1ll * a * a % p; b /= 2; } return res; }
int RD() { int x = 0, f = 1, ch = getchar(); while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + (ch - '0'); ch = getchar(); } return x * f; }
//ci p = 998244353 1000000007; int fac[N], inv[N], ifac[N]; int binom(int x, int y, int MOD = p) { if (x < y) return 0; return 1ll * fac[x] * ifac[y] % p * ifac[x - y] % p; } void init(int LIM = N - 1, int MOD = p) { fac[0] = ifac[0] = inv[1] = 1; rep(i, 1, LIM) fac[i] = 1ll * fac[i - 1] * i % MOD; rep(i, 2, LIM) inv[i] = 1ll * (MOD - MOD / i) * inv[MOD % i] % MOD; rep(i, 1, LIM) ifac[i] = 1ll * ifac[i - 1] * inv[i] % MOD; }
void work(int);

signed main() { int CASINPUT = 1;
  string op = R"(
                 )";if (op.size() == 19) cin >> CASINPUT; rep(CUR, 1, CASINPUT) work(CUR); }
ci N = 1e5 + 5, L = 25;
ll ans;
int val[N];
int n;
vi e[N];
int f[N][L][2];
void dfs(int u, int pr = -1) {
 Rep(i,0,L)
  f[u][i][val[u] >> i & 1]++;
 for(int v:e[u])if(v!=pr) {
  dfs(v,u);
  Rep(i,0,L) {
   ans += ((ll)f[u][i][0] * f[v][i][1] + (ll)f[u][i][1] * f[v][i][0]) << i;
   if(val[u] >> i & 1)
    f[u][i][1] += f[v][i][0],f[u][i][0] += f[v][i][1];
   else
    f[u][i][0] += f[v][i][0],f[u][i][1] += f[v][i][1];
  }
 }
}
void work(int CASE) {
 n re;fn val[i] re, ans += val[i];
 rept(n-1){int u re,v re;e[u].pb(v),e[v].pb(u);}
 dfs(1);
 cout << ans;
}

Subtask #1
90.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2900 KB Output is correct
5 Correct 2 ms 2900 KB Output is correct
6 Correct 45 ms 35028 KB Output is correct
7 Correct 45 ms 35020 KB Output is correct
8 Correct 58 ms 27428 KB Output is correct
9 Correct 51 ms 26580 KB Output is correct
10 Correct 71 ms 25772 KB Output is correct