Submission #982966

#	Time	Username	Problem	Language	Result	Execution time	Memory
982966		Kenjikrab	Game (APIO22_game)	C++17	60 / 100	4088 ms	18780 KiB

game

#include "game.h"
#include<bits/stdc++.h>
using namespace std;
int const n_max=3e5+10;
int mx[n_max];
vector<int> node[n_max];
int n,k;
void init(int N, int K)
{
  n=N;
  k=K;
  fill(mx,mx+n,-1);
}
bool flag=false;
int add_teleporter(int u, int v)
{
  if(flag)return 1;
  node[u].push_back(v);
  queue<int> q;
  int val=mx[u];
  if(u<k)val=u;
  if(val==-1)return 0;
  q.push(v);
  while(!q.empty())
  {
    int cur=q.front();
    q.pop();
    if(mx[cur]>=val)continue;
    if(cur<k&&val>=cur)
    {
      flag=true;
      return 1;
    }
    mx[cur]=val;
    for(auto nxt:node[cur])
    {
      if(mx[nxt]>=val)continue;
      q.push(nxt);
    }
  }
  return 0;
}

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