Submission #1285213

#TimeUsernameProblemLanguageResultExecution timeMemory
1285213goulthenPermutation Game (APIO25_permgame)C++20
0 / 100
2 ms344 KiB
#include "permgame.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i = a; i <= b; ++i)

int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) {
    vector<int> inv(n);
    rep(i,0,n-1) inv[p[i]] = i;
    rep(i,1,n-1) {
        if(p[i] == i) continue;

        vector<int> t = {i,inv[i]};
        int j = Bob(t);
        swap(p[t[u[j]]], p[t[v[j]]]);
        swap(inv[t[u[j]]], inv[t[v[j]]]);
    }

    return n;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...