제출 #1003169

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003169		Otalp	게임 (APIO22_game)	C++17	2 / 100	4 ms	9816 KiB

game

#include "game.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back


vector<int> q[200100], dq[200100];
int n, k;
int mn[200100];
int mx[200100];
int ok = 1;

void init(int N, int K) {
    n = N;
    k = K;
    ok = 1;
    for(int i=0; i<n; i++){
        q[i].clear();
        dq[i].clear();
    }
    for(int i=0; i<k-1; i++){
        q[i].pb(i + 1);
        dq[i + 1].pb(i);
    }
    for(int i=0; i<k; i++){
        if(i < k-1) mn[i] = i + 1;
        else mn[i] = 1e9;
        mx[i] = i;
    }
    for(int i=k; i<n; i++){
        mn[i] = 1e9;
        mx[i] = -1;
    }
}


void dfsmn(int v, int x){
    mn[v] = x;
    if(mn[v] <= mx[v] and mx[v] < k) ok = 0;
    for(int to: dq[v]){
        if(mn[to] > x){
            dfsmn(to, x);
        }
    }
}

void dfsmx(int v, int x){
    mx[v] = x;
    if(mn[v] <= mx[v] and mx[v] < k) ok = 0;
    for(int to: q[v]){
        if(mx[to] < x){
            dfsmx(to, x);
        }
    }
}


int add_teleporter(int u, int v) {
    //cout<<"______________________\n";
    //cout<<u<<' '<<v<<'\n';
    q[u].pb(v);
    dq[v].pb(u);
    if(v < k) mn[u] = min(v, mn[u]);
    if(u < k) mx[v] = max(u, mx[v]);
    dfsmn(v, mn[v]);
    dfsmx(u, mx[u]);
    //for(int i=0; i<n; i++){
    //    cout<<mn[i]<<' '<<mx[i]<<'\n';
    //}
    return !ok;

}

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