# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160629 | Aviansh | Game (APIO22_game) | C++17 | 0 ms | 320 KiB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>g;
vector<int>vis;
int myk;
int myn;
int cyc = 0;
void init(int n, int k) {
myk=k;
myn=n;
g.clear();
vis.clear();
vector<int>temp;
for(int i = 0;i<n;i++){
g.push_back(temp);
vis.push_back(0);
}
for(int i = 0;i<k-1;i++){
g[i].push_back(i+1);
}
}
void dfs(int st){
assert(st>=0);
assert(st<myn);
vis[st]=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... |