# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1234837 | Aisha | Mouse (info1cup19_mouse) | C++20 | 50 ms | 416 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);
do {
int cnt = query(q);
if (cnt == n) return;
} while (next_permutation(q.begin(), q.end()));
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |