Submission #1186864

#	Time	Username	Problem	Language	Result	Execution time	Memory
1186864		epicci23	Super Dango Maker (JOI22_dango3)	C++20	7 / 100	768 ms	1148 KiB

dango3

#include "bits/stdc++.h"
#include "dango3.h"
#define all(v) v.begin() , v.end()
#define sz(a) (int) a.size()
using namespace std;

int n, m;

void DFS(vector<int> Candidate){

  if(sz(Candidate) == n){
  	Answer(Candidate);
  	return;
  }

  m = sz(Candidate) / n;
  
  vector<int> Must, Remaining;

  for(int i = sz(Candidate) - 1; i >= 0; i--){
    int wait = Candidate.back();
    Candidate.pop_back();

    int xd = sz(Must) * (m - 1);
    int lol = sz(Remaining) - xd;

    if(lol < m - 1){
      Remaining.push_back(wait);
      continue;
    }

    vector<int> cur;

    for(int u : Candidate) cur.push_back(u);
    for(int u : Must) cur.push_back(u);

    int val = Query(cur);
    if(val >= 1) Remaining.push_back(wait);
    else Must.push_back(wait);
  }  

  Answer(Must);
  DFS(Remaining);
}


void Solve(int _n, int _m){
  n = _n, m = _m;
  vector<int> v;
  for(int i=1;i<=n*m;i++) v.push_back(i);
  DFS(v);
}

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