# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445928 | Jasiekstrz | Svjetlo (COCI20_svjetlo) | C++17 | 2094 ms | 56336 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 fi first
#define se second
using namespace std;
const int N=5e5;
const int INF=1e9+7;
vector<int> e[N+10];
bool t[N+10];
pair<int,bool> dp0[N+10];
int dp1[N+10][2];
void dfs1(int x,int p)
{
for(auto v:e[x])
{
if(v!=p)
dfs1(v,x);
}
int sum=0;
dp0[x]={0,0};
for(auto v:e[x])
{
if(v==p)
continue;
sum+=dp0[v].se;
dp0[x].fi+=dp0[v].fi;
}
sum+=e[x].size();
if(sum%2==t[x])
{
# | 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... |