Submission #949458

#	Time	Username	Problem	Language	Result	Execution time	Memory
949458		Alfraganus	Game (APIO22_game)	C++17	30 / 100	3 ms	616 KiB

game

#include <bits/stdc++.h>
#include "game.h"
// #include "grader.cpp"
using namespace std;

const int N = 3001;
int mx[N], K;
vector<int> graph[N];

void init(int n, int k) {
  for(int i = k; i < n; i ++)
    mx[i] = -1;
  for(int i = 0; i < k; i ++)
    mx[i] = i;
  K = k;
}

int add_teleporter(int u, int v) {
  if(u == v)
    return u < K;
  graph[u].push_back(v);
  queue<int> q;
  if(mx[v] <= mx[u])
    q.push(v), mx[v] = mx[u];
  bitset<N> bt;
  while(!q.empty()){
    int x = q.front();
    q.pop();
    bt[x] = 1;
    if(x < K){
      if (mx[x] >= x)
        return 1;
      else
        return 0;
    }
    for(int y : graph[x])
      if(mx[y] <= mx[x] and !bt[y])
        mx[y] = mx[x], q.push(y);
  }
  return 0;
}

• Subtask 1: 2 / 2
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 0 / 30
• Subtask 5: 0 / 40