Submission #957612

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
957612	2024-04-04T05:37:21 Z	vjudge1	Game (APIO22_game)	C++17	2 / 100	12 ms	344 KB

game

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e3 + 100;

int n, k, t;
vector<int> g[maxn];
int used[maxn];

bool ok(int v){
	used[v] = t;
	for(int to: g[v]){
		if(used[to] == t) return 1;
		if(used[to] != t + 1 && ok(to)) return 1;
	}
	used[v] = t + 1;
	return 0;
}

void init(int N, int K){
	n = N; k = K;
	for(int i = 1; i < k; i++){
		g[i].push_back(i+1);
	}
}

int add_teleporter(int u, int v){
	u++; v++;
	g[u].push_back(v);
	for(int i = 1; i <= k; i++){
		t += 2;
		if(ok(i)) return 1;
	}
	return 0;
}

Subtask #1

2.0 / 2.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	12 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	10 ms	344 KB	Output is correct
6	Correct	10 ms	344 KB	Output is correct
7	Correct	12 ms	344 KB	Output is correct

Subtask #2

0.0 / 10.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	12 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	10 ms	344 KB	Output is correct
6	Correct	10 ms	344 KB	Output is correct
7	Correct	12 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	Incorrect	0 ms	344 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 18.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	12 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	10 ms	344 KB	Output is correct
6	Correct	10 ms	344 KB	Output is correct
7	Correct	12 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	Incorrect	0 ms	344 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 30.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	12 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	10 ms	344 KB	Output is correct
6	Correct	10 ms	344 KB	Output is correct
7	Correct	12 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	Incorrect	0 ms	344 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.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	12 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	10 ms	344 KB	Output is correct
6	Correct	10 ms	344 KB	Output is correct
7	Correct	12 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	Incorrect	0 ms	344 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-