oj.uz

Submission #1037954

# Submission time Handle Problem Language Result Execution time Memory
1037954 2024-07-29T11:01:50 Z _8_8_ Game (APIO22_game) C++17
30 / 100
 700 ms 262144 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 3e5 + 12;
vector<int> g[N],gr[N];
set<int> L[N * 4],R[N * 4];
int k;
void build(int v = 1,int tl = 0,int tr = k - 1) {
    int tm = (tl + tr) >> 1;
    for(int i = tl;i <= tr;i++) {
        if(i <= tm) {
            L[v].insert(i);
        }
        if(i >= tm) {
            R[v].insert(i);
        }
    }
    if(tl == tr) return;
    build(v + v,tl,tm);
    build(v + v + 1,tm + 1,tr);
}
void init(int n, int K) {
    k = K;
    for(int i = 0;i <= k - 2;i++) {
        g[i].push_back(i + 1);
        gr[i + 1].push_back(i);
    }
    build();
}
bool CYC = false;
void add(int x,int y,int v = 1,int tl = 0,int tr = k - 1) {
    int tm = (tl + tr) >> 1;
    bool ok = false,ok1 = false;
    function<void(int)> dfs = [&](int u){
        R[v].insert(u);
        ok = 1;
        if(L[v].find(u) != L[v].end()) {
            CYC = 1;
            return;
        }
        for(int to:g[u]) {
            if(R[v].find(to) == R[v].end()) {
                dfs(to);
            }
            if(CYC) return;
        }
        if(CYC) return;
    };
    if(R[v].find(x) != R[v].end()) {
        if(L[v].find(y) != L[v].end()) {
            CYC = 1;
            return;
        }
        dfs(y);
        if(tl != tr) add(x,y,v + v + 1,tm + 1,tr);
    } else {
        if(tl != tr) add(x,y,v + v,tl,tm);
    }
}
void addl(int x,int y,int v = 1,int tl = 0,int tr = k - 1) {
    int tm = (tl + tr) >> 1;
    function<void(int)> dfs1 = [&](int u){
        if(R[v].find(u) != R[v].end()) {
            CYC = 1;
            return;
        }
        L[v].insert(u);
        for(int to:gr[u]) {
            if(L[v].find(to) == L[v].end()) {
                dfs1(to);
            }
            if(CYC) return;
        }
        if(CYC) return;
    };
    if(L[v].find(y) != L[v].end()) {
        if(R[v].find(x) != R[v].end()) {
            CYC = 1;
            return;
        }
        dfs1(x);
        if(tl != tr) addl(x,y,v + v,tl,tm);
    } else {
        if(tl != tr) addl(x,y,v+v+1,tm+1,tr);
    }
}
int add_teleporter(int u, int v) {
    if(CYC) return 1;
    if(max(u,v) <= k - 1) {
        if(u >= v) {
            CYC = 1;
            return 1;
        }
        return 0;
    }
    g[u].push_back(v);
    gr[v].push_back(u);
    add(u,v);
    addl(u,v);
    return CYC;
}

Compilation message

game.cpp: In function 'void add(int, int, int, int, int)':
game.cpp:34:21: warning: unused variable 'ok1' [-Wunused-variable]
   34 |     bool ok = false,ok1 = false;
      |                     ^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 127064 KB Output is correct
