| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 940679 | velislavgarkov | Super Dango Maker (JOI22_dango3) | C++17 | 208 ms | 1000 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MAXN=1e4+10;
bool used[MAXN];
vector <int> solve(vector <int> a, int n, int m) {
if (a.size()==n) {
Answer(a);
return {};
}
if (m>1) {
vector <int> q, s1;
int l, r, mid, gr=m/2;
l=gr*n-1; r=a.size()-1;
while (l<r) {
mid=(l+r)/2;
if (!q.empty()) q.clear();
for (int i=0;i<=mid;i++) q.push_back(a[i]);
if (Query(q)<gr) l=mid+1;
else r=mid;
}
for (int i=0;i<=l;i++) s1.push_back(a[i]);
if (!q.empty()) q.clear();
q=solve(s1,n,gr);
s1.clear();
for (int i=l+1;i<a.size();i++) s1.push_back(a[i]);
for (auto i:q) s1.push_back(i);
return solve(s1,n,m-gr);
}
vector <int> cur_ans, q;
for (auto i:a) cur_ans.push_back(i);
for (int i=0;i<a.size();i++) {
if (cur_ans.size()==n) break;
cur_ans.erase(cur_ans.begin());
if (Query(cur_ans)==0) cur_ans.push_back(a[i]);
else q.push_back(a[i]);
}
Answer(cur_ans);
return q;
}
void Solve(int N, int M) {
int n, m;
n=N; m=M;
vector <int> a;
for (int i=1;i<=n*m;i++) a.push_back(i);
//random_shuffle(a.begin(),a.end());
solve(a,n,m);
}
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... | ||||
