# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282029 | stoyan_malinin | Werewolf (IOI18_werewolf) | C++14 | 4019 ms | 44316 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 "werewolf.h"
//#include "grader.cpp"
#include <vector>
#include <iostream>
#include <functional>
using namespace std;
const int MAXN = 2e5 + 5;
int n;
vector <int> graph[MAXN];
bool solveDP(int s, int e, int l, int r)
{
if(s<l || e>r) return false;
vector <bool> used[2];
used[0].assign(n+5, false);
used[1].assign(n+5, false);
function <void(int, int)> DFS = [&](int x, int state)
{
if(used[state][x]==true) return;
used[state][x] = true;
//cout << state << " " << x << '\n';
if(state==0 && x>=l && x<=r) DFS(x, 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... |