| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1291362 | LolkasMeep | Permutation Game (APIO25_permgame) | C++20 | 0 ms | 0 KiB |
#include "permgame.h"
#include "bits/stdc++.h"
using namespace std;
int Alice(int m, int e, vector<int> u, vector<int> v, int n, vector<int> p) {
ll score = 0;
for(ll i = 0; i < m; i++){
if(i == p[i]) score++;
}
return score;
vector<int> t(m);
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;
}
