# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976366 | Unforgettablepl | Game (APIO22_game) | C++17 | 49 ms | 860 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;
#define int long long
vector<int> adj[1001];
int K,N;
void init(int32_t n, int32_t k) {
N=n;K=k;
for(int i=0;i<k-1;i++)adj[i].emplace_back(i+1);
}
vector<pair<bool,bool>> visited;
vector<int> ans;
int DFS(int x){
if(visited[x].second)return 0;
if(visited[x].first){
if(x<K){ans.emplace_back(x);
return x;}
return 0;
}
visited[x].first=true;
for(int&i:adj[x]){
int temp = DFS(i);
if(temp==0)continue;
if(temp==-1)return -1;
ans.emplace_back(x);
if(x==temp)return -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... |