oj.uz

Submission #727063

# Submission time Handle Problem Language Result Execution time Memory
727063 2023-04-20T02:18:51 Z marvinthang Game (APIO22_game) C++17
60 / 100
 4000 ms 39416 KB 
/*************************************
*    author: marvinthang             *
*    created: 20.04.2023 08:56:45    *
*************************************/

#include <bits/stdc++.h>
#include "game.h"

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int MAX = 3e5 + 5;
vector <int> adj[MAX], radj[MAX];

int N, K, minFrom[MAX], maxTo[MAX];

void init(int n, int k) {
    N = n; K = k;
    REP(i, N) {
        if (i < K) {
            minFrom[i] = i;
            maxTo[i] = i - 1;
        } else {
            minFrom[i] = K;
            maxTo[i] = -1;
        }
    }
}

bool res;

void dfs(int u, int f) {
    if (res) return;
    if (!maximize(maxTo[u], f)) return;
    if (minFrom[u] <= maxTo[u]) {
        res = true;
        return;
    }
    for (int v: adj[u]) dfs(v, f);
}

void rdfs(int u, int f) {
    if (res) return;
    if (!minimize(minFrom[u], f)) return;
    if (minFrom[u] <= maxTo[u]) {
        res = true;
        return;
    }
    for (int v: radj[u]) rdfs(v, f);
}

int add_teleporter(int u, int v) {
    if (res) return true;
    adj[u].push_back(v);
    radj[v].push_back(u);
    dfs(v, u < K ? max(u, maxTo[u]) : maxTo[u]);
    rdfs(u, minFrom[v]);
    return res;
}

#ifdef LOCAL
#include <cstdio>
#include <cstdlib>
#include <vector>
#include "game.h"

namespace {

int read_int() {
    int x;
    if (scanf("%d", &x) != 1) {
        fprintf(stderr, "Error while reading input\n");
        exit(1);
    }
    return x;
}

}  // namespace

