| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1359748 | serendipitous | Permutation Game (APIO25_permgame) | C++20 | 1 ms | 348 KiB |
#include <bits/stdc++.h>
#include "permgame.h"
using namespace std;
int Alice(int m, int e, vector<int> u, vector<int> v, int n, vector<int> p) {
vector<int> t(m);
// initial number of 1cycles
int wins = 0;
for(int i = 0; i < n; ++i) {
if(p[i] == i) ++wins;
}
return wins;
// for (int i = 0; i < m; i++){
// t[i] = i;
// }
// int j = Bob(t);
// swap(p[t[u[j]]], p[t[v[j]]]);
// return 42;
}
| # | 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... | ||||
