# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101496 | MateiKing80 | The Xana coup (BOI21_xanadu) | C++14 | 38 ms | 15744 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
const int N = 1e5 + 3;
int dp[N][2][2];
int a[N];
vector<int> vec[N];
void dfs(int v, int p)
{
if(vec[v].size() == 1)
{
dp[v][a[v]][0] = 0;
dp[v][1 - a[v]][1] = 1;
dp[v][a[v]][1] = 1e6;
dp[v][1 - a[v]][0] = 1e6;
return;
}
for(int to : vec[v])
if(to != p)
dfs(to, v);
int mn = 0, par = a[v], mnadd = 1e9;
for(int to : vec[v])
{
if(to == p)
continue;
# | 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... |