oj.uz

Submission #952695

# Submission time Handle Problem Language Result Execution time Memory
952695 2024-03-24T14:53:27 Z quanlt206 Game (APIO22_game) C++17
0 / 100
 3 ms 15192 KB 
#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];

bool 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, k) res[i] = res2[i] = true;
}

int d[2][N];

void dfs(int x) {
    if (res[x]) return ;
    res[x] = true;
    for (auto y : v[x]) dfs(y);
}

void dfs2(int x) {
    if (res2[x]) return ;
    res2[x] = true;
    for (auto y : rv[x]) dfs2(y);
}

int add_teleporter(int x, int y) {
    if (x < k && y < k) return 1;
    if (res[x]) dfs(y);
    if (res2[y]) dfs2(x);
    v[x].push_back(y);
    rv[y].push_back(x);
    REP(i, k, n)
        if (res[i] && res2[i]) return 1;
    return 0;
}

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Incorrect 3 ms 15192 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Incorrect 3 ms 15192 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Incorrect 3 ms 15192 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Incorrect 3 ms 15192 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Incorrect 3 ms 15192 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -