oj.uz

Submission #1009239

# Submission time Handle Problem Language Result Execution time Memory
1009239 2024-06-27T10:21:14 Z lrancic Special graph (IZhO13_specialg) C++17
0 / 100
 1000 ms 5648 KB 
#include <iostream>
#include <vector>
#include <unordered_set>

int path(std::vector<int> &vec) {
	int x, y, c = 0; std::cin >> x >> y;
	std::unordered_set<int> visited;

	while (x != y) {
		x = vec[x];

		if (visited.find(x) != visited.end() || x == -1) return -1;
		visited.insert(x);

		c++;
	}

	return c;
}

int main() {
	std::ios_base::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);

	int n; std::cin >> n;
	std::vector<int> vec(n+1); for (int i = 1; i <= n; i++) std::cin >> vec[i];

	int m; std::cin >> m;
	for (int i = 0; i < m; i++) {
		int act; std::cin >> act;

		if (act == 1) {
			int x; std::cin >> x;
			vec[x] = -1;
			continue;
		}

		std::cout << path(vec) << '\n';
	}
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 4 ms 404 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 204 ms 492 KB Output is correct
7 Correct 229 ms 348 KB Output is correct
8 Correct 245 ms 344 KB Output is correct
9 Correct 176 ms 348 KB Output is correct
10 Correct 275 ms 492 KB Output is correct
11 Execution timed out 1014 ms 5648 KB Time limit exceeded
12 Halted 0 ms 0 KB -