답안 #953768

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
953768	2024-03-26T15:41:59 Z	De3b0o	게임 (APIO22_game)	C++17	30 / 100	4000 ms	52908 KB

game

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include "game.h"
#include<bits/stdc++.h>

using namespace std;

bitset<900000000> path;

int K , N;

void init(int n, int k)
{
    N=n;
    K=k;
    for(int i = 0 ; k>i ; i++)
        for(int j = i+1 ; k>j ; j++)
            path[j+i*N]=1;
}

int add_teleporter(int u, int v)
{
    if(path[v+u*N])
        return 0;
    path[v+u*N]=1;
    for(int i = 0 ; N>i ; i++)
    {
        if(path[u+i*N])
        {
            path[v+i*N]=1;
            for(int j = 0 ; N>j ; j++)
            {
                if(path[j+v*N])
                    path[j+i*N]=1;
            }
        }
    }
    for(int i = 0 ; N>i ; i++)
        if(path[i+v*N])
            path[i+u*N]=1;
    for(int i = 0 ; K>i ; i++)
    {
        if(path[i+i*N])
            return 1;
    }
    return 0;
}

Subtask #1

2.0 / 2.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	4 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	8 ms	344 KB	Output is correct
23	Correct	6 ms	344 KB	Output is correct
24	Correct	187 ms	344 KB	Output is correct
25	Correct	283 ms	344 KB	Output is correct
26	Correct	350 ms	344 KB	Output is correct
27	Correct	434 ms	344 KB	Output is correct
28	Correct	98 ms	344 KB	Output is correct
29	Correct	190 ms	344 KB	Output is correct

Subtask #4

0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	4 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	8 ms	344 KB	Output is correct
23	Correct	6 ms	344 KB	Output is correct
24	Correct	187 ms	344 KB	Output is correct
25	Correct	283 ms	344 KB	Output is correct
26	Correct	350 ms	344 KB	Output is correct
27	Correct	434 ms	344 KB	Output is correct
28	Correct	98 ms	344 KB	Output is correct
29	Correct	190 ms	344 KB	Output is correct
30	Execution timed out	4006 ms	52908 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	4 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	8 ms	344 KB	Output is correct
23	Correct	6 ms	344 KB	Output is correct
24	Correct	187 ms	344 KB	Output is correct
25	Correct	283 ms	344 KB	Output is correct
26	Correct	350 ms	344 KB	Output is correct
27	Correct	434 ms	344 KB	Output is correct
28	Correct	98 ms	344 KB	Output is correct
29	Correct	190 ms	344 KB	Output is correct
30	Execution timed out	4006 ms	52908 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-