# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1221815 | brinton | Permutation Game (APIO25_permgame) | C++20 | 1 ms | 328 KiB |
#include "permgame.h"
#include <bits/stdc++.h>
using namespace std;
/*
m: vertices in u,v
e: edges in u,v
n: permutation length;
*/
int Alice(int m, int e, vector<int> u, vector<int> v, int N, vector<int> p) {
int already = 0;
int ans;
for(int i = 0;i < N;i++) if(p[i]==i) already++;
if(e > m) {
return already;
}else if(e == m-1){
set<int> s;
for(int i = 0;i < N;i++) if(p[i] != i) s.insert(i);
while(s.size() >= m){
vector<int> t(s.begin(),next(s.begin(),m));
int j = Bob(t);
swap(p[t[u[j]]], p[t[v[j]]]);
}
return N-m;
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |