Submission #953752

# Submission time Handle Problem Language Result Execution time Memory
953752 2024-03-26T15:29:20 Z De3b0o Game (APIO22_game) C++17
30 / 100
4000 ms 35876 KB
#include "game.h"
#include<bits/stdc++.h>

using namespace std;

bitset<900000000> path(0);

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.set(j+i*N);
}

int add_teleporter(int u, int v)
{
    if(path.test(v+u*N)==1)
        return 0;
    path.set(v+u*N);
    for(int i = 0 ; N>i ; i++)
    {
        if(path.test(u+i*N)==1)
        {
            for(int j = 0 ; N>j ; j++)
            {
                if(path.test(j+v*N)==1)
                    path.set(j+i*N);
            }
        }
    }
    for(int i = 0 ; N>i ; i++)
        if(path.test(i+v*N)==1)
            path.set(i+u*N);
    for(int i = 0 ; N>i ; i++)
        if(path.test(u+i*N)==1)
            path.set(v+i*N);
    for(int i = 0 ; K>i ; i++)
    {
        if(path.test(i+i*N)==1)
            return 1;
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 1 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 340 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 1 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 0 ms 344 KB Output is correct
7 Correct 1 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 340 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 10 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 221 ms 344 KB Output is correct
25 Correct 354 ms 344 KB Output is correct
26 Correct 391 ms 344 KB Output is correct
27 Correct 529 ms 344 KB Output is correct
28 Correct 103 ms 552 KB Output is correct
29 Correct 227 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 1 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 340 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 10 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 221 ms 344 KB Output is correct
25 Correct 354 ms 344 KB Output is correct
26 Correct 391 ms 344 KB Output is correct
27 Correct 529 ms 344 KB Output is correct
28 Correct 103 ms 552 KB Output is correct
29 Correct 227 ms 344 KB Output is correct
30 Execution timed out 4011 ms 35876 KB Time limit exceeded
31 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 1 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 340 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 10 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 221 ms 344 KB Output is correct
25 Correct 354 ms 344 KB Output is correct
26 Correct 391 ms 344 KB Output is correct
27 Correct 529 ms 344 KB Output is correct
28 Correct 103 ms 552 KB Output is correct
29 Correct 227 ms 344 KB Output is correct
30 Execution timed out 4011 ms 35876 KB Time limit exceeded
31 Halted 0 ms 0 KB -