제출 #1204984

#제출 시각아이디문제언어결과실행 시간메모리
1204984avighnaPermutation Game (APIO25_permgame)C++20
12 / 100
1 ms328 KiB
#include <bits/stdc++.h> int Bob(std::vector<int> t); int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) { if (m == 2) { while (true) { int idx = -1; for (int i = 0; i < n; ++i) { if (i != p[i]) { idx = i; } } if (idx == -1) { break; } // swap idx with p[idx] std::vector<int> t = {idx, p[idx]}; int j = Bob(t); std::swap(p[t[u[j]]], p[t[v[j]]]); } return n; } int ans = 0; for (int i = 0; i < n; ++i) { ans += p[i] == i; } return ans; }
#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...