# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551735 | kshitij_sodani | Super Dango Maker (JOI22_dango3) | C++17 | 4246 ms | 912 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>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
#define endl '\n'
#include "dango3.h"
namespace {
int variable_example = 1;
}
vector<int> pre[30];
int vis[100001];
int ind[100001];
void Solve(int n,int m){
for(int i=1;i<=n*m;i++){
int low=0;
for(int j=19;j>=0;j--){
if(low+(1<<j)<=m){
vector<int> cur;
for(int ii=1;ii<=n*m;ii++){
if(ii==i){
continue;
}
if(ii<i){
if(ind[ii]==(low+(1<<j))){
continue;
}
}
cur.pb(ii);
}
if(Query(cur)==m-1){
}
else{
low+=(1<<j);
}
}
}
pre[low+1].pb(i);
//cout<<i<<":"<<low+1<<endl;
ind[i]=low+1;
}
for(int j=1;j<=m;j++){
Answer(pre[j]);
}
}
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... |