제출 #1265066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1265066		tvgk	Super Dango Maker (JOI22_dango3)	C++20	100 / 100	1237 ms	704 KiB

dango3

#include "dango3.h"
#include<bits/stdc++.h>
using namespace std;
#define task "a"
#define se second
#define fi first
#define ll long long
#define ii pair<ll, ll>
const long mxN = 1e4 + 7;

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

int Binary(int mid, int j)
{
    vector<int> ask;
    for (int i = j + 1; i <= n * m; i++)
        ask.push_back(i);

    for (int i = mid + 1; i <= m; i++)
    {
        for (int u : ans[i])
            ask.push_back(u);
    }

    return Query(ask);
}

void Solve(int N, int M)
{
    n = N;
    m = M;

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

            if (Binary(mid, i) < m - mid)
                l = mid + 1;
            else
            {
                res = mid;
                r = mid - 1;
            }
        }
        ans[res].push_back(i);
    }

    for (int i = 1; i <= m; i++)
        Answer(ans[i]);
}

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