답안 #952495

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
952495	2024-03-24T06:31:01 Z	quanlt206	게임 (APIO22_game)	C++17	30 / 100	4000 ms	19224 KB

game

#include "game.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 3e5 + 7;

int n, k;

vector<int> v[N], rv[N];

void init(int N, int K) {
    n = N;
    k = K;
    REP(i, 0, k - 1) {
        v[i].push_back(i + 1);
        rv[i + 1].push_back(i);
    }
}

void bfs(int x, int d[], vector<int> v[]) {
    REP(i, 0, n) d[i] = -1;
    queue<int> qu;
    qu.push(x);
    d[x] = 0;
    while (!qu.empty()) {
        int x = qu.front();
        qu.pop();
        for (auto y : v[x])
            if (d[y] == -1) {
                qu.push(y);
                d[y] = d[x] + 1;
            }
    }
}

int d[2][N];

int add_teleporter(int x, int y) {
    bfs(y, d[0], v);
    bfs(x, d[1], rv);
    REP(i, 0, k)
        if (d[0][i] != -1 && d[1][i] != -1) return 1;
    v[x].push_back(y);
    rv[y].push_back(x);
    return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	16468 KB	Output is correct
2	Correct	4 ms	16472 KB	Output is correct
3	Correct	5 ms	16472 KB	Output is correct
4	Correct	4 ms	16472 KB	Output is correct
5	Correct	5 ms	16472 KB	Output is correct
6	Correct	5 ms	16472 KB	Output is correct
7	Correct	4 ms	16472 KB	Output is correct
8	Correct	4 ms	16472 KB	Output is correct
9	Correct	4 ms	16472 KB	Output is correct
10	Correct	4 ms	16472 KB	Output is correct
11	Correct	5 ms	16472 KB	Output is correct
12	Correct	4 ms	16472 KB	Output is correct
13	Correct	4 ms	16472 KB	Output is correct
14	Correct	4 ms	16472 KB	Output is correct
15	Correct	5 ms	16472 KB	Output is correct
16	Correct	6 ms	16472 KB	Output is correct
17	Correct	5 ms	16472 KB	Output is correct
18	Correct	5 ms	16728 KB	Output is correct
19	Correct	4 ms	16472 KB	Output is correct
20	Correct	5 ms	16728 KB	Output is correct
21	Correct	4 ms	16472 KB	Output is correct
22	Correct	5 ms	16728 KB	Output is correct
23	Correct	6 ms	16724 KB	Output is correct
24	Correct	9 ms	16728 KB	Output is correct
25	Correct	32 ms	16984 KB	Output is correct
26	Correct	33 ms	16800 KB	Output is correct
27	Correct	18 ms	17496 KB	Output is correct
28	Correct	13 ms	16984 KB	Output is correct
29	Correct	26 ms	16728 KB	Output is correct

Subtask #4
0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	16468 KB	Output is correct
2	Correct	4 ms	16472 KB	Output is correct
3	Correct	5 ms	16472 KB	Output is correct
4	Correct	4 ms	16472 KB	Output is correct
5	Correct	5 ms	16472 KB	Output is correct
6	Correct	5 ms	16472 KB	Output is correct
7	Correct	4 ms	16472 KB	Output is correct
8	Correct	4 ms	16472 KB	Output is correct
9	Correct	4 ms	16472 KB	Output is correct
10	Correct	4 ms	16472 KB	Output is correct
11	Correct	5 ms	16472 KB	Output is correct
12	Correct	4 ms	16472 KB	Output is correct
13	Correct	4 ms	16472 KB	Output is correct
14	Correct	4 ms	16472 KB	Output is correct
15	Correct	5 ms	16472 KB	Output is correct
16	Correct	6 ms	16472 KB	Output is correct
17	Correct	5 ms	16472 KB	Output is correct
18	Correct	5 ms	16728 KB	Output is correct
19	Correct	4 ms	16472 KB	Output is correct
20	Correct	5 ms	16728 KB	Output is correct
21	Correct	4 ms	16472 KB	Output is correct
22	Correct	5 ms	16728 KB	Output is correct
23	Correct	6 ms	16724 KB	Output is correct
24	Correct	9 ms	16728 KB	Output is correct
25	Correct	32 ms	16984 KB	Output is correct
26	Correct	33 ms	16800 KB	Output is correct
27	Correct	18 ms	17496 KB	Output is correct
28	Correct	13 ms	16984 KB	Output is correct
29	Correct	26 ms	16728 KB	Output is correct
30	Correct	606 ms	18216 KB	Output is correct
31	Correct	161 ms	17232 KB	Output is correct
32	Correct	642 ms	18772 KB	Output is correct
33	Correct	678 ms	18532 KB	Output is correct
34	Correct	1573 ms	19096 KB	Output is correct
35	Correct	3478 ms	19136 KB	Output is correct
36	Correct	2085 ms	18924 KB	Output is correct
37	Correct	1411 ms	18976 KB	Output is correct
38	Correct	1898 ms	18488 KB	Output is correct
39	Correct	1893 ms	18616 KB	Output is correct
40	Correct	2314 ms	19224 KB	Output is correct
41	Correct	3749 ms	18896 KB	Output is correct
42	Correct	2593 ms	18720 KB	Output is correct
43	Execution timed out	4038 ms	19032 KB	Time limit exceeded
44	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	16468 KB	Output is correct
2	Correct	4 ms	16472 KB	Output is correct
3	Correct	5 ms	16472 KB	Output is correct
4	Correct	4 ms	16472 KB	Output is correct
5	Correct	5 ms	16472 KB	Output is correct
6	Correct	5 ms	16472 KB	Output is correct
7	Correct	4 ms	16472 KB	Output is correct
8	Correct	4 ms	16472 KB	Output is correct
9	Correct	4 ms	16472 KB	Output is correct
10	Correct	4 ms	16472 KB	Output is correct
11	Correct	5 ms	16472 KB	Output is correct
12	Correct	4 ms	16472 KB	Output is correct
13	Correct	4 ms	16472 KB	Output is correct
14	Correct	4 ms	16472 KB	Output is correct
15	Correct	5 ms	16472 KB	Output is correct
16	Correct	6 ms	16472 KB	Output is correct
17	Correct	5 ms	16472 KB	Output is correct
18	Correct	5 ms	16728 KB	Output is correct
19	Correct	4 ms	16472 KB	Output is correct
20	Correct	5 ms	16728 KB	Output is correct
21	Correct	4 ms	16472 KB	Output is correct
22	Correct	5 ms	16728 KB	Output is correct
23	Correct	6 ms	16724 KB	Output is correct
24	Correct	9 ms	16728 KB	Output is correct
25	Correct	32 ms	16984 KB	Output is correct
26	Correct	33 ms	16800 KB	Output is correct
27	Correct	18 ms	17496 KB	Output is correct
28	Correct	13 ms	16984 KB	Output is correct
29	Correct	26 ms	16728 KB	Output is correct
30	Correct	606 ms	18216 KB	Output is correct
31	Correct	161 ms	17232 KB	Output is correct
32	Correct	642 ms	18772 KB	Output is correct
33	Correct	678 ms	18532 KB	Output is correct
34	Correct	1573 ms	19096 KB	Output is correct
35	Correct	3478 ms	19136 KB	Output is correct
36	Correct	2085 ms	18924 KB	Output is correct
37	Correct	1411 ms	18976 KB	Output is correct
38	Correct	1898 ms	18488 KB	Output is correct
39	Correct	1893 ms	18616 KB	Output is correct
40	Correct	2314 ms	19224 KB	Output is correct
41	Correct	3749 ms	18896 KB	Output is correct
42	Correct	2593 ms	18720 KB	Output is correct
43	Execution timed out	4038 ms	19032 KB	Time limit exceeded
44	Halted	0 ms	0 KB	-

답안 #952495

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 10.0 / 10.0

Subtask #3 18.0 / 18.0

Subtask #4 0.0 / 30.0

Subtask #5 0.0 / 40.0

Subtask #1
2.0 / 2.0

Subtask #2
10.0 / 10.0

Subtask #3
18.0 / 18.0

Subtask #4
0.0 / 30.0

Subtask #5
0.0 / 40.0