This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
#include <bits/stdc++.h>
#define all(x) begin((x)), end((x))
using ll = long long;
using namespace std;
vector<vector<int>> g(1001);
ll planets, specials;
void init(int n, int k) {
planets = n, specials = k;
for (int i = 0; i < k - 1; i++) g[i].push_back(i + 1);
}
int add_teleporter(int u, int v) {
g[u].push_back(v);
vector<bool> vis(1001);
priority_queue<ll> q;
q.push(0);
while (q.size()) {
ll curr = q.top();
q.pop();
cout << curr << endl;
if (vis[curr] && curr < specials) return true;
else if (vis[curr])
continue;
vis[curr] = true;
for (const int& nei : g[curr]) q.push(nei);
}
return false;
}
# | 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... |