답안 #594687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594687	2022-07-12T20:08:59 Z	Ozy	게임 (APIO22_game)	C++17	60 / 100	1262 ms	5028 KB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define lli long long  int
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << endl
#define debugsl(a) cout << #a << " = " << ", "

#define MAX 30000

lli N,K;
lli des[MAX+2], ori[MAX+2];
    //menor   ,  mayor
vector<lli> hijos[MAX+2];
vector<lli> reves[MAX+2];

void origen(lli pos, lli val) {
    ori[pos] = val;
    for (auto h : hijos[pos]) {
        if (ori[h] < val) origen(h,val);
    }
}

void destino(lli pos, lli val) {
    des[pos] = val;
    for (auto h : reves[pos]) {
        if (des[h] > val) destino(h,val);
    }
}

void init(int n, int k) {
    N = n;
    K = k;

    rep(i,0,k-2) {
        hijos[i].push_back(i+1);
        reves[i+1].push_back(i);
    }
    rep(i,k,n-1) {
        des[i] = N+1;
        ori[i] = -1;
    }
    rep(i,0,k-1) {
        des[i] = i+1;
        ori[i] = i;
    }

}

int add_teleporter(int u, int v) {

    hijos[u].push_back(v);
    reves[v].push_back(u);

    // origen mas grande usando hijos
    if (ori[u] < K && ori[u] > ori[v]) origen(v,ori[u]);

    //destino mas pequeno usando reves

    lli x;
    if (v < K) x = v;
    else x = des[v];

    if (x < des[u]) destino(u,x);

    if (ori[u] >= des[u]) return 1;
    else return false;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1616 KB	Output is correct
2	Correct	1 ms	1616 KB	Output is correct
3	Correct	1 ms	1616 KB	Output is correct
4	Correct	1 ms	1616 KB	Output is correct
5	Correct	1 ms	1616 KB	Output is correct
6	Correct	1 ms	1616 KB	Output is correct
7	Correct	2 ms	1616 KB	Output is correct
8	Correct	1 ms	1616 KB	Output is correct
9	Correct	1 ms	1664 KB	Output is correct
10	Correct	2 ms	1616 KB	Output is correct
11	Correct	2 ms	1616 KB	Output is correct
12	Correct	2 ms	1616 KB	Output is correct
13	Correct	1 ms	1616 KB	Output is correct
14	Correct	2 ms	1616 KB	Output is correct
15	Correct	1 ms	1616 KB	Output is correct
16	Correct	1 ms	1616 KB	Output is correct
17	Correct	1 ms	1616 KB	Output is correct
18	Correct	1 ms	1616 KB	Output is correct
19	Correct	1 ms	1720 KB	Output is correct
20	Correct	2 ms	1744 KB	Output is correct
21	Correct	2 ms	1616 KB	Output is correct
22	Correct	1 ms	1744 KB	Output is correct
23	Correct	2 ms	1748 KB	Output is correct
24	Correct	6 ms	1744 KB	Output is correct
25	Correct	7 ms	1792 KB	Output is correct
26	Correct	3 ms	1872 KB	Output is correct
27	Correct	3 ms	1872 KB	Output is correct
28	Correct	3 ms	1816 KB	Output is correct
29	Correct	5 ms	1792 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1616 KB	Output is correct
2	Correct	1 ms	1616 KB	Output is correct
3	Correct	1 ms	1616 KB	Output is correct
4	Correct	1 ms	1616 KB	Output is correct
5	Correct	1 ms	1616 KB	Output is correct
6	Correct	1 ms	1616 KB	Output is correct
7	Correct	2 ms	1616 KB	Output is correct
8	Correct	1 ms	1616 KB	Output is correct
9	Correct	1 ms	1664 KB	Output is correct
10	Correct	2 ms	1616 KB	Output is correct
11	Correct	2 ms	1616 KB	Output is correct
12	Correct	2 ms	1616 KB	Output is correct
13	Correct	1 ms	1616 KB	Output is correct
14	Correct	2 ms	1616 KB	Output is correct
15	Correct	1 ms	1616 KB	Output is correct
16	Correct	1 ms	1616 KB	Output is correct
17	Correct	1 ms	1616 KB	Output is correct
18	Correct	1 ms	1616 KB	Output is correct
19	Correct	1 ms	1720 KB	Output is correct
20	Correct	2 ms	1744 KB	Output is correct
21	Correct	2 ms	1616 KB	Output is correct
22	Correct	1 ms	1744 KB	Output is correct
23	Correct	2 ms	1748 KB	Output is correct
24	Correct	6 ms	1744 KB	Output is correct
25	Correct	7 ms	1792 KB	Output is correct
26	Correct	3 ms	1872 KB	Output is correct
27	Correct	3 ms	1872 KB	Output is correct
28	Correct	3 ms	1816 KB	Output is correct
29	Correct	5 ms	1792 KB	Output is correct
30	Correct	19 ms	3360 KB	Output is correct
31	Correct	6 ms	2536 KB	Output is correct
32	Correct	18 ms	4196 KB	Output is correct
33	Correct	19 ms	3936 KB	Output is correct
34	Correct	1262 ms	4544 KB	Output is correct
35	Correct	342 ms	4460 KB	Output is correct
36	Correct	45 ms	4088 KB	Output is correct
37	Correct	50 ms	4120 KB	Output is correct
38	Correct	36 ms	3968 KB	Output is correct
39	Correct	40 ms	3976 KB	Output is correct
40	Correct	955 ms	4964 KB	Output is correct
41	Correct	154 ms	4112 KB	Output is correct
42	Correct	109 ms	4124 KB	Output is correct
43	Correct	47 ms	4824 KB	Output is correct
44	Correct	719 ms	5028 KB	Output is correct

Subtask #5
0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1616 KB	Output is correct
2	Correct	1 ms	1616 KB	Output is correct
3	Correct	1 ms	1616 KB	Output is correct
4	Correct	1 ms	1616 KB	Output is correct
5	Correct	1 ms	1616 KB	Output is correct
6	Correct	1 ms	1616 KB	Output is correct
7	Correct	2 ms	1616 KB	Output is correct
8	Correct	1 ms	1616 KB	Output is correct
9	Correct	1 ms	1664 KB	Output is correct
10	Correct	2 ms	1616 KB	Output is correct
11	Correct	2 ms	1616 KB	Output is correct
12	Correct	2 ms	1616 KB	Output is correct
13	Correct	1 ms	1616 KB	Output is correct
14	Correct	2 ms	1616 KB	Output is correct
15	Correct	1 ms	1616 KB	Output is correct
16	Correct	1 ms	1616 KB	Output is correct
17	Correct	1 ms	1616 KB	Output is correct
18	Correct	1 ms	1616 KB	Output is correct
19	Correct	1 ms	1720 KB	Output is correct
20	Correct	2 ms	1744 KB	Output is correct
21	Correct	2 ms	1616 KB	Output is correct
22	Correct	1 ms	1744 KB	Output is correct
23	Correct	2 ms	1748 KB	Output is correct
24	Correct	6 ms	1744 KB	Output is correct
25	Correct	7 ms	1792 KB	Output is correct
26	Correct	3 ms	1872 KB	Output is correct
27	Correct	3 ms	1872 KB	Output is correct
28	Correct	3 ms	1816 KB	Output is correct
29	Correct	5 ms	1792 KB	Output is correct
30	Correct	19 ms	3360 KB	Output is correct
31	Correct	6 ms	2536 KB	Output is correct
32	Correct	18 ms	4196 KB	Output is correct
33	Correct	19 ms	3936 KB	Output is correct
34	Correct	1262 ms	4544 KB	Output is correct
35	Correct	342 ms	4460 KB	Output is correct
36	Correct	45 ms	4088 KB	Output is correct
37	Correct	50 ms	4120 KB	Output is correct
38	Correct	36 ms	3968 KB	Output is correct
39	Correct	40 ms	3976 KB	Output is correct
40	Correct	955 ms	4964 KB	Output is correct
41	Correct	154 ms	4112 KB	Output is correct
42	Correct	109 ms	4124 KB	Output is correct
43	Correct	47 ms	4824 KB	Output is correct
44	Correct	719 ms	5028 KB	Output is correct
45	Runtime error	3 ms	3732 KB	Execution killed with signal 11
46	Halted	0 ms	0 KB	-

답안 #594687

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 10.0 / 10.0

Subtask #3 18.0 / 18.0

Subtask #4 30.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
30.0 / 30.0

Subtask #5
0.0 / 40.0