Submission #710333

#	Time	Username	Problem	Language	Result	Execution time	Memory
710333		Astrayt	Game (APIO22_game)	C++17	0 / 100	8 ms	14364 KiB

game

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

int N, K, good = 0, t = 1, 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);
    adj[v].pb(u);
    low[u] = min(low[v], low[u]);
    queue<int> bfs; bfs.push(u);
    while(bfs.size()){
        int u = bfs.front(); bfs.pop();
        for(auto v:adj[u]){
            if(low[v] > low[u]) {
                low[v] = low[u];
                bfs.push(v);
            }
        }
    }
    if(u < K && low[u] < u) return 1;
    return 0;
}

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