Submission #892629

#	Time	Username	Problem	Language	Result	Execution time	Memory
892629		Minbaev	Super Dango Maker (JOI22_dango3)	C++17	100 / 100	347 ms	848 KiB

dango3

#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
const int mod= 1e9 +7;
const int N=1e5*4;


void Solve(int n,int m){
	
	vector<int>v(n*m);
	
	iota(all(v),1);
	
	queue<pair<vector<int>,int>>q;
	
	q.push({v,m});
	
	while(!q.empty()){
		auto [g,sz] = q.front();
		q.pop();
		int pl = g.size();
		if(sz==1){
			Answer(g);
			continue;
		}
		vector<int>vs;
		for(int i = 0;i<pl;i++){
			vs.pb(g[0]);
			g.erase(g.begin());
			int x = Query(g);
			if(x<sz/2){
				g.pb(vs.back());
				vs.pop_back();
			}	
		}
		q.push({g,sz/2});
		q.push({vs,sz-sz/2});
	}
}

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