# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892501 | Aiperiii | Super Dango Maker (JOI22_dango3) | C++17 | 460 ms | 852 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){
queue < pair <vector <int> ,int> > q;
vector <int> in;
vector <vector <int> > ans;
for(int i=1;i<=n*m;i++){
in.push_back(i);
}
q.push({in,m});
while(!q.empty()){
vector <int> v=q.front().first;
int k=q.front().second/2;
q.pop();
if(k==0){
ans.push_back(v);
continue;
}
vector <int> used(v.size());
for(int i=0;i<v.size();i++){
used[i]=1;
vector <int> x;
for(int j=0;j<v.size();j++){
if(!used[j])x.push_back(v[j]);
}
if(Query(x)<k)used[i]=0;
}
vector <int> g1,g2;
for(int i=0;i<v.size();i++){
if(used[i])g1.push_back(v[i]);
else g2.push_back(v[i]);
}
q.push({g1,k});
q.push({g2,k});
}
for(auto x : ans){
Answer(x);
}
return;
}
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... |