oj.uz

Submission #728364

# Submission time Handle Problem Language Result Execution time Memory
728364 2023-04-22T10:00:03 Z veehj Game (APIO22_game) C++17
0 / 100
 0 ms 208 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
vector<bool> vist;
int k, n;
vector<vector<int>> adj;

void init(int N, int K) {
  k=K; n=N;
  adj.resize(n);
  for(int i=0; i<k-1; i++) adj[i].pb(i+1);
}

int s(int x){
  if(vist[x]){
    if(x<k){
      return 1;
    }
    return 0;
  }
  vist[x]=1;
  for(auto& u : adj[x]){
    if(s(u)==1) return 1;
  }
  return 0;
}

int add_teleporter(int u, int v) {
  vist.assign(n, 0);
  adj[u].pb(v);
  return s(0);
}

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -