제출 #1234862

#제출 시각아이디문제언어결과실행 시간메모리
1234862AishaMouse (info1cup19_mouse)C++20
0 / 100
0 ms416 KiB
#include "grader.h" #include "bits/stdc++.h" using namespace std; void solve(int n) { vector <int> q; for (int i = 1; i <= n; i ++) q.push_back(i); int cnt = query(q); for (int i = 1; i <= n; i ++) { for (int j = 1; j <= n; j ++) { if (i == j) continue; swap(q[i], q[j]); int c = query(q); if (c == n) return; if (c > cnt) continue; else swap(q[i], q[j]); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...