int main() {
    file("game");
    int N = read_int();
    int M = read_int();
    int K = read_int();
    std::vector<int> u(M), v(M);
    for (int i = 0; i < M; ++i) {
        u[i] = read_int();
        v[i] = read_int();
    }

    init(N, K);
    int i;
    for (i = 0; i < M; ++i) {
        int answer = add_teleporter(u[i], v[i]);
        if (answer != 0 && answer != 1) {
            i = -1;
            break;
        } else if (answer == 1) {
            break;
        }
    }
    printf("%d\n", i);
    return 0;
}
#endif

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14288 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 9 ms 14404 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14408 KB Output is correct
6 Correct 8 ms 14288 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14288 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 9 ms 14404 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14408 KB Output is correct
6 Correct 8 ms 14288 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct
8 Correct 7 ms 14288 KB Output is correct
9 Correct 9 ms 14288 KB Output is correct
10 Correct 9 ms 14284 KB Output is correct
11 Correct 8 ms 14288 KB Output is correct
12 Correct 10 ms 14292 KB Output is correct
13 Correct 8 ms 14288 KB Output is correct
14 Correct 7 ms 14288 KB Output is correct
15 Correct 7 ms 14288 KB Output is correct
16 Correct 8 ms 14288 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14288 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 9 ms 14404 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14408 KB Output is correct
6 Correct 8 ms 14288 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct
8 Correct 7 ms 14288 KB Output is correct
9 Correct 9 ms 14288 KB Output is correct
10 Correct 9 ms 14284 KB Output is correct
11 Correct 8 ms 14288 KB Output is correct
12 Correct 10 ms 14292 KB Output is correct
13 Correct 8 ms 14288 KB Output is correct
14 Correct 7 ms 14288 KB Output is correct
15 Correct 7 ms 14288 KB Output is correct
16 Correct 8 ms 14288 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14416 KB Output is correct
21 Correct 9 ms 14416 KB Output is correct
22 Correct 10 ms 14388 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 14 ms 14512 KB Output is correct
25 Correct 11 ms 14416 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 9 ms 14416 KB Output is correct
28 Correct 10 ms 14380 KB Output is correct
29 Correct 11 ms 14416 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14288 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 9 ms 14404 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14408 KB Output is correct
6 Correct 8 ms 14288 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct
8 Correct 7 ms 14288 KB Output is correct
9 Correct 9 ms 14288 KB Output is correct
10 Correct 9 ms 14284 KB Output is correct
11 Correct 8 ms 14288 KB Output is correct
12 Correct 10 ms 14292 KB Output is correct
13 Correct 8 ms 14288 KB Output is correct
14 Correct 7 ms 14288 KB Output is correct
15 Correct 7 ms 14288 KB Output is correct
16 Correct 8 ms 14288 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14416 KB Output is correct
21 Correct 9 ms 14416 KB Output is correct
22 Correct 10 ms 14388 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 14 ms 14512 KB Output is correct
25 Correct 11 ms 14416 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 9 ms 14416 KB Output is correct
28 Correct 10 ms 14380 KB Output is correct
29 Correct 11 ms 14416 KB Output is correct
30 Correct 28 ms 15668 KB Output is correct
31 Correct 13 ms 14968 KB Output is correct
32 Correct 40 ms 16596 KB Output is correct
33 Correct 28 ms 16484 KB Output is correct
34 Correct 1153 ms 17352 KB Output is correct
35 Correct 362 ms 16848 KB Output is correct
36 Correct 50 ms 16484 KB Output is correct
37 Correct 63 ms 16452 KB Output is correct
38 Correct 44 ms 16124 KB Output is correct
39 Correct 44 ms 16256 KB Output is correct
40 Correct 1014 ms 17512 KB Output is correct
41 Correct 155 ms 16496 KB Output is correct
42 Correct 116 ms 16328 KB Output is correct
43 Correct 77 ms 17096 KB Output is correct
44 Correct 807 ms 17376 KB Output is correct

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14288 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 9 ms 14404 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14408 KB Output is correct
6 Correct 8 ms 14288 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct
8 Correct 7 ms 14288 KB Output is correct
9 Correct 9 ms 14288 KB Output is correct
10 Correct 9 ms 14284 KB Output is correct
11 Correct 8 ms 14288 KB Output is correct
12 Correct 10 ms 14292 KB Output is correct
13 Correct 8 ms 14288 KB Output is correct
14 Correct 7 ms 14288 KB Output is correct
15 Correct 7 ms 14288 KB Output is correct
16 Correct 8 ms 14288 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14416 KB Output is correct
21 Correct 9 ms 14416 KB Output is correct
22 Correct 10 ms 14388 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 14 ms 14512 KB Output is correct
25 Correct 11 ms 14416 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 9 ms 14416 KB Output is correct
28 Correct 10 ms 14380 KB Output is correct
29 Correct 11 ms 14416 KB Output is correct
30 Correct 28 ms 15668 KB Output is correct
31 Correct 13 ms 14968 KB Output is correct
32 Correct 40 ms 16596 KB Output is correct
33 Correct 28 ms 16484 KB Output is correct
34 Correct 1153 ms 17352 KB Output is correct
35 Correct 362 ms 16848 KB Output is correct
36 Correct 50 ms 16484 KB Output is correct
37 Correct 63 ms 16452 KB Output is correct
38 Correct 44 ms 16124 KB Output is correct
39 Correct 44 ms 16256 KB Output is correct
40 Correct 1014 ms 17512 KB Output is correct
41 Correct 155 ms 16496 KB Output is correct
42 Correct 116 ms 16328 KB Output is correct
43 Correct 77 ms 17096 KB Output is correct
44 Correct 807 ms 17376 KB Output is correct
45 Correct 256 ms 28012 KB Output is correct
46 Correct 15 ms 17128 KB Output is correct
47 Correct 17 ms 17012 KB Output is correct
48 Correct 358 ms 39416 KB Output is correct
49 Correct 274 ms 35436 KB Output is correct
50 Execution timed out 4094 ms 30808 KB Time limit exceeded
51 Halted 0 ms 0 KB -