Submission #969653

#	Time	Username	Problem	Language	Result	Execution time	Memory
969653		anton	Game (APIO22_game)	C++17	30 / 100	21 ms	856 KiB

game

#include "game.h"
#include<bits/stdc++.h>

using namespace std;
#define pii pair<int, int>

const int MAX_N = 1e3;

vector<int> adj[MAX_N];
vector<int> rev_adj[MAX_N];
int min_acc[MAX_N];
int N, K;

void rev_dfs(int u, int acc){
  min_acc[u] = acc;
  for(auto e: rev_adj[u]){
    if(min_acc[e]>acc){
      rev_dfs(e, acc);
    }
  }
}

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

int add_teleporter(int u, int v) {
  adj[u].push_back(v);
  rev_adj[v].push_back(u);

  for(int i = 0; i<N; i++){
    min_acc[i] = 1e9;
  }
  for(int i = 0; i<K; i++){
    //cout<<min_acc[i]<<" ";
    if(min_acc[i]<i){
      return 1;
    }
    else{
      for(auto e: rev_adj[i]){
        if(min_acc[e]>i){
          rev_dfs(e, i);
        }
      }
    }
    if(min_acc[i]<=i){
      return 1;
    }
  }
  //cout<<endl;
  return 0;
}

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