Submission #988650

#	Time	Username	Problem	Language	Result	Execution time	Memory
988650		toan2602	Super Dango Maker (JOI22_dango3)	C++17	100 / 100	1943 ms	884 KiB

dango3

#include<bits/stdc++.h>
#include "dango3.h"

using namespace std;

vector<int> ans, v2, x;
bool mark[100005];
vector<int> dango[100];

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++) mark[j] = true;
            for (int i = 0; i <= mid; i++) {
                for (int j: dango[i]) mark[j] = false;
            }
            mark[i] = false;
            x.clear();
            for (int j = 1; j <= n * m; j++) if(mark[j]) x.push_back(j);
            int dm = Query(x);
            if(dm == 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