# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892651 | iskhakkutbilim | Super Dango Maker (JOI22_dango3) | C++17 | 397 ms | 676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int n, int m){
vector<int> used(n * m + 1, 0);
vector<vector<int> > ans(n);
vector<int> asking;
for(int i = 0;i < n; i++){
vector<int> idx = asking;
for(int j = 1;j <= n * m; j++){
if(used[j]) continue;
idx.push_back(j);
int cnt = Query(idx);
if(cnt == 1){
ans[i].push_back(j);
used[j] = 1;
idx.pop_back();
}
}
for(int el : ans[i]){
asking.push_back(el);
}
}
vector<vector<int> > vec(m);
for(int i = 0;i < n; i++){
int cur = 0;
if(ans[i].size() != m) assert(false);
for(int j : ans[i]){
vec[cur++].push_back(j);
}
}
for(int i = 0;i < m; i++) Answer(vec[i]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |