# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
704949 | 2023-03-03T07:09:16 Z | piOOE | Super Dango Maker (JOI22_dango3) | C++17 | 1374 ms | 588 KB |
#include "dango3.h" #include <bits/stdc++.h> using namespace std; void Solve(int n, int m) { const int N = n * m; vector<int> ord(N); iota(ord.begin(), ord.end(), 1); deque<int> st(ord.begin(), ord.end()); while (st.size() > n) { vector<int> now; int full = st.size() / n; while (now.size() < n) { int x = st.front(); st.pop_front(); if (Query(vector(st.begin(), st.end())) == full - 1) { now.push_back(x); continue; } else { st.push_back(x); } } Answer(now); } Answer(vector(st.begin(), st.end())); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 368 KB | Output is correct |
2 | Correct | 11 ms | 368 KB | Output is correct |
3 | Correct | 13 ms | 340 KB | Output is correct |
4 | Correct | 19 ms | 368 KB | Output is correct |
5 | Correct | 4 ms | 340 KB | Output is correct |
6 | Correct | 4 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 337 ms | 416 KB | Output is correct |
2 | Correct | 309 ms | 416 KB | Output is correct |
3 | Incorrect | 977 ms | 468 KB | Wrong Answer [3] |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1374 ms | 588 KB | Wrong Answer [3] |
2 | Halted | 0 ms | 0 KB | - |