# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990736 | 2024-05-31T06:55:50 Z | snpmrnhlol | Super Dango Maker (JOI22_dango3) | C++17 | 403 ms | 600 KB |
#include "dango3.h" #include <bits/stdc++.h> using namespace std; const int N = 400; const int M = 25; bool vis[N*M]; vector <int> ans; void Solve(int n, int m){ vector <int> v; vector <int> bucket[n]; for(int j = 0;j < n;j++){ v.clear(); for(int i = 0;i < n*m;i++){ if(vis[i])v.push_back(i + 1); } for(int i = 0;i < n*m;i++){ if(vis[i])continue; v.push_back(i + 1); if(Query(v) > 0){ v.pop_back(); bucket[j].push_back(i); vis[i] = 1; } if(bucket[j].size() >= m)break; } } for(int i = 0;i < m;i++){ ans.clear(); for(int j = 0;j < n;j++){ ans.push_back(bucket[j].back() + 1); bucket[j].pop_back(); } Answer(ans); } } /** 3 2 3 3 1 2 1 2 **/
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 62 ms | 348 KB | Output is correct |
2 | Correct | 61 ms | 348 KB | Output is correct |
3 | Correct | 58 ms | 344 KB | Output is correct |
4 | Correct | 57 ms | 344 KB | Output is correct |
5 | Incorrect | 56 ms | 344 KB | Wrong Answer [3] |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 204 ms | 576 KB | Wrong Answer [3] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 403 ms | 600 KB | Wrong Answer [3] |
2 | Halted | 0 ms | 0 KB | - |