Submission #1207123

#TimeUsernameProblemLanguageResultExecution timeMemory
1207123LudisseyPermutation Game (APIO25_permgame)C++20
24 / 100
2 ms328 KiB
#include "permgame.h" #include <bits/stdc++.h> #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() using namespace std; int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) { std::vector<int> t(m); bool b=true; int c=0; vector<int> vt(n,0); for (int i = 0; i < n; i++) { int x=i; if(vt[x]) continue; vector<int> q; while(!vt[x]){ vt[x]=true; q.push_back(x); x=p[x]; } if(sz(q)%2!=0){ c++; } } while(b){ b=false; for (int i = 0; i < n; i++) { int x=i; vector<int> q; vector<int> visited(n,0); while(!visited[x]&&sz(q)<3){ visited[x]=true; q.push_back(x); x=p[x]; } if(sz(q)==3){ int j=Bob(q); swap(p[q[u[j]]],p[q[v[j]]]); b=true; break; } } } int sc=0; for (int i = 0; i < n; i++) sc+=(i==p[i]); return c; }
#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...