# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
406873 | Ruxandra985 | The Xana coup (BOI21_xanadu) | C++14 | 109 ms | 15312 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 DIMN 100010
using namespace std;
int dp[DIMN][2][2] , c[DIMN];
vector <int> v[DIMN];
void dfs (int nod , int tt){
int i , vecin , par , impar , par_ant , ok = 0;
for (i = 0 ; i < v[nod].size() ; i++){
vecin = v[nod][i];
if (vecin != tt){
dfs(vecin , nod);
ok = 1;
}
}
if (!ok){ /// e frunza
dp[nod][c[nod]][0] = 0;
dp[nod][1 - c[nod]][1] = 1;
return;
}
/// daca eu apas nod, toti vecinii trb sa fie 1
par = 0;
impar = DIMN;
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... |