이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#include <unordered_set>
#include <stack>
using namespace std;
vector<vector<int>> graph;
unordered_set<int> special_planets;
bool has_infinite_stamps;
void init(int n, int k) {
graph.resize(n);
special_planets.clear();
has_infinite_stamps = false;
for (int i = 0; i < k; i++) {
special_planets.insert(i);
}
}
int add_teleporter(int u, int v) {
graph[u].push_back(v);
stack<int> stack;
unordered_set<int> visited;
stack.push(u);
while (!stack.empty()) {
int planet = stack.top();
stack.pop();
if (special_planets.count(planet) > 0) {
has_infinite_stamps = true;
return 1;
}
visited.insert(planet);
for (int neighbor : graph[planet]) {
if (visited.count(neighbor) == 0) {
stack.push(neighbor);
}
}
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |