# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150897 | Alexa2001 | Bulb Game (FXCUP4_bulb) | C++17 | 103 ms | 30364 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 "bulb.h"
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 3e5 + 5;
bool bad = 0;
int v1[Nmax], v2[Nmax];
int subarb[Nmax];
int dfs(int node, vector<int> &L, vector<int> &R, int e1, int e2, int e3)
{
if(node == -1)
return 0;
if(node == -2)
{
if(e1 == -1) bad = 1;
else
if(e2 == -1) return 1;
else
if(e3 == -1)
{
v2[e1]++;
v2[e2]++;
}
return 0;
}
int ans = dfs(L[node], L, R, e1, e2, e3);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |