oj.uz

답안 #609437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609437 2022-07-27T15:45:48 Z duality 게임 (APIO22_game) C++17
100 / 100
 1240 ms 71416 KB 
#define DEBUG 0
 
#include <bits/stdc++.h>
using namespace std;
 
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
 
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
 
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
 
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
 
// ---------- END OF TEMPLATE ----------
#include "game.h"
 
int N,K;
vi adjList[300002],adjList2[300002];
int l[300002],r[300002];
void init(int n,int k) {
    int i;
    N = n,K = k;
    for (i = 0; i < N+2; i++) l[i] = 0,r[i] = K+1;
    for (i = 1; i < K; i++) adjList[i].pb(i+1),adjList2[i+1].pb(i);
    for (i = 1; i <= K; i++) l[i] = i,r[i] = i;
}
int relax(int u,int v) {
    if (l[u] >= r[v]) return 1;
    if (l[u] >= (l[v]+r[v])/2+1) {
        while (l[u] >= (l[v]+r[v])/2+1) l[v] = (l[v]+r[v])/2+1;
        for (int w: adjList[v]) {
            if (relax(v,w)) return 1;
        }
    }
    if (r[v] <= (l[u]+r[u])/2) {
        while (r[v] <= (l[u]+r[u])/2) r[u] = (l[u]+r[u])/2;
        for (int w: adjList2[u]) {
            if (relax(w,u)) return 1;
        }
    }
    return 0;
}
int add_teleporter(int u,int v) {
    u += (u < K) ? 1:2,v += (v < K) ? 1:2;
    adjList[u].pb(v),adjList2[v].pb(u);
    return relax(u,v);
}

