제출 #602299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
602299		duality	게임 (APIO22_game)	C++17	60 / 100	4027 ms	17948 KiB

game

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "game.h"

int N,K;
vi adjList[300000];
int mm[300000];
void init(int n,int k) {
    int i;
    N = n,K = k;
    for (i = 0; i < k-2; i++) adjList[i].pb(i+1);
    for (i = 0; i < n; i++) mm[i] = (i < k) ? i:-1;
}
int add_teleporter(int u,int v) {
    queue<int> Q;
    if ((v < K) && (mm[u] >= v)) return 1;
    adjList[u].pb(v);
    if (mm[u] > mm[v]) mm[v] = mm[u],Q.push(v);
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();

        for (int v: adjList[u]) {
            if ((v < K) && (mm[u] >= v)) return 1;
            if (mm[u] > mm[v]) mm[v] = mm[u],Q.push(v);
        }
    }
    return 0;
}

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