# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
952024 | 2024-03-23T03:52:07 Z | goodspeed0208 | Super Dango Maker (JOI22_dango3) | C++17 | 436 ms | 608 KB |
#include "dango3.h" #include<bits/stdc++.h> #include <vector> using namespace std; namespace { int variable_example = 1; } // namespace void Solve(int n, int m) { vector<int>used(n*m+1, 0); for (int k = 1 ; k <= m ; k++) { vector<int>v; vector<int>ans; for (int i = 1 ; i <= n*m ; i++) if (!used[i]) v.push_back(i); int num = 0; for (int i = 1 ; i <= n*m ; i++) { if (used[i]) continue; v.erase(find(v.begin(), v.end(), i)); //cout << i <<"\n"; int q = Query(v); if (q == m-k) { ans.push_back(i); used[i] = 1; } else { v.push_back(i); } if (ans.size() == n) break; } Answer(ans); } } //g++ -std=gnu++14 -O2 -o grader grader.cpp dango3.cpp
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 344 KB | Output is correct |
2 | Correct | 3 ms | 348 KB | Output is correct |
3 | Correct | 7 ms | 500 KB | Output is correct |
4 | Correct | 8 ms | 436 KB | Output is correct |
5 | Correct | 2 ms | 344 KB | Output is correct |
6 | Correct | 2 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 124 ms | 604 KB | Output is correct |
2 | Correct | 278 ms | 608 KB | Output is correct |
3 | Incorrect | 431 ms | 600 KB | Wrong Answer [3] |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 436 ms | 604 KB | Wrong Answer [3] |
2 | Halted | 0 ms | 0 KB | - |