제출 #1158128

#제출 시각아이디문제언어결과실행 시간메모리
1158128domblySuper Dango Maker (JOI22_dango3)C++20
100 / 100
5323 ms760 KiB
#include "dango3.h" #include <bits/stdc++.h> using namespace std; namespace { int variable_example = 1; } // namespace vector<int>res[26]; void Solve(int N, int M) { for(int i = 1; i <= N * M; i++) { int l = 1,r = 25,ans = -1; while(l <= r) { int mid = l + r >> 1; vector<int>vec = res[mid]; vec.push_back(i); set<int>st; for(int j : vec) st.insert(j); vector<int>ask; for(int j = 1; j <= N * M; j++) if(st.find(j) == st.end()) ask.push_back(j); if(Query(ask) == M - 1) { ans = mid; r = mid - 1; }else { l = mid + 1; } } assert(ans != -1); res[ans].push_back(i); } for(int i = 1; i <= M; i++) Answer(res[i]); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...