| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 560577 |
2022-05-11T17:20:15 Z |
Sam_a17 |
Deblo (COCI18_deblo) |
C++14 |
|
115 ms |
53612 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 = 25;
long long n, value[N], ans, dp[N][LOG][2], answ[LOG];
vector<int> adj[N];
void dfs(int node, int parent) {
for(int i = 0; i < LOG; i++) {
if(value[node] & (1 << i)) {
answ[i]++;
dp[node][i][1]++;
} else {
dp[node][i][0]++;
}
}
for(auto u: adj[node]) {
if(u == parent) continue;
dfs(u, node);
for(int i = 0; i < LOG; i++) {
answ[i] += dp[node][i][0] * dp[u][i][1];
answ[i] += dp[node][i][1] * dp[u][i][0];
if(value[node] & (1 << i)) {
dp[node][i][0] += dp[u][i][1];
dp[node][i][1] += dp[u][i][0];
} else {
dp[node][i][0] += dp[u][i][0];
dp[node][i][1] += dp[u][i][1];
}
}
}
}
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);
}
dfs(1, 0);
for(int i = 0; i <= LOG; i++) {
ans += answ[i] * (1ll << i);
}
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);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
deblo.cpp: In function 'void solve_()':
deblo.cpp:109:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
109 | scanf("%lld", &n);
| ~~~~~^~~~~~~~~~~~
deblo.cpp:111:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
111 | scanf("%lld", &value[i]);
| ~~~~~^~~~~~~~~~~~~~~~~~~
deblo.cpp:115:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
115 | int a, b; scanf("%d%d", &a, &b);
| ~~~~~^~~~~~~~~~~~~~~~
deblo.cpp:123:18: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
123 | ans += answ[i] * (1ll << i);
| ~~~~~~^
deblo.cpp:122:20: note: within this loop
122 | for(int i = 0; i <= LOG; i++) {
| ~~^~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2644 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2644 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2684 KB |
Output is correct |
| 4 |
Correct |
3 ms |
3156 KB |
Output is correct |
| 5 |
Correct |
3 ms |
3028 KB |
Output is correct |
| 6 |
Correct |
104 ms |
53580 KB |
Output is correct |
| 7 |
Correct |
90 ms |
53612 KB |
Output is correct |
| 8 |
Correct |
90 ms |
47216 KB |
Output is correct |
| 9 |
Correct |
104 ms |
46528 KB |
Output is correct |
| 10 |
Correct |
115 ms |
45944 KB |
Output is correct |
