oj.uz

Submission #579708

# Submission time Handle Problem Language Result Execution time Memory
579708 2022-06-19T16:19:56 Z wiwiho Game (APIO22_game) C++17
60 / 100
 4000 ms 92560 KB 
#include "game.h"
 
#include <bits/stdc++.h>
#include <bits/extc++.h>
 
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
 
const ll MOD = 1000000007;
const ll MAX = 2147483647;
 
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}
 
ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}
 
ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}
 
int n, k;
vector<int> lk, rk;
vector<vector<int>> g, rg;
map<pii, int> ed;
int ans = 0;
 
void add(int u, int v, int L = 0, int R = k - 1, int dpt = 1){
    if(L > R) return;
    if(ans == 1) return;
    int M = (L + R) / 2;
    ed[mp(u, v)] = max(ed[mp(u, v)], dpt);
    if(v == M || rk[v] <= M){
        int o = rk[u];
        rk[u] = min(rk[u], M);
        if(lk[u] >= rk[u]) return ans = 1, void();
        add(u, v, L, M - 1, dpt + 1);
        if(o > M){
            for(int i : rg[u]){
                add(i, u, L, R, dpt);
            }
        }
    }
    if(u == M || lk[u] >= M){
        int o = lk[v];
        lk[v] = max(lk[v], M);
        if(lk[v] >= rk[v]) return ans = 1, void();
        add(u, v, M + 1, R, dpt + 1);
        if(o < M){
            for(int i : g[v]){
                add(v, i, L, R, dpt);
            }
        }
    }
}
 
void init(int _n, int _k){
    n = _n;
    k = _k;
    lk.resize(n, -1);
    rk.resize(n, k);
    g.resize(n);
    rg.resize(n);
    for(int i = 0; i < k; i++){
        lk[i] = i - 1;
        rk[i] = i + 1;
    }
}
 
int add_teleporter(int u, int v){
    g[u].eb(v);
    rg[v].eb(u);
    add(u, v);
    /*cerr << "add " << u << " " << v << "\n";
    printv(lk, cerr);
    printv(rk, cerr);*/
    return ans;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 320 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 228 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 308 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 228 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 2 ms 408 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 4 ms 592 KB Output is correct
25 Correct 6 ms 720 KB Output is correct
26 Correct 11 ms 648 KB Output is correct
27 Correct 9 ms 592 KB Output is correct
28 Correct 5 ms 720 KB Output is correct
29 Correct 9 ms 860 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 228 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 2 ms 408 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 4 ms 592 KB Output is correct
25 Correct 6 ms 720 KB Output is correct
26 Correct 11 ms 648 KB Output is correct
27 Correct 9 ms 592 KB Output is correct
28 Correct 5 ms 720 KB Output is correct
29 Correct 9 ms 860 KB Output is correct
30 Correct 39 ms 4928 KB Output is correct
31 Correct 12 ms 2768 KB Output is correct
32 Correct 48 ms 7648 KB Output is correct
33 Correct 42 ms 5704 KB Output is correct
34 Correct 218 ms 13840 KB Output is correct
35 Correct 173 ms 9420 KB Output is correct
36 Correct 183 ms 7032 KB Output is correct
37 Correct 142 ms 6272 KB Output is correct
38 Correct 115 ms 6304 KB Output is correct
39 Correct 112 ms 6432 KB Output is correct
40 Correct 274 ms 14428 KB Output is correct
41 Correct 146 ms 10868 KB Output is correct
42 Correct 126 ms 7868 KB Output is correct
43 Correct 323 ms 9088 KB Output is correct
44 Correct 479 ms 12108 KB Output is correct

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 228 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 2 ms 408 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 4 ms 592 KB Output is correct
25 Correct 6 ms 720 KB Output is correct
26 Correct 11 ms 648 KB Output is correct
27 Correct 9 ms 592 KB Output is correct
28 Correct 5 ms 720 KB Output is correct
29 Correct 9 ms 860 KB Output is correct
30 Correct 39 ms 4928 KB Output is correct
31 Correct 12 ms 2768 KB Output is correct
32 Correct 48 ms 7648 KB Output is correct
33 Correct 42 ms 5704 KB Output is correct
34 Correct 218 ms 13840 KB Output is correct
35 Correct 173 ms 9420 KB Output is correct
36 Correct 183 ms 7032 KB Output is correct
37 Correct 142 ms 6272 KB Output is correct
38 Correct 115 ms 6304 KB Output is correct
39 Correct 112 ms 6432 KB Output is correct
40 Correct 274 ms 14428 KB Output is correct
41 Correct 146 ms 10868 KB Output is correct
42 Correct 126 ms 7868 KB Output is correct
43 Correct 323 ms 9088 KB Output is correct
44 Correct 479 ms 12108 KB Output is correct
45 Correct 674 ms 45460 KB Output is correct
46 Correct 20 ms 17528 KB Output is correct
47 Correct 19 ms 17440 KB Output is correct
48 Correct 1018 ms 72372 KB Output is correct
49 Correct 718 ms 54644 KB Output is correct
50 Correct 3722 ms 92560 KB Output is correct
51 Correct 3870 ms 83796 KB Output is correct
52 Correct 2848 ms 60876 KB Output is correct
53 Correct 3586 ms 61816 KB Output is correct
54 Execution timed out 4062 ms 63556 KB Time limit exceeded
55 Halted 0 ms 0 KB -