2 Correct 20 ms 127064 KB Output is correct
3 Correct 22 ms 127064 KB Output is correct
4 Correct 19 ms 127064 KB Output is correct
5 Correct 21 ms 127064 KB Output is correct
6 Correct 20 ms 127132 KB Output is correct
7 Correct 20 ms 127064 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 127064 KB Output is correct
2 Correct 20 ms 127064 KB Output is correct
3 Correct 22 ms 127064 KB Output is correct
4 Correct 19 ms 127064 KB Output is correct
5 Correct 21 ms 127064 KB Output is correct
6 Correct 20 ms 127132 KB Output is correct
7 Correct 20 ms 127064 KB Output is correct
8 Correct 19 ms 127160 KB Output is correct
9 Correct 19 ms 127180 KB Output is correct
10 Correct 21 ms 127180 KB Output is correct
11 Correct 21 ms 127064 KB Output is correct
12 Correct 21 ms 127064 KB Output is correct
13 Correct 21 ms 127064 KB Output is correct
14 Correct 21 ms 127320 KB Output is correct
15 Correct 21 ms 127320 KB Output is correct
16 Correct 21 ms 127184 KB Output is correct
17 Correct 21 ms 127320 KB Output is correct
18 Correct 21 ms 127064 KB Output is correct
19 Correct 22 ms 127064 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 127064 KB Output is correct
2 Correct 20 ms 127064 KB Output is correct
3 Correct 22 ms 127064 KB Output is correct
4 Correct 19 ms 127064 KB Output is correct
5 Correct 21 ms 127064 KB Output is correct
6 Correct 20 ms 127132 KB Output is correct
7 Correct 20 ms 127064 KB Output is correct
8 Correct 19 ms 127160 KB Output is correct
9 Correct 19 ms 127180 KB Output is correct
10 Correct 21 ms 127180 KB Output is correct
11 Correct 21 ms 127064 KB Output is correct
12 Correct 21 ms 127064 KB Output is correct
13 Correct 21 ms 127064 KB Output is correct
14 Correct 21 ms 127320 KB Output is correct
15 Correct 21 ms 127320 KB Output is correct
16 Correct 21 ms 127184 KB Output is correct
17 Correct 21 ms 127320 KB Output is correct
18 Correct 21 ms 127064 KB Output is correct
19 Correct 22 ms 127064 KB Output is correct
20 Correct 21 ms 127320 KB Output is correct
21 Correct 21 ms 127064 KB Output is correct
22 Correct 21 ms 127472 KB Output is correct
23 Correct 20 ms 127320 KB Output is correct
24 Correct 90 ms 149584 KB Output is correct
25 Correct 83 ms 138744 KB Output is correct
26 Correct 39 ms 128852 KB Output is correct
27 Correct 41 ms 129364 KB Output is correct
28 Correct 35 ms 129880 KB Output is correct
29 Correct 39 ms 130384 KB Output is correct

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 127064 KB Output is correct
2 Correct 20 ms 127064 KB Output is correct
3 Correct 22 ms 127064 KB Output is correct
4 Correct 19 ms 127064 KB Output is correct
5 Correct 21 ms 127064 KB Output is correct
6 Correct 20 ms 127132 KB Output is correct
7 Correct 20 ms 127064 KB Output is correct
8 Correct 19 ms 127160 KB Output is correct
9 Correct 19 ms 127180 KB Output is correct
10 Correct 21 ms 127180 KB Output is correct
11 Correct 21 ms 127064 KB Output is correct
12 Correct 21 ms 127064 KB Output is correct
13 Correct 21 ms 127064 KB Output is correct
14 Correct 21 ms 127320 KB Output is correct
15 Correct 21 ms 127320 KB Output is correct
16 Correct 21 ms 127184 KB Output is correct
17 Correct 21 ms 127320 KB Output is correct
18 Correct 21 ms 127064 KB Output is correct
19 Correct 22 ms 127064 KB Output is correct
20 Correct 21 ms 127320 KB Output is correct
21 Correct 21 ms 127064 KB Output is correct
22 Correct 21 ms 127472 KB Output is correct
23 Correct 20 ms 127320 KB Output is correct
24 Correct 90 ms 149584 KB Output is correct
25 Correct 83 ms 138744 KB Output is correct
26 Correct 39 ms 128852 KB Output is correct
27 Correct 41 ms 129364 KB Output is correct
28 Correct 35 ms 129880 KB Output is correct
29 Correct 39 ms 130384 KB Output is correct
30 Correct 47 ms 128840 KB Output is correct
31 Correct 33 ms 128592 KB Output is correct
32 Correct 85 ms 136040 KB Output is correct
33 Correct 41 ms 130136 KB Output is correct
34 Runtime error 700 ms 262144 KB Execution killed with signal 9
35 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 127064 KB Output is correct
2 Correct 20 ms 127064 KB Output is correct
3 Correct 22 ms 127064 KB Output is correct
4 Correct 19 ms 127064 KB Output is correct
5 Correct 21 ms 127064 KB Output is correct
6 Correct 20 ms 127132 KB Output is correct
7 Correct 20 ms 127064 KB Output is correct
8 Correct 19 ms 127160 KB Output is correct
9 Correct 19 ms 127180 KB Output is correct
10 Correct 21 ms 127180 KB Output is correct
11 Correct 21 ms 127064 KB Output is correct
12 Correct 21 ms 127064 KB Output is correct
13 Correct 21 ms 127064 KB Output is correct
14 Correct 21 ms 127320 KB Output is correct
15 Correct 21 ms 127320 KB Output is correct
16 Correct 21 ms 127184 KB Output is correct
17 Correct 21 ms 127320 KB Output is correct
18 Correct 21 ms 127064 KB Output is correct
19 Correct 22 ms 127064 KB Output is correct
20 Correct 21 ms 127320 KB Output is correct
21 Correct 21 ms 127064 KB Output is correct
22 Correct 21 ms 127472 KB Output is correct
23 Correct 20 ms 127320 KB Output is correct
24 Correct 90 ms 149584 KB Output is correct
25 Correct 83 ms 138744 KB Output is correct
26 Correct 39 ms 128852 KB Output is correct
27 Correct 41 ms 129364 KB Output is correct
28 Correct 35 ms 129880 KB Output is correct
29 Correct 39 ms 130384 KB Output is correct
30 Correct 47 ms 128840 KB Output is correct
31 Correct 33 ms 128592 KB Output is correct
32 Correct 85 ms 136040 KB Output is correct
33 Correct 41 ms 130136 KB Output is correct
34 Runtime error 700 ms 262144 KB Execution killed with signal 9
35 Halted 0 ms 0 KB -