# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857548 | iskhakkutbilim | The Xana coup (BOI21_xanadu) | C++17 | 86 ms | 47968 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>
using namespace std;
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 2e5;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
int n;
int a[N + 1];
vector<int> g[N+1];
vector<vector<int>> dfs(int v, int par){
if(g[v].size() == 1 and v != par){
vector< vector<int> > res(2, vector<int>(2));
res[a[v]][1] = res[!a[v]][0] = MOD;
res[a[v]][0] = 0, res[!a[v]][1] = 1;
return res;
}
vector< vector<int> > sub(2, vector<int>(2, 0));
sub[0][1] = INF;
sub[1][1] = INF;
for(int to : g[v]){
if(to == par) continue;
auto child = dfs(to, v);
vector< vector<int> > new_sub(2, vector<int>(2));
for(int i = 0;i < 2; i++){
Compilation message (stderr)
# | 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... |