# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1262865 | norman165 | Super Dango Maker (JOI22_dango3) | C++20 | 0 ms | 0 KiB |
#include "dango3.h"
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define yes() cout << "YES\n"
#define no() cout << "NO\n"
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int inf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 1e6;
const int mod1 = 998244353;
const int mod2 = 1e18 + 1;
const int mod3 = 1e9 + 9;
const int mod4 = 333333333;
const int mod5 = 200000;
const int mod6 = 10007;
const int k = 3000;
const int w = 1e5;
const ld EPS = 1e-8;
int LOG = 30;
int ask(vector<int> a) {
return Query(a);
}
void solve(int n, int m) {
vector<vector<int>> ans;
set<int> st;
while (m--) {
vector<int> res;
int idx = -1;
for (int i = 0; i < n * m; i++) {
vector<int> go;
for (int j = 0; j <= i; j++) if (!st.count(j)) go.push_back(j + 1);
if (ask(go)) {
idx = i;
break;
}
}
res.push_back(idx);
st.insert(idx);
for (int i = idx - 1; i >= -1; i--) {
vector<int> go;
for (int j = 0; j <= i; j++) if (!st.count(j)) go.push_back(j + 1);
for (int& j : res) go.push_back(j + 1);
if (ask(go) == 0) {
res.push_back(i + 1);
}
}
ans.push_back(res);
}
for (auto& i : ans) Answer(i);
}
signed main() {
// cout.precision(16);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
}