oj.uz

답안 #579714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579714 2022-06-19T16:31:36 Z wiwiho 게임 (APIO22_game) C++17
60 / 100
 427 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;
const int SZ = 20;
vector<int> lk, rk;
map<pii, int> ed;
vector<vector<vector<int>>> g, rg;
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;
    bool ok = false;
    int td = ed[mp(u, v)];
    ed[mp(u, v)] = max(ed[mp(u, v)], dpt);
    if(v == M || rk[v] <= M){
        rk[u] = min(rk[u], M);
        if(lk[u] >= rk[u]) return ans = 1, void();
        ok = true;
        add(u, v, L, M - 1, dpt + 1);
        if(ans == 1) return;
        while(!rg[dpt][u].empty()){
            int t = rg[dpt][u].back();
            rg[dpt][u].pob;
            add(t, u, L, R, dpt);
            if(ans == 1) return;
        }
    }
    if(u == M || lk[u] >= M){
        lk[v] = max(lk[v], M);
        if(lk[v] >= rk[v]) return ans = 1, void();
        ok = true;
        add(u, v, M + 1, R, dpt + 1);
        if(ans == 1) return;
        while(!g[dpt][v].empty()){
            int t = g[dpt][v].back();
            g[dpt][v].pob;
            add(v, t, L, R, dpt);
            if(ans == 1) return;
        }
    }
    if(!ok && td < dpt){
        g[dpt][u].eb(v);
        rg[dpt][v].eb(u);
    }
}
 
void init(int _n, int _k){
    n = _n;
    k = _k;
    lk.resize(n, -1);
    rk.resize(n, k);
    g.resize(SZ, vector<vector<int>>(n));
    rg.resize(SZ, vector<vector<int>>(n));
    for(int i = 0; i < k; i++){
        lk[i] = i - 1;
        rk[i] = i + 1;
    }
}
 
int add_teleporter(int u, int v){
    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 0 ms 208 KB Output is correct
3 Correct 1 ms 336 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

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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 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 336 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 3 ms 1232 KB Output is correct
21 Correct 2 ms 1232 KB Output is correct
22 Correct 2 ms 1360 KB Output is correct
23 Correct 2 ms 1360 KB Output is correct
24 Correct 3 ms 1488 KB Output is correct
25 Correct 8 ms 1616 KB Output is correct
26 Correct 14 ms 1744 KB Output is correct
27 Correct 11 ms 1616 KB Output is correct
28 Correct 7 ms 1616 KB Output is correct
29 Correct 7 ms 1744 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 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 336 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 3 ms 1232 KB Output is correct
21 Correct 2 ms 1232 KB Output is correct
22 Correct 2 ms 1360 KB Output is correct
23 Correct 2 ms 1360 KB Output is correct
24 Correct 3 ms 1488 KB Output is correct
25 Correct 8 ms 1616 KB Output is correct
26 Correct 14 ms 1744 KB Output is correct
27 Correct 11 ms 1616 KB Output is correct
28 Correct 7 ms 1616 KB Output is correct
29 Correct 7 ms 1744 KB Output is correct
30 Correct 61 ms 31676 KB Output is correct
31 Correct 25 ms 29564 KB Output is correct
32 Correct 85 ms 34288 KB Output is correct
33 Correct 89 ms 32960 KB Output is correct
34 Correct 250 ms 45184 KB Output is correct
35 Correct 270 ms 41480 KB Output is correct
36 Correct 329 ms 38752 KB Output is correct
37 Correct 253 ms 37576 KB Output is correct
38 Correct 216 ms 35684 KB Output is correct
39 Correct 215 ms 36616 KB Output is correct
40 Correct 221 ms 44120 KB Output is correct
41 Correct 261 ms 42476 KB Output is correct
42 Correct 187 ms 37276 KB Output is correct
43 Correct 277 ms 40212 KB Output is correct
44 Correct 427 ms 46716 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 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 336 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 3 ms 1232 KB Output is correct
21 Correct 2 ms 1232 KB Output is correct
22 Correct 2 ms 1360 KB Output is correct
23 Correct 2 ms 1360 KB Output is correct
24 Correct 3 ms 1488 KB Output is correct
25 Correct 8 ms 1616 KB Output is correct
26 Correct 14 ms 1744 KB Output is correct
27 Correct 11 ms 1616 KB Output is correct
28 Correct 7 ms 1616 KB Output is correct
29 Correct 7 ms 1744 KB Output is correct
30 Correct 61 ms 31676 KB Output is correct
31 Correct 25 ms 29564 KB Output is correct
32 Correct 85 ms 34288 KB Output is correct
33 Correct 89 ms 32960 KB Output is correct
34 Correct 250 ms 45184 KB Output is correct
35 Correct 270 ms 41480 KB Output is correct
36 Correct 329 ms 38752 KB Output is correct
37 Correct 253 ms 37576 KB Output is correct
38 Correct 216 ms 35684 KB Output is correct
39 Correct 215 ms 36616 KB Output is correct
40 Correct 221 ms 44120 KB Output is correct
41 Correct 261 ms 42476 KB Output is correct
42 Correct 187 ms 37276 KB Output is correct
43 Correct 277 ms 40212 KB Output is correct
44 Correct 427 ms 46716 KB Output is correct
45 Runtime error 143 ms 262144 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -