oj.uz

답안 #1038230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038230 2024-07-29T14:38:15 Z _8_8_ 게임 (APIO22_game) C++17
30 / 100
 852 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 * 3],R[N * 3];
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;
bool check = false;
void add(int x,int y,int v = 1,int tl = 0,int tr = k - 1) {
    if(CYC) return;
    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;
        }
        if(R[v].find(y) == R[v].end()) 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) {
    if(CYC) return;
    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;
        }
        if(L[v].find(x) == L[v].end()) 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;
    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:36:21: warning: unused variable 'ok1' [-Wunused-variable]
   36 |     bool ok = false,ok1 = false;
      |                     ^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 98904 KB Output is correct
2 Correct 15 ms 98988 KB Output is correct
3 Correct 18 ms 99484 KB Output is correct
4 Correct 20 ms 99160 KB Output is correct
5 Correct 18 ms 99416 KB Output is correct
6 Correct 18 ms 99416 KB Output is correct
7 Correct 19 ms 99412 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 98904 KB Output is correct
2 Correct 15 ms 98988 KB Output is correct
3 Correct 18 ms 99484 KB Output is correct
4 Correct 20 ms 99160 KB Output is correct
5 Correct 18 ms 99416 KB Output is correct
6 Correct 18 ms 99416 KB Output is correct
7 Correct 19 ms 99412 KB Output is correct
8 Correct 17 ms 98904 KB Output is correct
9 Correct 17 ms 98904 KB Output is correct
10 Correct 16 ms 99008 KB Output is correct
11 Correct 17 ms 99048 KB Output is correct
12 Correct 16 ms 98904 KB Output is correct
13 Correct 14 ms 98904 KB Output is correct
14 Correct 18 ms 99160 KB Output is correct
15 Correct 17 ms 99160 KB Output is correct
16 Correct 16 ms 98996 KB Output is correct
17 Correct 16 ms 98904 KB Output is correct
18 Correct 16 ms 98904 KB Output is correct
19 Correct 17 ms 99160 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 98904 KB Output is correct
2 Correct 15 ms 98988 KB Output is correct
3 Correct 18 ms 99484 KB Output is correct
4 Correct 20 ms 99160 KB Output is correct
5 Correct 18 ms 99416 KB Output is correct
6 Correct 18 ms 99416 KB Output is correct
7 Correct 19 ms 99412 KB Output is correct
8 Correct 17 ms 98904 KB Output is correct
9 Correct 17 ms 98904 KB Output is correct
10 Correct 16 ms 99008 KB Output is correct
11 Correct 17 ms 99048 KB Output is correct
12 Correct 16 ms 98904 KB Output is correct
13 Correct 14 ms 98904 KB Output is correct
14 Correct 18 ms 99160 KB Output is correct
15 Correct 17 ms 99160 KB Output is correct
16 Correct 16 ms 98996 KB Output is correct
17 Correct 16 ms 98904 KB Output is correct
18 Correct 16 ms 98904 KB Output is correct
19 Correct 17 ms 99160 KB Output is correct
20 Correct 17 ms 99020 KB Output is correct
21 Correct 15 ms 98904 KB Output is correct
22 Correct 18 ms 99160 KB Output is correct
23 Correct 16 ms 99112 KB Output is correct
24 Correct 88 ms 121576 KB Output is correct
25 Correct 81 ms 110500 KB Output is correct
26 Correct 37 ms 100688 KB Output is correct
27 Correct 39 ms 100944 KB Output is correct
28 Correct 34 ms 101712 KB Output is correct
29 Correct 111 ms 113636 KB Output is correct

Subtask #4
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 98904 KB Output is correct
2 Correct 15 ms 98988 KB Output is correct
3 Correct 18 ms 99484 KB Output is correct
4 Correct 20 ms 99160 KB Output is correct
5 Correct 18 ms 99416 KB Output is correct
6 Correct 18 ms 99416 KB Output is correct
7 Correct 19 ms 99412 KB Output is correct
8 Correct 17 ms 98904 KB Output is correct
9 Correct 17 ms 98904 KB Output is correct
10 Correct 16 ms 99008 KB Output is correct
11 Correct 17 ms 99048 KB Output is correct
12 Correct 16 ms 98904 KB Output is correct
13 Correct 14 ms 98904 KB Output is correct
14 Correct 18 ms 99160 KB Output is correct
15 Correct 17 ms 99160 KB Output is correct
16 Correct 16 ms 98996 KB Output is correct
17 Correct 16 ms 98904 KB Output is correct
18 Correct 16 ms 98904 KB Output is correct
19 Correct 17 ms 99160 KB Output is correct
20 Correct 17 ms 99020 KB Output is correct
21 Correct 15 ms 98904 KB Output is correct
22 Correct 18 ms 99160 KB Output is correct
23 Correct 16 ms 99112 KB Output is correct
24 Correct 88 ms 121576 KB Output is correct
25 Correct 81 ms 110500 KB Output is correct
26 Correct 37 ms 100688 KB Output is correct
27 Correct 39 ms 100944 KB Output is correct
28 Correct 34 ms 101712 KB Output is correct
29 Correct 111 ms 113636 KB Output is correct
30 Correct 49 ms 100608 KB Output is correct
31 Correct 30 ms 100440 KB Output is correct
32 Correct 106 ms 105692 KB Output is correct
33 Correct 45 ms 101936 KB Output is correct
34 Runtime error 852 ms 262144 KB Execution killed with signal 9
35 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 98904 KB Output is correct
2 Correct 15 ms 98988 KB Output is correct
3 Correct 18 ms 99484 KB Output is correct
4 Correct 20 ms 99160 KB Output is correct
5 Correct 18 ms 99416 KB Output is correct
6 Correct 18 ms 99416 KB Output is correct
7 Correct 19 ms 99412 KB Output is correct
8 Correct 17 ms 98904 KB Output is correct
9 Correct 17 ms 98904 KB Output is correct
10 Correct 16 ms 99008 KB Output is correct
11 Correct 17 ms 99048 KB Output is correct
12 Correct 16 ms 98904 KB Output is correct
13 Correct 14 ms 98904 KB Output is correct
14 Correct 18 ms 99160 KB Output is correct
15 Correct 17 ms 99160 KB Output is correct
16 Correct 16 ms 98996 KB Output is correct
17 Correct 16 ms 98904 KB Output is correct
18 Correct 16 ms 98904 KB Output is correct
19 Correct 17 ms 99160 KB Output is correct
20 Correct 17 ms 99020 KB Output is correct
21 Correct 15 ms 98904 KB Output is correct
22 Correct 18 ms 99160 KB Output is correct
23 Correct 16 ms 99112 KB Output is correct
24 Correct 88 ms 121576 KB Output is correct
25 Correct 81 ms 110500 KB Output is correct
26 Correct 37 ms 100688 KB Output is correct
27 Correct 39 ms 100944 KB Output is correct
28 Correct 34 ms 101712 KB Output is correct
29 Correct 111 ms 113636 KB Output is correct
30 Correct 49 ms 100608 KB Output is correct
31 Correct 30 ms 100440 KB Output is correct
32 Correct 106 ms 105692 KB Output is correct
33 Correct 45 ms 101936 KB Output is correct
34 Runtime error 852 ms 262144 KB Execution killed with signal 9
35 Halted 0 ms 0 KB -