Submission #710348

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
710348	2023-03-15T07:34:07 Z	Astrayt	Game (APIO22_game)	C++17	2 / 100	10 ms	14416 KB

game

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define maxn 300005

int N, K, good = 0, t = 1, low[maxn];
vector<int> adj[maxn], rev[maxn];

void init(int n, int k){
    N = n, K = k;
    for(int i = 0; i < k - 1; ++i) adj[i].pb(i + 1), rev[i + 1].pb(i);
    for(int i = 0; i < n; ++i) low[i] = i;
}

int add_teleporter(int u, int v){
    if(u == v){
        if(u < K) return 1;
        else return 0;
    }
    adj[u].pb(v);
    rev[v].pb(u);
    low[u] = min(low[v], low[u]);
    queue<int> bfs; bfs.push(u);
    while(bfs.size()){
        int u = bfs.front(); bfs.pop();
        for(auto v:rev[u]){
            if(low[v] > low[u]) {
                low[v] = low[u];
                bfs.push(v);
            }
        }
    }
    for(int i = 0; i < K; ++i){
        if(low[i] < i) return 1;
    }
    return 0;
}

Subtask #1

2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	14416 KB	Output is correct
2	Correct	9 ms	14380 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	10 ms	14356 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	9 ms	14288 KB	Output is correct

Subtask #2

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	14416 KB	Output is correct
2	Correct	9 ms	14380 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	10 ms	14356 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	9 ms	14288 KB	Output is correct
8	Correct	7 ms	14288 KB	Output is correct
9	Correct	8 ms	14288 KB	Output is correct
10	Correct	8 ms	14288 KB	Output is correct
11	Correct	7 ms	14288 KB	Output is correct
12	Correct	7 ms	14288 KB	Output is correct
13	Incorrect	8 ms	14280 KB	Wrong Answer[1]
14	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	14416 KB	Output is correct
2	Correct	9 ms	14380 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	10 ms	14356 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	9 ms	14288 KB	Output is correct
8	Correct	7 ms	14288 KB	Output is correct
9	Correct	8 ms	14288 KB	Output is correct
10	Correct	8 ms	14288 KB	Output is correct
11	Correct	7 ms	14288 KB	Output is correct
12	Correct	7 ms	14288 KB	Output is correct
13	Incorrect	8 ms	14280 KB	Wrong Answer[1]
14	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	14416 KB	Output is correct
2	Correct	9 ms	14380 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	10 ms	14356 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	9 ms	14288 KB	Output is correct
8	Correct	7 ms	14288 KB	Output is correct
9	Correct	8 ms	14288 KB	Output is correct
10	Correct	8 ms	14288 KB	Output is correct
11	Correct	7 ms	14288 KB	Output is correct
12	Correct	7 ms	14288 KB	Output is correct
13	Incorrect	8 ms	14280 KB	Wrong Answer[1]
14	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	14416 KB	Output is correct
2	Correct	9 ms	14380 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	10 ms	14356 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	9 ms	14288 KB	Output is correct
8	Correct	7 ms	14288 KB	Output is correct
9	Correct	8 ms	14288 KB	Output is correct
10	Correct	8 ms	14288 KB	Output is correct
11	Correct	7 ms	14288 KB	Output is correct
12	Correct	7 ms	14288 KB	Output is correct
13	Incorrect	8 ms	14280 KB	Wrong Answer[1]
14	Halted	0 ms	0 KB	-