Submission #1166594

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166594		Malix	Game (APIO22_game)	C++20	12 / 100	8 ms	504 KiB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
 
const ll INF=1000000000000000010;
const int inf=1e9+10;
const ll M=1e9+7;

int n,k;
vii a,b;
vi vis,ls,arr;

void dfs2(int x){
  arr.PB(x);
  vis[x]=1;
  for(auto u:b[x])if(!vis[u])dfs2(u);
}

void dfs(int x){
  vis[x]=1;
  for(auto u:a[x])if(!vis[u])dfs(u);
  ls.PB(x);
}

void init(int N, int K) {
  n=N;k=K;
  a.resize(n);
  b.resize(n);
  REP(i,0,k-1)a[i].PB(i+1);
  REP(i,1,k)b[i].PB(i-1);
}

int add_teleporter(int u, int v) {
  if(u==v&&u<k)return 1;
  a[u].PB(v);
  b[v].PB(u);
  vis.clear();
  vis.resize(n,0);
  ls.clear();
  REP(i,0,n)if(!vis[i])dfs(i);
  vis.clear();
  vis.resize(n,0);
  reverse(ls.begin(),ls.end());
  REP(i,0,n){
    if(vis[ls[i]])continue;
    arr.clear();
    if(!vis[ls[i]])dfs2(ls[i]);
    if(arr.size()<=1)continue;
    for(auto u:arr)if(u<k)return 1;
  }
  return 0;
}

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