제출 #1285218

#제출 시각아이디문제언어결과실행 시간메모리
1285218goulthenPermutation Game (APIO25_permgame)C++20
12 / 100
2 ms348 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) { int cnt = 0; rep(i,0,n-1) if (p[i]==i) cnt++; if(m > 2) return cnt; vector<int> inv(n); rep(i,0,n-1) inv[p[i]] = i; rep(i,0,n-1) { if(p[i] == i) continue; vector<int> t = {i,inv[i]}; int j = Bob(t); swap(inv[p[t[u[j]]]], inv[p[t[v[j]]]]); swap(p[t[u[j]]], p[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...