Submission #1285257

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285257		goulthen	Permutation Game (APIO25_permgame)	C++20	0 / 100	1 ms	356 KiB

permgame

#include "permgame.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i = a; i <= b; ++i)
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>

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

    while(1){
        vector<int> t(m);
        bool ok = 1;
        rep(i,0,n-1) {
            if(p[p[i]] == i) continue;
            ok=0;
            t[0] = i;
            t[1] = p[i];
            t[2] = p[p[i]];
        }
        if(ok)break;

        int k = Bob(t);
        swap(p[t[u[k]]], p[t[v[k]]]);
    }

    cnt = 0;
    rep(i,0,n-1) if (p[i]==i) cnt++;

    return cnt;

}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 24
• Subtask 5: 0 / 24
• Subtask 6: 0 / 30