oj.uz

Submission #609389

# Submission time Handle Problem Language Result Execution time Memory
609389 2022-07-27T14:49:27 Z duality Game (APIO22_game) C++17
100 / 100
 1640 ms 130204 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) {
        l[v] = (l[v]+r[v])/2+1;
        for (int w: adjList[v]) {
            if (relax(v,w)) return 1;
        }
        for (int w: adjList2[v]) {
            if (relax(w,v)) return 1;
        }
    }
    if (r[v] <= (l[u]+r[u])/2) {
        r[u] = (l[u]+r[u])/2;
        for (int w: adjList[u]) {
            if (relax(u,w)) return 1;
        }
        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

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14388 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14288 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14388 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14288 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct
8 Correct 8 ms 14288 KB Output is correct
9 Correct 8 ms 14288 KB Output is correct
10 Correct 9 ms 14288 KB Output is correct
11 Correct 7 ms 14348 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 8 ms 14380 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14336 KB Output is correct
16 Correct 8 ms 14308 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 7 ms 14416 KB Output is correct
19 Correct 8 ms 14416 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14388 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14288 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct
8 Correct 8 ms 14288 KB Output is correct
9 Correct 8 ms 14288 KB Output is correct
10 Correct 9 ms 14288 KB Output is correct
11 Correct 7 ms 14348 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 8 ms 14380 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14336 KB Output is correct
16 Correct 8 ms 14308 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 7 ms 14416 KB Output is correct
19 Correct 8 ms 14416 KB Output is correct
20 Correct 10 ms 14424 KB Output is correct
21 Correct 8 ms 14404 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 10 ms 14544 KB Output is correct
25 Correct 10 ms 14432 KB Output is correct
26 Correct 12 ms 14416 KB Output is correct
27 Correct 11 ms 14440 KB Output is correct
28 Correct 9 ms 14500 KB Output is correct
29 Correct 9 ms 14572 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14388 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14288 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct
8 Correct 8 ms 14288 KB Output is correct
9 Correct 8 ms 14288 KB Output is correct
10 Correct 9 ms 14288 KB Output is correct
11 Correct 7 ms 14348 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 8 ms 14380 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14336 KB Output is correct
16 Correct 8 ms 14308 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 7 ms 14416 KB Output is correct
19 Correct 8 ms 14416 KB Output is correct
20 Correct 10 ms 14424 KB Output is correct
21 Correct 8 ms 14404 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 10 ms 14544 KB Output is correct
25 Correct 10 ms 14432 KB Output is correct
26 Correct 12 ms 14416 KB Output is correct
27 Correct 11 ms 14440 KB Output is correct
28 Correct 9 ms 14500 KB Output is correct
29 Correct 9 ms 14572 KB Output is correct
30 Correct 22 ms 15688 KB Output is correct
31 Correct 12 ms 15056 KB Output is correct
32 Correct 29 ms 23368 KB Output is correct
33 Correct 25 ms 16544 KB Output is correct
34 Correct 66 ms 30092 KB Output is correct
35 Correct 54 ms 18008 KB Output is correct
36 Correct 44 ms 16556 KB Output is correct
37 Correct 40 ms 16400 KB Output is correct
38 Correct 39 ms 16240 KB Output is correct
39 Correct 40 ms 16328 KB Output is correct
40 Correct 42 ms 18756 KB Output is correct
41 Correct 44 ms 18088 KB Output is correct
42 Correct 43 ms 18844 KB Output is correct
43 Correct 41 ms 17708 KB Output is correct
44 Correct 47 ms 17656 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14388 KB Output is correct
2 Correct 7 ms 14288 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14288 KB Output is correct
5 Correct 8 ms 14288 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 8 ms 14288 KB Output is correct
8 Correct 8 ms 14288 KB Output is correct
9 Correct 8 ms 14288 KB Output is correct
10 Correct 9 ms 14288 KB Output is correct
11 Correct 7 ms 14348 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 8 ms 14380 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14336 KB Output is correct
16 Correct 8 ms 14308 KB Output is correct
17 Correct 8 ms 14288 KB Output is correct
18 Correct 7 ms 14416 KB Output is correct
19 Correct 8 ms 14416 KB Output is correct
20 Correct 10 ms 14424 KB Output is correct
21 Correct 8 ms 14404 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 10 ms 14544 KB Output is correct
25 Correct 10 ms 14432 KB Output is correct
26 Correct 12 ms 14416 KB Output is correct
27 Correct 11 ms 14440 KB Output is correct
28 Correct 9 ms 14500 KB Output is correct
29 Correct 9 ms 14572 KB Output is correct
30 Correct 22 ms 15688 KB Output is correct
31 Correct 12 ms 15056 KB Output is correct
32 Correct 29 ms 23368 KB Output is correct
33 Correct 25 ms 16544 KB Output is correct
34 Correct 66 ms 30092 KB Output is correct
35 Correct 54 ms 18008 KB Output is correct
36 Correct 44 ms 16556 KB Output is correct
37 Correct 40 ms 16400 KB Output is correct
38 Correct 39 ms 16240 KB Output is correct
39 Correct 40 ms 16328 KB Output is correct
40 Correct 42 ms 18756 KB Output is correct
41 Correct 44 ms 18088 KB Output is correct
42 Correct 43 ms 18844 KB Output is correct
43 Correct 41 ms 17708 KB Output is correct
44 Correct 47 ms 17656 KB Output is correct
45 Correct 258 ms 28080 KB Output is correct
46 Correct 17 ms 17172 KB Output is correct
47 Correct 12 ms 17152 KB Output is correct
48 Correct 342 ms 45512 KB Output is correct
49 Correct 310 ms 35488 KB Output is correct
50 Correct 632 ms 130204 KB Output is correct
51 Correct 980 ms 65780 KB Output is correct
52 Correct 654 ms 35424 KB Output is correct
53 Correct 909 ms 35744 KB Output is correct
54 Correct 951 ms 35988 KB Output is correct
55 Correct 1182 ms 36864 KB Output is correct
56 Correct 1458 ms 36308 KB Output is correct
57 Correct 597 ms 35744 KB Output is correct
58 Correct 513 ms 36192 KB Output is correct
59 Correct 598 ms 35816 KB Output is correct
60 Correct 633 ms 36224 KB Output is correct
61 Correct 899 ms 35980 KB Output is correct
62 Correct 572 ms 44284 KB Output is correct
63 Correct 463 ms 41020 KB Output is correct
64 Correct 1378 ms 71416 KB Output is correct
65 Correct 721 ms 46684 KB Output is correct
66 Correct 527 ms 34044 KB Output is correct
67 Correct 1020 ms 65536 KB Output is correct
68 Correct 229 ms 29520 KB Output is correct
69 Correct 69 ms 23524 KB Output is correct
70 Correct 917 ms 46540 KB Output is correct
71 Correct 373 ms 30316 KB Output is correct
72 Correct 285 ms 26236 KB Output is correct
73 Correct 737 ms 43976 KB Output is correct
74 Correct 1640 ms 36360 KB Output is correct
75 Correct 1105 ms 48016 KB Output is correct
76 Correct 1242 ms 55248 KB Output is correct