oj.uz

Submission #579642

# Submission time Handle Problem Language Result Execution time Memory
579642 2022-06-19T14:44:46 Z wiwiho Game (APIO22_game) C++17
60 / 100
 2907 ms 262144 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<set<int>> ls, rs;
vector<map<int, set<int>>> g, rg;

void build(int L = 0, int R = k - 1){
    if(L > R) return;
    int M = (L + R) / 2;
    for(int i = L; i < M; i++) ls[M].insert(i);
    for(int i = M + 1; i <= R; i++) rs[M].insert(i);
    build(L, M - 1);
    build(M + 1, R);
}

int ans = 0;

void addls(int M, int id){
    if(rs[M].find(id) != rs[M].end() || M == id){
        ans = 1;
    }
    ls[M].insert(id);
}

void addrs(int M, int id){
    if(ls[M].find(id) != ls[M].end() || M == id){
        ans = 1;
    }
    rs[M].insert(id);
}

void add(int u, int v, int L = 0, int R = k - 1){
    if(L > R) return;
    if(ans == 1) return;
    int M = (L + R) / 2;
    if(v == M || ls[M].find(v) != ls[M].end()){
        //cerr << M << " " << mp(u, v) << " left\n";
        //printv(rg[M][u], cerr);
        addls(M, u);
        add(u, v, L, M - 1);
        while(!rg[M][u].empty()){
            int t = *rg[M][u].begin();
            rg[M][u].erase(rg[M][u].begin());
            add(t, u, L, R);
        }
    }
    else rg[M][v].insert(u);
    if(u == M || rs[M].find(u) != rs[M].end()){
        //cerr << M << " " << mp(u, v) << " right\n";
        //printv(g[M][v], cerr);
        addrs(M, v);
        add(u, v, M + 1, R);
        while(!g[M][v].empty()){
            int t = *g[M][v].begin();
            g[M][v].erase(g[M][v].begin());
            add(v, t, L, R);
        }
    }
    else g[M][u].insert(v);
    /*cerr << "add " << mp(u, v) << " " << M << " " << L << " " << R << "\n";
    printv(ls[M], cerr);
    printv(rs[M], cerr);*/
}

void init(int _n, int _k){
    n = _n;
    k = _k;
    ls.resize(n);
    rs.resize(n);
    g.resize(n);
    rg.resize(n);
    build();
}

int add_teleporter(int u, int v){
    add(u, v);
    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 376 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 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 376 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 396 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 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 376 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 396 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 720 KB Output is correct
21 Correct 1 ms 536 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 2 ms 828 KB Output is correct
24 Correct 9 ms 2108 KB Output is correct
25 Correct 16 ms 2644 KB Output is correct
26 Correct 28 ms 3144 KB Output is correct
27 Correct 19 ms 2768 KB Output is correct
28 Correct 7 ms 1872 KB Output is correct
29 Correct 13 ms 2464 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 376 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 396 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 720 KB Output is correct
21 Correct 1 ms 536 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 2 ms 828 KB Output is correct
24 Correct 9 ms 2108 KB Output is correct
25 Correct 16 ms 2644 KB Output is correct
26 Correct 28 ms 3144 KB Output is correct
27 Correct 19 ms 2768 KB Output is correct
28 Correct 7 ms 1872 KB Output is correct
29 Correct 13 ms 2464 KB Output is correct
30 Correct 50 ms 12752 KB Output is correct
31 Correct 14 ms 8272 KB Output is correct
32 Correct 185 ms 38200 KB Output is correct
33 Correct 70 ms 16856 KB Output is correct
34 Correct 671 ms 94748 KB Output is correct
35 Correct 867 ms 88708 KB Output is correct
36 Correct 839 ms 63396 KB Output is correct
37 Correct 1099 ms 92224 KB Output is correct
38 Correct 455 ms 44556 KB Output is correct
39 Correct 644 ms 58764 KB Output is correct
40 Correct 649 ms 86640 KB Output is correct
41 Correct 694 ms 77292 KB Output is correct
42 Correct 408 ms 55348 KB Output is correct
43 Correct 1164 ms 100608 KB Output is correct
44 Correct 736 ms 81500 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 376 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 396 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 720 KB Output is correct
21 Correct 1 ms 536 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 2 ms 828 KB Output is correct
24 Correct 9 ms 2108 KB Output is correct
25 Correct 16 ms 2644 KB Output is correct
26 Correct 28 ms 3144 KB Output is correct
27 Correct 19 ms 2768 KB Output is correct
28 Correct 7 ms 1872 KB Output is correct
29 Correct 13 ms 2464 KB Output is correct
30 Correct 50 ms 12752 KB Output is correct
31 Correct 14 ms 8272 KB Output is correct
32 Correct 185 ms 38200 KB Output is correct
33 Correct 70 ms 16856 KB Output is correct
34 Correct 671 ms 94748 KB Output is correct
35 Correct 867 ms 88708 KB Output is correct
36 Correct 839 ms 63396 KB Output is correct
37 Correct 1099 ms 92224 KB Output is correct
38 Correct 455 ms 44556 KB Output is correct
39 Correct 644 ms 58764 KB Output is correct
40 Correct 649 ms 86640 KB Output is correct
41 Correct 694 ms 77292 KB Output is correct
42 Correct 408 ms 55348 KB Output is correct
43 Correct 1164 ms 100608 KB Output is correct
44 Correct 736 ms 81500 KB Output is correct
45 Correct 735 ms 117380 KB Output is correct
46 Correct 38 ms 58952 KB Output is correct
47 Correct 37 ms 59172 KB Output is correct
48 Correct 2907 ms 239944 KB Output is correct
49 Correct 876 ms 149896 KB Output is correct
50 Runtime error 1207 ms 262144 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -