Submission #952698

#	Time	Username	Problem	Language	Result	Execution time	Memory
952698		quanlt206	Game (APIO22_game)	C++17	60 / 100	4064 ms	43060 KiB

game

#include "game.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 3e5 + 7;

int n, k;

vector<int> v[N], rv[N];

int res[N], res2[N];
void init(int N, int K) {
    n = N;
    k = K;
    REP(i, 0, k - 1) {
        v[i].push_back(i + 1);
        rv[i + 1].push_back(i);
    }
    REP(i, 0, n) res[i] = -1;
}

int d[2][N];

bool getAnswer = false;

void dfs(int x, int val) {
    if (!maximize(res[x], val)) return ;
    if (x < k && res[x] >= x) getAnswer = true;
    for (auto y : v[x]) dfs(y, val);
}


int add_teleporter(int x, int y) {
    dfs(y, (x < k ? x : res[x]));
    v[x].push_back(y);
    rv[y].push_back(x);
//    cout<<x<<" "<<y<<"\n";
//    REP(i, 0, n) cout<<res[i]<<" "; cout<<"\n";
    if (getAnswer) return 1;
    return 0;
}

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