oj.uz

답안 #579680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579680 2022-06-19T15:49:15 Z wiwiho 게임 (APIO22_game) C++17
60 / 100
 4000 ms 97132 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 waassert(bool t){
    if(t) return;
    cout << "OAO\n";
    exit(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)] = 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);
        if(o > M){
            for(int i : rg[u]){
                if(ed[mp(i, u)] <= dpt) add(i, u, L, R);
            }
        }
    }
    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);
        if(o < M){
            for(int i : g[v]){
                if(ed[mp(v, i)] <= dpt) add(v, i, L, R);
            }
        }
    }
}
 
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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 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 0 ms 208 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 208 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 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 0 ms 208 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 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 488 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 4 ms 592 KB Output is correct
25 Correct 5 ms 720 KB Output is correct
26 Correct 9 ms 708 KB Output is correct
27 Correct 9 ms 664 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 5 ms 876 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 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 0 ms 208 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 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 488 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 4 ms 592 KB Output is correct
25 Correct 5 ms 720 KB Output is correct
26 Correct 9 ms 708 KB Output is correct
27 Correct 9 ms 664 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 5 ms 876 KB Output is correct
30 Correct 30 ms 4800 KB Output is correct
31 Correct 8 ms 2768 KB Output is correct
32 Correct 45 ms 7868 KB Output is correct
33 Correct 54 ms 5800 KB Output is correct
34 Correct 236 ms 14748 KB Output is correct
35 Correct 127 ms 9648 KB Output is correct
36 Correct 139 ms 7048 KB Output is correct
37 Correct 120 ms 6332 KB Output is correct
38 Correct 96 ms 6276 KB Output is correct
39 Correct 99 ms 6472 KB Output is correct
40 Correct 185 ms 15300 KB Output is correct
41 Correct 166 ms 11260 KB Output is correct
42 Correct 103 ms 8036 KB Output is correct
43 Correct 222 ms 9528 KB Output is correct
44 Correct 394 ms 12844 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 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 0 ms 208 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 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 488 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 4 ms 592 KB Output is correct
25 Correct 5 ms 720 KB Output is correct
26 Correct 9 ms 708 KB Output is correct
27 Correct 9 ms 664 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 5 ms 876 KB Output is correct
30 Correct 30 ms 4800 KB Output is correct
31 Correct 8 ms 2768 KB Output is correct
32 Correct 45 ms 7868 KB Output is correct
33 Correct 54 ms 5800 KB Output is correct
34 Correct 236 ms 14748 KB Output is correct
35 Correct 127 ms 9648 KB Output is correct
36 Correct 139 ms 7048 KB Output is correct
37 Correct 120 ms 6332 KB Output is correct
38 Correct 96 ms 6276 KB Output is correct
39 Correct 99 ms 6472 KB Output is correct
40 Correct 185 ms 15300 KB Output is correct
41 Correct 166 ms 11260 KB Output is correct
42 Correct 103 ms 8036 KB Output is correct
43 Correct 222 ms 9528 KB Output is correct
44 Correct 394 ms 12844 KB Output is correct
45 Correct 599 ms 45472 KB Output is correct
46 Correct 18 ms 17608 KB Output is correct
47 Correct 15 ms 17488 KB Output is correct
48 Correct 960 ms 74468 KB Output is correct
49 Correct 649 ms 54896 KB Output is correct
50 Correct 3406 ms 97132 KB Output is correct
51 Correct 3577 ms 86316 KB Output is correct
52 Correct 2437 ms 60908 KB Output is correct
53 Correct 3570 ms 61852 KB Output is correct
54 Correct 3909 ms 63880 KB Output is correct
55 Execution timed out 4085 ms 63988 KB Time limit exceeded
56 Halted 0 ms 0 KB -