# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409884 | CaroLinda | The Xana coup (BOI21_xanadu) | C++14 | 101 ms | 15328 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 ll long long
#define all(x) x.begin(),x.end()
const int MAXN = 1e5+10 ;
using namespace std ;
int N ;
int color[MAXN] ;
int dp[MAXN][2][2] ; //color, should click
vector<int> adj[MAXN] ;
void dfs(int x, int par )
{
bool is_leaf = true ;
for(auto e : adj[x])
{
if(e == par ) continue ;
dfs(e,x) ;
is_leaf = false ;
}
if(is_leaf)
{
dp[x][0][0] = 0 ;
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... |