# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568774 | dantoh000 | Super Dango Maker (JOI22_dango3) | C++17 | 1815 ms | 1172 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;
int vis[10005];
int N;
int M;
void solve(vector<int> v){
/*printf("solving: ");
for (auto x : v) printf("%d ",x);
printf("\n");*/
int k = v.size()/N;
if (k == 1){
Answer(v);
return;
}
int target = k/2;
int l = 1, r = v.size();
while (l < r){
int m = (l+r)/2;
vector<int> query = vector<int>(v.begin(), v.begin()+m);
/*for (auto x : query) printf("%d ",x);
printf("\n");*/
int res = Query(query);
if (res >= target) r = m;
else l = m+1;
}
set<int> K = set<int>(v.begin(), v.begin()+l);
vector<int> L;
vector<int> R;
for (int i = 0; i < l; i++){
K.erase(v[i]);
vector<int> q;
for (auto x : K) q.push_back(x);
if (Query(q) == target){
R.push_back(v[i]);
}
else {L.push_back(v[i]); K.insert(v[i]);}
}
for (int i = l; i < v.size(); i++) R.push_back(v[i]);
solve(L);
solve(R);
}
void Solve(int _N, int _M) {
N = _N, M = _M;
vector<int> v(N*M);
iota(v.begin(),v.end(),1);
solve(v);
}
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... |