Submission #892570

#TimeUsernameProblemLanguageResultExecution timeMemory
892570vjudge1Super Dango Maker (JOI22_dango3)C++17
0 / 100
79 ms608 KiB
#include "dango3.h" #include <vector> #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> new_v; for(int i = 0; i < (int)v.size(); i++){ new_v.pb(*v.begin()); v.erase(v.begin()); int x = Query(v); if(x < m/2){ v.pb(new_v.back()); new_v.pop_back(); } } rec(v, m/2); rec(new_v, 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...