oj.uz

답안 #623516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623516 2022-08-05T18:10:09 Z Lobo 게임 (APIO22_game) C++17
60 / 100
 421 ms 53764 KB 
#include "game.h"
#include<iostream>
#include<vector>
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define mp make_pair

const int maxn = 3e5+10;
const int maxm = 5e5+10;

int n, k;
char dir[maxn][20];
// vector<pair<int,int>> g[maxn], gt[maxn];
vector<int> g[maxn];
int ans = 0;
char lvedg[maxm];
int ledg[maxm], redg[maxm], A[maxn], B[maxn];
int cntedg = 0;

/*
0 -> fora desse nível
1 -> chega em mid 
2 -> mid chega em
*/

void recall(int a);
void att(int l, int r, int lv, int a, int b, int id);
void recall(int a) {
    for(auto id : g[a]) {
        att(ledg[id],redg[id],lvedg[id],A[id],B[id],id);
        // att(0,k-1,0,a,b,id);
    }
    // for(auto B : gt[a]) {
    //     int b = B.fr;
    //     int id = B.sc;
    //     att(ledg[id],redg[id],lvedg[id],b,a,id);
    //     // att(0,k-1,0,b,a,id);
    // }
}
void att(int l, int r, int lv, int a, int b, int id) {
    lvedg[id] = lv;
    ledg[id] = l;
    redg[id] = r;
    if(l > r) return;
    int mid = (l+r)/2;
    if(a == mid) {
        if(dir[b][lv] == 0) {
            dir[b][lv] = 2; //mid chega no b
            recall(b); //b muda
        }
        else if(dir[b][lv] == 1) {
            ans = 1; // b chega em mid e mid chega em b

        }
        return;
    }
    if(b == mid) {
        if(dir[a][lv] == 0) {
            dir[a][lv] = 1; //a chega em mid
            recall(a); //a muda
        }
        else if(dir[a][lv] == 2) {
            ans = 1; // mid chega em a e a chega em mid
        }
        return;
    }

    if(dir[a][lv] == 0 && dir[b][lv] == 1) {
        //b chega em mid, a chega em b -> a chega em mid
        dir[a][lv] = 1;
        recall(a); //a mudou
        att(l,mid-1,lv+1,a,b,id); //os dois tão no L
        return;
    }
    if(dir[a][lv] == 2 && dir[b][lv] == 0) {
        //mid chega em a, a chega em b -> mid chega em b
        dir[b][lv] = 2;
        recall(b); //b mudou
        att(mid+1,r,lv+1,a,b,id); //os dois tão no R
        return;
    }
    if(dir[a][lv] == 2 && dir[b][lv] == 1) {
        //mid chega em a, a chega em b, b chega em mid -> mid chega em mid
        ans = 1;
        return;
    }
    if(dir[a][lv] == 1 && dir[b][lv] == 1) {
        att(l,mid-1,lv+1,a,b,id); //os dois tão no L | BRUTE ASSIM FICA LOG²
        return;
    }
    if(dir[a][lv] == 2 && dir[b][lv] == 2) {
        att(mid+1,r,lv+1,a,b,id); //os dois tão no R | BRUTE ASSIM FICA LOG²
        return;
    }

}

void build(int l, int r, int lv) {
    if(l > r) return;
    int mid = (l+r)/2;

    for(int i = l; i < mid; i++) {
        dir[i][lv] = 1;
    }
    for(int i = mid+1; i <= r; i++) {
        dir[i][lv] = 2;
    }

    build(l,mid-1,lv+1);
    build(mid+1,r,lv+1);
}

void init(int N, int K) {
    n = N;
    k = K;
    build(0,k-1,0);
}

