# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951541 | pcc | Super Dango Maker (JOI22_dango3) | C++17 | 1 ms | 600 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>
#include <vector>
using namespace std;
namespace {
int variable_example = 1;
const int mxn = 20;
bitset<mxn> vis;
} // namespace
/*
std::vector<int> x(3);
x[0] = 1;
x[1] = 2;
x[2] = 3;
variable_example = Query(x);
for (int i = 0; i < M; i++) {
std::vector<int> a(N);
for (int j = 0; j < N; j++) {
a[j] = N * i + j + 1;
}
Answer(a);
}
*/
void Solve(int N, int M) {
for(int i = 0;i<(1<<(N*M));i++){
if(__builtin_popcount(i) != N)continue;
vector<int> v;
for(int j = 0;j<N*M;j++){
if(i&(1<<j))v.push_back(j+1);
}
bool flag = true;
for(auto &j:v){
if(vis[j])flag = false;
}
if(!flag)continue;
if(Query(v) >= 1){
for(auto &j:v)vis[j] = true;
Answer(v);
}
}
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... |