| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 605555 | MohamedAhmed04 | Super Dango Maker (JOI22_dango3) | C++17 | 0 ms | 0 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 ;
const int MAX = 1e4 + 10 ;
int mark[MAX] ;
int n , m ;
vector<int>ans[30] ;
vector<int>v ;
bool check(int idx , int x)
{
	v.clear() ;
	memset(mark , 0 , sizeof(mark)) ;
	mark[x] = 1 ;
	for(auto &i : ans[idx])
		mark[i] = 1 ;
	vector<int>v ;
	for(int i = 1 ; i <= n*m ; ++i)
	{
		if(!mark[i])
			v.push_back(i) ;
	}
	return (Query(v) == M-2) ;
}
void Solve(int N, int M) 
{
	n = N , m = M ;
	int cnt = 0 ;
	for(int i = 1 ; i <= n*m ; ++i)
	{
		int l = 1 , r = cnt ;
		int last = 0 ;
		while(l <= r)
		{
			int mid = (l + r) >> 1 ;
			if(check(mid , i))
				last = mid , l = mid+1 ;
			else
				r = mid-1 ;
		}
		ans[last+1].push_back(i) ;
		cnt = max(cnt , last+1) ;
	}
	for(int i = 1 ; i <= m ; ++i)
		Answer(ans[i]) ;
}
