Submission #1266302

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266302		abdelhakim	Permutation Game (APIO25_permgame)	C++20	6 / 100	1 ms	328 KiB

permgame

#include "permgame.h"
#include <vector>
#include <utility>
#include <bits/stdc++.h>
#define dbg(x) cerr << #x << ' ' << x << endl;
#define ll long long
#define inf (ll) 1e17
using namespace std;

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


int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) {
    vector<vector<ll>> adj(m);
    ll curans=0;
    for (int i=0;i<n;i++)
    {
        curans+=p[i]==i;
    }
    for (int i=0;i<e;i++)
    {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
    for (int i=0;i<m;i++)
    {
        if(adj[i].size() > 2)
        {
            return curans;
        }
    }
    while(true)
    {
        vector<int> t;
        for (int i=0;i<n;i++)
        {
            if(p[i]!=i && t.size()<m)
            {
                t.push_back(i);
            }
        }
        if(t.size() < m) break;
        int j = Bob(t);
        std::swap(p[t[u[j]]], p[t[v[j]]]);
    }
    ll cnt=0;
    for (int i=0;i<n;i++)
    {
        cnt+=p[i]==i;
    }
    return cnt;
}

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