# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
964406 | 2024-04-16T19:26:01 Z | marinaluca | Super Dango Maker (JOI22_dango3) | C++17 | 0 ms | 0 KB |
#include "dango3.h" #include <bits/stdc++.h> using namespace std; namespace{ void solve (vector <int> ans, int x){ if (x == 1){ Answer(ans); return; } int mijl = x / 2; vector <int> rez; for (int i = ans.size(); -- i){ swap (ans[i], ans.back()); int y = ans.back(); ans.pop_back(); if (Query(ans) < mijl) ans.push_back(y); else rez.push_back(y); } solve (ans, mijl); solve(rez, x - mijl); } } 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; } **/