Submission #1216813

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216813		cowwycow	Super Dango Maker (JOI22_dango3)	C++20	100 / 100	1652 ms	1000 KiB

dango3

#include <bits/stdc++.h>
#include "dango3.h"
using namespace std;
#define name "aaaaaa"
#define fi first
#define se second
using ll = long long;
using db = double;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ppii = pair<int, pii>;

const int N = 405, M = 30, K = N * M;

bool a[K];
vector<int> dango[K];

void Solve(int n, int m){
	for(int i = 1; i <= n * m; i++){
		int l = -1, r = m - 1, mid;
		while(l + 1 < r){
			mid = (l + r) / 2;

			for(int j = 1; j <= n * m; j++){
				a[j] = true;
			}
			for(int j = 0; j <= mid; j++){
				for(int k : dango[j]){
					a[k] = false;
				}
			}
			a[i] = false;

			vector<int> v;
			for(int j = 1; j <= n * m; j++){
				if(a[j]) v.push_back(j);
			}

			if(Query(v) == m - mid - 2){
				l = mid;
			}else{
				r = mid;
			}
		}
		dango[r].push_back(i);
	}
	for(int i = 0; i < m; i++){
		Answer(dango[i]);
	}
}

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