Submission #1266530

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266530		abdelhakim	Permutation Game (APIO25_permgame)	C++20	6 / 100	1432 ms	1114112 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]]]);

vector<bool> vis;
void dfs(ll node, vector<int>& g, vector<int>& p, ll first)
{
    if(vis[node]) return;
    vis[node]=true;
    g.push_back(node);
    dfs(p[node],g,p,first);
}
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);
    vis.assign(n,0);
    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;
        }
    }
   
    for (int i=0;i<n;i++)
    {
        if(p[i]!=i && !vis[i])
        {
            vector<int> g;
            for (int j=i;1;j=p[j])
            {
                vis[j]=1;
                g.push_back(j);
                if(p[j]==i)
                {
                    break;
                }
            }
            if(g.size()%2) 
            {
                curans++;
                while(g.size()>2)
                {
                vector<int> t={g[0],g[1],g[2]};
                int j = Bob(t);
                std::swap(p[t[u[j]]], p[t[v[j]]]);
                if(abs(u[j]-v[j])==1)break;
                g.clear();
                for (int j=t.back();1;j=p[j])
                {
                    g.push_back(j);
                    if(p[j]==i)
                    {
                        break;
                    }
                }
                }

            }
        }
}
   
    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