Subtask #1
2.0 / 2.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 7 ms 14288 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14288 KB Output is correct
6 Correct 8 ms 14300 KB Output is correct
7 Correct 10 ms 14288 KB Output is correct
8 Correct 7 ms 14288 KB Output is correct
9 Correct 7 ms 14416 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 8 ms 14288 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 10 ms 14288 KB Output is correct
14 Correct 8 ms 14324 KB Output is correct
15 Correct 8 ms 14288 KB Output is correct
16 Correct 10 ms 14288 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14416 KB Output is correct
21 Correct 8 ms 14364 KB Output is correct
22 Correct 8 ms 14416 KB Output is correct
23 Correct 8 ms 14416 KB Output is correct
24 Correct 8 ms 14428 KB Output is correct
25 Correct 10 ms 14484 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 10 ms 14468 KB Output is correct
28 Correct 9 ms 14544 KB Output is correct
29 Correct 9 ms 14544 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 7 ms 14288 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14288 KB Output is correct
6 Correct 8 ms 14300 KB Output is correct
7 Correct 10 ms 14288 KB Output is correct
8 Correct 7 ms 14288 KB Output is correct
9 Correct 7 ms 14416 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 8 ms 14288 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 10 ms 14288 KB Output is correct
14 Correct 8 ms 14324 KB Output is correct
15 Correct 8 ms 14288 KB Output is correct
16 Correct 10 ms 14288 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14416 KB Output is correct
21 Correct 8 ms 14364 KB Output is correct
22 Correct 8 ms 14416 KB Output is correct
23 Correct 8 ms 14416 KB Output is correct
24 Correct 8 ms 14428 KB Output is correct
25 Correct 10 ms 14484 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 10 ms 14468 KB Output is correct
28 Correct 9 ms 14544 KB Output is correct
29 Correct 9 ms 14544 KB Output is correct
30 Correct 21 ms 15748 KB Output is correct
31 Correct 14 ms 15084 KB Output is correct
32 Correct 25 ms 17528 KB Output is correct
33 Correct 23 ms 16528 KB Output is correct
34 Correct 41 ms 20932 KB Output is correct
35 Correct 38 ms 17968 KB Output is correct
36 Correct 59 ms 16440 KB Output is correct
37 Correct 33 ms 16484 KB Output is correct
38 Correct 31 ms 16240 KB Output is correct
39 Correct 41 ms 16288 KB Output is correct
40 Correct 48 ms 20732 KB Output is correct
41 Correct 37 ms 17452 KB Output is correct
42 Correct 43 ms 17116 KB Output is correct
43 Correct 44 ms 17776 KB Output is correct
44 Correct 46 ms 17660 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 7 ms 14288 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14288 KB Output is correct
6 Correct 8 ms 14300 KB Output is correct
7 Correct 10 ms 14288 KB Output is correct
8 Correct 7 ms 14288 KB Output is correct
9 Correct 7 ms 14416 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 8 ms 14288 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 10 ms 14288 KB Output is correct
14 Correct 8 ms 14324 KB Output is correct
15 Correct 8 ms 14288 KB Output is correct
16 Correct 10 ms 14288 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14416 KB Output is correct
21 Correct 8 ms 14364 KB Output is correct
22 Correct 8 ms 14416 KB Output is correct
23 Correct 8 ms 14416 KB Output is correct
24 Correct 8 ms 14428 KB Output is correct
25 Correct 10 ms 14484 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 10 ms 14468 KB Output is correct
28 Correct 9 ms 14544 KB Output is correct
29 Correct 9 ms 14544 KB Output is correct
30 Correct 21 ms 15748 KB Output is correct
31 Correct 14 ms 15084 KB Output is correct
32 Correct 25 ms 17528 KB Output is correct
33 Correct 23 ms 16528 KB Output is correct
34 Correct 41 ms 20932 KB Output is correct
35 Correct 38 ms 17968 KB Output is correct
36 Correct 59 ms 16440 KB Output is correct
37 Correct 33 ms 16484 KB Output is correct
38 Correct 31 ms 16240 KB Output is correct
39 Correct 41 ms 16288 KB Output is correct
40 Correct 48 ms 20732 KB Output is correct
41 Correct 37 ms 17452 KB Output is correct
42 Correct 43 ms 17116 KB Output is correct
43 Correct 44 ms 17776 KB Output is correct
44 Correct 46 ms 17660 KB Output is correct
45 Correct 250 ms 28024 KB Output is correct
46 Correct 14 ms 17188 KB Output is correct
47 Correct 15 ms 17232 KB Output is correct
48 Correct 344 ms 45472 KB Output is correct
49 Correct 314 ms 35484 KB Output is correct
50 Correct 663 ms 59812 KB Output is correct
51 Correct 796 ms 47908 KB Output is correct
52 Correct 571 ms 35560 KB Output is correct
53 Correct 692 ms 35716 KB Output is correct
54 Correct 722 ms 35744 KB Output is correct
55 Correct 974 ms 35772 KB Output is correct
56 Correct 1110 ms 35980 KB Output is correct
57 Correct 495 ms 35664 KB Output is correct
58 Correct 495 ms 35820 KB Output is correct
59 Correct 510 ms 36236 KB Output is correct
60 Correct 475 ms 36032 KB Output is correct
61 Correct 625 ms 36492 KB Output is correct
62 Correct 476 ms 44280 KB Output is correct
63 Correct 390 ms 41012 KB Output is correct
64 Correct 1211 ms 71416 KB Output is correct
65 Correct 473 ms 37996 KB Output is correct
66 Correct 419 ms 34044 KB Output is correct
67 Correct 809 ms 43616 KB Output is correct
68 Correct 251 ms 29436 KB Output is correct
69 Correct 68 ms 23480 KB Output is correct
70 Correct 773 ms 46716 KB Output is correct
71 Correct 330 ms 30184 KB Output is correct
72 Correct 256 ms 26184 KB Output is correct
73 Correct 657 ms 40716 KB Output is correct
74 Correct 1240 ms 36260 KB Output is correct
75 Correct 1038 ms 47936 KB Output is correct
76 Correct 1093 ms 55384 KB Output is correct