Submission #892650

#TimeUsernameProblemLanguageResultExecution timeMemory
892650vjudge1Super Dango Maker (JOI22_dango3)C++17
100 / 100
265 ms612 KiB
/* This code was written by Abush, who read this code, he is a "krasavshik". author : abushbandit1 platform : vjudge contest : IZHO prep 2023 (contest #6) problem : C (Super Dango Maker) "https://oj.uz/problem/view/JOI22_dango3". */ #include "dango3.h" #include <bits/stdc++.h> #define pb push_back #define ff first #define ss second #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() using namespace std; void rec(vector<int> &v, int m){ if(m == 1){ Answer(v); return; } vector<int> nv; int sz = v.size(); for(int i = 0; i < sz; i++){ nv.pb(v[0]); v.erase(v.begin()); int x = Query(v); if(x < m / 2){ v.pb(nv.back()); nv.pop_back(); } } rec(v, m / 2); rec(nv, m - m / 2); } void Solve(int n, int m) { vector<int> a; for(int i = 1; i <= n * m; i++) a.pb(i); rec(a, m); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...