Submission #734151

#TimeUsernameProblemLanguageResultExecution timeMemory
734151QwertyPiSuper Dango Maker (JOI22_dango3)C++17
100 / 100
1221 ms872 KiB
#include "dango3.h" #include <bits/stdc++.h> using namespace std; void divide(int N, int M, vector<int> a){ if(M == 1){ Answer(a); return; } int L = M / 2; vector<bool> used(N * M, true); for(int i = 0; i < N * M; i++){ used[i] = false; vector<int> qry; for(int j = 0; j < N * M; j++){ if(used[j]) qry.push_back(a[j]); } int res = Query(qry); if(res < L) used[i] = true; } vector<int> al, ar; for(int i = 0; i < N * M; i++){ if(used[i]){ al.push_back(a[i]); }else{ ar.push_back(a[i]); } } divide(N, L, al); divide(N, M - L, ar); } void Solve(int N, int M) { vector<int> C; for(int i = 1; i <= N * M; i++){ C.push_back(i); } divide(N, M, C); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...