# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952031 | 2024-03-23T03:58:53 Z | goodspeed0208 | Super Dango Maker (JOI22_dango3) | C++17 | 467 ms | 684 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); if (q == m-k) { ans.push_back(rd[i]); used[rd[i]] = 1; } else { v.push_back(rd[i]); } if (ans.size() == n) break; } Answer(ans); } } //g++ -std=gnu++14 -O2 -o grader grader.cpp dango3.cpp
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 344 KB | Output is correct |
2 | Correct | 3 ms | 500 KB | Output is correct |
3 | Correct | 4 ms | 348 KB | Output is correct |
4 | Correct | 3 ms | 512 KB | Output is correct |
5 | Correct | 3 ms | 348 KB | Output is correct |
6 | Correct | 4 ms | 504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 113 ms | 580 KB | Output is correct |
2 | Correct | 113 ms | 600 KB | Output is correct |
3 | Correct | 123 ms | 604 KB | Output is correct |
4 | Correct | 102 ms | 600 KB | Output is correct |
5 | Correct | 113 ms | 604 KB | Output is correct |
6 | Correct | 114 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 467 ms | 684 KB | Wrong Answer [3] |
2 | Halted | 0 ms | 0 KB | - |