# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933893 | codefox | The Xana coup (BOI21_xanadu) | C++14 | 61 ms | 28496 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 pii pair<int, int>
#define arr array<int, 2>
#define int long long
int inf = 1e9;
vector<vector<int>> graph;
vector<int> state;
vector<array<arr, 2>> opt;
void dfs(int i, int p)
{
opt[i][0][0] = inf;
opt[i][0][1] = inf;
opt[i][1][0] = inf;
opt[i][1][1] = inf;
if (graph[i].size() == 1 && i != 0)
{
int s = state[i];
opt[i][s][0] = 0;
opt[i][s][1] = inf;
if (s == 1) s = 0;
else s = 1;
opt[i][s][0] = inf;
opt[i][s][1] = 1;
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... |