# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710669 | alvingogo | Super Dango Maker (JOI22_dango3) | C++17 | 2713 ms | 620 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 <bits/stdc++.h>
#include "dango3.h"
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
mt19937 rnd(time(NULL));
void Solve(int n,int m){
n*=m;
vector<int> v(n);
iota(v.begin(),v.end(),1);
vector<int> vis(n+1);
auto check=[&](){
vector<int> zz;
for(int i=1;i<=n;i++){
if(!vis[i]){
zz.push_back(i);
}
}
return Query(zz);
};
int uu=n/m;
while(m--){
shuffle(v.begin(),v.end(),rnd);
vector<int> ans;
int cnt=0;
for(int j=0;j<v.size();j++){
if(!vis[v[j]]){
vis[v[j]]=1;
if(check()!=m-1){
cnt++;
ans.push_back(v[j]);
if(cnt==uu){
break;
}
}
else{
vis[v[j]]=0;
}
}
}
Answer(ans);
vector<int> l;
for(int j=1;j<=n;j++){
if(!vis[j]){
l.push_back(j);
}
}
}
}
/*
g++ -std=gnu++17 -O2 -o grader grader.cpp temp6.cpp
.\grader.exe
*/
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... |