oj.uz

Submission #966836

# Submission time Handle Problem Language Result Execution time Memory
966836 2024-04-20T13:00:56 Z josanneo22 Game (APIO22_game) C++17
0 / 100
 1 ms 2648 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int nax = 30005;
const int kax = 1005;
int reach[kax][nax], N, K;
vector<int> G[nax];
bool ok;

void dfs(int tp, int u) {
	reach[tp][u] = 1;
	if (u <= tp) ok = true;
	for (auto & v : G[u]) {
		if (!reach[tp][v]) {
			dfs(tp, v);
		}
	}
}
void init(int n, int k) {
	N = n; K = k; ok = false;
	for (int i = 1; i <= k - 1; i++) G[i].push_back(i + 1);
	for (int i = 1; i <= k - 1; i++) dfs(i, i);
}
int add_teleporter(int u, int v) {
	u++; v++;
	G[u].push_back(v);
	for (int i = 1; i <= K; i++) {
		if (reach[i][u] && !reach[i][v]) {
			dfs(i, v);
		}
	}
	return ok;
}

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -