Submission #710360

#	Time	Username	Problem	Language	Result	Execution time	Memory
710360		Astrayt	Game (APIO22_game)	C++17	0 / 100	7 ms	14288 KiB

game

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define maxn 300005

int N, K, low[maxn];
vector<int> adj[maxn], rev[maxn];

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

int add_teleporter(int u, int v){
    if(u == v){
        if(u < K) return 1;
        else return 0;
    }
    adj[u].pb(v);
    rev[v].pb(u);
    queue<int> bfs; bfs.push(v);
    while(bfs.size()){
        int a = bfs.front(); bfs.pop();
        for(auto b:rev[a]){
            if(b <= low[a] && b < K) return 1;
            if(low[b] > low[a]) {
                low[b] = low[a];
                bfs.push(b);
            }
            if(low[b] < b && b < K) return 1;
        }
    }
    return 0;
}

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