int add_teleporter(int u, int v) {
    g[u].pb(cntedg);
    g[v].pb(cntedg);
    // gt[v].pb(cntedg);
    A[cntedg] = u;
    B[cntedg] = v;
    if(u == v && u < k) return 1;
    att(0,k-1,0,u,v,cntedg);
    cntedg++;
    return ans;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7248 KB Output is correct
2 Correct 3 ms 7376 KB Output is correct
3 Correct 4 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7376 KB Output is correct
6 Correct 5 ms 7376 KB Output is correct
7 Correct 5 ms 7376 KB Output is correct
8 Correct 5 ms 7376 KB Output is correct
9 Correct 4 ms 7248 KB Output is correct
10 Correct 3 ms 7376 KB Output is correct
11 Correct 4 ms 7376 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 5 ms 7444 KB Output is correct
14 Correct 4 ms 7376 KB Output is correct
15 Correct 4 ms 7376 KB Output is correct
16 Correct 5 ms 7376 KB Output is correct
17 Correct 5 ms 7392 KB Output is correct
18 Correct 5 ms 7404 KB Output is correct
19 Correct 4 ms 7376 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7248 KB Output is correct
2 Correct 3 ms 7376 KB Output is correct
3 Correct 4 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7376 KB Output is correct
6 Correct 5 ms 7376 KB Output is correct
7 Correct 5 ms 7376 KB Output is correct
8 Correct 5 ms 7376 KB Output is correct
9 Correct 4 ms 7248 KB Output is correct
10 Correct 3 ms 7376 KB Output is correct
11 Correct 4 ms 7376 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 5 ms 7444 KB Output is correct
14 Correct 4 ms 7376 KB Output is correct
15 Correct 4 ms 7376 KB Output is correct
16 Correct 5 ms 7376 KB Output is correct
17 Correct 5 ms 7392 KB Output is correct
18 Correct 5 ms 7404 KB Output is correct
19 Correct 4 ms 7376 KB Output is correct
20 Correct 4 ms 7376 KB Output is correct
21 Correct 4 ms 7376 KB Output is correct
22 Correct 4 ms 7376 KB Output is correct
23 Correct 4 ms 7396 KB Output is correct
24 Correct 5 ms 7632 KB Output is correct
25 Correct 8 ms 7632 KB Output is correct
26 Correct 7 ms 7528 KB Output is correct
27 Correct 7 ms 7632 KB Output is correct
28 Correct 6 ms 7668 KB Output is correct
29 Correct 6 ms 7760 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7248 KB Output is correct
2 Correct 3 ms 7376 KB Output is correct
3 Correct 4 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7376 KB Output is correct
6 Correct 5 ms 7376 KB Output is correct
7 Correct 5 ms 7376 KB Output is correct
8 Correct 5 ms 7376 KB Output is correct
9 Correct 4 ms 7248 KB Output is correct
10 Correct 3 ms 7376 KB Output is correct
11 Correct 4 ms 7376 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 5 ms 7444 KB Output is correct
14 Correct 4 ms 7376 KB Output is correct
15 Correct 4 ms 7376 KB Output is correct
16 Correct 5 ms 7376 KB Output is correct
17 Correct 5 ms 7392 KB Output is correct
18 Correct 5 ms 7404 KB Output is correct
19 Correct 4 ms 7376 KB Output is correct
20 Correct 4 ms 7376 KB Output is correct
21 Correct 4 ms 7376 KB Output is correct
22 Correct 4 ms 7376 KB Output is correct
23 Correct 4 ms 7396 KB Output is correct
24 Correct 5 ms 7632 KB Output is correct
25 Correct 8 ms 7632 KB Output is correct
26 Correct 7 ms 7528 KB Output is correct
27 Correct 7 ms 7632 KB Output is correct
28 Correct 6 ms 7668 KB Output is correct
29 Correct 6 ms 7760 KB Output is correct
30 Correct 25 ms 9152 KB Output is correct
31 Correct 9 ms 8272 KB Output is correct
32 Correct 30 ms 15304 KB Output is correct
33 Correct 18 ms 9456 KB Output is correct
34 Correct 59 ms 21112 KB Output is correct
35 Correct 49 ms 13564 KB Output is correct
36 Correct 70 ms 10056 KB Output is correct
37 Correct 52 ms 9692 KB Output is correct
38 Correct 35 ms 9700 KB Output is correct
39 Correct 37 ms 9800 KB Output is correct
40 Correct 57 ms 20464 KB Output is correct
41 Correct 62 ms 15984 KB Output is correct
42 Correct 44 ms 11708 KB Output is correct
43 Correct 69 ms 12828 KB Output is correct
44 Correct 61 ms 14220 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7248 KB Output is correct
2 Correct 3 ms 7376 KB Output is correct
3 Correct 4 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7376 KB Output is correct
6 Correct 5 ms 7376 KB Output is correct
7 Correct 5 ms 7376 KB Output is correct
8 Correct 5 ms 7376 KB Output is correct
9 Correct 4 ms 7248 KB Output is correct
10 Correct 3 ms 7376 KB Output is correct
11 Correct 4 ms 7376 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 5 ms 7444 KB Output is correct
14 Correct 4 ms 7376 KB Output is correct
15 Correct 4 ms 7376 KB Output is correct
16 Correct 5 ms 7376 KB Output is correct
17 Correct 5 ms 7392 KB Output is correct
18 Correct 5 ms 7404 KB Output is correct
19 Correct 4 ms 7376 KB Output is correct
20 Correct 4 ms 7376 KB Output is correct
21 Correct 4 ms 7376 KB Output is correct
22 Correct 4 ms 7376 KB Output is correct
23 Correct 4 ms 7396 KB Output is correct
24 Correct 5 ms 7632 KB Output is correct
25 Correct 8 ms 7632 KB Output is correct
26 Correct 7 ms 7528 KB Output is correct
27 Correct 7 ms 7632 KB Output is correct
28 Correct 6 ms 7668 KB Output is correct
29 Correct 6 ms 7760 KB Output is correct
30 Correct 25 ms 9152 KB Output is correct
31 Correct 9 ms 8272 KB Output is correct
32 Correct 30 ms 15304 KB Output is correct
33 Correct 18 ms 9456 KB Output is correct
34 Correct 59 ms 21112 KB Output is correct
35 Correct 49 ms 13564 KB Output is correct
36 Correct 70 ms 10056 KB Output is correct
37 Correct 52 ms 9692 KB Output is correct
38 Correct 35 ms 9700 KB Output is correct
39 Correct 37 ms 9800 KB Output is correct
40 Correct 57 ms 20464 KB Output is correct
41 Correct 62 ms 15984 KB Output is correct
42 Correct 44 ms 11708 KB Output is correct
43 Correct 69 ms 12828 KB Output is correct
44 Correct 61 ms 14220 KB Output is correct
45 Correct 226 ms 23676 KB Output is correct
46 Correct 9 ms 7988 KB Output is correct
47 Correct 10 ms 8060 KB Output is correct
48 Correct 421 ms 53764 KB Output is correct
49 Incorrect 251 ms 27700 KB Wrong Answer[1]
50 Halted 0 ms 0 KB -