# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160660 | Aviansh | Game (APIO22_game) | C++17 | 4 ms | 7444 KiB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5+12;
vector<int>g[maxn];
int vis[maxn];
int myk;
int myn;
void init(int n, int k) {
myk=k;
myn=n;
for(int i = 0;i<k-1;i++){
g[i].push_back(i+1);
}
}
int ans = 0;
void dfs(int st){
vis[st]=1;
for(int i : g[st]){
if(vis[i]==2){
continue;
}
if(vis[i]==1){
if(i<myk){
# | 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... |