제출 #560532

#제출 시각아이디문제언어결과실행 시간메모리
560532Sam_a17Deblo (COCI18_deblo)C++14
81 / 90
1094 ms14420 KiB
#define _CRT_SECURE_NO_WARNINGS #include <bits/stdc++.h> // #include "temp.cpp" #include <cstdio> using namespace std; #ifndef ONLINE_JUDGE #define dbg(x) cerr << #x <<" "; print(x); cerr << endl; #else #define dbg(x) #endif #define sz(x) (int((x).size())) #define len(x) (int)x.length() #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define clr(x) x.clear() #define uniq(x) x.resize(unique(all(x)) - x.begin()); #define blt __builtin_popcount #define pb push_back #define pf push_front #define popf pop_front #define popb pop_back void print(long long t) {cerr << t;} void print(int t) {cerr << t;} void print(string t) {cerr << t;} void print(char t) {cerr << t;} void print(double t) {cerr << t;} void print(long double t) {cerr << t;} void print(unsigned long long t) {cerr << t;} template <class T> void print(set <T> v); template <class T> void print(vector <T> v); template <class T> void print(multiset <T> v); template <class T, class V> void print(map <T, V> v); template <class T, class V> void print(pair <T, V> p); template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";} template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";} template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T> void print(deque<T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";} template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";} #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; #define nl '\n' // for grid problems int dx[8] = {-1,0,1,0,1,-1,1,-1}; int dy[8] = {0,1,0,-1,1,1,-1,-1}; // lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6 void fastIO() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } // file in/out void setIO(string str = "") { fastIO(); if (str != "" && str != "input") { freopen((str + ".in").c_str(), "r", stdin); freopen((str + ".out").c_str(), "w", stdout); } if(str == "input") { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); } } // Indexed Set template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; const int N = 1e5 + 10, LOG = 23; long long n, value[N], bit[N], answ, q[2]; long long sz[N], compSize, qn[2]; bool used[N]; vector<int> adj[N], order; long long dfs(int node, int parent) { sz[node] = 1; compSize++; for(auto i: adj[node]) { if(used[i] || i == parent) continue; sz[node] += dfs(i, node); } return sz[node]; } int find_center(int node, int parent) { for(auto i: adj[node]) { if (used[i] || i == parent) continue; if (2 * sz[i] > compSize) { return find_center(i, node); } } return node; } int centroid(int u) { compSize = 0; dfs(u, 0); u = find_center(u, 0); return u; } void solve(int node, int parent, int cnt, int b) { if(parent) { q[cnt % 2]++; } for(auto i: adj[node]) { if(i == parent || used[i]) continue; long long curr = value[i] & (1 << b); if(curr) curr = 1; solve(i, node, cnt + curr, b); if(parent) continue; curr = value[node] & (1 << b); if(curr) curr = 1; if(curr) { answ += qn[0] * q[0]; answ += qn[1] * q[1]; answ += q[0]; } else { answ += qn[1] * q[0]; answ += qn[0] * q[1]; answ += q[1]; } qn[0] += q[0]; qn[1] += q[1]; q[0] = q[1] = 0; } } void centroid_decomposition() { queue<int> qu; qu.push(1); while(!qu.empty()) { auto u = qu.front(); qu.pop(); int center = centroid(u); order.push_back(center); used[center] = true; for(auto i: adj[center]) { if(used[i]) continue; qu.push(i); } } } void slv(int b) { for(auto center: order) { long long curr = value[center] & (1 << b); if(curr) answ++; solve(center, 0, 0, b); qn[0] = qn[1] = 0; used[center] = true; } } void clear() { for(int i = 1; i <= n; i++) { used[i] = false; } q[0] = q[1] = 0; answ = 0, compSize = 0; } void solve_() { scanf("%lld", &n); for(int i = 1; i <= n; i++) { scanf("%lld", &value[i]); } for(int i = 1; i <= n - 1; i++) { int a, b; scanf("%d%d", &a, &b); adj[a].push_back(b); adj[b].push_back(a); } centroid_decomposition(); long long ans = 0; for(int i = LOG; i >= 0; i--) { slv(i); ans += 1ll * answ * (1ll << i); clear(); } printf("%lld\n", ans); } int main() { setIO(); auto solve = [&](int test_case)-> void { while(test_case--) { solve_(); } }; int test_cases = 1; solve(test_cases); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

deblo.cpp: In function 'void setIO(std::string)':
deblo.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
deblo.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
deblo.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
deblo.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
deblo.cpp: In function 'void solve_()':
deblo.cpp:180:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  180 |   scanf("%lld", &n);
      |   ~~~~~^~~~~~~~~~~~
deblo.cpp:182:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  182 |     scanf("%lld", &value[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
deblo.cpp:186:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  186 |     int a, b; scanf("%d%d", &a, &b);
      |               ~~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...