# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
876598 | floralfield | The Xana coup (BOI21_xanadu) | C++17 | 82 ms | 30748 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define keish \
ios_base::sync_with_stdio(0); \
cin.tie(0); cout.tie(0)
using namespace std;
signed main(){
keish;
int n;
cin >> n;
vector<vector<int>> e(n);
for(int i = 1; i < n; i++){
int u, v;
cin >> u >> v; u--, v--;
e[u].push_back(v);
e[v].push_back(u);
}
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<bool> vis(n);
vector dp(n, vector(2, vector<int>(2, n + 5)));
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |