Submission #609437

#	Time	Username	Problem	Language	Result	Execution time	Memory
609437		duality	Game (APIO22_game)	C++17	100 / 100	1240 ms	71416 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[300002],adjList2[300002];
int l[300002],r[300002];
void init(int n,int k) {
    int i;
    N = n,K = k;
    for (i = 0; i < N+2; i++) l[i] = 0,r[i] = K+1;
    for (i = 1; i < K; i++) adjList[i].pb(i+1),adjList2[i+1].pb(i);
    for (i = 1; i <= K; i++) l[i] = i,r[i] = i;
}
int relax(int u,int v) {
    if (l[u] >= r[v]) return 1;
    if (l[u] >= (l[v]+r[v])/2+1) {
        while (l[u] >= (l[v]+r[v])/2+1) l[v] = (l[v]+r[v])/2+1;
        for (int w: adjList[v]) {
            if (relax(v,w)) return 1;
        }
    }
    if (r[v] <= (l[u]+r[u])/2) {
        while (r[v] <= (l[u]+r[u])/2) r[u] = (l[u]+r[u])/2;
        for (int w: adjList2[u]) {
            if (relax(w,u)) return 1;
        }
    }
    return 0;
}
int add_teleporter(int u,int v) {
    u += (u < K) ? 1:2,v += (v < K) ? 1:2;
    adjList[u].pb(v),adjList2[v].pb(u);
    return relax(u,v);
}

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