제출 #1319628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319628		Muhammad_Aneeq	Super Dango Maker (JOI22_dango3)	C++20	22 / 100	679 ms	788 KiB

dango3

#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int n, int m) 
{
    vector<vector<int>>ans;
    ans.push_back({n*m});
    vector<int>que;
    for (int i=1;i<=n*m-2;i++)
        que.push_back(i);
    int pre=m-1;
    while (que.size())
    {
        int z=Query(que);
        int f=que.back();
        if (z==pre-1)
        {
            ans.push_back({f+1});
            // cout<<1<<' '<<ans.size()<<' '<<f+1<<endl;
            pre=z;
        }
        else
        {
            int st=-1,en=ans.size()-1;
            while (st+1<en)
            {
                int mid=(st+en)/2;
                vector<int>g=que;
                for (int j=0;j<=mid;j++)
                {
                    for (auto k:ans[j])
                        g.push_back(k);
                }
                int f=Query(g);
                if (f==pre+mid+1)
                    st=mid;
                else
                    en=mid;
            }
            // cout<<en<<' '<<f+1<<endl;
            ans[en].push_back(f+1);
        }
        que.pop_back();
    }
    for (auto& i:ans)
    {
        if (i.size()!=n)
            i.push_back(1);
    }
    for (auto i:ans)
        Answer(i);
}

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