제출 #549950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
549950		MilosMilutinovic	Super Dango Maker (JOI22_dango3)	C++17	100 / 100	9514 ms	976 KiB

dango3

#include "dango3.h"
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;

int n, m;
vector<int> ans[25];

int ask(vector<int> v)
{
	set<int> st;
	for (int i : v) st.insert(i);
	vector<int> vec;
	rep1(i, n * m) if (st.find(i) == st.end()) vec.push_back(i);
	return Query(vec);
}

void Solve(int n, int m)
{
	::n = n, ::m = m;
	rep1(i, n * m) {
		int l = 0, r = m - 1;
		while (l < r) {
			int mid = (l + r) / 2;
			vector<int> vec = ans[mid];
			vec.push_back(i);
			if (ask(vec) == m - 1) r = mid; else l = mid + 1;
		}
		ans[l].push_back(i);
	}
	rep(i, m) Answer(ans[i]);
}

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