| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 560530 |
2022-05-11T16:03:57 Z |
Sam_a17 |
Deblo (COCI18_deblo) |
C++14 |
|
1000 ms |
15092 KB |
#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) {
if(parent) {
q[cnt % 2]++;
}
for(auto i: adj[node]) {
if(i == parent || used[i]) continue;
solve(i, node, cnt + bit[i]);
if(parent) continue;
if(bit[node]) {
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() {
for(auto center: order) {
if(bit[center]) answ++;
solve(center, 0, 0);
qn[0] = qn[1] = 0;
used[center] = true;
}
}
void clear() {
for(int i = 1; i <= n; i++) {
used[i] = false, bit[i] = 0;
}
q[0] = q[1] = 0, qn[0] = qn[1] = 0;
answ = 0, compSize = 0;
}
void solve_() {
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> value[i];
}
for(int i = 1; i <= n - 1; i++) {
int a, b; cin >> 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--) {
for(int j = 1; j <= n; j++) {
if(value[j] & (1 << i)) {
bit[j] = 1;
}
}
slv();
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;
}
Compilation message
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);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2644 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2628 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2644 KB |
Output is correct |
| 4 |
Correct |
6 ms |
2772 KB |
Output is correct |
| 5 |
Correct |
5 ms |
2772 KB |
Output is correct |
| 6 |
Correct |
504 ms |
14952 KB |
Output is correct |
| 7 |
Correct |
500 ms |
15092 KB |
Output is correct |
| 8 |
Correct |
748 ms |
9924 KB |
Output is correct |
| 9 |
Correct |
882 ms |
9452 KB |
Output is correct |
| 10 |
Execution timed out |
1093 ms |
8832 KB |
Time limit exceeded |
