oj.uz

Submission #579633

# Submission time Handle Problem Language Result Execution time Memory
579633 2022-06-19T14:28:43 Z wiwiho Game (APIO22_game) C++17
30 / 100
 4000 ms 204536 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, vector<int>>> g, rg;
vector<vector<int>> tg;
deque<pii> todo;

bool check(){
    for(int i = 0; i < k; i++){
        vector<bool> vst(n);
        queue<int> q;
        q.push(i);
        while(!q.empty()){
            int now = q.front();
            q.pop();
            for(int v : tg[now]){
                if(vst[v]) continue;
                q.push(v);
                vst[v] = true;
            }
        }
        if(vst[i]) return true;
    }
    return false;
}

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;
    int M = (L + R) / 2;
    if(v == M || ls[M].find(v) != ls[M].end()){
        //cerr << M << " " << mp(u, v) << " "  << "left\n";
        addls(M, u);
        add(u, v, L, M - 1);
        while(!rg[M][u].empty()){
            int t = rg[M][u].back();
            //cerr << "test " << mp(t, u) << "\n";
            rg[M][u].pob;
            add(t, u, L, R);
        }
    }
    else rg[M][v].eb(u);
    if(u == M || rs[M].find(u) != rs[M].end()){
        //cerr << M << " " << mp(u, v) << " "  << "right\n";
        addrs(M, v);
        add(u, v, M + 1, R);
        while(!g[M][v].empty()){
            int t = g[M][v].back();
            //cerr << "test " << mp(v, t) << "\n";
            g[M][v].pob;
            add(v, t, L, R);
        }
    }
    else g[M][u].eb(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);
    tg.resize(n);
    for(int i = 0; i < k - 1; i++){
        tg[i].eb(i + 1);
    }
    build();
}

int tt = 0;
int add_teleporter(int u, int v){
    tt++;
    //cerr << "add " << tt << ": " << u << " " << v << "\n";
    tg[u].eb(v);
    add(u, v);
    //assert(ans == check());
    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 1 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 2 ms 464 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 1 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 2 ms 464 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 2 ms 464 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 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 2 ms 720 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 7 ms 1548 KB Output is correct
23 Correct 2 ms 788 KB Output is correct
24 Correct 15 ms 2896 KB Output is correct
25 Correct 21 ms 2444 KB Output is correct
26 Correct 33 ms 2520 KB Output is correct
27 Correct 16 ms 2000 KB Output is correct
28 Correct 7 ms 1728 KB Output is correct
29 Correct 13 ms 2128 KB Output is correct

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 2 ms 464 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 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 2 ms 720 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 7 ms 1548 KB Output is correct
23 Correct 2 ms 788 KB Output is correct
24 Correct 15 ms 2896 KB Output is correct
25 Correct 21 ms 2444 KB Output is correct
26 Correct 33 ms 2520 KB Output is correct
27 Correct 16 ms 2000 KB Output is correct
28 Correct 7 ms 1728 KB Output is correct
29 Correct 13 ms 2128 KB Output is correct
30 Correct 53 ms 11800 KB Output is correct
31 Correct 16 ms 8712 KB Output is correct
32 Correct 319 ms 48320 KB Output is correct
33 Correct 86 ms 16520 KB Output is correct
34 Correct 1276 ms 109096 KB Output is correct
35 Correct 929 ms 83940 KB Output is correct
36 Correct 857 ms 55380 KB Output is correct
37 Execution timed out 4033 ms 204536 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 2 ms 464 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 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 2 ms 720 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 7 ms 1548 KB Output is correct
23 Correct 2 ms 788 KB Output is correct
24 Correct 15 ms 2896 KB Output is correct
25 Correct 21 ms 2444 KB Output is correct
26 Correct 33 ms 2520 KB Output is correct
27 Correct 16 ms 2000 KB Output is correct
28 Correct 7 ms 1728 KB Output is correct
29 Correct 13 ms 2128 KB Output is correct
30 Correct 53 ms 11800 KB Output is correct
31 Correct 16 ms 8712 KB Output is correct
32 Correct 319 ms 48320 KB Output is correct
33 Correct 86 ms 16520 KB Output is correct
34 Correct 1276 ms 109096 KB Output is correct
35 Correct 929 ms 83940 KB Output is correct
36 Correct 857 ms 55380 KB Output is correct
37 Execution timed out 4033 ms 204536 KB Time limit exceeded
38 Halted 0 ms 0 KB -