# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
772920 | fve5 | Comparing Plants (IOI20_plants) | C++17 | 4077 ms | 18112 KiB |
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 <bits/stdc++.h>
using namespace std;
#define MAXN 200'000
vector<int> adj[MAXN];
void init(int k, vector<int> r) {
for (int i = 0; i < r.size(); i++) {
if (r[i] == k - 1) {
for (int j = 1; j < k; j++) {
adj[(i + j) % r.size()].push_back(i);
}
}
if (r[i] == 0) {
for (int j = 1; j < k; j++) {
adj[i].push_back((i + j) % r.size());
}
}
}
}
int compare_plants(int x, int y) {
{
set<int> visited;
stack<int> q;
q.push(x);
while (!q.empty()) {
auto curr = q.top(); q.pop();
if (visited.count(curr)) continue;
if (curr == y) return 1;
visited.insert(curr);
for (auto n: adj[curr]) {
q.push(n);
}
}
}
{
set<int> visited;
stack<int> q;
q.push(y);
while (!q.empty()) {
auto curr = q.top(); q.pop();
if (visited.count(curr)) continue;
if (curr == x) return -1;
visited.insert(curr);
for (auto n: adj[curr]) {
q.push(n);
}
}
}
return 0;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |