Submission #953769

# Submission time Handle Problem Language Result Execution time Memory
953769 2024-03-26T15:48:48 Z De3b0o Game (APIO22_game) C++17
30 / 100
4000 ms 52848 KB
#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++)
    {
        int e = i*N;
        for(int j = i+1 ; k>j ; j++)
            path[j+e]=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])
        {
            int e = i*N;
            path[v+e]=1;
            int c = v*N;
            for(int j = 0 ; N>j ; j++)
            {
                if(path[j+c])
                    path[j+e]=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;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 1 ms 344 KB Output is correct
12 Correct 0 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 1 ms 344 KB Output is correct
12 Correct 0 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 186 ms 344 KB Output is correct
25 Correct 286 ms 344 KB Output is correct
26 Correct 355 ms 344 KB Output is correct
27 Correct 436 ms 344 KB Output is correct
28 Correct 96 ms 344 KB Output is correct
29 Correct 182 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 1 ms 344 KB Output is correct
12 Correct 0 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 186 ms 344 KB Output is correct
25 Correct 286 ms 344 KB Output is correct
26 Correct 355 ms 344 KB Output is correct
27 Correct 436 ms 344 KB Output is correct
28 Correct 96 ms 344 KB Output is correct
29 Correct 182 ms 344 KB Output is correct
30 Execution timed out 4043 ms 52848 KB Time limit exceeded
31 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 1 ms 344 KB Output is correct
12 Correct 0 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 186 ms 344 KB Output is correct
25 Correct 286 ms 344 KB Output is correct
26 Correct 355 ms 344 KB Output is correct
27 Correct 436 ms 344 KB Output is correct
28 Correct 96 ms 344 KB Output is correct
29 Correct 182 ms 344 KB Output is correct
30 Execution timed out 4043 ms 52848 KB Time limit exceeded
31 Halted 0 ms 0 KB -