제출 #971683

#제출 시각아이디문제언어결과실행 시간메모리
97168312345678Super Dango Maker (JOI22_dango3)C++17
7 / 100
2094 ms700 KiB
#include "dango3.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e4+5;

int used[nx], n, m;

int query()
{
    vector<int> qrs;
    for (int i=1; i<=n*m; i++) if (!used[i]) qrs.push_back(i);
    return Query(qrs);
}

void Solve(int N, int M) {
    n=N, m=M;
    for (int i=M; i>=1; i--)
    {
        vector<int> res;
        for (int j=1; j<=N*M; j++)
        {
            if (used[j]) continue;
            used[j]=1;
            if (query()==i-1) res.push_back(j);
            else used[j]=0;
        }
        Answer(res);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...