#include <bits/stdc++.h>
int Bob(std::vector<int> t);
int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) {
if (m == 2) {
while (true) {
int idx = -1;
for (int i = 0; i < n; ++i) {
if (i != p[i]) {
idx = i;
}
}
if (idx == -1) {
break;
}
// swap idx with p[idx]
std::vector<int> t = {idx, p[idx]};
int j = Bob(t);
std::swap(p[t[u[j]]], p[t[v[j]]]);
}
return n;
}
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += p[i] == i;
}
return ans;
}
# | 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... |