제출 #969694

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
969694		anton	게임 (APIO22_game)	C++17	60 / 100	504 ms	5720 KiB

game

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

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

const int MAX_N = 3 * 1e4;

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

bool broken = false;
void rev_dfs(int u, int acc){
  //cout<<u<<" "<<acc<<endl;
  min_acc[u] = acc;
  if(u<K && acc<=u){
    broken = true;
  }
  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<N; i++){
    min_acc[i] = 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);

  if(min_acc[v]<min_acc[u]){
    rev_dfs(u, min(v, min_acc[v]));
  }
  else if(v<min_acc[u]){
    rev_dfs(u, v);
  }
  if(broken){
    return 1;
  }
  //cout<<endl;
  return 0;
}

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