| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 618196 | penguinhacker | Super Dango Maker (JOI22_dango3) | C++17 | 333 ms | 524 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;
mt19937 rng(42);
void Solve(int n, int m) {
	vector<bool> vis(n*m+1);
	for (int rep=0; rep<m; ++rep) {
		vector<int> v;
		for (int i=1; i<=n*m; ++i)
			if (!vis[i])
				v.push_back(i);
		while(1) {
			shuffle(v.begin(), v.end(), rng);
			int s=min((int)v.size(), 1900);
			vector<int> v2(v.begin(), v.begin()+s);
			if (Query(v2)) {
				v=v2;
				break;
			}
		}
		while(v.size()>n) {
			int x=v.back();
			v.pop_back();
			if (!Query(v))
				v.insert(v.begin(), x);
		}
		Answer(v);
		for (int i : v)
			vis[i]=1;
	}
}
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... | ||||
