| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 964420 | marinaluca | Super Dango Maker (JOI22_dango3) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
namespace{
  
void Solve (vector <int> v, int x){
    if (x == 1){
        Answer(v);
        return;
    }
    int mijl = x / 2;
    vector <int> rez;
    for (int i = v.size(); -- i;){
        swap (v[i], v.back());
        int y = v.back();
        v.pop_back();
        if (Query(v) < mijl)
            v.push_back(y);
        else
            rez.push_back(y);
    }
    Solve (v, mijl);
    Solve(rez, mijl - x);
}
}
 
void solve (int N, int M){
    vector <int> v;
    for (int i = 0; i < N * M; ++ i){
        v.push_back(i + 1);
    }
    Solve(v, M);
}
/**
signed main(void){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    return 0 ^ 0;
}
**/
