Submission #1142181

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142181		denislav	Super Dango Maker (JOI22_dango3)	C++20	7 / 100	243 ms	628 KiB

dango3

#include "dango3.h"
//#include "grader.cpp"
#include <iostream>
#include <vector>
using namespace std;

const int MAX=1e6+11;
bool vis[MAX];

void Solve(int N, int M)
{
    int n=N,m=M;
    for(int t=1;t<=m;t++)
    {
        vector<int> v,ans;
        for(int i=1;i<=n*m;i++) if(!vis[i]) v.push_back(i);

        //int last_resp=m-t+1;
        while(true)
        {
            int bk=v.back();
            v.pop_back();

            int resp=Query(v);
            //if(resp<last_resp)
            if(resp==0)
            {
                vis[bk]=1;
                v.insert(v.begin(),bk);
                ans.push_back(bk);
                if((int)ans.size()==n)
                {
                    Answer(ans);
                    break;
                }
            }

            //last_resp=resp;
        }
    }
}

/*
3 2
3 3 1 2 1 2
*/


/*
4 4
2 2 3 2 4 4 3 2 3 1 1 3 4 1 4 1
*/

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