# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985301 | ph0enlx | Game (APIO22_game) | C++17 | 4 ms | 14676 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>
using namespace std;
const int N = 3e5+10;
vector<set<int>> g(N);
int ng, kg;
void dfs(int ver, int par, bool &exist, vector<bool> &vis, int ret)
{
vis[ver] = true;
for(int child : g[ver])
{
if(vis[child])
{
if(child==ret)
{
exist = true;
return;
}
continue;
}
dfs(child, ver, exist, vis, ret);
}
}
void init(int n, int k)
{
ng = n, kg = k;
for(int i=0; i<k-1; i++)
{
g[i].insert(i+1);
# | 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... |