# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
952055 | 2024-03-23T04:50:50 Z | goodspeed0208 | Super Dango Maker (JOI22_dango3) | C++17 | 34 ms | 1104 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) { srand(time(NULL)); vector<int>rd(n*m+1); for (int i = 0 ; i <= n*m ; i++) rd[i] = i; random_shuffle(rd.begin()+1, rd.end()); 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[rd[i]]) v.push_back(rd[i]); int num = 0; for (int i = 1 ; i <= n*m ; i++) { if (used[rd[i]]) continue; v.erase(find(v.begin(), v.end(), rd[i])); // cout << rd[i] <<"\n"; int q = Query(v); num++; if (q == m-k) { ans.push_back(rd[i]); used[rd[i]] = 1; } else { v.push_back(rd[i]); } if (ans.size() == n) break; } assert(num <= n*5); Answer(ans); } } //g++ -std=gnu++14 -O2 -o grader grader.cpp dango3.cpp
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 360 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 344 KB | Output is correct |
2 | Runtime error | 3 ms | 604 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 10 ms | 860 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 34 ms | 1104 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |