Submission #892658

#	Time	Username	Problem	Language	Result	Execution time	Memory
892658		iskhakkutbilim	Super Dango Maker (JOI22_dango3)	C++17	100 / 100	265 ms	784 KiB

dango3

#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;


vector< vector<int> > dnq(vector<int> idx, int need){
	
	if(need == 1){
		vector< vector<int> > res(1);
		res[0] = idx;
		return res;
	}
	vector<int> n1 = idx, n2;
	for(int i : idx){
		n2.push_back(i);
		n1.erase(n1.begin());
		int cnt = Query(n1);
		if(cnt < need / 2){
			n1.push_back(n2.back());
			n2.pop_back();
		}
	}
	vector<vector<int> > v1 = dnq(n1, need / 2), v2 =dnq(n2, need - need / 2);
	vector< vector<int> > res =v1;
	for(auto i : v2) res.push_back(i);
	return res;
	
}



void Solve(int n, int m){
	vector<int> all;
	for(int i = 1;i <= n * m; i++) all.push_back(i);
	vector<vector<int> > vec = dnq(all, m);
	for(int i = 0;i < m; i++) Answer(vec[i]);
}

• Subtask 1: 2 / 2
• Subtask 2: 5 / 5
• Subtask 3: 15 / 15
• Subtask 4: 78 / 78