# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096938 | andrei_iorgulescu | The Xana coup (BOI21_xanadu) | C++14 | 109 ms | 27476 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
int inf = 1e9;
int n, v[100005];
vector<int> g[100005], f[100005];
bool viz[100005];
int dp[100005][2][2];
void dfs(int nod)
{
viz[nod] = true;
for (auto it : g[nod])
if (!viz[it])
f[nod].push_back(it), dfs(it);
}
void solve(int nod)
{
for (auto fiu : f[nod])
solve(fiu);
for (int sf = 0; sf < 2; sf++)
{
for (int cf = 0; cf < 2; cf++)
{
vector<vector<int>> d(f[nod].size() + 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... |