# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1204883 | hackstar | Permutation Game (APIO25_permgame) | C++20 | 2094 ms | 328 KiB |
#include "permgame.h"
#include <vector>
#include <utility>
#include<bits/stdc++.h>
using namespace std;
int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) {
auto calc=[&]()->int{
int cur=0;
for(int i=0;i<n;i++){
cur+=(p[i]==i);
}
return cur;
};
while(calc()!=n){
for(int i=0;i<n;i++){
if(p[i]!=i){
vector<int>t={i,p[i]};
int id=Bob(t);
swap(p[t[u[i]]],p[t[v[i]]]);
}
}
}
calc();
}
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... |