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){
int taked[n*m+1] = {0};
for(int i = 0;i<m;i++){
vector<int> lol;
for(int j = 1;j<=n*m;j++){
if(taked[j]==0){
lol.push_back(j);
}
}
vector<int> ans;
int mi = lol.size()-1;
for(int j = 1;j<=n;j++){
int l = 0 , r = mi , an = 0;
while(l<=r){
int mid = (l+r)/2;
vector<int> ex;
for(auto i:ans)ex.push_back(i);
for(int j = 0;j<=mid;j++){
ex.push_back(lol[j]);
}
if(Query(ex)>=1){
an = mid;
r = mid-1;
}else l = mid+1;
}
mi = min(mi,an-1);
ans.push_back(lol[an]);
}
for(auto i:ans)taked[i] = 1;
Answer(ans);
}
}
# | 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... |