Submission #1164878

#TimeUsernameProblemLanguageResultExecution timeMemory
1164878mychecksedadSuper Dango Maker (JOI22_dango3)C++20
7 / 100
316 ms616 KiB
#include "dango3.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>

namespace {

int variable_example = 1;

}  // namespace

void Solve(int n, int m) {
  vector<int> v;
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < m; ++j) v.pb(i*m + j + 1);
  }
  int cur = m;
  while(cur > 0){
    vector<int> V(all(v));
    vi res;
    res.pb(v.back());
    V.pop_back();
    while(res.size() < n){
      int bb = V.back();
      V.pop_back();
      if(Query(V) == cur - 1){
        res.pb(bb);
      }else{
        V.insert(V.begin(), bb);
      }
    }
    Answer(res);
    v.swap(V);
    --cur;
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...