{"model_name":"grok-4.20-beta","codes":{"1":{"ahc001":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int n;\n cin >> n;\n vector x(n), y(n), r(n);\n for (int i = 0; i < n; i++) {\n cin >> x[i] >> y[i] >> r[i];\n }\n vector la(n), lb(n), lc(n), ld(n);\n auto rec = [&](auto&& self, vector ids, ll xl, ll xr, ll yl, ll yr) -> void {\n int m = ids.size();\n if (m == 0) return;\n if (m == 1) {\n int i = ids[0];\n la[i] = xl; lb[i] = yl; lc[i] = xr; ld[i] = yr;\n return;\n }\n ll carea = (xr - xl) * (yr - yl);\n ll tr = 0;\n for (int i : ids) tr += r[i];\n double min_dev = 1e18;\n int best_d = -1; // 0:vert 1:horiz\n int best_kk = -1;\n ll best_cutt = -1;\n vector best_sids;\n // vertical\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return x[i] < x[j] || (x[i] == x[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll hy = yr - yl;\n if (hy == 0) continue;\n double id_cut = xl + id_area / hy;\n ll maxlx = -1;\n for (int j = 0; j < k; j++) maxlx = max(maxlx, x[sids[j]]);\n ll minrx = 10001;\n for (int j = k; j < m; j++) minrx = min(minrx, x[sids[j]]);\n ll lo = max(xl + 1, maxlx + 1);\n ll hi = min(xr, minrx);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - xl) * (double)hy;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 0;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n // horizontal\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return y[i] < y[j] || (y[i] == y[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll wx = xr - xl;\n if (wx == 0) continue;\n double id_cut = yl + id_area / wx;\n ll maxly = -1;\n for (int j = 0; j < k; j++) maxly = max(maxly, y[sids[j]]);\n ll minry = 10001;\n for (int j = k; j < m; j++) minry = min(minry, y[sids[j]]);\n ll lo = max(yl + 1, maxly + 1);\n ll hi = min(yr, minry);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - yl) * (double)wx;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 1;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n if (best_d == -1) {\n for (int ii : ids) {\n int i = ii;\n la[i] = x[i]; lb[i] = y[i]; lc[i] = x[i] + 1; ld[i] = y[i] + 1;\n }\n return;\n }\n vector left, rightt;\n for (int j = 0; j < best_kk; j++) left.push_back(best_sids[j]);\n for (int j = best_kk; j < m; j++) rightt.push_back(best_sids[j]);\n if (best_d == 0) {\n ll cut = best_cutt;\n self(self, left, xl, cut, yl, yr);\n self(self, rightt, cut, xr, yl, yr);\n } else {\n ll cut = best_cutt;\n self(self, left, xl, xr, yl, cut);\n self(self, rightt, xl, xr, cut, yr);\n }\n };\n vector all(n);\n iota(all.begin(), all.end(), 0);\n rec(rec, all, 0LL, 10000LL, 0LL, 10000LL);\n for (int i = 0; i < n; i++) {\n cout << la[i] << \" \" << lb[i] << \" \" << lc[i] << \" \" << ld[i] << \"\\n\";\n }\n}","ahc002":"#include \nusing namespace std;\n\nint main() {\n int si, sj;\n cin >> si >> sj;\n int T[50][50], P[50][50];\n int maxt = 0;\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> T[i][j];\n maxt = max(maxt, T[i][j]);\n }\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> P[i][j];\n }\n int M = maxt + 1;\n int di[4] = {-1, 0, 1, 0};\n int dj[4] = {0, 1, 0, -1};\n char dirch[4] = {'U', 'R', 'D', 'L'};\n string best_str = \"\";\n long long best_sc = -1;\n srand(42);\n int num_trials = 1000;\n char usd[2505];\n for (int trial = 0; trial < num_trials; trial++) {\n memset(usd, 0, M);\n vector moves;\n int curi = si, curj = sj;\n long long cursum = P[si][sj];\n usd[T[si][sj]] = 1;\n while (true) {\n vector> cands;\n for (int d = 0; d < 4; d++) {\n int ni = curi + di[d];\n int nj = curj + dj[d];\n if (ni < 0 || ni >= 50 || nj < 0 || nj >= 50) continue;\n int nt = T[ni][nj];\n if (usd[nt]) continue;\n int deg = 0;\n for (int dd = 0; dd < 4; dd++) {\n int nni = ni + di[dd], nnj = nj + dj[dd];\n if (nni >= 0 && nni < 50 && nnj >= 0 && nnj < 50) {\n int nnt = T[nni][nnj];\n if (nnt != nt && !usd[nnt]) deg++;\n }\n }\n cands.emplace_back(-deg, -P[ni][nj], d);\n }\n if (cands.empty()) break;\n sort(cands.begin(), cands.end());\n int sz = cands.size();\n int take = 0;\n if (sz >= 2) {\n take = rand() % min(3, sz);\n }\n auto [ndeg, np, d] = cands[take];\n int ni = curi + di[d];\n int nj = curj + dj[d];\n int nt = T[ni][nj];\n usd[nt] = 1;\n moves.push_back(dirch[d]);\n cursum += P[ni][nj];\n curi = ni;\n curj = nj;\n }\n if (cursum > best_sc) {\n best_sc = cursum;\n best_str = string(moves.begin(), moves.end());\n }\n }\n cout << best_str << endl;\n}","ahc003":"#include \nusing namespace std;\n\nint main() {\n double H[30][29];\n double V[29][30];\n for (int i = 0; i < 30; i++) {\n for (int j = 0; j < 29; j++) H[i][j] = 5000.0;\n }\n for (int i = 0; i < 29; i++) {\n for (int j = 0; j < 30; j++) V[i][j] = 5000.0;\n }\n for (int q = 0; q < 1000; q++) {\n int si, sj, ti, tj;\n cin >> si >> sj >> ti >> tj;\n const double INF = 1e18;\n vector dist(900, INF);\n vector prevv(900, -1);\n priority_queue, vector>, greater>> pq;\n int S = si * 30 + sj;\n int T = ti * 30 + tj;\n dist[S] = 0.0;\n pq.push({0.0, S});\n while (!pq.empty()) {\n auto [c, u] = pq.top();\n pq.pop();\n if (c > dist[u]) continue;\n int i = u / 30;\n int j = u % 30;\n if (j > 0) {\n int nv = i * 30 + (j - 1);\n double nw = H[i][j - 1];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (j < 29) {\n int nv = i * 30 + (j + 1);\n double nw = H[i][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i > 0) {\n int nv = (i - 1) * 30 + j;\n double nw = V[i - 1][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i < 29) {\n int nv = (i + 1) * 30 + j;\n double nw = V[i][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n }\n vector path_nodes;\n int cur = T;\n while (true) {\n path_nodes.push_back(cur);\n if (cur == S) break;\n cur = prevv[cur];\n }\n reverse(path_nodes.begin(), path_nodes.end());\n string path_str = \"\";\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n char move;\n if (ci == pi - 1 && cj == pj) move = 'U';\n else if (ci == pi + 1 && cj == pj) move = 'D';\n else if (cj == pj - 1 && ci == pi) move = 'L';\n else if (cj == pj + 1 && ci == pi) move = 'R';\n else assert(false);\n path_str += move;\n }\n cout << path_str << endl;\n int obs;\n cin >> obs;\n double est = dist[T];\n if (est < 1e-9) est = 1.0;\n double factor = (double)obs / est;\n double alpha = 0.25;\n double mul = 1.0 + alpha * (factor - 1.0);\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n if (pi == ci) {\n int jleft = min(pj, cj);\n H[pi][jleft] *= mul;\n if (H[pi][jleft] < 100.0) H[pi][jleft] = 100.0;\n if (H[pi][jleft] > 20000.0) H[pi][jleft] = 20000.0;\n } else {\n int itop = min(pi, ci);\n V[itop][pj] *= mul;\n if (V[itop][pj] < 100.0) V[itop][pj] = 100.0;\n if (V[itop][pj] > 20000.0) V[itop][pj] = 20000.0;\n }\n }\n }\n return 0;\n}","ahc004":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector S(M);\n for (auto& s : S) cin >> s;\n vector order(M);\n iota(order.begin(), order.end(), 0);\n sort(order.begin(), order.end(), [&](int a, int b) {\n return S[a].size() > S[b].size();\n });\n vector grid(N, string(N, '.'));\n auto can_place = [&](int r, int c, int dr, int dc, const string& s) -> pair {\n int k = s.size();\n int match_cnt = 0;\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n char need = s[p];\n if (grid[rr][cc] != '.' && grid[rr][cc] != need) return {false, 0};\n if (grid[rr][cc] == need) match_cnt++;\n }\n return {true, match_cnt};\n };\n auto do_write = [&](int r, int c, int dr, int dc, const string& s) {\n int k = s.size();\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n grid[rr][cc] = s[p];\n }\n };\n for (int idx : order) {\n const string& s = S[idx];\n int k = s.size();\n int best_match = -1;\n int best_r = -1, best_c = -1, best_dr = -1, best_dc = -1;\n // horiz\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place(r, st, 0, 1, s);\n if (poss && mt > best_match) {\n best_match = mt;\n best_r = r;\n best_c = st;\n best_dr = 0;\n best_dc = 1;\n }\n }\n }\n // vert\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place(st, c, 1, 0, s);\n if (poss && mt > best_match) {\n best_match = mt;\n best_r = st;\n best_c = c;\n best_dr = 1;\n best_dc = 0;\n }\n }\n }\n if (best_match >= 0) {\n do_write(best_r, best_c, best_dr, best_dc, s);\n }\n }\n for (auto& row : grid) {\n cout << row << endl;\n }\n return 0;\n}","ahc005":"#include \nusing namespace std;\nusing ll = long long;\n\nconst int MAXN = 70;\nconst ll INF = 1LL << 60;\nint di[4] = {-1, 0, 1, 0};\nint dj[4] = {0, 1, 0, -1};\n\nint main() {\n int N, si, sj;\n cin >> N >> si >> sj;\n vector grid(N);\n for (auto& s : grid) cin >> s;\n int h_id[MAXN][MAXN];\n int v_id[MAXN][MAXN];\n memset(h_id, -1, sizeof(h_id));\n memset(v_id, -1, sizeof(v_id));\n int num_h = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N;) {\n if (grid[i][j] == '#') {\n j++;\n continue;\n }\n while (j < N && grid[i][j] != '#') {\n h_id[i][j] = num_h;\n j++;\n }\n num_h++;\n }\n }\n int num_v = 0;\n for (int j = 0; j < N; j++) {\n for (int i = 0; i < N;) {\n if (grid[i][j] == '#') {\n i++;\n continue;\n }\n while (i < N && grid[i][j] != '#') {\n v_id[i][j] = num_v;\n i++;\n }\n num_v++;\n }\n }\n vector>> h_cells(num_h);\n vector>> v_cells(num_v);\n vector> all_roads;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (grid[i][j] != '#') {\n all_roads.emplace_back(i, j);\n h_cells[h_id[i][j]].emplace_back(i, j);\n v_cells[v_id[i][j]].emplace_back(i, j);\n }\n }\n }\n int r = all_roads.size();\n bool is_covered[MAXN][MAXN] = {};\n int num_uncovered = r;\n auto get_gain = [&](int x, int y) {\n int g = 0;\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) if (!is_covered[a][b]) g++;\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) if (!is_covered[a][b]) g++;\n if (!is_covered[x][y]) g--;\n return g;\n };\n auto apply_cover = [&](int x, int y) {\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n };\n vector> keys;\n apply_cover(si, sj);\n keys.emplace_back(si, sj);\n while (num_uncovered > 0) {\n int mg = 0;\n pair bp{-1, -1};\n for (auto p : all_roads) {\n int gg = get_gain(p.first, p.second);\n if (gg > mg) {\n mg = gg;\n bp = p;\n }\n }\n if (mg <= 0) break;\n keys.push_back(bp);\n apply_cover(bp.first, bp.second);\n }\n vector> points;\n set> unique_pts(keys.begin(), keys.end());\n for (auto p : unique_pts) points.push_back(p);\n int m = points.size();\n for (int i = 0; i < m; i++) {\n if (points[i].first == si && points[i].second == sj) {\n swap(points[i], points[0]);\n break;\n }\n }\n if (m == 0) {\n cout << \"\" << endl;\n return 0;\n }\n vector> D(m, vector(m, INF));\n for (int k = 0; k < m; k++) {\n pair src = points[k];\n vector> dd(N, vector(N, INF));\n dd[src.first][src.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, src.first, src.second});\n while (!pq.empty()) {\n auto [cost, x, y] = pq.top();\n pq.pop();\n if (cost > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = cost + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n pq.push({nc, nx, ny});\n }\n }\n }\n for (int t = 0; t < m; t++) {\n auto [tx, ty] = points[t];\n D[k][t] = dd[tx][ty];\n }\n }\n vector order;\n if (m == 1) {\n order = {0};\n } else {\n vector vis(m, false);\n order.push_back(0);\n vis[0] = true;\n for (int cnt = 1; cnt < m; cnt++) {\n int curi = order.back();\n ll min_d = INF;\n int chosen = -1;\n for (int j = 0; j < m; j++) {\n if (!vis[j] && D[curi][j] < min_d) {\n min_d = D[curi][j];\n chosen = j;\n }\n }\n order.push_back(chosen);\n vis[chosen] = true;\n }\n }\n auto calc_tour_cost = [&](const vector& ord) -> ll {\n ll sum = 0;\n for (int i = 0; i < m; i++) {\n sum += D[ord[i]][ord[(i + 1) % m]];\n }\n return sum;\n };\n if (m >= 3) {\n int iters = 0;\n bool improved = true;\n while (improved && iters++ < 200) {\n improved = false;\n ll cur_cost = calc_tour_cost(order);\n for (int l = 0; l < m && !improved; l++) {\n for (int r = l + 1; r < m && !improved; r++) {\n vector newo = order;\n reverse(newo.begin() + l, newo.begin() + r + 1);\n ll nc = calc_tour_cost(newo);\n if (nc < cur_cost) {\n order = newo;\n improved = true;\n }\n }\n }\n }\n }\n int zero_pos = 0;\n for (int i = 0; i < m; i++) {\n if (order[i] == 0) {\n zero_pos = i;\n break;\n }\n }\n vector final_order(m);\n for (int i = 0; i < m; i++) {\n final_order[i] = order[(zero_pos + i) % m];\n }\n order = final_order;\n vector> full_route;\n full_route.push_back(points[0]);\n for (int i = 0; i < m; i++) {\n int u = order[i];\n int v = order[(i + 1) % m];\n auto sp = points[u];\n auto tp = points[v];\n vector>> par(N, vector>(N, {-1, -1}));\n vector> dd(N, vector(N, INF));\n dd[sp.first][sp.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, sp.first, sp.second});\n while (!pq.empty()) {\n auto [c, x, y] = pq.top();\n pq.pop();\n if (c > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = c + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n par[nx][ny] = {x, y};\n pq.push({nc, nx, ny});\n }\n }\n }\n vector> thisp;\n auto curp = tp;\n while (curp.first != -1) {\n thisp.push_back(curp);\n if (curp == sp) break;\n curp = par[curp.first][curp.second];\n }\n reverse(thisp.begin(), thisp.end());\n for (size_t j = 1; j < thisp.size(); j++) {\n full_route.push_back(thisp[j]);\n }\n }\n string ans = \"\";\n for (size_t i = 0; i + 1 < full_route.size(); i++) {\n int dx = full_route[i + 1].first - full_route[i].first;\n int dy = full_route[i + 1].second - full_route[i].second;\n if (dx == -1 && dy == 0) ans += 'U';\n else if (dx == 1 && dy == 0) ans += 'D';\n else if (dx == 0 && dy == -1) ans += 'L';\n else if (dx == 0 && dy == 1) ans += 'R';\n }\n cout << ans << endl;\n}","future-contest-2022-qual":"#include \nusing namespace std;\n\nint main() {\n int N, M, K, R;\n cin >> N >> M >> K >> R;\n vector> D(N, vector(K));\n for (int i = 0; i < N; i++) {\n for (int k = 0; k < K; k++) {\n cin >> D[i][k];\n }\n }\n vector> successors(N);\n vector unfinished_preds(N, 0);\n for (int i = 0; i < R; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n successors[u].push_back(v);\n unfinished_preds[v]++;\n }\n vector priority(N, 0);\n for (int i = N - 1; i >= 0; i--) {\n int mx = 0;\n for (int s : successors[i]) {\n mx = max(mx, priority[s]);\n }\n priority[i] = 3 + mx;\n }\n vector> est_s(M, vector(K, 0));\n vector member_task(M, -1);\n vector member_startday(M, -1);\n vector task_status(N, 0);\n int day = 0;\n while (true) {\n day++;\n if (day > 2000) break;\n vector free_workers;\n for (int j = 0; j < M; j++) {\n if (member_task[j] == -1) free_workers.push_back(j);\n }\n vector candidate_tasks;\n for (int i = 0; i < N; i++) {\n if (task_status[i] == 0 && unfinished_preds[i] == 0) {\n candidate_tasks.push_back(i);\n }\n }\n vector> assigns;\n if (!free_workers.empty() && !candidate_tasks.empty()) {\n sort(candidate_tasks.begin(), candidate_tasks.end(), [&](int a, int b) {\n if (priority[a] != priority[b]) return priority[a] > priority[b];\n return a < b;\n });\n int num_assign = min((int)free_workers.size(), (int)candidate_tasks.size());\n vector tasks_select(candidate_tasks.begin(), candidate_tasks.begin() + num_assign);\n vector worker_free(M, false);\n for (int j : free_workers) worker_free[j] = true;\n for (int ti = 0; ti < num_assign; ti++) {\n int tsk = tasks_select[ti];\n int best_j = -1;\n int best_est = INT_MAX;\n for (int j = 0; j < M; j++) {\n if (!worker_free[j]) continue;\n int wsum = 0;\n for (int k = 0; k < K; k++) {\n wsum += max(0, D[tsk][k] - est_s[j][k]);\n }\n int estt = (wsum == 0 ? 1 : wsum);\n if (estt < best_est || (estt == best_est && (best_j == -1 || j < best_j))) {\n best_est = estt;\n best_j = j;\n }\n }\n if (best_j != -1) {\n worker_free[best_j] = false;\n assigns.emplace_back(best_j, tsk);\n task_status[tsk] = 1;\n member_task[best_j] = tsk;\n member_startday[best_j] = day;\n }\n }\n }\n cout << assigns.size();\n for (auto [j, t] : assigns) {\n cout << \" \" << (j + 1) << \" \" << (t + 1);\n }\n cout << endl;\n int n_comp;\n cin >> n_comp;\n if (n_comp == -1) break;\n for (int fi = 0; fi < n_comp; fi++) {\n int f;\n cin >> f;\n int j = f - 1;\n int tsk = member_task[j];\n if (tsk >= 0) {\n int t_taken = day - member_startday[j] + 1;\n if (t_taken == 1) {\n for (int k = 0; k < K; k++) {\n est_s[j][k] = max(est_s[j][k], D[tsk][k] - 4);\n }\n } else if (t_taken == 2) {\n for (int k = 0; k < K; k++) {\n est_s[j][k] = max(est_s[j][k], D[tsk][k] - 6);\n }\n }\n task_status[tsk] = 2;\n member_task[j] = -1;\n member_startday[j] = -1;\n for (int suc : successors[tsk]) {\n unfinished_preds[suc]--;\n }\n }\n }\n }\n return 0;\n}","ahc006":"#include \nusing namespace std;\n\nstruct Point {\n int x, y;\n};\n\nint manh(const Point& a, const Point& b) {\n return abs(a.x - b.x) + abs(a.y - b.y);\n}\n\npair> get_route(const vector& S, const Point* picks, const Point* dels, Point cen) {\n int N = S.size();\n bool isp[1000] = {};\n bool isd[1000] = {};\n vector pth;\n pth.push_back(cen);\n Point cur = cen;\n int tt = 0;\n for (int st = 0; st < N * 2; ++st) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : S) {\n if (!isp[id]) {\n int dt = manh(cur, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd[id]) {\n int dt = manh(cur, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n tt += bd;\n if (bip) {\n cur = picks[bi];\n isp[bi] = true;\n } else {\n cur = dels[bi];\n isd[bi] = true;\n }\n pth.push_back(cur);\n }\n tt += manh(cur, cen);\n pth.push_back(cen);\n return {tt, pth};\n}\n\nint main() {\n Point picks[1000], dels[1000];\n for (int i = 0; i < 1000; ++i) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n picks[i] = {a, b};\n dels[i] = {c, d};\n }\n Point cen = {400, 400};\n int solos[1000];\n for (int i = 0; i < 1000; ++i) {\n solos[i] = manh(cen, picks[i]) + manh(picks[i], dels[i]) + manh(dels[i], cen);\n }\n vector ord(1000);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) {\n return solos[i] < solos[j] || (solos[i] == solos[j] && i < j);\n });\n vector cur_S(ord.begin(), ord.begin() + 50);\n auto compute_T = [&](const vector& S) -> int {\n bool isp[1000] = {};\n bool isd[1000] = {};\n Point curr = cen;\n int total = 0;\n for (int step = 0; step < 100; ++step) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : S) {\n if (!isp[id]) {\n int dt = manh(curr, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd[id]) {\n int dt = manh(curr, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n total += bd;\n if (bip) {\n curr = picks[bi];\n isp[bi] = true;\n } else {\n curr = dels[bi];\n isd[bi] = true;\n }\n }\n total += manh(curr, cen);\n return total;\n };\n bool is_in[1000] = {};\n for (int i : cur_S) is_in[i] = true;\n int current_T = compute_T(cur_S);\n int best_T_val = current_T;\n vector best_S = cur_S;\n double temperature = 3000.0;\n const double rate = 0.99995;\n const int max_iter = 100000;\n srand(42);\n for (int it = 0; it < max_iter; ++it) {\n int pos = rand() % 50;\n int old_id = cur_S[pos];\n int new_id;\n do {\n new_id = rand() % 1000;\n } while (is_in[new_id]);\n cur_S[pos] = new_id;\n int nt = compute_T(cur_S);\n int delta = nt - current_T;\n bool acc = false;\n if (delta < 0) {\n acc = true;\n } else {\n double prob = exp(-delta / temperature);\n if (prob > (rand() * 1.0 / RAND_MAX)) acc = true;\n }\n if (acc) {\n is_in[old_id] = false;\n is_in[new_id] = true;\n current_T = nt;\n if (current_T < best_T_val) {\n best_T_val = current_T;\n best_S = cur_S;\n }\n } else {\n cur_S[pos] = old_id;\n }\n temperature *= rate;\n }\n auto [final_t, best_path] = get_route(best_S, picks, dels, cen);\n vector chosen = best_S;\n for (int& v : chosen) ++v;\n sort(chosen.begin(), chosen.end());\n cout << 50;\n for (int r : chosen) cout << \" \" << r;\n cout << endl;\n cout << best_path.size();\n for (auto& pt : best_path) {\n cout << \" \" << pt.x << \" \" << pt.y;\n }\n cout << endl;\n return 0;\n}","ahc007":"#include \nusing namespace std;\n\nstruct Edge {\n int u, v, d, order_idx;\n};\n\nint main() {\n int N = 400;\n int M = 1995;\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector alledges(M);\n for (int i = 0; i < M; i++) {\n cin >> alledges[i].u >> alledges[i].v;\n long long dx = X[alledges[i].u] - X[alledges[i].v];\n long long dy = Y[alledges[i].u] - Y[alledges[i].v];\n long long dist2 = dx * dx + dy * dy;\n alledges[i].d = round(sqrt((double)dist2));\n alledges[i].order_idx = i;\n }\n vector sorted_edges = alledges;\n sort(sorted_edges.begin(), sorted_edges.end(), [](const Edge& a, const Edge& b) {\n return a.d < b.d;\n });\n vector parent(N), rankk(N, 0);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto& self, int x) -> int {\n if (parent[x] != x) parent[x] = self(self, parent[x]);\n return parent[x];\n };\n auto unite = [&](int a, int b) {\n a = find(find, a);\n b = find(find, b);\n if (a == b) return;\n if (rankk[a] < rankk[b]) swap(a, b);\n parent[b] = a;\n if (rankk[a] == rankk[b]) rankk[a]++;\n };\n for (int ii = 0; ii < M; ii++) {\n int l;\n cin >> l;\n Edge& e = alledges[ii];\n int uu = e.u, vv = e.v;\n int pu = find(find, uu);\n int pv = find(find, vv);\n if (pu == pv) {\n cout << 0 << endl;\n continue;\n }\n vector tparent = parent;\n vector trank = rankk;\n auto tfind = [&](auto& self, int x) -> int {\n if (tparent[x] != x) tparent[x] = self(self, tparent[x]);\n return tparent[x];\n };\n auto tunite = [&](int a, int b) {\n a = tfind(tfind, a);\n b = tfind(tfind, b);\n if (a == b) return;\n if (trank[a] < trank[b]) swap(a, b);\n tparent[b] = a;\n if (trank[a] == trank[b]) trank[a]++;\n };\n int su = tfind(tfind, uu);\n int sv = tfind(tfind, vv);\n int bott = 0;\n bool can_connect = false;\n for (auto& se : sorted_edges) {\n int j = se.order_idx;\n if (j > ii) {\n int pa = tfind(tfind, se.u);\n int pb = tfind(tfind, se.v);\n if (pa != pb) {\n tunite(se.u, se.v);\n if (tfind(tfind, su) == tfind(tfind, sv)) {\n bott = se.d;\n can_connect = true;\n break;\n }\n }\n }\n }\n bool adopt;\n if (!can_connect) {\n adopt = true;\n } else {\n adopt = (l <= 2 * bott);\n }\n cout << (adopt ? 1 : 0) << endl;\n if (adopt) {\n unite(uu, vv);\n }\n }\n return 0;\n}","ahc008":"#include \nusing namespace std;\n\nstruct Task {\n int tx, ty;\n char act;\n int wx, wy;\n};\n\nint main() {\n int N;\n cin >> N;\n vector> pet_pos(N);\n vector pet_t(N);\n for (int i = 0; i < N; i++) {\n int x, y, t;\n cin >> x >> y >> t;\n pet_pos[i] = {x, y};\n pet_t[i] = t;\n }\n int M;\n cin >> M;\n vector> hum_pos(M);\n for (int i = 0; i < M; i++) {\n int x, y;\n cin >> x >> y;\n hum_pos[i] = {x, y};\n }\n double pp = 0.03;\n double ff = 1.0 - pow(pp, 1.0 / N);\n ff = min(ff, 0.35);\n int area_t = (int)(ff * 900);\n int best_per = 1000;\n int HH = 10, WW = 10;\n for (int h = 5; h <= 25; h++) {\n for (int w = 5; w <= 25; w++) {\n if ((long long)h * w >= area_t && h + w < best_per) {\n best_per = h + w;\n HH = h;\n WW = w;\n }\n }\n }\n int H = HH, W = WW;\n int num_bottom_walls = W;\n int num_right_walls = H;\n int num_b_h = max(1, M * num_bottom_walls / (num_bottom_walls + num_right_walls));\n if (num_b_h > M) num_b_h = M;\n int num_r_h = M - num_b_h;\n if (num_r_h == 0 && num_right_walls > 0 && num_b_h > 0) {\n num_b_h--;\n num_r_h = 1;\n }\n vector> homes(M);\n vector> bot_pos, rig_pos;\n for (int y = 1; y <= W; y++) bot_pos.emplace_back(H, y);\n for (int x = 1; x <= H; x++) rig_pos.emplace_back(x, W);\n for (int i = 0; i < M; i++) {\n if (i < num_b_h) {\n int idxx = (bot_pos.size() * i) / max(1, num_b_h);\n if (idxx >= (int)bot_pos.size()) idxx = 0;\n homes[i] = bot_pos[idxx];\n } else {\n int ii = i - num_b_h;\n int idxx = (rig_pos.size() * ii) / max(1, num_r_h);\n if (idxx >= (int)rig_pos.size()) idxx = 0;\n homes[i] = rig_pos[idxx];\n }\n }\n bool walledg[31][31];\n memset(walledg, 0, sizeof(walledg));\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n char mcs[4] = {'U', 'D', 'L', 'R'};\n bool is_build = false;\n vector> htasks(M);\n vector tindex(M, 0);\n int wait_turns = 0;\n bool is_all_home = false;\n for (int turn = 0; turn < 300; turn++) {\n string acts(M, '.');\n int pin = 0;\n for (auto [x, y] : pet_pos) if (x <= H && y <= W && !walledg[x][y]) pin++;\n bool allhome = true;\n for (int i = 0; i < M; i++) if (hum_pos[i].first != homes[i].first || hum_pos[i].second != homes[i].second) allhome = false;\n if (allhome) {\n is_all_home = true;\n wait_turns++;\n }\n if (!is_build && is_all_home && (pin == 0 || (wait_turns > 200 && pin <= 1))) {\n is_build = true;\n htasks.assign(M, vector());\n tindex.assign(M, 0);\n for (int k = 0; k < num_b_h; k++) {\n int hi = k;\n int yst = 1 + (num_bottom_walls * k / max(1, num_b_h));\n int yen = 1 + (num_bottom_walls * (k + 1) / max(1, num_b_h)) - 1;\n vector ts;\n for (int y = yst; y <= yen; y++) {\n ts.push_back(Task{H, y, 'd', H + 1, y});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n for (int k = 0; k < num_r_h; k++) {\n int hi = num_b_h + k;\n int xst = 1 + (num_right_walls * k / max(1, num_r_h));\n int xen = 1 + (num_right_walls * (k + 1) / max(1, num_r_h)) - 1;\n vector ts;\n for (int x = xst; x <= xen; x++) {\n ts.push_back(Task{x, W, 'r', x, W + 1});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n }\n set> will_wall;\n if (is_build) {\n for (int i = 0; i < M; i++) {\n if (tindex[i] >= (int)htasks[i].size()) {\n acts[i] = '.';\n continue;\n }\n Task tk = htasks[i][tindex[i]];\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n if (hx == tk.tx && hy == tk.ty) {\n bool canb = true;\n int cx = tk.wx, cy = tk.wy;\n for (int j = 0; j < N; j++) if (pet_pos[j].first == cx && pet_pos[j].second == cy) canb = false;\n for (int j = 0; j < M; j++) if (hum_pos[j].first == cx && hum_pos[j].second == cy) canb = false;\n int ddx[4] = {-1, 0, 1, 0};\n int ddy[4] = {0, 1, 0, -1};\n for (int d = 0; d < 4; d++) {\n int nx = cx + ddx[d], ny = cy + ddy[d];\n for (int j = 0; j < N; j++) if (pet_pos[j].first == nx && pet_pos[j].second == ny) canb = false;\n }\n if (canb) {\n acts[i] = tk.act;\n will_wall.insert({cx, cy});\n walledg[cx][cy] = true;\n tindex[i]++;\n } else {\n acts[i] = '.';\n }\n } else {\n int cdist = abs(hx - tk.tx) + abs(hy - tk.ty);\n char chosen = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d];\n int ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int ndd = abs(nx - tk.tx) + abs(ny - tk.ty);\n if (ndd < cdist) {\n cdist = ndd;\n chosen = mcs[d];\n }\n }\n }\n acts[i] = chosen;\n }\n }\n } else {\n for (int i = 0; i < M; i++) {\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n int tx = homes[i].first, ty = homes[i].second;\n if (hx == tx && hy == ty) {\n acts[i] = '.';\n } else {\n int cdist = abs(hx - tx) + abs(hy - ty);\n char ch = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d], ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int nd = abs(nx - tx) + abs(ny - ty);\n if (nd < cdist) {\n cdist = nd;\n ch = mcs[d];\n }\n }\n }\n acts[i] = ch;\n }\n }\n }\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = 0;\n if (a == 'U') d = 0;\n else if (a == 'D') d = 1;\n else if (a == 'L') d = 2;\n else if (a == 'R') d = 3;\n int tx = hum_pos[i].first + dx[d];\n int ty = hum_pos[i].second + dy[d];\n if (will_wall.count({tx, ty})) {\n acts[i] = '.';\n }\n }\n }\n cout << acts << endl;\n cout.flush();\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = -1;\n for (int k = 0; k < 4; k++) if (mcs[k] == a) d = k;\n if (d >= 0) {\n hum_pos[i].first += dx[d];\n hum_pos[i].second += dy[d];\n }\n }\n }\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (char c : s) {\n int d = -1;\n if (c == 'U') d = 0;\n else if (c == 'D') d = 1;\n else if (c == 'L') d = 2;\n else if (c == 'R') d = 3;\n if (d >= 0) {\n pet_pos[i].first += dx[d];\n pet_pos[i].second += dy[d];\n }\n }\n }\n }\n return 0;\n}","ahc009":"#include \nusing namespace std;\n\nconst int H = 20;\nconst int W = 20;\nconst int MAXL = 200;\nconst int BEAMW = 40;\nconst double EPS = 1e-12;\n\nstruct State {\n double expv;\n double pr[H][W];\n};\n\nstruct TempCand {\n double expv;\n double pot;\n double pr[H][W];\n int from;\n int dird;\n};\n\nint dr[4] = {-1, 1, 0, 0};\nint dc[4] = {0, 0, -1, 1};\nchar dch[4] = {'U', 'D', 'L', 'R'};\nbool wallh[H][W-1];\nbool wallv[H-1][W];\nint dist_to[H][W];\nint parent[MAXL+1][BEAMW];\nint ch_dir[MAXL+1][BEAMW];\nState current_states[BEAMW];\nTempCand cands[BEAMW * 4 + 10];\n\nbool can_move(int r, int c, int d) {\n int nr = r + dr[d];\n int nc = c + dc[d];\n if (nr < 0 || nr >= H || nc < 0 || nc >= W) return false;\n if (d == 0) {\n return !wallv[nr][c];\n } else if (d == 1) {\n return !wallv[r][c];\n } else if (d == 2) {\n return !wallh[r][nc];\n } else {\n return !wallh[r][c];\n }\n}\n\nint main() {\n int si, sj, ti, tj;\n double p;\n cin >> si >> sj >> ti >> tj >> p;\n double forget = p;\n double success = 1.0 - p;\n for (int i = 0; i < H; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W - 1; j++) {\n wallh[i][j] = (s[j] == '1');\n }\n }\n for (int i = 0; i < H - 1; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W; j++) {\n wallv[i][j] = (s[j] == '1');\n }\n }\n // dist to T\n memset(dist_to, 0x3f, sizeof(dist_to));\n dist_to[ti][tj] = 0;\n queue> qu;\n qu.emplace(ti, tj);\n while (!qu.empty()) {\n auto [r, c] = qu.front();\n qu.pop();\n for (int d = 0; d < 4; d++) {\n if (can_move(r, c, d)) {\n int nr = r + dr[d];\n int nc = c + dc[d];\n if (dist_to[nr][nc] > dist_to[r][c] + 1) {\n dist_to[nr][nc] = dist_to[r][c] + 1;\n qu.emplace(nr, nc);\n }\n }\n }\n }\n // initial\n int cur_num = 1;\n current_states[0].expv = 0.0;\n memset(current_states[0].pr, 0, sizeof(current_states[0].pr));\n current_states[0].pr[si][sj] = 1.0;\n for (int step = 1; step <= MAXL; step++) {\n int num_cand = 0;\n for (int b = 0; b < cur_num; b++) {\n for (int d = 0; d < 4; d++) {\n TempCand& news = cands[num_cand];\n news.expv = current_states[b].expv;\n memset(news.pr, 0, sizeof(news.pr));\n double reached = 0.0;\n for (int r = 0; r < H; r++) {\n for (int c = 0; c < W; c++) {\n double pb = current_states[b].pr[r][c];\n if (pb > EPS) {\n news.pr[r][c] += pb * forget;\n int nr = r, nc = c;\n if (can_move(r, c, d)) {\n nr += dr[d];\n nc += dc[d];\n }\n double pm = pb * success;\n if (nr == ti && nc == tj) {\n reached += pm;\n } else {\n news.pr[nr][nc] += pm;\n }\n }\n }\n }\n news.expv += reached * (401.0 - step);\n news.pot = 0.0;\n for (int r = 0; r < H; r++) {\n for (int c = 0; c < W; c++) {\n news.pot += news.pr[r][c] * dist_to[r][c];\n }\n }\n news.from = b;\n news.dird = d;\n num_cand++;\n }\n }\n vector ord(num_cand);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b) {\n if (fabs(cands[a].expv - cands[b].expv) > 1e-9) {\n return cands[a].expv > cands[b].expv;\n }\n return cands[a].pot < cands[b].pot;\n });\n cur_num = min(BEAMW, num_cand);\n for (int i = 0; i < cur_num; i++) {\n int idx = ord[i];\n current_states[i].expv = cands[idx].expv;\n memcpy(current_states[i].pr, cands[idx].pr, sizeof(cands[idx].pr));\n parent[step][i] = cands[idx].from;\n ch_dir[step][i] = cands[idx].dird;\n }\n }\n string res = \"\";\n int bestb = 0;\n for (int step = MAXL; step >= 1; step--) {\n int d = ch_dir[step][bestb];\n res = dch[d] + res;\n bestb = parent[step][bestb];\n }\n cout << res << endl;\n return 0;\n}","ahc010":"#include \nusing namespace std;\n\nconst int TO[8][4] = {\n {1, 0, -1, -1},\n {3, -1, -1, 0},\n {-1, -1, 3, 2},\n {-1, 2, 1, -1},\n {1, 0, 3, 2},\n {3, 2, 1, 0},\n {2, -1, 0, -1},\n {-1, 3, -1, 1}\n};\n\nint nxt_type[8] = {1,2,3,0,5,4,7,6};\nint rotated_type[4][8];\nint givenn[30][30];\nint cur_rot[30][30];\nint cur_tiles[30][30];\nint best_rots[30][30];\n\nvector get_cycles(int tiles[][30]) {\n bool vis[30][30][4] = {};\n vector res;\n int di[4] = {0, -1, 0, 1};\n int dj[4] = {-1, 0, 1, 0};\n for(int si=0; si<30; si++){\n for(int sj=0; sj<30; sj++){\n for(int sd=0; sd<4; sd++){\n if(vis[si][sj][sd]) continue;\n int t = tiles[si][sj];\n if(TO[t][sd] < 0) continue;\n int i = si, j = sj, d = sd;\n long long len = 0;\n bool ok = true;\n while(true){\n if(len > 5000){ ok=false; break;}\n int tt = tiles[i][j];\n int d2 = TO[tt][d];\n if(d2 < 0){ ok=false; break; }\n i += di[d2];\n j += dj[d2];\n if(i < 0 || i >=30 || j<0 || j>=30){ ok=false; break;}\n d = (d2 + 2) % 4;\n len++;\n if(i == si && j == sj && d == sd){\n break;\n }\n }\n if(ok && len > 0 && i == si && j == sj && d == sd){\n res.push_back(len);\n i=si; j=sj; d=sd;\n for(long long k=0; k=30||nj<0||nj>=30) break;\n i = ni; j = nj; d = (d2+2)%4;\n }\n }\n }\n }\n }\n return res;\n}\n\nlong long calc_score(int tiles[][30]) {\n vector cys = get_cycles(tiles);\n if(cys.size() < 2) return 0;\n sort(cys.rbegin(), cys.rend());\n return cys[0] * cys[1];\n}\n\nint main() {\n for(int k=0; k<4;k++){\n for(int t=0;t<8;t++){\n int cur = t;\n for(int r=0; r> s;\n for(int j=0;j<30;j++){\n givenn[i][j] = s[j] - '0';\n }\n }\n srand(42);\n for(int i=0;i<30;i++) for(int j=0;j<30;j++){\n cur_rot[i][j] = rand() % 4;\n cur_tiles[i][j] = rotated_type[ cur_rot[i][j] ][ givenn[i][j] ];\n }\n long long cur_sc = calc_score(cur_tiles);\n long long best_sc = cur_sc;\n memcpy(best_rots, cur_rot, sizeof(cur_rot));\n const int MAX_ITER = 150000;\n double Tstart = 5000.0;\n double Tend = 0.1;\n double cool = pow(Tend / Tstart, 1.0/MAX_ITER);\n double Temp = Tstart;\n for(int it=0; it < MAX_ITER; it++){\n int i = rand()%30;\n int j = rand()%30;\n int oldr = cur_rot[i][j];\n int oldt = cur_tiles[i][j];\n int nr = rand() % 3;\n if(nr >= oldr) nr++;\n cur_rot[i][j] = nr;\n cur_tiles[i][j] = rotated_type[nr][givenn[i][j]];\n long long nsc = calc_score(cur_tiles);\n double del = (double)nsc - (double)cur_sc;\n bool acc = (del >= 0.0);\n if(!acc && Temp > 0.01){\n if( (rand() / (double)RAND_MAX) < exp(del / Temp) ) acc = true;\n }\n if(acc){\n cur_sc = nsc;\n }else{\n cur_rot[i][j] = oldr;\n cur_tiles[i][j] = oldt;\n }\n if(cur_sc > best_sc){\n best_sc = cur_sc;\n memcpy(best_rots , cur_rot, sizeof(cur_rot));\n }\n Temp *= cool;\n }\n for(int i=0;i<30;i++){\n for(int j=0;j<30;j++){\n cout << best_rots[i][j];\n }\n }\n cout << endl;\n return 0;\n}","ahc011":"#include \nusing namespace std;\n\nint get_largest_tree(vector> board, int ei, int ej, int N) {\n vector> visited(N, vector(N, false));\n visited[ei][ej] = true;\n int maxs = 0;\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n int bit_from[4] = {2, 8, 1, 4};\n int bit_to[4] = {8, 2, 4, 1};\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (visited[i][j]) continue;\n vector> comp;\n queue> q;\n q.push({i, j});\n visited[i][j] = true;\n comp.push_back({i, j});\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (int d = 0; d < 4; d++) {\n int nx = x + dx[d];\n int ny = y + dy[d];\n if (nx >= 0 && nx < N && ny >= 0 && ny < N && !visited[nx][ny]) {\n if ((board[x][y] & bit_from[d]) && (board[nx][ny] & bit_to[d])) {\n visited[nx][ny] = true;\n q.push({nx, ny});\n comp.push_back({nx, ny});\n }\n }\n }\n }\n int v = comp.size();\n if (v == 0) continue;\n int e = 0;\n vector> in_c(N, vector(N, false));\n for (auto p : comp) in_c[p.first][p.second] = true;\n for (auto [x, y] : comp) {\n if (y + 1 < N && in_c[x][y + 1] && (board[x][y] & 4) && (board[x][y + 1] & 1)) e++;\n if (x + 1 < N && in_c[x + 1][y] && (board[x][y] & 8) && (board[x + 1][y] & 2)) e++;\n }\n if (v == 1 || e == v - 1) {\n maxs = max(maxs, v);\n }\n }\n }\n return maxs;\n}\n\nint main() {\n int N, T;\n cin >> N >> T;\n vector> board(N, vector(N));\n int ei, ej;\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < N; j++) {\n char c = s[j];\n if (c >= '0' && c <= '9') board[i][j] = c - '0';\n else board[i][j] = 10 + (c - 'a');\n if (board[i][j] == 0) {\n ei = i;\n ej = j;\n }\n }\n }\n int maxv = N * N - 1;\n int best_s = get_largest_tree(board, ei, ej, N);\n string best_seq = \"\";\n int best_score = (best_s < maxv ? round(500000.0 * best_s / maxv) : 1000000);\n srand(42);\n char dchar[4] = {'U','D','L','R'};\n int dx[4] = {-1,1,0,0};\n int dy[4] = {0,0,-1,1};\n for(int trial = 0; trial < 5; trial++) {\n vector> cur_board = board;\n int cei = ei, cej = ej;\n string cur_seq = \"\";\n int cur_s = best_s;\n int last_d = -1;\n double temp = 30.0 - trial * 5;\n bool found_full = false;\n for(int step = 0; step < T / 5; step++) {\n if(cur_s == maxv) {\n found_full = true;\n break;\n }\n vector poss_d;\n for(int d = 0; d < 4; d++) {\n int ni = cei + dx[d];\n int nj = cej + dy[d];\n if(ni >= 0 && ni < N && nj >= 0 && nj < N) {\n int opp = (d <= 1 ? 1 - d : (d == 2 ? 3 : 2));\n if(last_d == opp) continue;\n poss_d.push_back(d);\n }\n }\n if(poss_d.empty()) break;\n int d = poss_d[rand() % poss_d.size()];\n int ni = cei + dx[d];\n int nj = cej + dy[d];\n int old_ei = cei, old_ej = cej;\n int moved_mask = cur_board[ni][nj];\n cur_board[old_ei][old_ej] = moved_mask;\n cur_board[ni][nj] = 0;\n cei = ni;\n cej = nj;\n cur_seq += dchar[d];\n int news = get_largest_tree(cur_board, cei, cej, N);\n int delta = news - cur_s;\n bool accept = (delta >= 0);\n if(!accept && temp > 0.0) {\n double prob = exp(delta / temp * 0.5);\n if((rand() * 1.0 / RAND_MAX) < prob) accept = true;\n }\n if(accept) {\n cur_s = news;\n last_d = d;\n int k = cur_seq.size();\n int sc = (cur_s < maxv ? round(500000.0 * cur_s / maxv) : round(500000.0 * (2.0 - k * 1.0 / T)));\n int best_sc = (best_s < maxv ? round(500000.0 * best_s / maxv) : round(500000.0 * (2.0 - best_seq.size() * 1.0 / T)));\n if(sc > best_sc) {\n best_s = cur_s;\n best_seq = cur_seq;\n best_score = sc;\n }\n if(cur_s == maxv && best_s < maxv) {\n best_s = maxv;\n best_seq = cur_seq;\n best_score = round(500000.0 * (2.0 - k * 1.0 / T));\n found_full = true;\n break;\n }\n } else {\n cur_board[cei][cej] = cur_board[old_ei][old_ej];\n cur_board[old_ei][old_ej] = 0;\n cei = old_ei;\n cej = old_ej;\n cur_seq.pop_back();\n }\n temp *= 0.99;\n }\n if(found_full) break;\n }\n cout << best_seq << endl;\n return 0;\n}","ahc012":"#include \nusing namespace std;\n\nbool on_line(long long px, long long py, long long qx, long long qy, const vector& X, const vector& Y, long long N) {\n long long vx = qx - px;\n long long vy = qy - py;\n for (int j = 0; j < N; j++) {\n long long ux = X[j] - px;\n long long uy = Y[j] - py;\n if (ux * vy - uy * vx == 0) {\n return true;\n }\n }\n return false;\n}\n\ndouble get_mid_ang(int gap, const vector& ord, const vector& angs, int N) {\n int i1 = ord[gap];\n int i2 = ord[(gap + 1) % N];\n double ang1 = angs[i1];\n double ang2 = angs[i2];\n if (ang2 < ang1 - 1e-9) ang2 += 2 * M_PI;\n return (ang1 + ang2) / 2.0;\n}\n\nint main() {\n int N, K;\n cin >> N >> K;\n vector a(11, 0);\n for (int i = 1; i <= 10; i++) cin >> a[i];\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector angs(N);\n for (int i = 0; i < N; i++) {\n angs[i] = atan2(Y[i], X[i]);\n if (angs[i] < 0) angs[i] += 2 * M_PI;\n }\n vector ord(N);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) { return angs[i] < angs[j]; });\n int best_m = -1;\n int best_s = -1;\n int num_pairs = 100;\n vector good_s;\n vector rem = a;\n for (int i = 0; i < num_pairs; i++) {\n for (int d = 1; d <= 10; d++) if (rem[d] > 0) {\n good_s.push_back(d);\n rem[d]--;\n break;\n }\n }\n for (int s = 0; s < N; s++) {\n vector main_cuts;\n main_cuts.push_back((s - 1 + N) % N);\n int curr = 0;\n for (int sz : good_s) {\n curr += sz;\n int after = (s + curr - 1 + N) % N;\n main_cuts.push_back(after);\n }\n vector> prs;\n for (int mg : main_cuts) {\n int og = (mg + N / 2) % N;\n prs.emplace_back(min(mg, og), max(mg, og));\n }\n set cutset;\n for (auto [m1, m2] : prs) {\n cutset.insert(m1);\n cutset.insert(m2);\n }\n vector cutlist(cutset.begin(), cutset.end());\n int nc = cutlist.size();\n vector psizes;\n for (int i = 0; i < nc; i++) {\n int from = cutlist[i];\n int to = cutlist[(i + 1) % nc];\n int ps = (to - from + N) % N;\n psizes.push_back(ps);\n }\n vector b(11, 0);\n for (int ps : psizes) if (ps >= 1 && ps <= 10) b[ps]++;\n int curm = 0;\n for (int d = 1; d <= 10; d++) curm += min(a[d], b[d]);\n if (curm > best_m) {\n best_m = curm;\n best_s = s;\n }\n }\n if (best_s == -1) best_s = 0;\n vector main_cuts;\n main_cuts.push_back((best_s - 1 + N) % N);\n int curr = 0;\n for (int sz : good_s) {\n curr += sz;\n int after = (best_s + curr - 1 + N) % N;\n main_cuts.push_back(after);\n }\n set> unique_pairs_set;\n for (int mg : main_cuts) {\n int og = (mg + N / 2) % N;\n unique_pairs_set.insert({min(mg, og), max(mg, og)});\n }\n vector> best_pairs(unique_pairs_set.begin(), unique_pairs_set.end());\n int k = best_pairs.size();\n if (k > 100) k = 100;\n cout << k << endl;\n for (int i = 0; i < k; i++) {\n auto [m, o] = best_pairs[i];\n double midang = get_mid_ang(m, ord, angs, N);\n double cx = cos(midang);\n double sy = sin(midang);\n long long px = round(cx * 1000000000.0);\n long long py = round(sy * 1000000000.0);\n long long qx = round(cos(midang + M_PI) * 1000000000.0);\n long long qy = round(sin(midang + M_PI) * 1000000000.0);\n int perturb = 0;\n while (on_line(px, py, qx, qy, X, Y, N) && perturb < 100) {\n qx += 123 + perturb * 7;\n qy += 456 + perturb * 11;\n perturb++;\n }\n if (px == qx && py == qy) {\n qx++;\n }\n cout << px << \" \" << py << \" \" << qx << \" \" << qy << endl;\n }\n return 0;\n}","ahc014":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> cur_dots;\n bool has_dot[65][65] = {};\n for(int i=0; i>x>>y;\n if(!has_dot[x][y]){\n has_dot[x][y]=true;\n cur_dots.emplace_back(x,y);\n }\n }\n bool hused[65][65]={};\n bool vused[65][65]={};\n bool dpused[65][65]={};\n bool dnused[65][65]={};\n int c = (N-1)/2;\n vector> cand;\n for(int x=0;x> ops;\n auto try_aa = [&](int px, int py) -> bool {\n if(has_dot[px][py]) return false;\n for(auto [ox,oy] : cur_dots){\n if(ox == px && oy == py) continue;\n int ax = ox, ay = py;\n int bx = px, by = oy;\n if(ax<0 || ax >=N || ay<0||ay>=N || bx<0||bx>=N||by<0||by>=N) continue;\n if(!has_dot[ax][ay] || !has_dot[bx][by]) continue;\n int xmin = min(px,ox), xmax=max(px,ox);\n int ymin = min(py,oy), ymax=max(py,oy);\n if(xmin==xmax || ymin == ymax) continue;\n bool val = true;\n for(int x=xmin; x bool {\n if(has_dot[px][py]) return false;\n int u1 = px + py;\n int v1 = px - py;\n for(auto [ox,oy]: cur_dots){\n int u2 = ox + oy;\n int v2 = ox - oy;\n if(abs(u2 - u1) < 2 || abs(v2 - v1) < 2) continue;\n if( (u2 - u1) % 2 != 0 || (v2 - v1) % 2 != 0 ) continue;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n if( (u1 + v2) % 2 !=0 || xb<0 || xb>=N || yb <0 || yb >=N ) continue;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n if( (u2 + v1)%2 !=0 || xc<0||xc>=N||yc<0||yc>=N) continue;\n if(!has_dot[xb][yb] || !has_dot[xc][yc]) continue;\n int umin = min(u1,u2), umax = max(u1,u2);\n int vmin = min(v1,v2), vmax = max(v1,v2);\n bool val = true;\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u1 + vv)/2; int yy=(u1 - vv)/2;\n if(xx<0||xx>=N || yy<0||yy>=N){val=false; continue;}\n bool corn = ((xx==px && yy==py) || (xx==xb && yy==yb) || (xx==ox && yy==oy) || (xx==xc && yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn ) val=false;\n }\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u2 + vv)/2; int yy=(u2 - vv)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy]&&!corn) val=false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v1)/2; int yy=(uu - v1)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n if(!val) continue;\n bool sval = true;\n for(int vv=vmin; vv < vmax; vv +=2){\n int xx = (u1 + vv)/2 ; int yy=(u1 - vv)/2;\n if(dnused[xx][yy]) sval=false;\n }\n for(int uu=umin; uu < umax; uu +=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(dpused[xx][yy]) sval = false;\n }\n for(int vv=vmin; vv\nusing namespace std;\n\nint main() {\n vector flav(100);\n for (int i = 0; i < 100; i++) cin >> flav[i];\n vector> grid(10, vector(10, 0));\n auto apply = [&](char d, auto& g) {\n if (d == 'F') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n for (int r = 0; r < 10; r++) g[r][c] = (r < (int)v.size() ? v[r] : 0);\n }\n } else if (d == 'B') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int r = 0; r < 10; r++) g[r][c] = (r >= 10 - sz ? v[r - (10 - sz)] : 0);\n }\n } else if (d == 'L') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n for (int c = 0; c < 10; c++) g[r][c] = (c < (int)v.size() ? v[c] : 0);\n }\n } else if (d == 'R') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int c = 0; c < 10; c++) g[r][c] = (c >= 10 - sz ? v[c - (10 - sz)] : 0);\n }\n }\n };\n auto get_score = [&](auto& g) -> long long {\n vector> vis(10, vector(10, false));\n long long res = 0;\n for (int i = 0; i < 10; i++) {\n for (int j = 0; j < 10; j++) {\n if (g[i][j] && !vis[i][j]) {\n int f = g[i][j];\n int sz = 0;\n stack> st;\n st.push({i, j});\n vis[i][j] = true;\n while (!st.empty()) {\n auto [x, y] = st.top(); st.pop();\n sz++;\n int dx[4] = {-1, 0, 1, 0};\n int dy[4] = {0, 1, 0, -1};\n for (int k = 0; k < 4; k++) {\n int nx = x + dx[k], ny = y + dy[k];\n if (nx >= 0 && nx < 10 && ny >= 0 && ny < 10 && !vis[nx][ny] && g[nx][ny] == f) {\n vis[nx][ny] = true;\n st.push({nx, ny});\n }\n }\n }\n res += 1LL * sz * sz;\n }\n }\n }\n return res;\n };\n for (int t = 0; t < 100; t++) {\n int p;\n cin >> p;\n int cnt = 0;\n int pr = -1, pc = -1;\n for (int r = 0; r < 10; r++) {\n bool found = false;\n for (int c = 0; c < 10; c++) if (grid[r][c] == 0) {\n cnt++;\n if (cnt == p) {\n pr = r; pc = c;\n found = true;\n break;\n }\n }\n if (found) break;\n }\n grid[pr][pc] = flav[t];\n if (t == 99) break;\n string dirs = \"FBLR\";\n long long best_score = -1;\n char best_d = 'F';\n for (char d : dirs) {\n auto temp = grid;\n apply(d, temp);\n long long sc = get_score(temp);\n if (sc > best_score) {\n best_score = sc;\n best_d = d;\n }\n }\n cout << best_d << endl;\n cout.flush();\n apply(best_d, grid);\n }\n}","ahc016":"#include \nusing namespace std;\n\nint calc_pos(int u, int v, int n) {\n if (u > v) swap(u, v);\n return u * (2 * n - u - 1) / 2 + (v - u - 1);\n}\n\ndouble compute_exp_e(const string& gs, double eps) {\n double res = 0.0;\n for (char c : gs) {\n res += (c == '1' ? (1 - eps) : eps);\n }\n return res;\n}\n\ndouble compute_exp_t(const string& gs, int n, double eps) {\n double sum_p = 0.0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n int p1 = calc_pos(a, b, n);\n int p2 = calc_pos(a, c, n);\n int p3 = calc_pos(b, c, n);\n double pa = (gs[p1] == '1' ? (1 - eps) : eps);\n double pb = (gs[p2] == '1' ? (1 - eps) : eps);\n double pc = (gs[p3] == '1' ? (1 - eps) : eps);\n sum_p += pa * pb * pc;\n }\n }\n }\n return sum_p;\n}\n\nlong long compute_t(const string& hs, int n) {\n long long tri = 0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n if (hs[calc_pos(a, b, n)] == '1' &&\n hs[calc_pos(a, c, n)] == '1' &&\n hs[calc_pos(b, c, n)] == '1') tri++;\n }\n }\n }\n return tri;\n}\n\nint main() {\n int M;\n double eps;\n cin >> M >> eps;\n int N = 4;\n if (eps < 1e-9) {\n while (N * (N - 1LL) / 2 < M - 1) N++;\n N = min(N, 100);\n } else {\n double best_sc = -1.0;\n int best_n = 4;\n for (int nn = 4; nn <= 100; nn++) {\n long long p = (long long)nn * (nn - 1) / 2;\n double sd = sqrt(p * 0.25);\n double del = p * 1.0 / max(1, M - 1);\n double delm = del * fabs(1 - 2 * eps);\n double sigma = max(sd, 1e-9);\n double zscore = (delm / 2.0) / sigma;\n double perr = erfc(zscore / sqrt(2.0));\n if (M <= 2) perr /= 2.0;\n if (zscore > 6) perr = 0.0;\n double e_app = 100.0 * min(1.0, perr);\n double sc = pow(0.9, e_app) / nn;\n if (sc > best_sc) {\n best_sc = sc;\n best_n = nn;\n }\n }\n N = best_n;\n }\n long long P = (long long)N * (N - 1) / 2;\n vector Gs(M);\n vector targ_e(M), targ_t(M);\n for (int k = 0; k < M; k++) {\n long long ek = (M == 1 ? P / 2 : round(k * P * 1.0 / (M - 1.0)));\n string s(P, '0');\n if (k % 2 == 0 || M == 1) {\n for (long long i = 0; i < ek; i++) if (i < P) s[i] = '1';\n } else {\n vector pr(P);\n for (int i = 0; i < P; i++) pr[i] = i;\n auto rngv = [&](int x) {\n return ((long long)x * 97LL ^ (long long)k * 1234567LL) % 1000000009LL;\n };\n sort(pr.begin(), pr.end(), [&](int x, int y) { return rngv(x) < rngv(y); });\n for (long long i = 0; i < ek; i++) if (i < P) s[pr[i]] = '1';\n }\n Gs[k] = s;\n targ_e[k] = compute_exp_e(s, eps);\n targ_t[k] = compute_exp_t(s, N, eps);\n }\n cout << N << endl;\n for (auto& s : Gs) cout << s << endl;\n cout.flush();\n for (int q = 0; q < 100; q++) {\n string h;\n cin >> h;\n int obse = 0;\n for (char c : h) if (c == '1') obse++;\n long long obst = compute_t(h, N);\n int bestk = 0;\n double bestd = 1e18;\n double sigma_e = sqrt(P * 0.25);\n double sigma_t_scale = N * 5.0;\n for (int k = 0; k < M; k++) {\n double de = obse - targ_e[k];\n double dt = obst - targ_t[k];\n double dist = (de * de) / (sigma_e * sigma_e + 1e-9) + (dt * dt) / (sigma_t_scale * sigma_t_scale + 1e-9);\n if (dist < bestd) {\n bestd = dist;\n bestk = k;\n }\n }\n cout << bestk << endl;\n cout.flush();\n }\n return 0;\n}","ahc017":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, M, D, K;\n cin >> N >> M >> D >> K;\n vector U(M), V(M), W(M);\n vector>> adj(N);\n for (int i = 0; i < M; i++) {\n cin >> U[i] >> V[i] >> W[i];\n U[i]--; V[i]--;\n adj[U[i]].emplace_back(V[i], W[i], i);\n adj[V[i]].emplace_back(U[i], W[i], i);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n mt19937 rng(123456789LL);\n int NUM_SAMPLES = 25;\n if (N <= 600) NUM_SAMPLES = 40;\n vector sources;\n vector perm(N);\n iota(perm.begin(), perm.end(), 0);\n shuffle(perm.begin(), perm.end(), rng);\n for (int i = 0; i < min(NUM_SAMPLES, N); i++) sources.push_back(perm[i]);\n vector rday(M);\n vector cnt(D + 1, 0);\n vector edgeord(M);\n iota(edgeord.begin(), edgeord.end(), 0);\n shuffle(edgeord.begin(), edgeord.end(), rng);\n for (int i = 0; i < M; i++) {\n int d = (i % D) + 1;\n rday[edgeord[i]] = d;\n cnt[d]++;\n }\n auto get_sum = [&](int day, const vector& rdays) -> ll {\n ll sm = 0;\n for (int s : sources) {\n vector dist(N, 4000000000000000000LL);\n dist[s] = 0;\n priority_queue, vector>, greater>> pq;\n pq.emplace(0, s);\n while (!pq.empty()) {\n auto [c, u] = pq.top(); pq.pop();\n if (c > dist[u]) continue;\n for (auto [v, w, e] : adj[u]) {\n if (rdays[e] == day) continue;\n ll nc = c + w;\n if (nc < dist[v]) {\n dist[v] = nc;\n pq.emplace(nc, v);\n }\n }\n }\n for (int j = 0; j < N; j++) {\n if (j == s) continue;\n ll dd = (dist[j] > 2000000000000000000LL ? 1000000000LL : dist[j]);\n sm += dd;\n }\n }\n return sm;\n };\n auto start_time = chrono::steady_clock::now();\n auto elapsed = [&]() {\n return chrono::duration(chrono::steady_clock::now() - start_time).count();\n };\n ll current_proxy = 0;\n for (int d = 1; d <= D; d++) {\n current_proxy += get_sum(d, rday);\n }\n ll total_delta_abs = 0;\n int cnt_sample = 0;\n uniform_int_distribution rnd_e(0, M - 1);\n uniform_int_distribution rnd_d(1, D);\n uniform_real_distribution rnd_real(0.0, 1.0);\n for (int tryy = 0; tryy < 300; tryy++) {\n if (elapsed() > 0.3) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n total_delta_abs += abs(del);\n cnt_sample++;\n if (cnt_sample >= 30) break;\n }\n double T = 1e10;\n if (cnt_sample > 0) {\n double avg = (double)total_delta_abs / cnt_sample;\n T = avg * 20.0;\n if (T < 1e8) T = 1e8;\n }\n double cool_rate = 0.999;\n double TL = 5.7;\n int it = 0;\n while (true) {\n it++;\n if (it % 20 == 0 && elapsed() > TL) break;\n if (T < 1.0 && it > 1000 && elapsed() > 2.0) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n bool accept = false;\n if (del < 0) accept = true;\n else {\n double prob = exp(-del / T);\n if (prob > rnd_real(rng)) accept = true;\n }\n if (accept) {\n rday[e] = nd;\n cnt[od]--;\n cnt[nd]++;\n current_proxy += del;\n }\n T *= cool_rate;\n }\n for (int i = 0; i < M; i++) {\n cout << rday[i];\n if (i + 1 < M) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc019":"#include \nusing namespace std;\n\nint main() {\n int D;\n cin >> D;\n vector F[2], R[2];\n for (int i = 0; i < 2; i++) {\n F[i].resize(D);\n for (int k = 0; k < D; k++) {\n cin >> F[i][k];\n }\n R[i].resize(D);\n for (int k = 0; k < D; k++) {\n cin >> R[i][k];\n }\n }\n vector> placed[2];\n for (int i = 0; i < 2; i++) {\n for (int z = 0; z < D; z++) {\n vector Xs, Ys;\n for (int x = 0; x < D; x++) {\n if (F[i][z][x] == '1') Xs.push_back(x);\n }\n for (int y = 0; y < D; y++) {\n if (R[i][z][y] == '1') Ys.push_back(y);\n }\n int nf = Xs.size();\n int nr = Ys.size();\n if (nf >= nr) {\n for (int j = 0; j < nr; j++) {\n placed[i].emplace_back(Xs[j], Ys[j], z);\n }\n for (int j = 0; j < nf - nr; j++) {\n placed[i].emplace_back(Xs[nr + j], Ys[0], z);\n }\n } else {\n for (int j = 0; j < nf; j++) {\n placed[i].emplace_back(Xs[j], Ys[j], z);\n }\n for (int j = 0; j < nr - nf; j++) {\n placed[i].emplace_back(Xs[0], Ys[nf + j], z);\n }\n }\n }\n }\n int s0 = placed[0].size();\n int s1 = placed[1].size();\n int c = min(s0, s1);\n int only0 = s0 - c;\n int only1 = s1 - c;\n int n = c + only0 + only1;\n vector blk0(s0), blk1(s1);\n for (int k = 0; k < s0; k++) {\n if (k < c) {\n blk0[k] = k + 1;\n } else {\n blk0[k] = c + (k - c) + 1;\n }\n }\n for (int k = 0; k < s1; k++) {\n if (k < c) {\n blk1[k] = k + 1;\n } else {\n blk1[k] = c + only0 + (k - c) + 1;\n }\n }\n int DD = D * D * D;\n vector B0(DD, 0), B1(DD, 0);\n for (int k = 0; k < s0; k++) {\n auto [x, y, z] = placed[0][k];\n int pos = x * (D * D) + y * D + z;\n B0[pos] = blk0[k];\n }\n for (int k = 0; k < s1; k++) {\n auto [x, y, z] = placed[1][k];\n int pos = x * (D * D) + y * D + z;\n B1[pos] = blk1[k];\n }\n cout << n << endl;\n for (int v : B0) cout << v << \" \";\n cout << endl;\n for (int v : B1) cout << v << \" \";\n cout << endl;\n return 0;\n}","ahc020":"#include \nusing namespace std;\nusing ll = long long;\n\nll get_p_from_dd(ll dd) {\n if (dd == 0) return 0;\n ll p = (ll)sqrtl(dd);\n if (p * p >= dd) return p;\n return p + 1;\n}\n\nint main() {\n int N, M, K;\n cin >> N >> M >> K;\n vector X(N+1), Y(N+1);\n for(int i = 1; i <= N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector eu(M), ev(M);\n vector ew(M);\n vector> krus;\n for(int j = 0; j < M; j++) {\n cin >> eu[j] >> ev[j] >> ew[j];\n krus.emplace_back(ew[j], eu[j], ev[j], j);\n }\n vector Ra(K), Rb(K);\n for(int k = 0; k < K; k++) {\n cin >> Ra[k] >> Rb[k];\n }\n vector> dds(N+1, vector(K));\n for(int i=1; i<=N; i++) {\n for(int k=0; k necessary(N+1, false);\n for(int k=0; k upar(N+1);\n for(int i=1;i<=N;i++) upar[i] = i;\n auto ufind = [&](auto self, int x) -> int {\n return upar[x]==x ? x : (upar[x] = self(self, upar[x]));\n };\n auto uunite = [&](int x,int y) {\n upar[ufind(ufind,x)] = ufind(ufind,y);\n };\n sort(krus.begin(), krus.end());\n vector>> adj(N+1);\n for(auto [ww,uu,vv,jj] : krus) {\n if(ufind(ufind,uu) != ufind(ufind,vv)) {\n uunite(uu,vv);\n adj[uu].emplace_back(vv, jj);\n adj[vv].emplace_back(uu, jj);\n }\n }\n auto eval_func = [&](vector trms) -> tuple, vector> {\n vector usd2(M,false);\n vector rch2(N+1, false);\n vector terms2(N+1, false);\n for(int i=1;i<=N;i++) terms2[i]=trms[i];\n auto dfs2 = [&](auto slf, int nd, int pr, int pe) -> int {\n int ct = terms2[nd]?1:0;\n bool hs = terms2[nd];\n for(auto [too,eidd] : adj[nd]) if(too != pr){\n int ss = slf(slf, too, nd, eidd);\n ct += ss;\n if(ss>0){\n usd2[eidd] = true;\n hs = true;\n }\n }\n if(hs) rch2[nd]=true;\n return ct;\n };\n dfs2(dfs2,1,-1,-1);\n rch2[1]=true;\n vector mdd(N+1,0);\n bool covers = true;\n for(int k=0;k 25000000LL) covers = false;\n mdd[bb] = max(mdd[bb], minndd);\n }\n ll cov=0;\n vector pp(N+1,0);\n for(int i=1;i<=N;i++)if(mdd[i]>0){\n ll pv = get_p_from_dd(mdd[i]);\n if(pv >5000) covers=false;\n cov += pv * pv;\n pp[i] = (int)pv;\n }\n ll edg =0;\n vector bbv(M,0);\n for(int j=0;j cur_t(N+1, false);\n for(int i=1;i<=N;i++) if(necessary[i]) cur_t[i] = true;\n auto current = eval_func(cur_t);\n ll current_cost; vector current_p, current_b;\n tie(current_cost, current_p, current_b) = current;\n ll global_best_cost = current_cost;\n vector global_best_p = current_p;\n vector global_best_b = current_b;\n bool updated = true;\n int iterations = 0;\n while(updated && iterations < 100){\n updated = false;\n iterations++;\n ll best_delta = 0;\n int to_rem = -1;\n vector bestp_this, bestb_this;\n for(int cand=1; cand<=N; cand++) if(cur_t[cand]){\n vector tm = cur_t;\n tm[cand] = false;\n auto res = eval_func(tm);\n ll this_cost; vector thisp, thisb;\n tie(this_cost, thisp, thisb) = res;\n if(this_cost < current_cost){\n if(current_cost - this_cost > best_delta){\n best_delta = current_cost - this_cost;\n to_rem = cand;\n bestp_this = thisp;\n bestb_this = thisb;\n }\n }\n }\n if(to_rem != -1){\n updated = true;\n cur_t[to_rem] = false;\n current_cost -= best_delta;\n current_p = bestp_this;\n current_b = bestb_this;\n if(current_cost < global_best_cost){\n global_best_cost = current_cost;\n global_best_p = current_p;\n global_best_b = current_b;\n }\n }\n }\n for(int i=1;i<=N;i++) {\n cout << global_best_p[i];\n if(i\nusing namespace std;\n\nconst int N = 30;\nconst int MAXP = 470;\nint grid[N][N];\npair pos_of[MAXP];\nint low[N + 1];\n\nvector> get_nei(int x, int y) {\n vector> r;\n if (y > 0) r.emplace_back(x, y - 1);\n if (y < x) r.emplace_back(x, y + 1);\n if (x > 0) {\n if (y <= x - 1) r.emplace_back(x - 1, y);\n if (y - 1 >= 0 && (y - 1) <= (x - 1)) r.emplace_back(x - 1, y - 1);\n }\n if (x < N - 1) {\n r.emplace_back(x + 1, y);\n r.emplace_back(x + 1, y + 1);\n }\n return r;\n}\n\nint main() {\n low[0] = 0;\n for (int i = 0; i < N; i++) {\n low[i + 1] = low[i] + i + 1;\n }\n for (int x = 0; x < N; x++) {\n for (int y = 0; y <= x; y++) {\n cin >> grid[x][y];\n pos_of[grid[x][y]] = {x, y};\n }\n }\n vector> ops;\n for (int rx = 0; rx < N - 1; rx++) {\n int tlow = low[rx];\n int thigh = low[rx + 1];\n while (true) {\n vector> bads;\n for (int y = 0; y <= rx; y++) {\n int numm = grid[rx][y];\n if (numm < tlow || numm >= thigh) {\n bads.emplace_back(rx, y);\n }\n }\n if (bads.empty()) break;\n vector> goods;\n for (int k = tlow; k < thigh; k++) {\n auto p = pos_of[k];\n if (p.first > rx) {\n goods.push_back(p);\n }\n }\n if (goods.empty()) break;\n int dists[N][N];\n pair pars[N][N];\n for (int i = 0; i < N; i++)\n for (int j = 0; j < N; j++) {\n dists[i][j] = -1;\n pars[i][j] = {-1, -1};\n }\n queue> qq;\n bool isbad[N][N] = {};\n for (auto p : bads) {\n isbad[p.first][p.second] = true;\n }\n for (auto g : goods) {\n int gx = g.first, gy = g.second;\n if (gx < N && gy < N) {\n dists[gx][gy] = 0;\n pars[gx][gy] = {-2, -2};\n qq.push(g);\n }\n }\n while (!qq.empty()) {\n auto [cx, cy] = qq.front();\n qq.pop();\n for (auto [nx, ny] : get_nei(cx, cy)) {\n if (nx < rx) continue;\n if (nx >= N || ny < 0 || ny > nx) continue;\n bool allwd = (nx > rx) || (nx == rx && isbad[nx][ny]);\n if (allwd && dists[nx][ny] == -1) {\n dists[nx][ny] = dists[cx][cy] + 1;\n pars[nx][ny] = {cx, cy};\n qq.push({nx, ny});\n }\n }\n }\n int md = INT_MAX / 2;\n pair cbad = {-1, -1};\n for (auto bd : bads) {\n int dd = dists[bd.first][bd.second];\n if (dd > 0 && dd < md) {\n md = dd;\n cbad = bd;\n }\n }\n if (cbad.first == -1) {\n break;\n }\n vector> pth;\n auto curr = cbad;\n while (curr.first != -1) {\n pth.push_back(curr);\n auto pr = pars[curr.first][curr.second];\n if (pr.first == -2) break;\n curr = pr;\n }\n reverse(pth.begin(), pth.end());\n for (size_t i = 0; i + 1 < pth.size(); ++i) {\n auto [x1, y1] = pth[i];\n auto [x2, y2] = pth[i + 1];\n ops.push_back({x1, y1, x2, y2});\n int n1 = grid[x1][y1], n2 = grid[x2][y2];\n grid[x1][y1] = n2;\n grid[x2][y2] = n1;\n pos_of[n1] = {x2, y2};\n pos_of[n2] = {x1, y1};\n }\n }\n }\n cout << ops.size() << endl;\n for (auto& ar : ops) {\n cout << ar[0] << \" \" << ar[1] << \" \" << ar[2] << \" \" << ar[3] << endl;\n }\n return 0;\n}","toyota2023summer-final":"#include \nusing namespace std;\n\nint main() {\n int D, N;\n cin >> D >> N;\n bool is_obst[9][9];\n memset(is_obst, 0, sizeof(is_obst));\n for (int i = 0; i < N; i++) {\n int r, c;\n cin >> r >> c;\n is_obst[r][c] = true;\n }\n int er = 0, ec = 4;\n int dr[4] = {-1, 0, 1, 0};\n int dc[4] = {0, 1, 0, -1};\n vector> positions;\n for (int r = 0; r < D; r++) {\n for (int c = 0; c < D; c++) {\n if (!is_obst[r][c] && !(r == er && c == ec)) {\n positions.emplace_back(r, c);\n }\n }\n }\n int MM = positions.size();\n bool assigned[81] = {false};\n int pos_label[9][9];\n memset(pos_label, -1, sizeof(pos_label));\n bool has_cont[9][9] = {false};\n auto get_reach_and_dist = [&](bool temp_used = false) {\n vector> vis(D, vector(D, false));\n vector> ddis(D, vector(D, -1));\n queue> q;\n if (!is_obst[er][ec] && (!has_cont[er][ec] || temp_used)) {\n q.emplace(er, ec);\n vis[er][ec] = true;\n ddis[er][ec] = 0;\n }\n while (!q.empty()) {\n auto [r, c] = q.front();\n q.pop();\n for (int k = 0; k < 4; k++) {\n int nr = r + dr[k], nc = c + dc[k];\n if (nr >= 0 && nr < D && nc >= 0 && nc < D && !is_obst[nr][nc] &&\n !vis[nr][nc] && !has_cont[nr][nc]) {\n vis[nr][nc] = true;\n ddis[nr][nc] = ddis[r][c] + 1;\n q.emplace(nr, nc);\n }\n }\n }\n return make_pair(vis, ddis);\n };\n for (int step = 0; step < MM; step++) {\n int t;\n cin >> t;\n int rank = 0;\n for (int l = 0; l < MM; l++) {\n if (!assigned[l] && l < t) rank++;\n }\n auto [vis, ddis] = get_reach_and_dist();\n vector> cands;\n for (auto p : positions) {\n int r = p.first, c = p.second;\n if (!has_cont[r][c] && vis[r][c]) {\n cands.push_back(p);\n }\n }\n vector> safes;\n int num_cur = cands.size();\n for (auto p : cands) {\n int r = p.first, c = p.second;\n has_cont[r][c] = true;\n auto [vis2, _] = get_reach_and_dist(true);\n has_cont[r][c] = false;\n int cnt = 0;\n for (auto posi : positions) {\n int rr = posi.first, cc = posi.second;\n if (!has_cont[rr][cc] && vis2[rr][cc]) cnt++;\n }\n if (cnt == num_cur - 1) {\n safes.push_back(p);\n }\n }\n if (safes.empty()) {\n safes = cands;\n }\n sort(safes.begin(), safes.end(), [&](const pair& a, const pair& b) {\n int da = ddis[a.first][a.second];\n int db = ddis[b.first][b.second];\n if (da != db) return da < db;\n if (a.first != b.first) return a.first < b.first;\n return a.second < b.second;\n });\n int chosen_idx = rank;\n if (chosen_idx >= (int)safes.size()) chosen_idx = (int)safes.size() - 1;\n if (safes.empty()) {\n if (!cands.empty()) {\n safes = cands;\n chosen_idx = 0;\n } else {\n continue;\n }\n }\n auto [pi, pj] = safes[chosen_idx];\n cout << pi << \" \" << pj << endl;\n pos_label[pi][pj] = t;\n has_cont[pi][pj] = true;\n assigned[t] = true;\n }\n vector> order;\n int remain = MM;\n while (remain > 0) {\n auto [vis, ddis] = get_reach_and_dist();\n set> accs;\n for (int i = 0; i < D; i++) {\n for (int j = 0; j < D; j++) {\n if (vis[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && has_cont[ni][nj] &&\n !is_obst[ni][nj]) {\n accs.insert({ni, nj});\n }\n }\n }\n }\n }\n if (accs.empty()) {\n break;\n }\n int minl = INT_MAX;\n pair bp = {-1, -1};\n for (auto p : accs) {\n int l = pos_label[p.first][p.second];\n if (l < minl) {\n minl = l;\n bp = p;\n }\n }\n if (bp.first == -1) break;\n order.push_back(bp);\n has_cont[bp.first][bp.second] = false;\n remain--;\n }\n for (auto [i, j] : order) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc024":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> C(n, vector(n));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> C[i][j];\n auto adj_mat = vector>(m + 1, vector(m + 1, false));\n auto mark_bdry = [&](int i, int j) {\n int c = C[i][j];\n adj_mat[c][0] = adj_mat[0][c] = true;\n };\n for (int j = 0; j < n; j++) {\n mark_bdry(0, j);\n mark_bdry(n - 1, j);\n }\n for (int i = 0; i < n; i++) {\n mark_bdry(i, 0);\n mark_bdry(i, n - 1);\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int c = C[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = C[ni][nj];\n if (c != d) {\n adj_mat[c][d] = adj_mat[d][c] = true;\n }\n }\n }\n }\n }\n vector bdry_wit(m + 1, -1);\n for (int j = 0; j < n; j++) {\n int c = C[0][j];\n if (bdry_wit[c] == -1) bdry_wit[c] = 0 * n + j;\n c = C[n - 1][j];\n if (bdry_wit[c] == -1) bdry_wit[c] = (n - 1) * n + j;\n }\n for (int i = 0; i < n; i++) {\n int c = C[i][0];\n if (bdry_wit[c] == -1) bdry_wit[c] = i * n + 0;\n c = C[i][n - 1];\n if (bdry_wit[c] == -1) bdry_wit[c] = i * n + (n - 1);\n }\n vector> witness_cell(m + 1, vector(m + 1, -1));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = C[i][j]; int p = i * n + j;\n for (auto [di, dj] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int d = C[ni][nj];\n if (c != d && witness_cell[c][d] == -1) {\n witness_cell[c][d] = p;\n witness_cell[d][c] = ni * n + nj;\n }\n }\n }\n }\n vector> terms(m + 1);\n for (int c = 1; c <= m; c++) {\n if (adj_mat[c][0] && bdry_wit[c] != -1) {\n terms[c].insert(bdry_wit[c]);\n }\n for (int d = 1; d <= m; d++) {\n if (adj_mat[c][d] && witness_cell[c][d] != -1) {\n terms[c].insert(witness_cell[c][d]);\n }\n }\n }\n for (int c = 1; c <= m; c++) {\n if (!adj_mat[c][0]) {\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n if (C[i][j] == c) {\n terms[c].insert(i * n + j);\n }\n }\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (C[i][j] == c) {\n for (auto [di, dj] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int dc = C[ni][nj];\n if (dc != c) {\n terms[dc].insert(ni * n + nj);\n }\n }\n }\n }\n }\n }\n vector> newm(n, vector(n, 0));\n for (int c = 1; c <= m; c++) {\n auto& tset = terms[c];\n if (tset.empty()) {\n for (int i = 0; i < n; i++) {\n bool found = false;\n for (int j = 0; j < n; j++) if (C[i][j] == c) {\n tset.insert(i * n + j);\n found = true;\n break;\n }\n if (found) break;\n }\n }\n vector termv(tset.begin(), tset.end());\n if (termv.empty()) continue;\n if (!adj_mat[c][0] && !tset.empty()) {\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (C[i][j] == c) newm[i][j] = c;\n continue;\n }\n unordered_set remain;\n for (int p : termv) remain.insert(p);\n int first = termv[0];\n remain.erase(first);\n unordered_set trec{first};\n while (!remain.empty()) {\n vector par(n * n, -1);\n vector vis(n * n, false);\n queue q;\n for (int p : trec) {\n vis[p] = true;\n par[p] = -2;\n q.push(p);\n }\n int found_t = -1;\n while (!q.empty() && found_t == -1) {\n int u = q.front(); q.pop();\n int ux = u / n, uy = u % n;\n for (auto [dx, dy] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int nx = ux + dx, ny = uy + dy;\n if (nx < 0 || nx >= n || ny < 0 || ny >= n) continue;\n int v = nx * n + ny;\n if (vis[v] || C[nx][ny] != c) continue;\n vis[v] = true;\n par[v] = u;\n q.push(v);\n if (remain.count(v)) {\n found_t = v;\n break;\n }\n }\n }\n if (found_t == -1) {\n break;\n }\n int at = found_t;\n while (par[at] != -2) {\n trec.insert(at);\n remain.erase(at);\n at = par[at];\n }\n trec.insert(at);\n remain.erase(found_t);\n }\n for (int p : trec) {\n int x = p / n, y = p % n;\n newm[x][y] = c;\n }\n }\n auto new_adj = vector>(m + 1, vector(m + 1, false));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = newm[ni][nj];\n if (c != d) {\n new_adj[c][d] = new_adj[d][c] = true;\n }\n }\n }\n }\n auto mark_bdry_new = [&](int i, int j) {\n int c = newm[i][j];\n new_adj[c][0] = new_adj[0][c] = true;\n };\n for (int j = 0; j < n; j++) {\n if (newm[0][j] != 0) mark_bdry_new(0, j);\n if (newm[n - 1][j] != 0) mark_bdry_new(n - 1, j);\n }\n for (int i = 0; i < n; i++) {\n if (newm[i][0] != 0) mark_bdry_new(i, 0);\n if (newm[i][n - 1] != 0) mark_bdry_new(i, n - 1);\n }\n bool adj_ok = true;\n for (int c = 0; c <= m; c++) for (int d = 0; d <= m; d++) {\n if (adj_mat[c][d] != new_adj[c][d]) adj_ok = false;\n }\n bool conn_ok = true;\n for (int c = 1; c <= m && conn_ok; c++) {\n vector> pos;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == c) pos.emplace_back(i, j);\n if (pos.empty()) {\n conn_ok = false;\n continue;\n }\n vector> vis(n, vector(n, false));\n queue> qq;\n auto st = pos[0];\n qq.push(st);\n vis[st.first][st.second] = true;\n int cnt = 1;\n while (!qq.empty()) {\n auto [x, y] = qq.front(); qq.pop();\n for (auto [dx, dy] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == c) {\n vis[nx][ny] = true;\n qq.push({nx, ny});\n cnt++;\n }\n }\n }\n if (cnt != (int)pos.size()) conn_ok = false;\n }\n if (conn_ok) {\n vector> zeros;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == 0) zeros.emplace_back(i, j);\n if (!zeros.empty()) {\n vector> vis(n, vector(n, false));\n queue> qq;\n int cnt = 0;\n for (auto [i, j] : zeros) {\n if ((i == 0 || i == n - 1 || j == 0 || j == n - 1) && !vis[i][j]) {\n vis[i][j] = true;\n qq.push({i, j});\n cnt++;\n }\n }\n while (!qq.empty()) {\n auto [x, y] = qq.front(); qq.pop();\n for (auto [dx, dy] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == 0) {\n vis[nx][ny] = true;\n qq.push({nx, ny});\n cnt++;\n }\n }\n }\n if (cnt != (int)zeros.size()) conn_ok = false;\n }\n }\n if (!adj_ok || !conn_ok) {\n newm = C;\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cout << newm[i][j];\n if (j < n - 1) cout << \" \";\n }\n cout << endl;\n }\n}","ahc025":"#include \nusing namespace std;\n\nint main() {\n int N, D, Q;\n cin >> N >> D >> Q;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n uniform_real_distribution uni(0.0, 1.0);\n vector score(N, 0);\n double avg_size = 3.0;\n double p = avg_size / N;\n for (int q = 0; q < Q; q++) {\n vector L, R;\n do {\n L.clear();\n R.clear();\n for (int i = 0; i < N; i++) {\n double r = uni(rng);\n if (r < p) L.push_back(i);\n else if (r < 2 * p) R.push_back(i);\n }\n if (L.empty()) {\n int add = rng() % N;\n bool inR = false;\n for (int x : R) if (x == add) inR = true;\n if (!inR) L.push_back(add);\n else L.push_back((add + 1) % N);\n }\n if (R.empty()) {\n int add = rng() % N;\n bool inL = false;\n for (int x : L) if (x == add) inL = true;\n if (!inL) R.push_back(add);\n else R.push_back((add + 1) % N);\n }\n } while (L.empty() || R.empty() || (L.size() + R.size() == 0));\n // remove possible dups (though shouldn't)\n sort(L.begin(), L.end());\n sort(R.begin(), R.end());\n auto it = unique(L.begin(), L.end());\n L.resize(it - L.begin());\n it = unique(R.begin(), R.end());\n R.resize(it - R.begin());\n bool overlap = false;\n for (int x : L) {\n for (int y : R) if (x == y) overlap = true;\n }\n if (overlap || L.empty() || R.empty()) {\n // fallback to 1vs1\n L.clear(); R.clear();\n int a = rng() % N;\n int b = rng() % N;\n while (b == a) b = rng() % N;\n L.push_back(a);\n R.push_back(b);\n }\n cout << L.size() << \" \" << R.size();\n for (int x : L) cout << \" \" << x;\n for (int x : R) cout << \" \" << x;\n cout << endl;\n string res;\n cin >> res;\n int sgn = 0;\n if (res == \">\") sgn = 1;\n else if (res == \"<\") sgn = -1;\n for (int x : L) score[x] += sgn;\n for (int x : R) score[x] -= sgn;\n }\n long long minw = LLONG_MAX;\n for (auto x : score) minw = min(minw, x);\n for (auto &x : score) x = x - minw + 1;\n vector> items;\n for (int i = 0; i < N; i++) {\n items.emplace_back(score[i], i);\n }\n sort(items.rbegin(), items.rend());\n vector group_sums(D, 0);\n vector group_id(N, 0);\n for (auto &pr : items) {\n int id = pr.second;\n int best = 0;\n for (int g = 1; g < D; g++) {\n if (group_sums[g] < group_sums[best]) best = g;\n }\n group_id[id] = best;\n group_sums[best] += pr.first;\n }\n for (int i = 0; i < N; i++) {\n if (i > 0) cout << \" \";\n cout << group_id[i];\n }\n cout << endl;\n return 0;\n}","ahc026":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> st(m);\n for (int i = 0; i < m; i++) {\n st[i].resize(n / m);\n for (int j = 0; j < n / m; j++) {\n cin >> st[i][j];\n }\n }\n vector> ops;\n int cur = 1;\n auto get_top = [&](int s) -> int {\n if (st[s].empty()) return n + 1;\n return st[s].back();\n };\n auto can_extract = [&]() -> bool {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) return true;\n }\n return false;\n };\n auto find_pos = [&](int v) -> pair {\n for (int s = 0; s < m; s++) {\n for (int h = 0; h < (int)st[s].size(); h++) {\n if (st[s][h] == v) return {s, h};\n }\n }\n return {-1, -1};\n };\n while (cur <= n) {\n if (can_extract()) {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) {\n ops.emplace_back(cur, 0);\n st[s].pop_back();\n cur++;\n break;\n }\n }\n continue;\n }\n auto [s, h] = find_pos(cur);\n assert(h != -1);\n assert(h + 1 < (int)st[s].size());\n int first_above = st[s][h + 1];\n int best_dest = -1;\n int best_tp = -1;\n for (int d = 0; d < m; d++) {\n if (d == s) continue;\n int tp = get_top(d);\n if (tp > best_tp) {\n best_tp = tp;\n best_dest = d;\n }\n }\n assert(best_dest != -1);\n ops.emplace_back(first_above, best_dest + 1);\n auto& from = st[s];\n int sz = from.size();\n for (int k = h + 1; k < sz; k++) {\n st[best_dest].push_back(from[k]);\n }\n from.resize(h + 1);\n }\n for (auto [v, i] : ops) {\n cout << v << \" \" << i << endl;\n }\n}","ahc027":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector h(N-1), v(N);\n for(int i = 0; i < N-1; i++) cin >> h[i];\n for(int i = 0; i < N; i++) cin >> v[i];\n vector> d(N, vector(N));\n for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) cin >> d[i][j];\n vector> visited(N, vector(N, false));\n int DI[4] = {0, 1, 0, -1};\n int DJ[4] = {1, 0, -1, 0};\n string DIR = \"RDLU\";\n function dfs = [&](int i, int j) {\n visited[i][j] = true;\n vector> poss;\n for(int dir = 0; dir < 4; dir++) {\n int ni = i + DI[dir];\n int nj = j + DJ[dir];\n if(ni < 0 || ni >= N || nj < 0 || nj >= N || visited[ni][nj]) continue;\n bool nowall;\n if(DI[dir] == 0) {\n nowall = v[i][min(j, nj)] == '0';\n } else {\n nowall = h[min(i, ni)][j] == '0';\n }\n if(nowall) {\n poss.emplace_back(-d[ni][nj], dir, 0);\n }\n }\n sort(poss.begin(), poss.end());\n for(auto [dd, dir, _] : poss) {\n int ni = i + DI[dir];\n int nj = j + DJ[dir];\n cout << DIR[dir];\n dfs(ni, nj);\n int backdir = (dir + 2) % 4;\n cout << DIR[backdir];\n }\n };\n dfs(0, 0);\n cout << endl;\n return 0;\n}","ahc028":"#include \nusing namespace std;\nusing pii = pair;\n\npair> compute_path(int ci, int cj, const string& need, const vector>& pos) {\n int r = need.size();\n if (r == 0) return {0, {}};\n vector> cands(r);\n for (int k = 0; k < r; k++) cands[k] = pos[need[k] - 'A'];\n vector> dp(r), pre(r);\n int sz0 = cands[0].size();\n dp[0].assign(sz0, INT_MAX / 2);\n pre[0].assign(sz0, -1);\n for (int j = 0; j < sz0; j++) {\n auto [x, y] = cands[0][j];\n dp[0][j] = abs(x - ci) + abs(y - cj);\n }\n for (int k = 1; k < r; k++) {\n int psz = cands[k - 1].size();\n int sz = cands[k].size();\n dp[k].assign(sz, INT_MAX / 2);\n pre[k].assign(sz, -1);\n for (int j = 0; j < sz; j++) {\n auto [x, y] = cands[k][j];\n for (int pj = 0; pj < psz; pj++) {\n if (dp[k - 1][pj] >= INT_MAX / 2) continue;\n auto [px, py] = cands[k - 1][pj];\n int d = abs(x - px) + abs(y - py);\n int tot = dp[k - 1][pj] + d;\n if (tot < dp[k][j]) {\n dp[k][j] = tot;\n pre[k][j] = pj;\n }\n }\n }\n }\n int ls = cands[r - 1].size();\n int md = INT_MAX / 2;\n int bj = 0;\n for (int j = 0; j < ls; j++) {\n if (dp[r - 1][j] < md) {\n md = dp[r - 1][j];\n bj = j;\n }\n }\n vector path(r);\n int currj = bj;\n for (int k = r - 1; k >= 0; k--) {\n path[k] = cands[k][currj];\n if (k >= 1) currj = pre[k][currj];\n }\n return {md, path};\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n int si, sj;\n cin >> si >> sj;\n vector grid(N);\n for (int i = 0; i < N; i++) cin >> grid[i];\n vector ts(M);\n for (int i = 0; i < M; i++) cin >> ts[i];\n vector> pos(26);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int c = grid[i][j] - 'A';\n pos[c].emplace_back(i, j);\n }\n }\n vector covered(M, false);\n int uncov = M;\n string current_S = \"\";\n int ci = si, cj = sj;\n vector actions;\n while (uncov > 0) {\n int best_addcost = INT_MAX;\n int best_k = -1;\n vector best_path;\n for (int k = 0; k < M; k++) {\n if (covered[k]) continue;\n const string& t = ts[k];\n int maxo = 0;\n int maxp = min(4, (int)current_S.size());\n for (int o = maxp; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : current_S.substr(current_S.size() - o, o));\n string pref = t.substr(0, o);\n if (suf == pref) {\n maxo = o;\n break;\n }\n }\n string needed = t.substr(maxo);\n if (needed.empty()) {\n covered[k] = true;\n uncov--;\n continue;\n }\n auto [md, pth] = compute_path(ci, cj, needed, pos);\n int addc = (int)needed.size() + md;\n if (addc < best_addcost) {\n best_addcost = addc;\n best_k = k;\n best_path = pth;\n }\n }\n if (best_k == -1) break;\n for (auto ppos : best_path) {\n actions.push_back(ppos);\n auto [x, y] = ppos;\n current_S += grid[x][y];\n ci = x;\n cj = y;\n if (current_S.size() >= 5) {\n string last5 = current_S.substr(current_S.size() - 5, 5);\n for (int kk = 0; kk < M; kk++) {\n if (!covered[kk] && ts[kk] == last5) {\n covered[kk] = true;\n uncov--;\n }\n }\n }\n }\n }\n for (auto [i, j] : actions) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc030":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n double eps;\n cin >> N >> M >> eps;\n int C = N * N;\n vector>> shapes(M);\n vector>> place_bits(M);\n for (int k = 0; k < M; k++) {\n int d;\n cin >> d;\n shapes[k].resize(d);\n int mi = 0, mj = 0;\n for (int p = 0; p < d; p++) {\n int x, y;\n cin >> x >> y;\n shapes[k][p] = {x, y};\n mi = max(mi, x);\n mj = max(mj, y);\n }\n for (int di = 0; di <= N - 1 - mi; di++) {\n for (int dj = 0; dj <= N - 1 - mj; dj++) {\n bitset<400> bs;\n for (auto [x, y] : shapes[k]) {\n bs.set((di + x) * N + (dj + y));\n }\n place_bits[k].push_back(bs);\n }\n }\n }\n vector> active(M);\n for (int k = 0; k < M; k++) {\n active[k].resize(place_bits[k].size(), true);\n }\n vector obs_v(C, -1);\n vector> observations;\n auto get_curr_poss = [&]() {\n vector> res(M);\n for (int k = 0; k < M; k++) {\n for (int p = 0; p < (int)place_bits[k].size(); p++) {\n if (active[k][p]) res[k].push_back(p);\n }\n }\n return res;\n };\n bool done = false;\n for (int iter = 0; iter < 2 * C; iter++) {\n auto curr_poss = get_curr_poss();\n long long tot = 1;\n bool is_unique = true;\n for (auto& ls : curr_poss) {\n if (ls.size() > 1) is_unique = false;\n tot *= ls.size();\n if (tot > 10000) tot = 10001;\n }\n vector> found;\n if ((is_unique || tot <= 10000) && tot >= 1) {\n vector choice(M, -1);\n function dfs = [&](int k) {\n if (found.size() >= 5) return;\n if (k == M) {\n bool ok = true;\n for (auto [cc, vv] : observations) {\n int sm = 0;\n for (int fk = 0; fk < M; fk++) {\n if (place_bits[fk][choice[fk]].test(cc)) sm++;\n }\n if (sm != vv) {\n ok = false;\n break;\n }\n }\n if (ok) {\n bitset<400> un;\n for (int fk = 0; fk < M; fk++) {\n un |= place_bits[fk][choice[fk]];\n }\n bool is_new = true;\n for (auto& f : found) {\n if (f == un) {\n is_new = false;\n break;\n }\n }\n if (is_new) found.push_back(un);\n }\n return;\n }\n for (int p : curr_poss[k]) {\n choice[k] = p;\n dfs(k + 1);\n if (found.size() >= 5) return;\n }\n };\n dfs(0);\n if (found.size() == 1) {\n vector> positives;\n for (int c = 0; c < C; c++) {\n if (found[0].test(c)) {\n positives.emplace_back(c / N, c % N);\n }\n }\n cout << \"a \" << positives.size();\n for (auto [ii, jj] : positives) {\n cout << \" \" << ii << \" \" << jj;\n }\n cout << endl;\n int resp;\n cin >> resp;\n done = true;\n break;\n } else if (found.size() > 1) {\n int best_c = -1;\n int best_var = 0;\n for (int c = 0; c < C; c++) {\n if (obs_v[c] != -1) continue;\n int num_posi = 0;\n for (auto& bs : found) if (bs.test(c)) num_posi++;\n int vr = min(num_posi, (int)found.size() - num_posi);\n if (vr > best_var) {\n best_var = vr;\n best_c = c;\n }\n }\n if (best_var > 0) {\n int i = best_c / N, j = best_c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[best_c] = v;\n observations.emplace_back(best_c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) {\n for (int p : curr_poss[k]) {\n if (place_bits[k][p].test(best_c)) active[k][p] = false;\n }\n }\n }\n continue;\n }\n }\n }\n auto curr_poss2 = curr_poss;\n int best_c = -1;\n double best_sc = -1;\n for (int c = 0; c < C; c++) {\n if (obs_v[c] != -1) continue;\n double ev = 0.0;\n int ctotal = 0;\n for (int k = 0; k < M; k++) {\n auto& ls = curr_poss2[k];\n int nas = ls.size();\n if (nas == 0) continue;\n int co = 0;\n for (int p : ls) {\n if (place_bits[k][p].test(c)) co++;\n }\n ev += static_cast(co) / nas;\n ctotal += co;\n }\n double pzero = exp(-ev);\n double sc = pzero * ctotal;\n if (sc > best_sc) {\n best_sc = sc;\n best_c = c;\n }\n }\n if (best_c == -1) break;\n int i = best_c / N, j = best_c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[best_c] = v;\n observations.emplace_back(best_c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) {\n for (int p : curr_poss2[k]) {\n if (place_bits[k][p].test(best_c)) active[k][p] = false;\n }\n }\n }\n }\n if (!done) {\n auto curr_poss = get_curr_poss();\n bitset<400> possible_pos;\n for (int k = 0; k < M; k++) for (int p : curr_poss[k]) possible_pos |= place_bits[k][p];\n for (int c = 0; c < C; c++) if (possible_pos.test(c) && obs_v[c] == -1) {\n int i = c / N, j = c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[c] = v;\n observations.emplace_back(c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) for (int pp : curr_poss[k]) if (place_bits[k][pp].test(c)) active[k][pp] = false;\n }\n }\n auto curr_poss_final = get_curr_poss();\n vector> found;\n vector choice(M, -1);\n function dfs = [&](int k) {\n if (found.size() >= 1) return;\n if (k == M) {\n bool ok = true;\n for (auto [cc, vv] : observations) {\n int sm = 0;\n for (int fk = 0; fk < M; fk++) if (place_bits[fk][choice[fk]].test(cc)) sm++;\n if (sm != vv) ok = false;\n }\n if (ok) {\n bitset<400> un;\n for (int fk = 0; fk < M; fk++) un |= place_bits[fk][choice[fk]];\n found.push_back(un);\n }\n return;\n }\n for (int p : curr_poss_final[k]) {\n choice[k] = p;\n dfs(k + 1);\n }\n };\n dfs(0);\n vector> positives;\n if (!found.empty()) {\n for (int c = 0; c < C; c++) if (found[0].test(c)) positives.emplace_back(c / N, c % N);\n } else {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {\n int vc = obs_v[i * N + j];\n if (vc > 0 || vc == -1) {\n if (vc == -1) {\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v; cin >> v;\n if (v > 0) positives.emplace_back(i, j);\n } else positives.emplace_back(i, j);\n }\n }\n }\n cout << \"a \" << positives.size();\n for (auto [i, j] : positives) cout << \" \" << i << \" \" << j;\n cout << endl;\n int r; cin >> r;\n }\n return 0;\n}","ahc031":"#include \nusing namespace std;\n\nint main() {\n int W, D, N;\n cin >> W >> D >> N;\n vector> a(D, vector(N));\n for(int d = 0; d < D; d++) {\n for(int k = 0; k < N; k++) {\n cin >> a[d][k];\n }\n }\n vector> reqs(N);\n for(int k = 0; k < N; k++) {\n for(int d = 0; d < D; d++) {\n reqs[k].push_back(a[d][k]);\n }\n }\n vector> ops;\n for(int k = 0; k < N; k++) {\n auto vals = reqs[k];\n sort(vals.rbegin(), vals.rend());\n long long cur = 0;\n int num = D;\n for(int j = D - 1; j >= 0; j--) {\n long long nxt = vals[j];\n if(nxt > cur) {\n ops.emplace_back(100 * num, nxt - cur, k);\n }\n cur = nxt;\n num--;\n }\n }\n sort(ops.rbegin(), ops.rend());\n vector b(N, 0);\n long long budget = (long long)W * W;\n for(auto& t : ops) {\n int g; long long w; int k;\n tie(g, w, k) = t;\n if(budget <= 0) break;\n long long tk = min(w, budget);\n b[k] += tk;\n budget -= tk;\n }\n vector ws(N, 1);\n for(int k = 0; k < N; k++) {\n int need = (b[k] + W - 1LL) / W;\n ws[k] = max(1, need);\n }\n int sumw = 0;\n for(int w : ws) sumw += w;\n if(sumw > W) {\n int over = sumw - W;\n for(int r = 0; r < over; r++) {\n bool reduced = false;\n for(int k = N - 1; k >= 0; k--) {\n if(ws[k] > 1) {\n ws[k]--;\n reduced = true;\n break;\n }\n }\n if(!reduced) break;\n }\n }\n vector jstarts(N);\n int cj = 0;\n for(int k = 0; k < N; k++) {\n jstarts[k] = cj;\n cj += ws[k];\n }\n for(int d = 0; d < D; d++) {\n for(int k = 0; k < N; k++) {\n int j1 = jstarts[k];\n int ww = ws[k];\n cout << 0 << \" \" << j1 << \" \" << W << \" \" << (j1 + ww) << endl;\n }\n }\n return 0;\n}","ahc032":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, M, K;\n cin >> N >> M >> K;\n const ll MOD = 998244353;\n ll brd[9][9];\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {\n cin >> brd[i][j];\n }\n ll st[20][3][3];\n for (int m = 0; m < M; m++) for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) {\n cin >> st[m][i][j];\n }\n vector> ops;\n for (int times = 0; times < K; times++) {\n ll best_delta = 0;\n int best_m = -1, best_p = -1, best_q = -1;\n for (int m = 0; m < M; m++) {\n for (int p = 0; p <= N - 3; p++) {\n for (int q = 0; q <= N - 3; q++) {\n ll d = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n ll nr = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n d += nr - brd[p + x][q + y];\n }\n if (d > best_delta) {\n best_delta = d;\n best_m = m;\n best_p = p;\n best_q = q;\n }\n }\n }\n }\n if (best_delta <= 0) break;\n int m = best_m, p = best_p, q = best_q;\n ops.emplace_back(m, p, q);\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n brd[p + x][q + y] = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n }\n }\n cout << ops.size() << endl;\n for (auto [m, p, q] : ops) {\n cout << m << \" \" << p << \" \" << q << endl;\n }\n}","ahc033":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector> A(N, vector(N));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> A[i][j];\n }\n }\n vector ops(N);\n vector> g(N, vector(N, -1));\n vector crane_r(N), crane_c(N);\n for (int i = 0; i < N; i++) {\n crane_r[i] = i;\n crane_c[i] = 0;\n }\n vector carry(N, false);\n vector carry_what(N, -1);\n vector isact(N, true);\n vector islarge(N, false);\n islarge[0] = true;\n vector next_e(N);\n for (int i = 0; i < N; i++) next_e[i] = i * N;\n vector inp_idx(N, 0);\n int dispat_cnt = 0;\n auto is_done = [&]() { return dispat_cnt == N * N; };\n auto do_receive = [&]() {\n for (int r = 0; r < N; r++) {\n if (inp_idx[r] >= N) continue;\n int c = 0;\n if (g[r][c] != -1) continue;\n bool hold_there = false;\n for (int k = 0; k < N; k++) {\n if (isact[k] && crane_r[k] == r && crane_c[k] == c && carry[k]) {\n hold_there = true;\n break;\n }\n }\n if (!hold_there) {\n int cn = A[r][inp_idx[r]];\n g[r][c] = cn;\n inp_idx[r]++;\n }\n }\n };\n auto do_dispatch = [&]() {\n for (int r = 0; r < N; r++) {\n int c = N - 1;\n if (g[r][c] != -1) {\n int b = g[r][c];\n g[r][c] = -1;\n dispat_cnt++;\n if (b / N == r && b == next_e[r]) {\n next_e[r]++;\n }\n }\n }\n };\n auto find_pos = [&](int cont) -> pair {\n for (int i = 0; i < N; i++)\n for (int j = 0; j < N; j++)\n if (g[i][j] == cont) return {i, j};\n return {-1, -1};\n };\n auto move_towards = [&](int cr, int cc, int tr, int tc, bool iscarry) -> char {\n if (cr != tr) {\n if (cr < tr) return 'D';\n return 'U';\n }\n if (cc != tc) {\n if (cc < tc) return 'R';\n return 'L';\n }\n return '.';\n };\n auto find_empty_for = [&](int cont) -> pair {\n int pref = cont / N;\n for (int j = 0; j < N - 1; j++) {\n if (g[pref][j] == -1) return {pref, j};\n }\n for (int j = 0; j < N - 1; j++) {\n for (int i = 0; i < N; i++) {\n if (g[i][j] == -1) return {i, j};\n }\n }\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (g[i][j] == -1) return {i, j};\n }\n }\n return {-1, -1};\n };\n const int MAXT = 10000;\n for (int t = 0; t < MAXT; t++) {\n if (is_done()) break;\n do_receive();\n if (is_done()) break;\n vector action(N, '.');\n for (int k = 1; k < N; k++) {\n if (isact[k] && t == 0) {\n action[k] = 'B';\n }\n }\n if (isact[0]) {\n bool done = false;\n int held = carry[0] ? carry_what[0] : -1;\n if (held != -1) {\n int trgt = held / N;\n if (held == next_e[trgt]) {\n int gr = trgt, gc = N - 1;\n if (crane_r[0] == gr && crane_c[0] == gc) {\n action[0] = 'Q';\n done = true;\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], gr, gc, true);\n done = true;\n }\n }\n }\n if (!done && !carry[0]) {\n int bestd = INT_MAX;\n int bx = -1, by = -1;\n bool will_pick = false;\n for (int i = 0; i < N; i++) {\n if (next_e[i] >= (i + 1) * N) continue;\n int nd = next_e[i];\n auto [pr, pc] = find_pos(nd);\n if (pr == -1) continue;\n if (pr == i && pc == N - 1) continue;\n int dist = abs(crane_r[0] - pr) + abs(crane_c[0] - pc);\n if (dist < bestd) {\n bestd = dist;\n bx = pr;\n by = pc;\n will_pick = true;\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) {\n action[0] = 'P';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n }\n done = true;\n }\n }\n if (!done && carry[0]) {\n int hc = carry_what[0];\n auto emp = find_empty_for(hc);\n if (emp.first != -1) {\n int ex = emp.first, ey = emp.second;\n if (crane_r[0] == ex && crane_c[0] == ey) {\n action[0] = 'Q';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], ex, ey, true);\n }\n done = true;\n }\n }\n if (!done) {\n int bestd = INT_MAX;\n int bx = -1, by = -1;\n for (int r = 0; r < N; r++) {\n if (g[r][0] != -1) {\n int dist = abs(crane_r[0] - r) + abs(crane_c[0] - 0);\n if (dist < bestd) {\n bestd = dist;\n bx = r;\n by = 0;\n }\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) {\n action[0] = 'P';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n }\n done = true;\n }\n }\n if (!done) {\n action[0] = '.';\n }\n }\n for (int k = 0; k < N; k++) {\n if (!isact[k]) {\n continue;\n }\n char act = action[k];\n if (act == 'B') {\n if (!carry[k]) {\n isact[k] = false;\n }\n continue;\n }\n if (act == 'P') {\n if (!carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] != -1) {\n carry[k] = true;\n carry_what[k] = g[rr][cc];\n g[rr][cc] = -1;\n }\n }\n } else if (act == 'Q') {\n if (carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] == -1) {\n g[rr][cc] = carry_what[k];\n carry[k] = false;\n carry_what[k] = -1;\n }\n }\n } else if (act == '.' ) {\n } else {\n int drr = 0, dcc = 0;\n if (act == 'U') drr = -1;\n else if (act == 'D') drr = 1;\n else if (act == 'L') dcc = -1;\n else if (act == 'R') dcc = 1;\n int nr = crane_r[k] + drr;\n int nc = crane_c[k] + dcc;\n if (nr >= 0 && nr < N && nc >= 0 && nc < N) {\n bool has_cont = (g[nr][nc] != -1);\n bool can_move = true;\n if (carry[k] && !islarge[k] && has_cont) can_move = false;\n if (can_move) {\n crane_r[k] = nr;\n crane_c[k] = nc;\n }\n }\n }\n }\n do_dispatch();\n for (int k = 0; k < N; k++) {\n ops[k] += action[k];\n }\n if (is_done()) break;\n }\n int maxlen = 0;\n for (auto& s : ops) maxlen = max(maxlen, (int)s.size());\n for (auto& s : ops) {\n while ((int)s.size() < maxlen) s += '.';\n }\n for (auto& s : ops) {\n cout << s << endl;\n }\n}","ahc034":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector> h(N, vector(N));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> h[i][j];\n }\n }\n vector> rem_supply(N, vector(N, 0));\n vector> rem_demand(N, vector(N, 0));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (h[i][j] > 0) rem_supply[i][j] = h[i][j];\n else rem_demand[i][j] = -h[i][j];\n }\n }\n vector ops;\n int cr = 0, cc = 0;\n long long load = 0;\n auto has_supply = [&]() -> bool {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (rem_supply[i][j] > 0) return true;\n }\n }\n return false;\n };\n auto find_closest = [&](bool is_supply) -> pair {\n int min_dist = INT_MAX;\n int ti = -1, tj = -1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int d = abs(i - cr) + abs(j - cc);\n bool has = is_supply ? (rem_supply[i][j] > 0) : (rem_demand[i][j] > 0);\n if (has) {\n if (d < min_dist || (d == min_dist && (i < ti || (i == ti && j < tj)))) {\n min_dist = d;\n ti = i;\n tj = j;\n }\n }\n }\n }\n return {ti, tj};\n };\n auto do_move = [&](int tr, int tc) {\n while (cr != tr) {\n if (cr < tr) {\n ops.push_back(\"D\");\n cr++;\n } else {\n ops.push_back(\"U\");\n cr--;\n }\n }\n while (cc != tc) {\n if (cc < tc) {\n ops.push_back(\"R\");\n cc++;\n } else {\n ops.push_back(\"L\");\n cc--;\n }\n }\n };\n for (;;) {\n if (!has_supply() && load == 0) break;\n if (load == 0) {\n auto [tr, tc] = find_closest(true);\n if (tr == -1) break;\n do_move(tr, tc);\n int d = rem_supply[cr][cc];\n if (d > 0) {\n ops.push_back(\"+\" + to_string(d));\n load += d;\n rem_supply[cr][cc] = 0;\n }\n } else {\n auto [tr, tc] = find_closest(false);\n if (tr == -1) {\n break;\n }\n do_move(tr, tc);\n long long d = min(load, (long long)rem_demand[cr][cc]);\n if (d > 0) {\n ops.push_back(\"-\" + to_string(d));\n load -= d;\n rem_demand[cr][cc] -= d;\n }\n }\n if (ops.size() > 90000) break;\n }\n // if still load > 0, dump to (0,0) as last resort\n if (load > 0) {\n do_move(0, 0);\n ops.push_back(\"-\" + to_string(load));\n load = 0;\n }\n for (auto& s : ops) {\n cout << s << endl;\n }\n}","ahc035":"#include \nusing namespace std;\n\nint main() {\n int N, M, T;\n cin >> N >> M >> T;\n int SEED_CNT = 2 * N * (N - 1);\n vector> seeds(SEED_CNT, vector(M));\n for (int i = 0; i < SEED_CNT; i++) {\n for (int j = 0; j < M; j++) {\n cin >> seeds[i][j];\n }\n }\n srand(42);\n for (int t = 0; t < T; t++) {\n vector val(SEED_CNT, 0);\n vector maxd(M, 0);\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n val[k] += seeds[k][l];\n if (seeds[k][l] > maxd[l]) maxd[l] = seeds[k][l];\n }\n }\n vector best_car(M, -1);\n for (int l = 0; l < M; l++) {\n int bv = -1;\n int bk = -1;\n for (int k = 0; k < SEED_CNT; k++) {\n if (seeds[k][l] == maxd[l] && val[k] > bv) {\n bv = val[k];\n bk = k;\n }\n }\n best_car[l] = bk;\n }\n set must_s;\n for (int bc : best_car) if (bc != -1) must_s.insert(bc);\n vector must(must_s.begin(), must_s.end());\n vector alls(SEED_CNT);\n iota(alls.begin(), alls.end(), 0);\n sort(alls.begin(), alls.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector in_chosen(SEED_CNT, false);\n vector selected;\n for (int m : must) {\n selected.push_back(m);\n in_chosen[m] = true;\n }\n for (int cand : alls) {\n if (!in_chosen[cand]) {\n selected.push_back(cand);\n in_chosen[cand] = true;\n if ((int)selected.size() == N * N) break;\n }\n }\n sort(selected.begin(), selected.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector> comp(36, vector(36, 0));\n for (int i = 0; i < 36; i++) {\n for (int j = 0; j < 36; j++) {\n if (i == j) continue;\n int s1 = selected[i];\n int s2 = selected[j];\n for (int l = 0; l < M; l++) {\n comp[i][j] += max(seeds[s1][l], seeds[s2][l]);\n }\n }\n }\n vector mixed(36);\n int left = 0, right = 35;\n for (int k = 0; k < 36; k++) {\n if (k % 2 == 0) {\n mixed[k] = left++;\n } else {\n mixed[k] = right--;\n }\n }\n vector assign(36);\n for (int p = 0; p < 36; p++) {\n assign[p] = mixed[p];\n }\n auto calc = [&](const vector& asg) -> int {\n int tot = 0;\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N - 1; c++) {\n int i1 = asg[r * N + c];\n int i2 = asg[r * N + c + 1];\n tot += comp[i1][i2];\n }\n }\n for (int r = 0; r < N - 1; r++) {\n for (int c = 0; c < N; c++) {\n int i1 = asg[r * N + c];\n int i2 = asg[(r + 1) * N + c];\n tot += comp[i1][i2];\n }\n }\n return tot;\n };\n int best_tot = calc(assign);\n vector best_asg = assign;\n int num_iters = 500;\n for (int it = 0; it < num_iters; it++) {\n int p1 = rand() % 36;\n int p2 = rand() % 36;\n if (p1 == p2) continue;\n swap(assign[p1], assign[p2]);\n int nt = calc(assign);\n if (nt > best_tot) {\n best_tot = nt;\n best_asg = assign;\n } else {\n swap(assign[p1], assign[p2]);\n }\n }\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N; c++) {\n int sidx = best_asg[r * N + c];\n cout << selected[sidx];\n if (c < N - 1) cout << \" \";\n }\n cout << endl;\n }\n cout.flush();\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n cin >> seeds[k][l];\n }\n }\n }\n return 0;\n}","ahc038":"#include \nusing namespace std;\n\nconst int MAXN = 31;\nint DELX[4] = {0, 1, 0, -1};\nint DELY[4] = {1, 0, -1, 0};\nchar MOVECH[5] = {'.', 'U', 'D', 'L', 'R'};\nint MX[5] = {0, -1, 1, 0, 0};\nint MY[5] = {0, 0, 0, -1, 1};\n\nstruct PrevInfo {\n int px, py, pd;\n char mch, rch;\n};\n\nint main() {\n int N, M, Vv;\n cin >> N >> M >> Vv;\n vector S(N), T(N);\n for(int i = 0; i < N; i++) cin >> S[i];\n for(int i = 0; i < N; i++) cin >> T[i];\n vector> sources, goals;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n if(S[i][j] == '1' && T[i][j] == '0') sources.emplace_back(i,j);\n if(S[i][j] == '0' && T[i][j] == '1') goals.emplace_back(i,j);\n }\n }\n int VP = 2;\n cout << VP << endl;\n cout << 0 << \" \" << 1 << endl;\n int ix = N / 2;\n int iy = N / 2;\n cout << ix << \" \" << iy << endl;\n vector operations;\n int cur_rx = ix, cur_ry = iy, cur_d = 0;\n auto perform_move_to = [&](int px, int py, bool should_act) {\n vector>> vis(N, vector>(N, vector(4, false)));\n vector>> pri(N, vector>(N, vector(4, {-1,-1,-1,'.','.'})));\n queue> q;\n q.push({cur_rx, cur_ry, cur_d});\n vis[cur_rx][cur_ry][cur_d] = true;\n int tx = -1, ty = -1, td = -1;\n bool found = false;\n while(!q.empty() && !found) {\n auto [x, y, d] = q.front(); q.pop();\n int fx = x + DELX[d];\n int fy = y + DELY[d];\n if(fx == px && fy == py) {\n tx = x; ty = y; td = d;\n found = true;\n break;\n }\n for(int mi = 0; mi < 5; mi++) {\n int nx = x + MX[mi];\n int ny = y + MY[mi];\n if(nx < 0 || nx >= N || ny < 0 || ny >= N) continue;\n for(int ri = 0; ri < 3; ri++) {\n int nd = d;\n char rc = '.';\n if(ri == 1) {\n nd = (d + 3) % 4;\n rc = 'L';\n } else if(ri == 2) {\n nd = (d + 1) % 4;\n rc = 'R';\n }\n if(vis[nx][ny][nd]) continue;\n vis[nx][ny][nd] = true;\n pri[nx][ny][nd] = {x, y, d, MOVECH[mi], rc};\n q.push({nx, ny, nd});\n }\n }\n }\n if(!found) {\n return;\n }\n vector> path;\n int cx = tx, cy = ty, cd = td;\n while(cx != cur_rx || cy != cur_ry || cd != cur_d) {\n PrevInfo p = pri[cx][cy][cd];\n if(p.px == -1) break;\n path.emplace_back(p.mch, p.rch);\n cx = p.px;\n cy = p.py;\n cd = p.pd;\n }\n reverse(path.begin(), path.end());\n int psz = path.size();\n for(int i = 0; i < psz; i++) {\n auto [m, r] = path[i];\n string ss(VP * 2, '.');\n ss[0] = m;\n ss[1] = r;\n if(should_act && i == psz - 1) {\n ss[VP + 1] = 'P';\n }\n operations.push_back(ss);\n }\n if(psz == 0 && should_act) {\n string ss(VP * 2, '.');\n ss[VP + 1] = 'P';\n operations.push_back(ss);\n }\n cur_rx = tx;\n cur_ry = ty;\n cur_d = td;\n };\n vector> rem_s = sources;\n vector> rem_g = goals;\n while(!rem_s.empty() && !rem_g.empty()) {\n int cfx = cur_rx + DELX[cur_d];\n int cfy = cur_ry + DELY[cur_d];\n int md = INT_MAX;\n pair chs = {-1,-1};\n for(auto& p: rem_s) {\n int dis = abs(p.first - cfx) + abs(p.second - cfy);\n if(dis < md) {\n md = dis;\n chs = p;\n }\n }\n perform_move_to(chs.first, chs.second, true);\n rem_s.erase(remove(rem_s.begin(), rem_s.end(), chs), rem_s.end());\n cfx = cur_rx + DELX[cur_d];\n cfy = cur_ry + DELY[cur_d];\n md = INT_MAX;\n chs = {-1,-1};\n for(auto& p: rem_g) {\n int dis = abs(p.first - cfx) + abs(p.second - cfy);\n if(dis < md) {\n md = dis;\n chs = p;\n }\n }\n perform_move_to(chs.first, chs.second, true);\n rem_g.erase(remove(rem_g.begin(), rem_g.end(), chs), rem_g.end());\n }\n for(const auto& op : operations) {\n cout << op << endl;\n }\n return 0;\n}","ahc039":"#include \nusing namespace std;\n\nstruct Point {\n int x, y, v;\n};\n\nint main() {\n int N;\n cin >> N;\n vector pts(2 * N);\n for (int i = 0; i < 2 * N; i++) {\n cin >> pts[i].x >> pts[i].y;\n pts[i].v = (i < N ? 1 : -1);\n }\n vector xs, ys;\n for (auto& p : pts) {\n xs.push_back(p.x);\n ys.push_back(p.y);\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n sort(ys.begin(), ys.end());\n ys.erase(unique(ys.begin(), ys.end()), ys.end());\n int kx = xs.size();\n int ky = ys.size();\n long long stride = ky + 1LL;\n vector ps((kx + 1LL) * stride, 0);\n for (auto& p : pts) {\n int rx = lower_bound(xs.begin(), xs.end(), p.x) - xs.begin() + 1;\n int ry = lower_bound(ys.begin(), ys.end(), p.y) - ys.begin() + 1;\n ps[rx * stride + ry] += p.v;\n }\n for (int i = 1; i <= kx; i++) {\n for (int j = 1; j <= ky; j++) {\n ps[i * stride + j] += ps[(i - 1) * stride + j] + ps[i * stride + (j - 1)] - ps[(i - 1) * stride + (j - 1)];\n }\n }\n auto getsum = [&](int x1, int y1, int x2, int y2) -> int {\n if (x1 > x2 || y1 > y2) return 0;\n if (x1 < 0) x1 = 0;\n if (y1 < 0) y1 = 0;\n long long v1 = ps[x2 * stride + y2];\n long long v2 = (x1 >= 1 ? ps[(x1 - 1) * stride + y2] : 0);\n long long v3 = (y1 >= 1 ? ps[x2 * stride + (y1 - 1)] : 0);\n long long v4 = ((x1 >= 1 && y1 >= 1) ? ps[(x1 - 1) * stride + (y1 - 1)] : 0);\n return (int)(v1 - v2 - v3 + v4);\n };\n int best_score = INT_MIN;\n int best_lx = -1, best_rx = -1, best_ly = -1, best_ry = -1;\n int S = 130;\n vector xcuts;\n int stepx = max(1, kx / S);\n for (int i = 0; i <= kx; i += stepx) {\n xcuts.push_back(i);\n }\n if (xcuts.back() != kx) xcuts.push_back(kx);\n vector ycuts;\n int stepy = max(1, ky / S);\n for (int i = 0; i <= ky; i += stepy) {\n ycuts.push_back(i);\n }\n if (ycuts.back() != ky) ycuts.push_back(ky);\n for (size_t pi = 0; pi < xcuts.size(); ++pi) {\n for (size_t qi = pi; qi < xcuts.size(); ++qi) {\n int lx_ = xcuts[pi] + 1;\n int rx_ = xcuts[qi];\n if (lx_ > rx_) continue;\n if (rx_ - lx_ < 0) continue;\n for (size_t pj = 0; pj < ycuts.size(); ++pj) {\n for (size_t qj = pj; qj < ycuts.size(); ++qj) {\n int ly_ = ycuts[pj] + 1;\n int ry_ = ycuts[qj];\n if (ly_ > ry_) continue;\n if (ry_ - ly_ < 1) continue;\n if (rx_ - lx_ < 1) continue;\n int s = getsum(lx_, ly_, rx_, ry_);\n if (s > best_score) {\n best_score = s;\n best_lx = lx_;\n best_rx = rx_;\n best_ly = ly_;\n best_ry = ry_;\n }\n }\n }\n }\n }\n if (best_score == INT_MIN || best_score < 1) {\n // fallback to single mackerel\n auto p = pts[0];\n int xx = p.x;\n int yy = p.y;\n int pl = max(0, xx - 1);\n int pr = min(100000, xx + 1);\n int pb = max(0, yy - 1);\n int pt = min(100000, yy + 1);\n cout << 4 << endl;\n cout << pl << \" \" << pb << endl;\n cout << pr << \" \" << pb << endl;\n cout << pr << \" \" << pt << endl;\n cout << pl << \" \" << pt << endl;\n return 0;\n }\n int lx = best_lx, rx = best_rx, ly = best_ly, ry = best_ry;\n int minx_ = (lx - 1 >= 0 && lx - 1 < kx ? xs[lx - 1] : 0);\n int maxx_ = (rx - 1 >= 0 && rx - 1 < kx ? xs[rx - 1] : 100000);\n int miny_ = (ly - 1 >= 0 && ly - 1 < ky ? ys[ly - 1] : 0);\n int maxy_ = (ry - 1 >= 0 && ry - 1 < ky ? ys[ry - 1] : 100000);\n int pleft = (lx >= 2 ? xs[lx - 2] + 1 : 0);\n int pright = (rx < kx ? xs[rx] - 1 : 100000);\n int pbot = (ly >= 2 ? ys[ly - 2] + 1 : 0);\n int ptop = (ry < ky ? ys[ry] - 1 : 100000);\n if (pleft >= pright) {\n pleft = minx_ - 1;\n pright = maxx_ + 1;\n if (pleft < 0) pleft = 0;\n if (pright > 100000) pright = 100000;\n if (pleft >= pright) {\n pleft = minx_;\n pright = maxx_ + 1;\n if (pright > 100000) pright = 100000;\n }\n }\n if (pbot >= ptop) {\n pbot = miny_ - 1;\n ptop = maxy_ + 1;\n if (pbot < 0) pbot = 0;\n if (ptop > 100000) ptop = 100000;\n if (pbot >= ptop) {\n pbot = miny_;\n ptop = maxy_ + 1;\n if (ptop > 100000) ptop = 100000;\n }\n }\n if (pleft == pright) {\n if (pright < 100000) pright++;\n else if (pleft > 0) pleft--;\n }\n if (pbot == ptop) {\n if (ptop < 100000) ptop++;\n else if (pbot > 0) pbot--;\n }\n cout << 4 << endl;\n cout << pleft << \" \" << pbot << endl;\n cout << pright << \" \" << pbot << endl;\n cout << pright << \" \" << ptop << endl;\n cout << pleft << \" \" << ptop << endl;\n return 0;\n}","ahc040":"#include \nusing namespace std;\nusing ll = long long;\n\nstruct RectPos {\n ll x, y, w, h;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N, T;\n ll sigma;\n cin >> N >> T >> sigma;\n vector WW(N), HH(N);\n for(int i = 0; i < N; i++) {\n cin >> WW[i] >> HH[i];\n }\n mt19937 rng(1234LL * 5678);\n vector>> cands;\n ll best_meas = LLONG_MAX;\n int best_idx = -1;\n const int MAX_VARIANTS = 200;\n for(int t = 0; t < T; t++) {\n vector> current_acts;\n int current_cand_idx = -1;\n if((int)cands.size() < MAX_VARIANTS) {\n vector> acts;\n vector pos(N);\n vector active;\n ll cW = 0, cH = 0;\n for(int i = 0; i < N; i++) {\n ll wi = WW[i], hi = HH[i];\n ll best_noisy = LLONG_MAX / 2;\n int br = -1, bbv = -2;\n char bd = ' ';\n ll bpx = -1, bpy = -1;\n for(int r = 0; r < 2; r++) {\n ll cw = r ? hi : wi;\n ll ch = r ? wi : hi;\n int bstart = max(-1, i - 30);\n for(int bb = bstart; bb < i; bb++) {\n int b = bb;\n for(char d : {'U', 'L'}) {\n ll px = 0, py = 0;\n if(d == 'U') {\n px = (b == -1 ? 0 : pos[b].x + pos[b].w);\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n } else {\n py = (b == -1 ? 0 : pos[b].y + pos[b].h);\n ll mr = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(py, re.y) < min(py + ch, re.y + re.h)) {\n mr = max(mr, re.x + re.w);\n }\n }\n px = mr;\n }\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) {\n ol = true;\n break;\n }\n }\n if(ol) continue;\n ll nW = max(cW, px + cw);\n ll nH = max(cH, py + ch);\n ll sc = nW + nH;\n ll noisy_sc = sc + (rng() % 1000);\n if(noisy_sc < best_noisy) {\n best_noisy = noisy_sc;\n br = r;\n bd = d;\n bbv = b;\n bpx = px;\n bpy = py;\n }\n }\n }\n }\n if(br != -1) {\n ll cw = br ? HH[i] : WW[i];\n ll ch = br ? WW[i] : HH[i];\n pos[i].x = bpx;\n pos[i].y = bpy;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, bpx + cw);\n cH = max(cH, bpy + ch);\n acts.emplace_back(i, br, bd, bbv);\n } else {\n int r = 0; char d = 'U'; int b = -1;\n ll cw = WW[i]; ll ch = HH[i];\n ll px = 0, py = 0;\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) ol = true;\n }\n if(!ol) {\n pos[i].x = px;\n pos[i].y = py;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, px + cw);\n cH = max(cH, py + ch);\n acts.emplace_back(i, r, d, b);\n }\n }\n }\n cands.push_back(acts);\n current_acts = std::move(acts);\n current_cand_idx = (int)cands.size() - 1;\n } else {\n current_cand_idx = best_idx;\n current_acts = cands[best_idx];\n }\n cout << current_acts.size() << '\\n';\n for(auto [p, r, d, b] : current_acts) {\n cout << p << ' ' << r << ' ' << d << ' ' << b << '\\n';\n }\n cout.flush();\n ll Wp, Hp;\n cin >> Wp >> Hp;\n ll meas = Wp + Hp;\n if(meas < best_meas) {\n best_meas = meas;\n best_idx = current_cand_idx;\n }\n }\n return 0;\n}","ahc041":"#include \nusing namespace std;\n\nint main() {\n int N, M, H_;\n cin >> N >> M >> H_;\n int H = H_;\n vector A(N);\n for (auto& a : A) cin >> a;\n vector> g(N);\n for (int i = 0; i < M; i++) {\n int u, v;\n cin >> u >> v;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n auto count_unc = [&](int c, const vector& cov) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n int ct = cov[c] ? 0 : 1;\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) ct++;\n }\n }\n }\n }\n return ct;\n };\n auto mark_ball = [&](int c, vector& cov, int& uncc) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n if (!cov[c]) {\n cov[c] = true;\n uncc--;\n }\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) {\n cov[v] = true;\n uncc--;\n }\n }\n }\n }\n }\n };\n vector cov(N, false);\n int uncc = N;\n vector S;\n while (uncc > 0) {\n int bct = -1, bc = -1;\n for (int c = 0; c < N; c++) {\n int ct = count_unc(c, cov);\n if (ct > bct) {\n bct = ct;\n bc = c;\n }\n }\n if (bct <= 0) break;\n S.push_back(bc);\n mark_ball(bc, cov, uncc);\n }\n vector> nears(N);\n for (int i = 0; i < N; i++) {\n for (int j = i + 1; j < N; j++) {\n double dist = hypot(X[i] - X[j], Y[i] - Y[j]);\n if (dist <= 180.0) {\n nears[i].push_back(j);\n nears[j].push_back(i);\n }\n }\n }\n auto get_eval = [&](const vector& cs) -> long long {\n if (cs.empty() && N > 0) return -1e18;\n vector d(N, -1);\n queue q;\n for (int s : cs) {\n if (d[s] == -1) {\n d[s] = 0;\n q.push(s);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) q.push(v);\n }\n }\n }\n long long sm = 0;\n for (int i = 0; i < N; i++) {\n if (d[i] < 0 || d[i] > H) return -1e18;\n sm += 1LL * d[i] * A[i];\n }\n return sm;\n };\n mt19937 rng(42);\n vector best_S = S;\n long long best_score = get_eval(S);\n vector curr_S = S;\n long long curr_sc = best_score;\n int n_iters = 30000;\n for (int it = 0; it < n_iters; it++) {\n vector news = curr_S;\n int movt = rng() % 10;\n bool skipped = true;\n if (movt < 6 && !news.empty()) {\n int idx = rng() % news.size();\n int old = news[idx];\n int newc;\n if (nears[old].empty() || (rng() % 5 == 0)) {\n newc = rng() % N;\n } else {\n int k = rng() % nears[old].size();\n newc = nears[old][k];\n }\n bool isin = false;\n for (int s : news) if (s == newc) {\n isin = true;\n break;\n }\n if (!isin) {\n news[idx] = newc;\n skipped = false;\n }\n } else if (movt < 8 && news.size() >= 1) {\n int idx = rng() % news.size();\n news.erase(news.begin() + idx);\n skipped = false;\n } else if (news.size() < 20) {\n int newc = rng() % N;\n bool isin = false;\n for (int s : news) if (s == newc) isin = true;\n if (!isin) {\n news.push_back(newc);\n skipped = false;\n }\n }\n if (skipped) continue;\n long long nsc = get_eval(news);\n if (nsc > -1e17) {\n double del = nsc - curr_sc;\n double T = 300.0 * pow(0.9998, it);\n if (T < 1.0) T = 1.0;\n bool accept = (del >= 0);\n if (!accept) {\n double prob = exp(del / T);\n if ((double)rng() / (double)rng.max() < prob) accept = true;\n }\n if (accept) {\n curr_S = news;\n curr_sc = nsc;\n if (nsc > best_score) {\n best_score = nsc;\n best_S = news;\n }\n }\n }\n }\n auto get_par = [&](const vector& cs) {\n vector parent(N, -1);\n vector dist(N, -1);\n queue q;\n for (int c : cs) {\n if (dist[c] == -1) {\n dist[c] = 0;\n parent[c] = -1;\n q.push(c);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (dist[v] == -1) {\n dist[v] = dist[u] + 1;\n parent[v] = u;\n if (dist[v] <= H) q.push(v);\n }\n }\n }\n return parent;\n };\n vector p = get_par(best_S);\n for (int i = 0; i < N; i++) {\n cout << p[i];\n if (i + 1 < N) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc042":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector board(N);\n for(auto &s : board) cin >> s;\n vector> onis;\n int oni_id[20][20];\n memset(oni_id, -1, sizeof(oni_id));\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n if(board[i][j] == 'x') {\n oni_id[i][j] = onis.size();\n onis.emplace_back(i, j);\n }\n }\n }\n int M = onis.size();\n vector>> oni_possible(M);\n vector g_dir;\n vector g_p;\n // columns up\n for(int j=0; j> adds;\n for(int r=0; r= 0; r--) {\n if(board[r][j] == 'o') break;\n mk++;\n }\n vector> adds;\n for(int r = N - mk; r < N; r++) if(board[r][j]=='x') {\n int rk = N - r;\n adds.emplace_back(oni_id[r][j], rk);\n }\n if(!adds.empty()) {\n int gid = g_dir.size();\n g_dir.push_back('D');\n g_p.push_back(j);\n for(auto [oid,rk]:adds) {\n oni_possible[oid].emplace_back(gid, rk);\n }\n }\n }\n // rows left\n for(int i=0; i> adds;\n for(int c=0; c=0; c--) {\n if(board[i][c]=='o') break;\n mk++;\n }\n vector> adds;\n for(int c=N-mk; c oni_order(M);\n iota(oni_order.begin(), oni_order.end(), 0);\n sort(oni_order.begin(), oni_order.end(), [&](int a, int b){\n int ma = INT_MAX, mb = INT_MAX;\n for(auto& pr : oni_possible[a]) ma = min(ma, pr.second);\n for(auto& pr : oni_possible[b]) mb = min(mb, pr.second);\n return ma > mb;\n });\n vector curr_maxk(num_g, 0);\n for(int oi: oni_order){\n int min_inc = INT_MAX;\n int bestg = -1;\n int bestrk = -1;\n for(auto& pr: oni_possible[oi]){\n int g = pr.first;\n int rk = pr.second;\n int nm = max(curr_maxk[g], rk);\n int inc = nm - curr_maxk[g];\n if(inc < min_inc || (inc == min_inc && curr_maxk[g] > bestrk)) {\n min_inc = inc;\n bestg = g;\n bestrk = curr_maxk[g];\n }\n }\n int rk_to_use = -1;\n for(auto& pr: oni_possible[oi]) if(pr.first == bestg) rk_to_use = pr.second;\n curr_maxk[bestg] = max(curr_maxk[bestg], rk_to_use);\n }\n vector> selected;\n for(int g=0; g 0){\n selected.emplace_back(g_dir[g], g_p[g], curr_maxk[g]);\n }\n }\n vector> moves;\n auto get_reverse = [](char d) -> char {\n if(d=='U') return 'D';\n if(d=='D') return 'U';\n if(d=='L') return 'R';\n if(d=='R') return 'L';\n return ' ';\n };\n for(auto [d, p, k] : selected){\n char fwd = d;\n char revv = get_reverse(d);\n for(int t=0; t\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N;\n ll L;\n cin >> N >> L;\n vector T(N);\n for (auto &x : T) cin >> x;\n vector> emp(N);\n for (int i = 0; i < N; i++) emp[i] = {T[i], i};\n sort(emp.rbegin(), emp.rend());\n ll min_approx_e = LLONG_MAX;\n int bestk = -1, bestd = -1;\n for (int k = 1; k <= N; k++) {\n for (int d = 0; d <= k; d++) {\n bool zero_in = false;\n for (int j = 0; j < k; j++) if (emp[j].second == 0) zero_in = true;\n double vis_S = zero_in ? (double)L : (double)L - 1.0;\n double denom = k + d;\n double r = vis_S / denom;\n vector assumed(N, 0);\n for (int j = 0; j < k; j++) {\n int id = emp[j].second;\n ll tapp = round((j < d ? 2 : 1) * r);\n assumed[id] = tapp;\n }\n if (!zero_in) {\n assumed[0] = 1;\n }\n ll this_e = 0;\n for (int i = 0; i < N; i++) {\n this_e += abs(assumed[i] - T[i]);\n }\n if (this_e < min_approx_e) {\n min_approx_e = this_e;\n bestk = k;\n bestd = d;\n }\n }\n }\n int k = bestk, d = bestd;\n vector is_dou(N, 0);\n vector is_inS(N, 0);\n for (int j = 0; j < k; j++) {\n is_inS[emp[j].second] = 1;\n if (j < d) is_dou[emp[j].second] = 1;\n }\n vector S;\n for (int j = 0; j < k; j++) S.push_back(emp[j].second);\n vector> cycs;\n cycs.push_back(S);\n auto byid = S;\n sort(byid.begin(), byid.end());\n cycs.push_back(byid);\n auto byascT = S;\n reverse(byascT.begin(), byascT.end());\n cycs.push_back(byascT);\n ll best_real_e = LLONG_MAX;\n vector best_a(N), best_b(N);\n for (auto cyc : cycs) {\n if (cyc.empty()) continue;\n vector cura(N), curb(N);\n int ent = cyc[0];\n for (int i = 0; i < N; i++) if (!is_inS[i]) {\n cura[i] = curb[i] = ent;\n }\n for (size_t ii = 0; ii < cyc.size(); ii++) {\n int i = cyc[ii];\n int nxt = cyc[(ii + 1) % cyc.size()];\n if (is_dou[i]) {\n cura[i] = i;\n curb[i] = nxt;\n } else {\n cura[i] = nxt;\n curb[i] = nxt;\n }\n }\n if (k == 0) {\n for (int i = 0; i < N; i++) {\n cura[i] = curb[i] = 0;\n }\n }\n vector cnt(N, 0);\n int curr = 0;\n for (ll w = 0; w < L; w++) {\n cnt[curr]++;\n if (w + 1 == L) break;\n ll t = cnt[curr];\n int nxt = (t % 2 == 1 ? cura[curr] : curb[curr]);\n curr = nxt;\n }\n ll ee = 0;\n for (int i = 0; i < N; i++) ee += abs(cnt[i] - T[i]);\n if (ee < best_real_e) {\n best_real_e = ee;\n best_a = cura;\n best_b = curb;\n }\n }\n if (bestk == -1) {\n for (int i = 0; i < N; i++) {\n cout << 0 << \" \" << 0 << endl;\n }\n } else {\n for (int i = 0; i < N; i++) {\n cout << best_a[i] << \" \" << best_b[i] << endl;\n }\n }\n}","ahc045":"#include \nusing namespace std;\n\nint main() {\n int N, M, maxQ, L, W;\n cin >> N >> M >> maxQ >> L >> W;\n vector G(M);\n for (auto &x : G) cin >> x;\n vector cx(N), cy(N);\n for (int i = 0; i < N; i++) {\n int lx, rx, ly, ry;\n cin >> lx >> rx >> ly >> ry;\n cx[i] = (lx + rx) / 2.0;\n cy[i] = (ly + ry) / 2.0;\n }\n vector seeds(M);\n vector min_d(N, 1e18);\n seeds[0] = 0;\n for (int j = 0; j < N; j++) {\n min_d[j] = hypot(cx[0] - cx[j], cy[0] - cy[j]);\n }\n min_d[0] = -1.0;\n for (int k = 1; k < M; k++) {\n double best_md = -1.0;\n int best_j = -1;\n for (int j = 0; j < N; j++) {\n if (min_d[j] > best_md) {\n best_md = min_d[j];\n best_j = j;\n }\n }\n seeds[k] = best_j;\n for (int j = 0; j < N; j++) {\n double d = hypot(cx[best_j] - cx[j], cy[best_j] - cy[j]);\n if (d < min_d[j]) min_d[j] = d;\n }\n }\n vector> clusters(M);\n vector group_id(N, -1);\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n clusters[k].push_back(s);\n group_id[s] = k;\n }\n vector> min_dist_cluster(M, vector(N, 1e18));\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n for (int j = 0; j < N; j++) {\n min_dist_cluster[k][j] = hypot(cx[s] - cx[j], cy[s] - cy[j]);\n }\n }\n vector clus_size(M, 1);\n vector used(N, false);\n for (int k = 0; k < M; k++) used[seeds[k]] = true;\n for (int toadd = 0; toadd < N - M; toadd++) {\n double bd = 1e18;\n int bc = -1, bg = -1;\n for (int j = 0; j < N; j++) {\n if (!used[j]) {\n for (int k = 0; k < M; k++) {\n if (clus_size[k] < G[k] && min_dist_cluster[k][j] < bd) {\n bd = min_dist_cluster[k][j];\n bc = j;\n bg = k;\n }\n }\n }\n }\n used[bc] = true;\n clusters[bg].push_back(bc);\n group_id[bc] = bg;\n clus_size[bg]++;\n for (int j = 0; j < N; j++) {\n if (!used[j]) {\n double nd = hypot(cx[bc] - cx[j], cy[bc] - cy[j]);\n if (nd < min_dist_cluster[bg][j]) min_dist_cluster[bg][j] = nd;\n }\n }\n }\n vector>> queries_per_group(M);\n for (int k = 0; k < M; k++) {\n vector cits = clusters[k];\n int gs = cits.size();\n if (gs <= 2) continue;\n sort(cits.begin(), cits.end(), [&](int a, int b) {\n if (abs(cx[a] - cx[b]) > 1e-9) return cx[a] < cx[b];\n if (abs(cy[a] - cy[b]) > 1e-9) return cy[a] < cy[b];\n return a < b;\n });\n clusters[k] = cits;\n if (gs <= L) {\n queries_per_group[k].push_back(cits);\n } else {\n int step = L - 1;\n int maxs = gs - L;\n vector starts;\n for (int s = 0; s <= maxs; s += step) {\n starts.push_back(s);\n }\n if (!starts.empty() && starts.back() < maxs) {\n starts.push_back(maxs);\n } else if (starts.empty() && maxs >= 0) {\n starts.push_back(maxs);\n }\n for (int s : starts) {\n vector sub(cits.begin() + s, cits.begin() + s + L);\n queries_per_group[k].push_back(sub);\n }\n }\n }\n vector>> mst_edges(M);\n for (int k = 0; k < M; k++) {\n for (auto &sub : queries_per_group[k]) {\n int ls = sub.size();\n cout << \"? \" << ls;\n for (int c : sub) cout << \" \" << c;\n cout << endl;\n for (int e = 0; e < ls - 1; e++) {\n int a, b;\n cin >> a >> b;\n mst_edges[k].emplace_back(a, b);\n }\n }\n }\n cout << \"!\" << endl;\n for (int k = 0; k < M; k++) {\n auto &cits = clusters[k];\n int gs = cits.size();\n for (int i = 0; i < gs; i++) {\n if (i > 0) cout << \" \";\n cout << cits[i];\n }\n cout << endl;\n if (gs == 1) {\n continue;\n } else if (gs == 2) {\n cout << cits[0] << \" \" << cits[1] << endl;\n continue;\n } else {\n vector> cands;\n set> edge_set;\n for (auto [aa, bb] : mst_edges[k]) {\n int u = min(aa, bb), v = max(aa, bb);\n if (edge_set.count({u, v})) continue;\n edge_set.insert({u, v});\n double dd = hypot(cx[u] - cx[v], cy[u] - cy[v]);\n cands.emplace_back(dd, u, v);\n }\n sort(cands.begin(), cands.end());\n vector parent(N);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto &self, int x) -> int {\n return parent[x] == x ? x : parent[x] = self(self, parent[x]);\n };\n vector> selected;\n for (auto [d, u, v] : cands) {\n int pu = find(find, u), pv = find(find, v);\n if (pu != pv) {\n parent[pu] = pv;\n selected.emplace_back(u, v);\n if ((int)selected.size() == gs - 1) break;\n }\n }\n if ((int)selected.size() < gs - 1) {\n vector> more;\n for (int i = 0; i < gs; i++) {\n for (int j = i + 1; j < gs; j++) {\n int u = cits[i], v = cits[j];\n int mu = min(u, v), mv = max(u, v);\n if (edge_set.count({mu, mv})) continue;\n double dd = hypot(cx[u] - cx[v], cy[u] - cy[v]);\n more.emplace_back(dd, mu, mv);\n }\n }\n sort(more.begin(), more.end());\n for (auto [d, u, v] : more) {\n int pu = find(find, u), pv = find(find, v);\n if (pu != pv) {\n parent[pu] = pv;\n selected.emplace_back(u, v);\n if ((int)selected.size() == gs - 1) break;\n }\n }\n }\n for (auto [a, b] : selected) {\n cout << a << \" \" << b << endl;\n }\n }\n }\n return 0;\n}","ahc046":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> points(M);\n for (auto& p : points) {\n cin >> p.first >> p.second;\n }\n vector> sequence;\n pair current = points[0];\n int di[4] = {-1, 1, 0, 0};\n int dj[4] = {0, 0, -1, 1};\n char dch[4] = {'U', 'D', 'L', 'R'};\n for (int t = 1; t < M; t++) {\n int gi = points[t].first;\n int gj = points[t].second;\n vector> dist(N, vector(N, -1));\n vector> pre(N, vector(N, -1));\n vector> ac(N, vector(N, ' '));\n vector> dc(N, vector(N, ' '));\n queue> q;\n int si = current.first;\n int sj = current.second;\n dist[si][sj] = 0;\n q.push({si, sj});\n while (!q.empty()) {\n auto [i, j] = q.front();\n q.pop();\n for (int tp = 0; tp < 2; tp++) {\n for (int d = 0; d < 4; d++) {\n int ni, nj;\n if (tp == 0) {\n ni = i + di[d];\n nj = j + dj[d];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N) continue;\n } else {\n int ci = i, cj = j;\n while (true) {\n int ti = ci + di[d];\n int tj = cj + dj[d];\n if (ti < 0 || ti >= N || tj < 0 || tj >= N) break;\n ci = ti;\n cj = tj;\n }\n ni = ci;\n nj = cj;\n }\n if (dist[ni][nj] != -1) continue;\n dist[ni][nj] = dist[i][j] + 1;\n pre[ni][nj] = i * N + j;\n ac[ni][nj] = (tp == 0 ? 'M' : 'S');\n dc[ni][nj] = dch[d];\n q.push({ni, nj});\n }\n }\n }\n vector> this_path;\n int ci = gi, cj = gj;\n while (dist[ci][cj] > 0) {\n this_path.emplace_back(ac[ci][cj], dc[ci][cj]);\n int p = pre[ci][cj];\n ci = p / N;\n cj = p % N;\n }\n reverse(this_path.begin(), this_path.end());\n for (auto& p : this_path) sequence.push_back(p);\n current = {gi, gj};\n }\n for (auto& p : sequence) {\n cout << p.first << \" \" << p.second << endl;\n }\n}"},"2":{"ahc001":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int n;\n cin >> n;\n vector x(n), y(n), r(n);\n for (int i = 0; i < n; i++) {\n cin >> x[i] >> y[i] >> r[i];\n }\n vector la(n), lb(n), lc(n), ld(n);\n auto rec = [&](auto&& self, vector ids, ll xl, ll xr, ll yl, ll yr) -> void {\n int m = ids.size();\n if (m == 0) return;\n if (m == 1) {\n int i = ids[0];\n la[i] = xl; lb[i] = yl; lc[i] = xr; ld[i] = yr;\n return;\n }\n ll carea = (xr - xl) * (yr - yl);\n ll tr = 0;\n for (int i : ids) tr += r[i];\n double min_dev = 1e18;\n int best_d = -1; // 0:vert 1:horiz\n int best_kk = -1;\n ll best_cutt = -1;\n vector best_sids;\n // vertical\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return x[i] < x[j] || (x[i] == x[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll hy = yr - yl;\n if (hy == 0) continue;\n double id_cut = xl + id_area / hy;\n ll maxlx = -1;\n for (int j = 0; j < k; j++) maxlx = max(maxlx, x[sids[j]]);\n ll minrx = 10001;\n for (int j = k; j < m; j++) minrx = min(minrx, x[sids[j]]);\n ll lo = max(xl + 1, maxlx + 1);\n ll hi = min(xr, minrx);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - xl) * (double)hy;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 0;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n // horizontal\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return y[i] < y[j] || (y[i] == y[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll wx = xr - xl;\n if (wx == 0) continue;\n double id_cut = yl + id_area / wx;\n ll maxly = -1;\n for (int j = 0; j < k; j++) maxly = max(maxly, y[sids[j]]);\n ll minry = 10001;\n for (int j = k; j < m; j++) minry = min(minry, y[sids[j]]);\n ll lo = max(yl + 1, maxly + 1);\n ll hi = min(yr, minry);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - yl) * (double)wx;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 1;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n if (best_d == -1) {\n for (int ii : ids) {\n int i = ii;\n la[i] = x[i]; lb[i] = y[i]; lc[i] = x[i] + 1; ld[i] = y[i] + 1;\n }\n return;\n }\n vector left, rightt;\n for (int j = 0; j < best_kk; j++) left.push_back(best_sids[j]);\n for (int j = best_kk; j < m; j++) rightt.push_back(best_sids[j]);\n if (best_d == 0) {\n ll cut = best_cutt;\n self(self, left, xl, cut, yl, yr);\n self(self, rightt, cut, xr, yl, yr);\n } else {\n ll cut = best_cutt;\n self(self, left, xl, xr, yl, cut);\n self(self, rightt, xl, xr, cut, yr);\n }\n };\n vector all(n);\n iota(all.begin(), all.end(), 0);\n rec(rec, all, 0LL, 10000LL, 0LL, 10000LL);\n // post-process shrinking/optimizing each rect independently\n for (int i = 0; i < n; i++) {\n ll xl = la[i], xr = lc[i], yl = lb[i], yr = ld[i];\n ll W = xr - xl;\n ll H = yr - yl;\n ll xi = x[i], yi = y[i];\n ll lroom = xi - xl;\n ll rroom = xr - xi - 1;\n ll broom = yi - yl;\n ll troom = yr - yi - 1;\n auto getp = [&](ll s) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, r[i]) * 1.0 / max(s, r[i]);\n return 2 * rat - rat * rat;\n };\n double bp = getp(W * H);\n ll bw = W, bh = H;\n for (ll w = 1; w <= W; w++) {\n double idh = r[i] * 1.0 / w;\n ll hround = (ll)round(idh);\n for (ll dh = -1; dh <= 1; dh++) {\n ll h = hround + dh;\n if (h < 1 || h > H) continue;\n ll s = w * h;\n double pv = getp(s);\n if (pv > bp) {\n bp = pv;\n bw = w;\n bh = h;\n }\n }\n }\n // apply if better or different\n if (bw != W || bh != H) {\n ll wl_min = max(0LL, bw - 1 - rroom);\n ll wl_max = min(lroom, bw - 1);\n ll wl = (wl_min + wl_max) / 2;\n ll new_a = xi - wl;\n ll new_c = new_a + bw;\n ll hb_min = max(0LL, bh - 1 - troom);\n ll hb_max = min(broom, bh - 1);\n ll hb = (hb_min + hb_max) / 2;\n ll new_b = yi - hb;\n ll new_d = new_b + bh;\n la[i] = new_a;\n lb[i] = new_b;\n lc[i] = new_c;\n ld[i] = new_d;\n }\n }\n for (int i = 0; i < n; i++) {\n cout << la[i] << \" \" << lb[i] << \" \" << lc[i] << \" \" << ld[i] << \"\\n\";\n }\n}","ahc002":"#include \nusing namespace std;\n\nint main() {\n int si, sj;\n cin >> si >> sj;\n int T[50][50], P[50][50];\n int maxt = 0;\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> T[i][j];\n maxt = max(maxt, T[i][j]);\n }\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> P[i][j];\n }\n int M = maxt + 1;\n int di[4] = {-1, 0, 1, 0};\n int dj[4] = {0, 1, 0, -1};\n char dirch[4] = {'U', 'R', 'D', 'L'};\n string best_str = \"\";\n long long best_sc = -1;\n srand(42);\n int num_trials = 1000;\n char usd[2505];\n for (int trial = 0; trial < num_trials; trial++) {\n memset(usd, 0, M);\n vector moves;\n int curi = si, curj = sj;\n long long cursum = P[si][sj];\n usd[T[si][sj]] = 1;\n while (true) {\n vector> cands;\n for (int d = 0; d < 4; d++) {\n int ni = curi + di[d];\n int nj = curj + dj[d];\n if (ni < 0 || ni >= 50 || nj < 0 || nj >= 50) continue;\n int nt = T[ni][nj];\n if (usd[nt]) continue;\n int deg = 0;\n for (int dd = 0; dd < 4; dd++) {\n int nni = ni + di[dd], nnj = nj + dj[dd];\n if (nni >= 0 && nni < 50 && nnj >= 0 && nnj < 50) {\n int nnt = T[nni][nnj];\n if (nnt != nt && !usd[nnt]) deg++;\n }\n }\n cands.emplace_back(-deg, -P[ni][nj], d);\n }\n if (cands.empty()) break;\n sort(cands.begin(), cands.end());\n int sz = cands.size();\n int take = 0;\n if (sz >= 2) {\n take = rand() % min(3, sz);\n }\n auto [ndeg, np, d] = cands[take];\n int ni = curi + di[d];\n int nj = curj + dj[d];\n int nt = T[ni][nj];\n usd[nt] = 1;\n moves.push_back(dirch[d]);\n cursum += P[ni][nj];\n curi = ni;\n curj = nj;\n }\n if (cursum > best_sc) {\n best_sc = cursum;\n best_str = string(moves.begin(), moves.end());\n }\n }\n cout << best_str << endl;\n}","ahc003":"#include \nusing namespace std;\n\nint main() {\n double H[30][29];\n double V[29][30];\n for (int i = 0; i < 30; i++) {\n for (int j = 0; j < 29; j++) {\n H[i][j] = 5000.0 + ((i * 29 + j) % 19 - 9) * 2.0;\n }\n }\n for (int i = 0; i < 29; i++) {\n for (int j = 0; j < 30; j++) {\n V[i][j] = 5000.0 + ((i * 30 + j) % 19 - 9) * 2.0;\n }\n }\n for (int q = 0; q < 1000; q++) {\n int si, sj, ti, tj;\n cin >> si >> sj >> ti >> tj;\n const double INF = 1e18;\n vector dist(900, INF);\n vector prevv(900, -1);\n priority_queue, vector>, greater>> pq;\n int S = si * 30 + sj;\n int T = ti * 30 + tj;\n dist[S] = 0.0;\n pq.push({0.0, S});\n while (!pq.empty()) {\n auto [c, u] = pq.top();\n pq.pop();\n if (c > dist[u]) continue;\n int i = u / 30;\n int j = u % 30;\n if (j > 0) {\n int nv = i * 30 + (j - 1);\n double nw = H[i][j - 1];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (j < 29) {\n int nv = i * 30 + (j + 1);\n double nw = H[i][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i > 0) {\n int nv = (i - 1) * 30 + j;\n double nw = V[i - 1][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i < 29) {\n int nv = (i + 1) * 30 + j;\n double nw = V[i][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n }\n vector path_nodes;\n int cur = T;\n while (true) {\n path_nodes.push_back(cur);\n if (cur == S) break;\n cur = prevv[cur];\n }\n reverse(path_nodes.begin(), path_nodes.end());\n string path_str = \"\";\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n char move;\n if (ci == pi - 1 && cj == pj) move = 'U';\n else if (ci == pi + 1 && cj == pj) move = 'D';\n else if (cj == pj - 1 && ci == pi) move = 'L';\n else if (cj == pj + 1 && ci == pi) move = 'R';\n else assert(false);\n path_str += move;\n }\n cout << path_str << endl;\n int obs;\n cin >> obs;\n double est = dist[T];\n if (est < 1e-9) est = 1.0;\n int num_e = path_nodes.size() - 1;\n double delta = (double)obs - est;\n double alpha = 0.3;\n double adjust_per = (delta / num_e) * alpha;\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n if (pi == ci) {\n int jleft = min(pj, cj);\n H[pi][jleft] += adjust_per;\n if (H[pi][jleft] < 100.0) H[pi][jleft] = 100.0;\n if (H[pi][jleft] > 20000.0) H[pi][jleft] = 20000.0;\n } else {\n int itop = min(pi, ci);\n V[itop][pj] += adjust_per;\n if (V[itop][pj] < 100.0) V[itop][pj] = 100.0;\n if (V[itop][pj] > 20000.0) V[itop][pj] = 20000.0;\n }\n }\n }\n return 0;\n}","ahc004":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector S(M);\n for (auto& s : S) cin >> s;\n vector base_order(M);\n iota(base_order.begin(), base_order.end(), 0);\n sort(base_order.begin(), base_order.end(), [&](int a, int b) {\n return S[a].size() > S[b].size();\n });\n srand(time(NULL));\n auto count_c = [&](const vector& g) -> int {\n int cnt = 0;\n for (const auto& s : S) {\n bool found = false;\n // horiz\n for (int r = 0; r < N && !found; r++) {\n for (int st = 0; st < N; st++) {\n bool ok = true;\n for (int p = 0; p < (int)s.size() && ok; p++) {\n if (g[r][(st + p) % N] != s[p]) ok = false;\n }\n if (ok) {\n found = true;\n break;\n }\n }\n }\n if (found) {\n cnt++;\n continue;\n }\n // vert\n for (int c = 0; c < N && !found; c++) {\n for (int st = 0; st < N; st++) {\n bool ok = true;\n for (int p = 0; p < (int)s.size() && ok; p++) {\n if (g[(st + p) % N][c] != s[p]) ok = false;\n }\n if (ok) {\n found = true;\n break;\n }\n }\n }\n if (found) cnt++;\n }\n return cnt;\n };\n auto compute_f = [&](const vector& g) -> int {\n int ff = 0;\n for (auto& row : g) for (char ch : row) if (ch != '.') ff++;\n return ff;\n };\n int best_c_val = -1;\n int best_ff = 0;\n vector best_grid;\n for (int trial = 0; trial < 10; trial++) {\n vector order = base_order;\n // shuffle within length groups\n int i = 0;\n while (i < M) {\n int j = i;\n int len = S[order[i]].size();\n while (j < M && (int)S[order[j]].size() == len) j++;\n shuffle(order.begin() + i, order.begin() + j, mt19937(rand()));\n i = j;\n }\n vector grid(N, string(N, '.'));\n auto can_place_func = [&](int r, int c, int dr, int dc, const string& s, const vector& grd) -> pair {\n int k = s.size();\n int match_cnt = 0;\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n char need = s[p];\n if (grd[rr][cc] != '.' && grd[rr][cc] != need) return {false, 0};\n if (grd[rr][cc] == need) match_cnt++;\n }\n return {true, match_cnt};\n };\n auto do_write_func = [&](int r, int c, int dr, int dc, const string& s, vector& grd) {\n int k = s.size();\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n grd[rr][cc] = s[p];\n }\n };\n for (int idx : order) {\n const string& s = S[idx];\n // first find true max_mt\n int true_max = -1;\n // horiz\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(r, st, 0, 1, s, grid);\n if (poss) true_max = max(true_max, mt);\n }\n }\n // vert\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(st, c, 1, 0, s, grid);\n if (poss) true_max = max(true_max, mt);\n }\n }\n if (true_max == -1) continue;\n int target_mt = (true_max == 1 ? 0 : true_max);\n vector> cands;\n // horiz collect\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(r, st, 0, 1, s, grid);\n if (poss && mt == target_mt) {\n cands.emplace_back(r, st, 0, 1);\n }\n }\n }\n // vert collect\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(st, c, 1, 0, s, grid);\n if (poss && mt == target_mt) {\n cands.emplace_back(st, c, 1, 0);\n }\n }\n }\n if (!cands.empty()) {\n int choice = 0;\n if (target_mt <= 1 && cands.size() > 1) {\n choice = rand() % cands.size();\n }\n auto [br, bc, bdr, bdc] = cands[choice];\n do_write_func(br, bc, bdr, bdc, s, grid);\n }\n }\n int this_c = count_c(grid);\n int this_f = compute_f(grid);\n bool do_update = false;\n if (best_c_val == -1 || this_c > best_c_val) {\n do_update = true;\n } else if (this_c == best_c_val) {\n if (this_c == M) {\n if (this_f < best_ff) do_update = true;\n }\n }\n if (do_update) {\n best_c_val = this_c;\n best_ff = this_f;\n best_grid = grid;\n }\n }\n for (auto& row : best_grid) {\n cout << row << endl;\n }\n return 0;\n}","ahc005":"#include \nusing namespace std;\nusing ll = long long;\n\nconst int MAXN = 70;\nconst ll INF = 1LL << 60;\nint di[4] = {-1, 0, 1, 0};\nint dj[4] = {0, 1, 0, -1};\n\nint main() {\n int N, si, sj;\n cin >> N >> si >> sj;\n vector grid(N);\n for (auto& s : grid) cin >> s;\n int h_id[MAXN][MAXN];\n int v_id[MAXN][MAXN];\n memset(h_id, -1, sizeof(h_id));\n memset(v_id, -1, sizeof(v_id));\n int num_h = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N;) {\n if (grid[i][j] == '#') {\n j++;\n continue;\n }\n while (j < N && grid[i][j] != '#') {\n h_id[i][j] = num_h;\n j++;\n }\n num_h++;\n }\n }\n int num_v = 0;\n for (int j = 0; j < N; j++) {\n for (int i = 0; i < N;) {\n if (grid[i][j] == '#') {\n i++;\n continue;\n }\n while (i < N && grid[i][j] != '#') {\n v_id[i][j] = num_v;\n i++;\n }\n num_v++;\n }\n }\n vector>> h_cells(num_h);\n vector>> v_cells(num_v);\n vector> all_roads;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (grid[i][j] != '#') {\n all_roads.emplace_back(i, j);\n h_cells[h_id[i][j]].emplace_back(i, j);\n v_cells[v_id[i][j]].emplace_back(i, j);\n }\n }\n }\n int r = all_roads.size();\n bool is_covered[MAXN][MAXN] = {};\n int num_uncovered = r;\n auto get_gain = [&](int x, int y) {\n int g = 0;\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) if (!is_covered[a][b]) g++;\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) if (!is_covered[a][b]) g++;\n if (!is_covered[x][y]) g--;\n return g;\n };\n auto apply_cover = [&](int x, int y) {\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n };\n vector> keys;\n apply_cover(si, sj);\n keys.emplace_back(si, sj);\n while (num_uncovered > 0) {\n int mg = 0;\n pair bp{-1, -1};\n for (auto p : all_roads) {\n int gg = get_gain(p.first, p.second);\n if (gg > mg) {\n mg = gg;\n bp = p;\n }\n }\n if (mg <= 0) break;\n keys.push_back(bp);\n apply_cover(bp.first, bp.second);\n }\n vector> points;\n set> unique_pts(keys.begin(), keys.end());\n for (auto p : unique_pts) points.push_back(p);\n int m = points.size();\n for (int i = 0; i < m; i++) {\n if (points[i].first == si && points[i].second == sj) {\n swap(points[i], points[0]);\n break;\n }\n }\n if (m == 0) {\n cout << \"\" << endl;\n return 0;\n }\n vector> D(m, vector(m, INF));\n for (int k = 0; k < m; k++) {\n pair src = points[k];\n vector> dd(N, vector(N, INF));\n dd[src.first][src.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, src.first, src.second});\n while (!pq.empty()) {\n auto [cost, x, y] = pq.top();\n pq.pop();\n if (cost > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = cost + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n pq.push({nc, nx, ny});\n }\n }\n }\n for (int t = 0; t < m; t++) {\n auto [tx, ty] = points[t];\n D[k][t] = dd[tx][ty];\n }\n }\n vector order;\n if (m == 1) {\n order = {0};\n } else {\n vector vis(m, false);\n order.push_back(0);\n vis[0] = true;\n for (int cnt = 1; cnt < m; cnt++) {\n int curi = order.back();\n ll min_d = INF;\n int chosen = -1;\n for (int j = 0; j < m; j++) {\n if (!vis[j] && D[curi][j] < min_d) {\n min_d = D[curi][j];\n chosen = j;\n }\n }\n order.push_back(chosen);\n vis[chosen] = true;\n }\n }\n auto calc_tour_cost = [&](const vector& ord) -> ll {\n ll sum = 0;\n for (int i = 0; i < m; i++) {\n sum += D[ord[i]][ord[(i + 1) % m]];\n }\n return sum;\n };\n if (m >= 3) {\n int iters = 0;\n bool improved = true;\n while (improved && iters++ < 200) {\n improved = false;\n ll cur_cost = calc_tour_cost(order);\n for (int l = 0; l < m && !improved; l++) {\n for (int r = l + 1; r < m && !improved; r++) {\n vector newo = order;\n reverse(newo.begin() + l, newo.begin() + r + 1);\n ll nc = calc_tour_cost(newo);\n if (nc < cur_cost) {\n order = newo;\n improved = true;\n }\n }\n }\n }\n }\n int zero_pos = 0;\n for (int i = 0; i < m; i++) {\n if (order[i] == 0) {\n zero_pos = i;\n break;\n }\n }\n vector final_order(m);\n for (int i = 0; i < m; i++) {\n final_order[i] = order[(zero_pos + i) % m];\n }\n order = final_order;\n vector> full_route;\n full_route.push_back(points[0]);\n for (int i = 0; i < m; i++) {\n int u = order[i];\n int v = order[(i + 1) % m];\n auto sp = points[u];\n auto tp = points[v];\n vector>> par(N, vector>(N, {-1, -1}));\n vector> dd(N, vector(N, INF));\n dd[sp.first][sp.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, sp.first, sp.second});\n while (!pq.empty()) {\n auto [c, x, y] = pq.top();\n pq.pop();\n if (c > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = c + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n par[nx][ny] = {x, y};\n pq.push({nc, nx, ny});\n }\n }\n }\n vector> thisp;\n auto curp = tp;\n while (curp.first != -1) {\n thisp.push_back(curp);\n if (curp == sp) break;\n curp = par[curp.first][curp.second];\n }\n reverse(thisp.begin(), thisp.end());\n for (size_t j = 1; j < thisp.size(); j++) {\n full_route.push_back(thisp[j]);\n }\n }\n string ans = \"\";\n for (size_t i = 0; i + 1 < full_route.size(); i++) {\n int dx = full_route[i + 1].first - full_route[i].first;\n int dy = full_route[i + 1].second - full_route[i].second;\n if (dx == -1 && dy == 0) ans += 'U';\n else if (dx == 1 && dy == 0) ans += 'D';\n else if (dx == 0 && dy == -1) ans += 'L';\n else if (dx == 0 && dy == 1) ans += 'R';\n }\n cout << ans << endl;\n}","future-contest-2022-qual":"#include \nusing namespace std;\n\nint main() {\n int N, M, K, R;\n cin >> N >> M >> K >> R;\n vector> D(N, vector(K));\n for (int i = 0; i < N; i++) {\n for (int k = 0; k < K; k++) {\n cin >> D[i][k];\n }\n }\n vector> successors(N);\n vector unfinished_preds(N, 0);\n for (int i = 0; i < R; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n successors[u].push_back(v);\n unfinished_preds[v]++;\n }\n vector priority(N, 0);\n for (int i = N - 1; i >= 0; i--) {\n int mx = 0;\n for (int s : successors[i]) {\n mx = max(mx, priority[s]);\n }\n priority[i] = 4 + mx;\n }\n vector> est_s(M, vector(K, 0));\n vector member_task(M, -1);\n vector member_startday(M, -1);\n vector task_status(N, 0);\n vector tasks_completed_by(M, 0);\n auto seed = chrono::steady_clock::now().time_since_epoch().count();\n mt19937 rng(seed);\n int day = 0;\n while (true) {\n day++;\n if (day > 2000) break;\n vector free_workers;\n for (int j = 0; j < M; j++) {\n if (member_task[j] == -1) free_workers.push_back(j);\n }\n vector candidate_tasks;\n for (int i = 0; i < N; i++) {\n if (task_status[i] == 0 && unfinished_preds[i] == 0) {\n candidate_tasks.push_back(i);\n }\n }\n vector> assigns;\n if (!free_workers.empty() && !candidate_tasks.empty()) {\n sort(candidate_tasks.begin(), candidate_tasks.end(), [&](int a, int b) {\n if (priority[a] != priority[b]) return priority[a] > priority[b];\n return a < b;\n });\n int num_assign = min((int)free_workers.size(), (int)candidate_tasks.size());\n vector tasks_select(candidate_tasks.begin(), candidate_tasks.begin() + num_assign);\n vector free_shuffled = free_workers;\n shuffle(free_shuffled.begin(), free_shuffled.end(), rng);\n vector worker_pref(M, 10000);\n for (int ord = 0; ord < (int)free_shuffled.size(); ord++) {\n worker_pref[free_shuffled[ord]] = ord;\n }\n vector worker_free(M, false);\n for (int j : free_workers) worker_free[j] = true;\n for (int ti = 0; ti < num_assign; ti++) {\n int tsk = tasks_select[ti];\n int best_et = INT_MAX;\n int best_exp = INT_MAX;\n int best_pref = INT_MAX;\n int best_j = -1;\n for (int j = 0; j < M; j++) {\n if (!worker_free[j]) continue;\n int wsum = 0;\n for (int k = 0; k < K; k++) {\n wsum += max(0, D[tsk][k] - est_s[j][k]);\n }\n int estt = (wsum == 0 ? 1 : wsum);\n int expp = tasks_completed_by[j];\n int preff = worker_pref[j];\n bool better = false;\n if (estt < best_et) better = true;\n else if (estt == best_et) {\n if (expp < best_exp) better = true;\n else if (expp == best_exp && preff < best_pref) better = true;\n }\n if (better) {\n best_et = estt;\n best_exp = expp;\n best_pref = preff;\n best_j = j;\n }\n }\n if (best_j != -1) {\n worker_free[best_j] = false;\n assigns.emplace_back(best_j, tsk);\n task_status[tsk] = 1;\n member_task[best_j] = tsk;\n member_startday[best_j] = day;\n }\n }\n }\n cout << assigns.size();\n for (auto [j, t] : assigns) {\n cout << \" \" << (j + 1) << \" \" << (t + 1);\n }\n cout << endl;\n int n_comp;\n cin >> n_comp;\n if (n_comp == -1) break;\n for (int fi = 0; fi < n_comp; fi++) {\n int f;\n cin >> f;\n int j = f - 1;\n int tsk = member_task[j];\n if (tsk >= 0) {\n int t_taken = day - member_startday[j] + 1;\n int w_max = (t_taken == 1 ? 4 : t_taken + 3);\n for (int k = 0; k < K; k++) {\n est_s[j][k] = max(est_s[j][k], D[tsk][k] - w_max);\n }\n tasks_completed_by[j]++;\n task_status[tsk] = 2;\n member_task[j] = -1;\n member_startday[j] = -1;\n for (int suc : successors[tsk]) {\n unfinished_preds[suc]--;\n }\n }\n }\n }\n return 0;\n}","ahc006":"#include \nusing namespace std;\n\nstruct Point {\n int x, y;\n};\n\nint manh(const Point& a, const Point& b) {\n return abs(a.x - b.x) + abs(a.y - b.y);\n}\n\npair> get_route(const vector& S, const Point* picks, const Point* dels, Point cen) {\n int N = S.size();\n bool isp[1000] = {};\n bool isd[1000] = {};\n vector pth;\n pth.push_back(cen);\n Point cur = cen;\n int tt = 0;\n for (int st = 0; st < N * 2; ++st) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : S) {\n if (!isp[id]) {\n int dt = manh(cur, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd[id]) {\n int dt = manh(cur, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n tt += bd;\n if (bip) {\n cur = picks[bi];\n isp[bi] = true;\n } else {\n cur = dels[bi];\n isd[bi] = true;\n }\n pth.push_back(cur);\n }\n tt += manh(cur, cen);\n pth.push_back(cen);\n return {tt, pth};\n}\n\nint main() {\n Point picks[1000], dels[1000];\n for (int i = 0; i < 1000; ++i) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n picks[i] = {a, b};\n dels[i] = {c, d};\n }\n Point cen = {400, 400};\n int solos[1000];\n for (int i = 0; i < 1000; ++i) {\n solos[i] = manh(cen, picks[i]) + manh(picks[i], dels[i]) + manh(dels[i], cen);\n }\n vector ord(1000);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) {\n return solos[i] < solos[j] || (solos[i] == solos[j] && i < j);\n });\n vector cur_S(ord.begin(), ord.begin() + 50);\n auto compute_T = [&](const vector& S) -> int {\n bool isp[1000] = {};\n bool isd[1000] = {};\n Point curr = cen;\n int total = 0;\n for (int step = 0; step < 100; ++step) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : S) {\n if (!isp[id]) {\n int dt = manh(curr, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd[id]) {\n int dt = manh(curr, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n total += bd;\n if (bip) {\n curr = picks[bi];\n isp[bi] = true;\n } else {\n curr = dels[bi];\n isd[bi] = true;\n }\n }\n total += manh(curr, cen);\n return total;\n };\n bool is_in[1000] = {};\n for (int i : cur_S) is_in[i] = true;\n int current_T = compute_T(cur_S);\n int best_T_val = current_T;\n vector best_S = cur_S;\n double temperature = 3000.0;\n const double rate = 0.99995;\n const int max_iter = 100000;\n srand(42);\n for (int it = 0; it < max_iter; ++it) {\n int pos = rand() % 50;\n int old_id = cur_S[pos];\n int new_id;\n do {\n new_id = rand() % 1000;\n } while (is_in[new_id]);\n cur_S[pos] = new_id;\n int nt = compute_T(cur_S);\n int delta = nt - current_T;\n bool acc = false;\n if (delta < 0) {\n acc = true;\n } else {\n double prob = exp(-delta / temperature);\n if (prob > (rand() * 1.0 / RAND_MAX)) acc = true;\n }\n if (acc) {\n is_in[old_id] = false;\n is_in[new_id] = true;\n current_T = nt;\n if (current_T < best_T_val) {\n best_T_val = current_T;\n best_S = cur_S;\n }\n } else {\n cur_S[pos] = old_id;\n }\n temperature *= rate;\n }\n auto [final_t, best_path] = get_route(best_S, picks, dels, cen);\n vector chosen = best_S;\n for (int& v : chosen) ++v;\n sort(chosen.begin(), chosen.end());\n cout << 50;\n for (int r : chosen) cout << \" \" << r;\n cout << endl;\n cout << best_path.size();\n for (auto& pt : best_path) {\n cout << \" \" << pt.x << \" \" << pt.y;\n }\n cout << endl;\n return 0;\n}","ahc007":"#include \nusing namespace std;\n\nstruct Edge {\n int u, v, d, order_idx;\n};\n\nstruct TmpE {\n int l, u, v;\n};\n\nint main() {\n mt19937 rng(42);\n int N = 400;\n int M = 1995;\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector alledges(M);\n for (int i = 0; i < M; i++) {\n cin >> alledges[i].u >> alledges[i].v;\n long long dx = X[alledges[i].u] - X[alledges[i].v];\n long long dy = Y[alledges[i].u] - Y[alledges[i].v];\n long long dist2 = dx * dx + dy * dy;\n alledges[i].d = round(sqrt((double)dist2));\n alledges[i].order_idx = i;\n }\n vector parent(N), rankk(N, 0);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto& self, int x) -> int {\n if (parent[x] != x) parent[x] = self(self, parent[x]);\n return parent[x];\n };\n auto unite = [&](int a, int b) {\n a = find(find, a);\n b = find(find, b);\n if (a == b) return;\n if (rankk[a] < rankk[b]) swap(a, b);\n parent[b] = a;\n if (rankk[a] == rankk[b]) rankk[a]++;\n };\n for (int ii = 0; ii < M; ii++) {\n int l;\n cin >> l;\n Edge& e = alledges[ii];\n int uu = e.u, vv = e.v;\n int pu = find(find, uu);\n int pv = find(find, vv);\n if (pu == pv) {\n cout << 0 << endl;\n continue;\n }\n bool must = true;\n {\n vector tp = parent;\n vector tr = rankk;\n auto tfi = [&](auto& self, int x) -> int {\n if (tp[x] != x) tp[x] = self(self, tp[x]);\n return tp[x];\n };\n int ssu = tfi(tfi, uu);\n int ssv = tfi(tfi, vv);\n for (int j = ii + 1; j < M; j++) {\n int pa = tfi(tfi, alledges[j].u);\n int pb = tfi(tfi, alledges[j].v);\n if (pa != pb) {\n int aa = pa, bb = pb;\n if (tr[aa] < tr[bb]) swap(aa, bb);\n tp[bb] = aa;\n if (tr[aa] == tr[bb]) tr[aa]++;\n }\n }\n if (tfi(tfi, ssu) == tfi(tfi, ssv)) must = false;\n }\n bool adopt;\n if (must) {\n adopt = true;\n } else {\n const int NS = 4;\n long long total_bott = 0;\n for (int sam = 0; sam < NS; sam++) {\n vector fut;\n fut.reserve(M - ii - 1);\n for (int j = ii + 1; j < M; j++) {\n auto& ej = alledges[j];\n int dd = ej.d;\n int rnum = 2 * dd + 1;\n int rl = dd + (int)(rng() % rnum);\n fut.push_back({rl, ej.u, ej.v});\n }\n sort(fut.begin(), fut.end(), [](const TmpE& a, const TmpE& b) {\n return a.l < b.l;\n });\n vector tp = parent;\n vector tr = rankk;\n auto tfi = [&](auto& self, int x) -> int {\n if (tp[x] != x) tp[x] = self(self, tp[x]);\n return tp[x];\n };\n int ssu = tfi(tfi, uu);\n int ssv = tfi(tfi, vv);\n int thisb = 1000000000;\n bool conn = false;\n for (auto& fe : fut) {\n int pa = tfi(tfi, fe.u);\n int pb = tfi(tfi, fe.v);\n if (pa != pb) {\n int aa = pa, bb = pb;\n if (tr[aa] < tr[bb]) swap(aa, bb);\n tp[bb] = aa;\n if (tr[aa] == tr[bb]) tr[aa]++;\n if (tfi(tfi, ssu) == tfi(tfi, ssv)) {\n thisb = fe.l;\n conn = true;\n break;\n }\n }\n }\n if (!conn) thisb = 1000000000;\n total_bott += thisb;\n }\n long long avgb = total_bott / NS;\n adopt = (l <= avgb);\n }\n cout << (adopt ? 1 : 0) << endl;\n if (adopt) {\n unite(uu, vv);\n }\n }\n return 0;\n}","ahc008":"#include \nusing namespace std;\n\nstruct Task {\n int tx, ty;\n char act;\n int wx, wy;\n};\n\nint main() {\n int N;\n cin >> N;\n vector> pet_pos(N);\n vector pet_t(N);\n for (int i = 0; i < N; i++) {\n int x, y, t;\n cin >> x >> y >> t;\n pet_pos[i] = {x, y};\n pet_t[i] = t;\n }\n int M;\n cin >> M;\n vector> hum_pos(M);\n for (int i = 0; i < M; i++) {\n int x, y;\n cin >> x >> y;\n hum_pos[i] = {x, y};\n }\n double pp = 0.04;\n double ff = 1.0 - pow(pp, 1.0 / N);\n ff = min(ff, 0.28);\n int area_t = (int)(ff * 900) + 20;\n int best_per = 1000;\n int HH = 10, WW = 10;\n for (int h = 6; h <= 26; h++) {\n for (int w = 6; w <= 26; w++) {\n if ((long long)h * w >= area_t && h + w < best_per) {\n best_per = h + w;\n HH = h;\n WW = w;\n }\n }\n }\n int H = HH, W = WW;\n int num_bottom_walls = W;\n int num_right_walls = H;\n int num_b_h = max(1, M * num_bottom_walls / (num_bottom_walls + num_right_walls));\n if (num_b_h > M - (num_right_walls > 0)) num_b_h = max(1, M - (num_right_walls > 0 ? 1 : 0));\n int num_r_h = M - num_b_h;\n pair center = {(1 + H) / 2, (1 + W) / 2};\n vector> homes(M, center);\n vector> bot_pos, rig_pos;\n for (int y = 1; y <= W; y++) bot_pos.emplace_back(H, y);\n for (int x = 1; x <= H; x++) rig_pos.emplace_back(x, W);\n bool walledg[31][31];\n memset(walledg, 0, sizeof(walledg));\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n char mcs[4] = {'U', 'D', 'L', 'R'};\n bool is_build = false;\n vector> htasks(M);\n vector tindex(M, 0);\n int wait_turns = 0;\n bool is_all_home = false;\n for (int turn = 0; turn < 300; turn++) {\n string acts(M, '.');\n int pin = 0;\n for (auto [x, y] : pet_pos) if (x <= H && y <= W && !walledg[x][y]) pin++;\n bool allhome = true;\n for (int i = 0; i < M; i++) if (hum_pos[i].first != homes[i].first || hum_pos[i].second != homes[i].second) allhome = false;\n if (allhome) {\n is_all_home = true;\n wait_turns++;\n }\n int trigger_n = (N <= 12 ? 0 : 1);\n if (!is_build && is_all_home && (pin <= trigger_n || (wait_turns > 90 && pin <= trigger_n + 2))) {\n is_build = true;\n htasks.assign(M, vector());\n tindex.assign(M, 0);\n for (int k = 0; k < num_b_h; k++) {\n int hi = k;\n int yst = 1 + (num_bottom_walls * k / max(1, num_b_h));\n int yen = 1 + (num_bottom_walls * (k + 1) / max(1, num_b_h)) - 1;\n vector ts;\n for (int y = yst; y <= yen; y++) {\n ts.push_back(Task{H, y, 'd', H + 1, y});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n for (int k = 0; k < num_r_h; k++) {\n int hi = num_b_h + k;\n int xst = 1 + (num_right_walls * k / max(1, num_r_h));\n int xen = 1 + (num_right_walls * (k + 1) / max(1, num_r_h)) - 1;\n vector ts;\n for (int x = xst; x <= xen; x++) {\n ts.push_back(Task{x, W, 'r', x, W + 1});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n }\n set> will_wall;\n if (is_build) {\n for (int i = 0; i < M; i++) {\n if (tindex[i] >= (int)htasks[i].size()) {\n acts[i] = '.';\n continue;\n }\n Task tk = htasks[i][tindex[i]];\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n if (hx == tk.tx && hy == tk.ty) {\n bool canb = true;\n int cx = tk.wx, cy = tk.wy;\n for (int j = 0; j < N; j++) if (pet_pos[j].first == cx && pet_pos[j].second == cy) canb = false;\n for (int j = 0; j < M; j++) if (hum_pos[j].first == cx && hum_pos[j].second == cy) canb = false;\n int ddx[4] = {-1, 0, 1, 0};\n int ddy[4] = {0, 1, 0, -1};\n for (int d = 0; d < 4; d++) {\n int nx = cx + ddx[d], ny = cy + ddy[d];\n for (int j = 0; j < N; j++) if (pet_pos[j].first == nx && pet_pos[j].second == ny) canb = false;\n }\n if (canb) {\n acts[i] = tk.act;\n will_wall.insert({cx, cy});\n walledg[cx][cy] = true;\n tindex[i]++;\n } else {\n acts[i] = '.';\n }\n } else {\n int cdist = abs(hx - tk.tx) + abs(hy - tk.ty);\n char chosen = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d];\n int ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int ndd = abs(nx - tk.tx) + abs(ny - tk.ty);\n if (ndd < cdist) {\n cdist = ndd;\n chosen = mcs[d];\n }\n }\n }\n acts[i] = chosen;\n }\n }\n } else {\n for (int i = 0; i < M; i++) {\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n int tx = homes[i].first, ty = homes[i].second;\n if (hx == tx && hy == ty) {\n acts[i] = '.';\n } else {\n int cdist = abs(hx - tx) + abs(hy - ty);\n char ch = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d], ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int nd = abs(nx - tx) + abs(ny - ty);\n if (nd < cdist) {\n cdist = nd;\n ch = mcs[d];\n }\n }\n }\n acts[i] = ch;\n }\n }\n }\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = 0;\n if (a == 'U') d = 0;\n else if (a == 'D') d = 1;\n else if (a == 'L') d = 2;\n else if (a == 'R') d = 3;\n int tx = hum_pos[i].first + dx[d];\n int ty = hum_pos[i].second + dy[d];\n if (will_wall.count({tx, ty})) {\n acts[i] = '.';\n }\n }\n }\n cout << acts << endl;\n cout.flush();\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = -1;\n for (int k = 0; k < 4; k++) if (mcs[k] == a) d = k;\n if (d >= 0) {\n hum_pos[i].first += dx[d];\n hum_pos[i].second += dy[d];\n }\n }\n }\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (char c : s) {\n int d = -1;\n if (c == 'U') d = 0;\n else if (c == 'D') d = 1;\n else if (c == 'L') d = 2;\n else if (c == 'R') d = 3;\n if (d >= 0) {\n pet_pos[i].first += dx[d];\n pet_pos[i].second += dy[d];\n }\n }\n }\n }\n return 0;\n}","ahc009":"#include \nusing namespace std;\n\nconst int H = 20;\nconst int W = 20;\nconst int MAXL = 200;\nconst int BEAMW = 40;\nconst double EPS = 1e-12;\n\nstruct State {\n double expv;\n double pr[H][W];\n};\n\nstruct TempCand {\n double expv;\n double pot;\n double pr[H][W];\n int from;\n int dird;\n};\n\nint dr[4] = {-1, 1, 0, 0};\nint dc[4] = {0, 0, -1, 1};\nchar dch[4] = {'U', 'D', 'L', 'R'};\nbool wallh[H][W-1];\nbool wallv[H-1][W];\nint dist_to[H][W];\nint parent[MAXL+1][BEAMW];\nint ch_dir[MAXL+1][BEAMW];\nState current_states[BEAMW];\nTempCand cands[BEAMW * 4 + 10];\n\nbool can_move(int r, int c, int d) {\n int nr = r + dr[d];\n int nc = c + dc[d];\n if (nr < 0 || nr >= H || nc < 0 || nc >= W) return false;\n if (d == 0) {\n return !wallv[nr][c];\n } else if (d == 1) {\n return !wallv[r][c];\n } else if (d == 2) {\n return !wallh[r][nc];\n } else {\n return !wallh[r][c];\n }\n}\n\nint main() {\n int si, sj, ti, tj;\n double p;\n cin >> si >> sj >> ti >> tj >> p;\n double forget = p;\n double success = 1.0 - p;\n for (int i = 0; i < H; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W - 1; j++) {\n wallh[i][j] = (s[j] == '1');\n }\n }\n for (int i = 0; i < H - 1; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W; j++) {\n wallv[i][j] = (s[j] == '1');\n }\n }\n // dist to T\n memset(dist_to, 0x3f, sizeof(dist_to));\n dist_to[ti][tj] = 0;\n queue> qu;\n qu.emplace(ti, tj);\n while (!qu.empty()) {\n auto [r, c] = qu.front();\n qu.pop();\n for (int d = 0; d < 4; d++) {\n if (can_move(r, c, d)) {\n int nr = r + dr[d];\n int nc = c + dc[d];\n if (dist_to[nr][nc] > dist_to[r][c] + 1) {\n dist_to[nr][nc] = dist_to[r][c] + 1;\n qu.emplace(nr, nc);\n }\n }\n }\n }\n // initial\n int cur_num = 1;\n current_states[0].expv = 0.0;\n memset(current_states[0].pr, 0, sizeof(current_states[0].pr));\n current_states[0].pr[si][sj] = 1.0;\n for (int step = 1; step <= MAXL; step++) {\n int num_cand = 0;\n for (int b = 0; b < cur_num; b++) {\n for (int d = 0; d < 4; d++) {\n TempCand& news = cands[num_cand];\n news.expv = current_states[b].expv;\n memset(news.pr, 0, sizeof(news.pr));\n double reached = 0.0;\n for (int r = 0; r < H; r++) {\n for (int c = 0; c < W; c++) {\n double pb = current_states[b].pr[r][c];\n if (pb > EPS) {\n news.pr[r][c] += pb * forget;\n int nr = r, nc = c;\n if (can_move(r, c, d)) {\n nr += dr[d];\n nc += dc[d];\n }\n double pm = pb * success;\n if (nr == ti && nc == tj) {\n reached += pm;\n } else {\n news.pr[nr][nc] += pm;\n }\n }\n }\n }\n news.expv += reached * (401.0 - step);\n news.pot = 0.0;\n for (int r = 0; r < H; r++) {\n for (int c = 0; c < W; c++) {\n news.pot += news.pr[r][c] * dist_to[r][c];\n }\n }\n news.from = b;\n news.dird = d;\n num_cand++;\n }\n }\n vector ord(num_cand);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b) {\n if (fabs(cands[a].expv - cands[b].expv) > 1e-9) {\n return cands[a].expv > cands[b].expv;\n }\n return cands[a].pot < cands[b].pot;\n });\n cur_num = min(BEAMW, num_cand);\n for (int i = 0; i < cur_num; i++) {\n int idx = ord[i];\n current_states[i].expv = cands[idx].expv;\n memcpy(current_states[i].pr, cands[idx].pr, sizeof(cands[idx].pr));\n parent[step][i] = cands[idx].from;\n ch_dir[step][i] = cands[idx].dird;\n }\n }\n string res = \"\";\n int bestb = 0;\n for (int step = MAXL; step >= 1; step--) {\n int d = ch_dir[step][bestb];\n res = dch[d] + res;\n bestb = parent[step][bestb];\n }\n cout << res << endl;\n return 0;\n}","ahc010":"#include \nusing namespace std;\n\nconst int TO[8][4] = {\n {1, 0, -1, -1},\n {3, -1, -1, 0},\n {-1, -1, 3, 2},\n {-1, 2, 1, -1},\n {1, 0, 3, 2},\n {3, 2, 1, 0},\n {2, -1, 0, -1},\n {-1, 3, -1, 1}\n};\n\nint nxt_type[8] = {1,2,3,0,5,4,7,6};\nint rotated_type[4][8];\nint givenn[30][30];\nint cur_rot[30][30];\nint cur_tiles[30][30];\nint best_rots[30][30];\n\nvector get_cycles(int tiles[][30]) {\n bool vis[30][30][4] = {};\n vector res;\n int di[4] = {0, -1, 0, 1};\n int dj[4] = {-1, 0, 1, 0};\n for(int si=0; si<30; si++){\n for(int sj=0; sj<30; sj++){\n for(int sd=0; sd<4; sd++){\n if(vis[si][sj][sd]) continue;\n int t = tiles[si][sj];\n if(TO[t][sd] < 0) continue;\n int i = si, j = sj, d = sd;\n long long len = 0;\n bool ok = true;\n while(true){\n if(len > 5000){ ok=false; break;}\n int tt = tiles[i][j];\n int d2 = TO[tt][d];\n if(d2 < 0){ ok=false; break; }\n i += di[d2];\n j += dj[d2];\n if(i < 0 || i >=30 || j<0 || j>=30){ ok=false; break;}\n d = (d2 + 2) % 4;\n len++;\n if(i == si && j == sj && d == sd){\n break;\n }\n }\n if(ok && len > 0 && i == si && j == sj && d == sd){\n res.push_back(len);\n i=si; j=sj; d=sd;\n for(long long k=0; k=30||nj<0||nj>=30) break;\n i = ni; j = nj; d = (d2+2)%4;\n }\n }\n }\n }\n }\n return res;\n}\n\nlong long calc_score(int tiles[][30]) {\n vector cys = get_cycles(tiles);\n if(cys.size() < 2) return 0;\n sort(cys.rbegin(), cys.rend());\n return cys[0] * cys[1];\n}\n\nint main() {\n for(int k=0; k<4;k++){\n for(int t=0;t<8;t++){\n int cur = t;\n for(int r=0; r> s;\n for(int j=0;j<30;j++){\n givenn[i][j] = s[j] - '0';\n }\n }\n srand(42);\n for(int i=0;i<30;i++) for(int j=0;j<30;j++){\n cur_rot[i][j] = rand() % 4;\n cur_tiles[i][j] = rotated_type[ cur_rot[i][j] ][ givenn[i][j] ];\n }\n long long cur_sc = calc_score(cur_tiles);\n long long best_sc = cur_sc;\n memcpy(best_rots, cur_rot, sizeof(cur_rot));\n const int MAX_ITER = 150000;\n double Tstart = 5000.0;\n double Tend = 0.1;\n double cool = pow(Tend / Tstart, 1.0/MAX_ITER);\n double Temp = Tstart;\n for(int it=0; it < MAX_ITER; it++){\n int i = rand()%30;\n int j = rand()%30;\n int oldr = cur_rot[i][j];\n int oldt = cur_tiles[i][j];\n int nr = rand() % 3;\n if(nr >= oldr) nr++;\n cur_rot[i][j] = nr;\n cur_tiles[i][j] = rotated_type[nr][givenn[i][j]];\n long long nsc = calc_score(cur_tiles);\n double del = (double)nsc - (double)cur_sc;\n bool acc = (del >= 0.0);\n if(!acc && Temp > 0.01){\n if( (rand() / (double)RAND_MAX) < exp(del / Temp) ) acc = true;\n }\n if(acc){\n cur_sc = nsc;\n }else{\n cur_rot[i][j] = oldr;\n cur_tiles[i][j] = oldt;\n }\n if(cur_sc > best_sc){\n best_sc = cur_sc;\n memcpy(best_rots , cur_rot, sizeof(cur_rot));\n }\n Temp *= cool;\n }\n for(int i=0;i<30;i++){\n for(int j=0;j<30;j++){\n cout << best_rots[i][j];\n }\n }\n cout << endl;\n return 0;\n}","ahc011":"#include \nusing namespace std;\n\nint get_largest_tree(vector> board, int ei, int ej, int N) {\n vector> visited(N, vector(N, false));\n visited[ei][ej] = true;\n int maxs = 0;\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n int bit_from[4] = {2, 8, 1, 4};\n int bit_to[4] = {8, 2, 4, 1};\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (visited[i][j]) continue;\n vector> comp;\n queue> q;\n q.push({i, j});\n visited[i][j] = true;\n comp.push_back({i, j});\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (int d = 0; d < 4; d++) {\n int nx = x + dx[d];\n int ny = y + dy[d];\n if (nx >= 0 && nx < N && ny >= 0 && ny < N && !visited[nx][ny]) {\n if ((board[x][y] & bit_from[d]) && (board[nx][ny] & bit_to[d])) {\n visited[nx][ny] = true;\n q.push({nx, ny});\n comp.push_back({nx, ny});\n }\n }\n }\n }\n int v = comp.size();\n if (v == 0) continue;\n int e = 0;\n vector> in_c(N, vector(N, false));\n for (auto p : comp) in_c[p.first][p.second] = true;\n for (auto [x, y] : comp) {\n if (y + 1 < N && in_c[x][y + 1] && (board[x][y] & 4) && (board[x][y + 1] & 1)) e++;\n if (x + 1 < N && in_c[x + 1][y] && (board[x][y] & 8) && (board[x + 1][y] & 2)) e++;\n }\n if (v == 1 || e == v - 1) {\n maxs = max(maxs, v);\n }\n }\n }\n return maxs;\n}\n\nint main() {\n int N, T;\n cin >> N >> T;\n vector> board(N, vector(N));\n int ei, ej;\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < N; j++) {\n char c = s[j];\n if (c >= '0' && c <= '9') board[i][j] = c - '0';\n else board[i][j] = 10 + (c - 'a');\n if (board[i][j] == 0) {\n ei = i;\n ej = j;\n }\n }\n }\n int maxv = N * N - 1;\n int best_s = get_largest_tree(board, ei, ej, N);\n string best_seq = \"\";\n int best_score = (best_s < maxv ? round(500000.0 * best_s / maxv) : 1000000);\n srand(42);\n char dchar[4] = {'U','D','L','R'};\n int dx[4] = {-1,1,0,0};\n int dy[4] = {0,0,-1,1};\n for(int trial = 0; trial < 5; trial++) {\n vector> cur_board = board;\n int cei = ei, cej = ej;\n string cur_seq = \"\";\n int cur_s = best_s;\n int last_d = -1;\n double temp = 30.0 - trial * 5;\n bool found_full = false;\n for(int step = 0; step < T / 5; step++) {\n if(cur_s == maxv) {\n found_full = true;\n break;\n }\n vector poss_d;\n for(int d = 0; d < 4; d++) {\n int ni = cei + dx[d];\n int nj = cej + dy[d];\n if(ni >= 0 && ni < N && nj >= 0 && nj < N) {\n int opp = (d <= 1 ? 1 - d : (d == 2 ? 3 : 2));\n if(last_d == opp) continue;\n poss_d.push_back(d);\n }\n }\n if(poss_d.empty()) break;\n int d = poss_d[rand() % poss_d.size()];\n int ni = cei + dx[d];\n int nj = cej + dy[d];\n int old_ei = cei, old_ej = cej;\n int moved_mask = cur_board[ni][nj];\n cur_board[old_ei][old_ej] = moved_mask;\n cur_board[ni][nj] = 0;\n cei = ni;\n cej = nj;\n cur_seq += dchar[d];\n int news = get_largest_tree(cur_board, cei, cej, N);\n int delta = news - cur_s;\n bool accept = (delta >= 0);\n if(!accept && temp > 0.0) {\n double prob = exp(delta / temp * 0.5);\n if((rand() * 1.0 / RAND_MAX) < prob) accept = true;\n }\n if(accept) {\n cur_s = news;\n last_d = d;\n int k = cur_seq.size();\n int sc = (cur_s < maxv ? round(500000.0 * cur_s / maxv) : round(500000.0 * (2.0 - k * 1.0 / T)));\n int best_sc = (best_s < maxv ? round(500000.0 * best_s / maxv) : round(500000.0 * (2.0 - best_seq.size() * 1.0 / T)));\n if(sc > best_sc) {\n best_s = cur_s;\n best_seq = cur_seq;\n best_score = sc;\n }\n if(cur_s == maxv && best_s < maxv) {\n best_s = maxv;\n best_seq = cur_seq;\n best_score = round(500000.0 * (2.0 - k * 1.0 / T));\n found_full = true;\n break;\n }\n } else {\n cur_board[cei][cej] = cur_board[old_ei][old_ej];\n cur_board[old_ei][old_ej] = 0;\n cei = old_ei;\n cej = old_ej;\n cur_seq.pop_back();\n }\n temp *= 0.99;\n }\n if(found_full) break;\n }\n cout << best_seq << endl;\n return 0;\n}","ahc012":"#include \nusing namespace std;\n\nusing ll = long long;\n\nbool hits_strawberry(ll px, ll py, ll qx, ll qy, const vector& X, const vector& Y) {\n ll vx = qx - px;\n ll vy = qy - py;\n for (int i = 0; i < (int)X.size(); i++) {\n ll ux = X[i] - px;\n ll uy = Y[i] - py;\n if (ux * vy - uy * vx == 0) return true;\n }\n return false;\n}\n\ndouble mid_angle(int gap, const vector& ord, const vector& angs, int N) {\n int p1 = ord[gap];\n int p2 = ord[(gap + 1) % N];\n double a1 = angs[p1];\n double a2 = angs[p2];\n if (a2 < a1 - 1e-9) a2 += 2 * M_PI;\n return (a1 + a2) / 2.0;\n}\n\nint main() {\n int N_int, K;\n cin >> N_int >> K;\n ll N = N_int;\n vector a(11, 0);\n for (int i = 1; i <= 10; i++) cin >> a[i];\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector angs(N);\n for (int i = 0; i < N; i++) {\n angs[i] = atan2(Y[i], X[i]);\n if (angs[i] < 0) angs[i] += 2 * M_PI;\n }\n vector ord(N);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) { return angs[i] < angs[j]; });\n\n int best_m = -1;\n int best_start = 0;\n int num_lines = 100;\n vector good_sizes;\n {\n vector rem = a;\n for (int i = 0; i < num_lines; i++) {\n int best_d = 1;\n int mx = 0;\n for (int d = 1; d <= 10; d++) {\n if (rem[d] > mx) {\n mx = rem[d];\n best_d = d;\n }\n }\n if (mx == 0) break;\n good_sizes.push_back(best_d);\n rem[best_d]--;\n }\n }\n\n for (int s = 0; s < N; s++) {\n vector main_cuts;\n main_cuts.push_back((s - 1 + N) % N);\n int cur = 0;\n for (int sz : good_sizes) {\n cur += sz;\n main_cuts.push_back((s + cur - 1 + N) % N);\n }\n set> pair_set;\n for (int m : main_cuts) {\n int o = (m + N / 2) % N;\n pair_set.insert({min(m, o), max(m, o)});\n }\n set all_cuts;\n for (auto& pr : pair_set) {\n all_cuts.insert(pr.first);\n all_cuts.insert(pr.second);\n }\n vector cutlist(all_cuts.begin(), all_cuts.end());\n int nc = cutlist.size();\n vector piece;\n for (int i = 0; i < nc; i++) {\n int from = cutlist[i];\n int to = cutlist[(i + 1) % nc];\n piece.push_back((to - from + N) % N);\n }\n vector b(11, 0);\n for (int p : piece) if (p >= 1 && p <= 10) b[p]++;\n int m_val = 0;\n for (int d = 1; d <= 10; d++) m_val += min(a[d], b[d]);\n if (m_val > best_m) {\n best_m = m_val;\n best_start = s;\n }\n }\n\n // Rebuild for best_start\n vector main_cuts;\n main_cuts.push_back((best_start - 1 + N) % N);\n int cur = 0;\n for (int sz : good_sizes) {\n cur += sz;\n main_cuts.push_back((best_start + cur - 1 + N) % N);\n }\n set> pair_set;\n for (int m : main_cuts) {\n int o = (m + N / 2) % N;\n pair_set.insert({min(m, o), max(m, o)});\n }\n vector> final_pairs(pair_set.begin(), pair_set.end());\n int k_out = min((int)final_pairs.size(), 100);\n\n cout << k_out << endl;\n for (int i = 0; i < k_out; i++) {\n int mg = final_pairs[i].first; // use any gap of the pair\n double mang = mid_angle(mg, ord, angs, N);\n double c = cos(mang);\n double s = sin(mang);\n ll px = round(c * 1000000000.0);\n ll py = round(s * 1000000000.0);\n ll qx = round(cos(mang + M_PI) * 1000000000.0);\n ll qy = round(sin(mang + M_PI) * 1000000000.0);\n int pert = 0;\n while (hits_strawberry(px, py, qx, qy, X, Y) && pert < 30) {\n qx += (pert + 1) * 17LL;\n qy += (pert + 1) * 31LL;\n pert++;\n }\n if (px == qx && py == qy) qx++;\n cout << px << \" \" << py << \" \" << qx << \" \" << qy << endl;\n }\n return 0;\n}","ahc014":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> cur_dots;\n bool has_dot[65][65] = {};\n for(int i=0; i>x>>y;\n if(!has_dot[x][y]){\n has_dot[x][y]=true;\n cur_dots.emplace_back(x,y);\n }\n }\n bool hused[65][65]={};\n bool vused[65][65]={};\n bool dpused[65][65]={};\n bool dnused[65][65]={};\n int c = (N-1)/2;\n vector> cand;\n for(int x=0;x> ops;\n auto try_aa = [&](int px, int py) -> bool {\n if(has_dot[px][py]) return false;\n vector pos_oxs;\n for(int ox=0; ox pos_oys;\n for(int oy=0; oy bool {\n if(has_dot[px][py]) return false;\n int u1 = px + py;\n int v1 = px - py;\n vector> possible_opp;\n for(auto [ox,oy]: cur_dots){\n if(ox == px && oy == py) continue;\n int u2 = ox + oy;\n int v2 = ox - oy;\n if(abs(u2 - u1) < 2 || abs(v2 - v1) < 2) continue;\n if( (u2 - u1) % 2 != 0 || (v2 - v1) % 2 != 0 ) continue;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n if( (u1 + v2) % 2 !=0 || xb<0 || xb>=N || yb <0 || yb >=N ) continue;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n if( (u2 + v1)%2 !=0 || xc<0||xc>=N||yc<0||yc>=N) continue;\n if(!has_dot[xb][yb] || !has_dot[xc][yc]) continue;\n int sz = abs(u2-u1) + abs(v2-v1);\n possible_opp.emplace_back(sz, ox, oy);\n }\n sort(possible_opp.begin(), possible_opp.end());\n for(auto& tp : possible_opp){\n int sz, ox, oy;\n tie(sz, ox, oy) = tp;\n int u2 = ox + oy;\n int v2 = ox - oy;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n int umin = min(u1,u2), umax = max(u1,u2);\n int vmin = min(v1,v2), vmax = max(v1,v2);\n bool val = true;\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u1 + vv)/2; int yy=(u1 - vv)/2;\n if(xx<0||xx>=N || yy<0||yy>=N){val=false; continue;}\n bool corn = ((xx==px && yy==py) || (xx==xb && yy==yb) || (xx==ox && yy==oy) || (xx==xc && yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn ) val=false;\n }\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u2 + vv)/2; int yy=(u2 - vv)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy]&&!corn) val=false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v1)/2; int yy=(uu - v1)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n if(!val) continue;\n bool sval = true;\n for(int vv=vmin; vv < vmax; vv +=2){\n int xx = (u1 + vv)/2 ; int yy=(u1 - vv)/2;\n if(dnused[xx][yy]) sval=false;\n }\n for(int uu=umin; uu < umax; uu +=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(dpused[xx][yy]) sval = false;\n }\n for(int vv=vmin; vv\nusing namespace std;\n\nint main() {\n vector flav(100);\n for (int i = 0; i < 100; i++) cin >> flav[i];\n vector> grid(10, vector(10, 0));\n auto apply = [&](char d, auto& g) {\n if (d == 'F') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n for (int r = 0; r < 10; r++) g[r][c] = (r < (int)v.size() ? v[r] : 0);\n }\n } else if (d == 'B') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int r = 0; r < 10; r++) g[r][c] = (r >= 10 - sz ? v[r - (10 - sz)] : 0);\n }\n } else if (d == 'L') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n for (int c = 0; c < 10; c++) g[r][c] = (c < (int)v.size() ? v[c] : 0);\n }\n } else if (d == 'R') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int c = 0; c < 10; c++) g[r][c] = (c >= 10 - sz ? v[c - (10 - sz)] : 0);\n }\n }\n };\n auto get_score = [&](auto& g) -> long long {\n vector> vis(10, vector(10, false));\n long long res = 0;\n for (int i = 0; i < 10; i++) {\n for (int j = 0; j < 10; j++) {\n if (g[i][j] && !vis[i][j]) {\n int f = g[i][j];\n int sz = 0;\n stack> st;\n st.push({i, j});\n vis[i][j] = true;\n while (!st.empty()) {\n auto [x, y] = st.top(); st.pop();\n sz++;\n int dx[4] = {-1, 0, 1, 0};\n int dy[4] = {0, 1, 0, -1};\n for (int k = 0; k < 4; k++) {\n int nx = x + dx[k], ny = y + dy[k];\n if (nx >= 0 && nx < 10 && ny >= 0 && ny < 10 && !vis[nx][ny] && g[nx][ny] == f) {\n vis[nx][ny] = true;\n st.push({nx, ny});\n }\n }\n }\n res += 1LL * sz * sz;\n }\n }\n }\n return res;\n };\n auto get_spread = [&](auto& g) -> long long {\n long long spread = 0;\n for (int f = 1; f <= 3; f++) {\n int minr = 11, maxr = -1, minc = 11, maxc = -1;\n int count = 0;\n for (int i = 0; i < 10; i++) {\n for (int j = 0; j < 10; j++) {\n if (g[i][j] == f) {\n count++;\n minr = min(minr, i);\n maxr = max(maxr, i);\n minc = min(minc, j);\n maxc = max(maxc, j);\n }\n }\n }\n if (count == 0) continue;\n spread += (maxr - minr) * 1LL * (maxr - minr) + (maxc - minc) * 1LL * (maxc - minc);\n }\n return spread;\n };\n for (int t = 0; t < 100; t++) {\n int p;\n cin >> p;\n int cnt = 0;\n int pr = -1, pc = -1;\n for (int r = 0; r < 10; r++) {\n bool found = false;\n for (int c = 0; c < 10; c++) if (grid[r][c] == 0) {\n cnt++;\n if (cnt == p) {\n pr = r; pc = c;\n found = true;\n break;\n }\n }\n if (found) break;\n }\n grid[pr][pc] = flav[t];\n if (t == 99) break;\n string dirs = \"FBLR\";\n long long best_sc = -1;\n long long best_spr = LLONG_MAX / 2;\n char best_d = 'F';\n for (char d : dirs) {\n auto temp = grid;\n apply(d, temp);\n long long sc = get_score(temp);\n long long spr = get_spread(temp);\n bool better = false;\n if (sc > best_sc) better = true;\n else if (sc == best_sc && spr < best_spr) better = true;\n if (better) {\n best_sc = sc;\n best_spr = spr;\n best_d = d;\n }\n }\n cout << best_d << endl;\n cout.flush();\n apply(best_d, grid);\n }\n}","ahc016":"#include \nusing namespace std;\n\nint calc_pos(int u, int v, int n) {\n if (u > v) swap(u, v);\n return u * (2 * n - u - 1) / 2 + (v - u - 1);\n}\n\ndouble compute_exp_e(const string& gs, double eps) {\n double res = 0.0;\n for (char c : gs) {\n res += (c == '1' ? (1 - eps) : eps);\n }\n return res;\n}\n\ndouble compute_exp_t(const string& gs, int n, double eps) {\n double sum_p = 0.0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n int p1 = calc_pos(a, b, n);\n int p2 = calc_pos(a, c, n);\n int p3 = calc_pos(b, c, n);\n double pa = (gs[p1] == '1' ? (1 - eps) : eps);\n double pb = (gs[p2] == '1' ? (1 - eps) : eps);\n double pc = (gs[p3] == '1' ? (1 - eps) : eps);\n sum_p += pa * pb * pc;\n }\n }\n }\n return sum_p;\n}\n\nlong long compute_t(const string& hs, int n) {\n long long tri = 0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n if (hs[calc_pos(a, b, n)] == '1' &&\n hs[calc_pos(a, c, n)] == '1' &&\n hs[calc_pos(b, c, n)] == '1') tri++;\n }\n }\n }\n return tri;\n}\n\nint main() {\n int M;\n double eps;\n cin >> M >> eps;\n int N = 4;\n if (eps < 1e-9) {\n while (N * (N - 1LL) / 2 < M - 1) N++;\n N = min(N, 100);\n } else {\n double best_sc = -1.0;\n int best_n = 4;\n for (int nn = 4; nn <= 100; nn++) {\n long long p = (long long)nn * (nn - 1) / 2;\n double sd = sqrt(p * 0.25);\n double del = p * 1.0 / max(1, M - 1);\n double delm = del * fabs(1 - 2 * eps);\n double sigma = max(sd, 1e-9);\n double zscore = (delm / 2.0) / sigma;\n double perr = erfc(zscore / sqrt(2.0));\n if (M <= 2) perr /= 2.0;\n if (zscore > 6) perr = 0.0;\n double e_app = 100.0 * min(1.0, perr);\n double sc = pow(0.9, e_app) / nn;\n if (sc > best_sc) {\n best_sc = sc;\n best_n = nn;\n }\n }\n N = best_n;\n }\n long long P = (long long)N * (N - 1) / 2;\n vector Gs(M);\n vector targ_e(M), targ_t(M);\n for (int k = 0; k < M; k++) {\n long long ek = (M == 1 ? P / 2 : round(k * P * 1.0 / (M - 1.0)));\n string s(P, '0');\n if (k % 2 == 0 || M == 1) {\n for (long long i = 0; i < ek; i++) if (i < P) s[i] = '1';\n } else {\n vector pr(P);\n for (int i = 0; i < P; i++) pr[i] = i;\n auto rngv = [&](int x) {\n return ((long long)x * 97LL ^ (long long)k * 1234567LL) % 1000000009LL;\n };\n sort(pr.begin(), pr.end(), [&](int x, int y) { return rngv(x) < rngv(y); });\n for (long long i = 0; i < ek; i++) if (i < P) s[pr[i]] = '1';\n }\n Gs[k] = s;\n targ_e[k] = compute_exp_e(s, eps);\n targ_t[k] = compute_exp_t(s, N, eps);\n }\n cout << N << endl;\n for (auto& s : Gs) cout << s << endl;\n cout.flush();\n for (int q = 0; q < 100; q++) {\n string h;\n cin >> h;\n int obse = 0;\n for (char c : h) if (c == '1') obse++;\n long long obst = compute_t(h, N);\n int bestk = 0;\n double bestd = 1e18;\n double sigma_e = sqrt(P * 0.25);\n double sigma_t_scale = N * 5.0;\n for (int k = 0; k < M; k++) {\n double de = obse - targ_e[k];\n double dt = obst - targ_t[k];\n double dist = (de * de) / (sigma_e * sigma_e + 1e-9) + (dt * dt) / (sigma_t_scale * sigma_t_scale + 1e-9);\n if (dist < bestd) {\n bestd = dist;\n bestk = k;\n }\n }\n cout << bestk << endl;\n cout.flush();\n }\n return 0;\n}","ahc017":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, M, D, K;\n cin >> N >> M >> D >> K;\n vector U(M), V(M), W(M);\n vector>> adj(N);\n for (int i = 0; i < M; i++) {\n cin >> U[i] >> V[i] >> W[i];\n U[i]--; V[i]--;\n adj[U[i]].emplace_back(V[i], W[i], i);\n adj[V[i]].emplace_back(U[i], W[i], i);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n mt19937 rng(123456789LL);\n int NUM_SAMPLES = 25;\n if (N <= 600) NUM_SAMPLES = 40;\n vector sources;\n vector perm(N);\n iota(perm.begin(), perm.end(), 0);\n shuffle(perm.begin(), perm.end(), rng);\n for (int i = 0; i < min(NUM_SAMPLES, N); i++) sources.push_back(perm[i]);\n vector rday(M);\n vector cnt(D + 1, 0);\n vector edgeord(M);\n iota(edgeord.begin(), edgeord.end(), 0);\n shuffle(edgeord.begin(), edgeord.end(), rng);\n for (int i = 0; i < M; i++) {\n int d = (i % D) + 1;\n rday[edgeord[i]] = d;\n cnt[d]++;\n }\n auto get_sum = [&](int day, const vector& rdays) -> ll {\n ll sm = 0;\n for (int s : sources) {\n vector dist(N, 4000000000000000000LL);\n dist[s] = 0;\n priority_queue, vector>, greater>> pq;\n pq.emplace(0, s);\n while (!pq.empty()) {\n auto [c, u] = pq.top(); pq.pop();\n if (c > dist[u]) continue;\n for (auto [v, w, e] : adj[u]) {\n if (rdays[e] == day) continue;\n ll nc = c + w;\n if (nc < dist[v]) {\n dist[v] = nc;\n pq.emplace(nc, v);\n }\n }\n }\n for (int j = 0; j < N; j++) {\n if (j == s) continue;\n ll dd = (dist[j] > 2000000000000000000LL ? 1000000000LL : dist[j]);\n sm += dd;\n }\n }\n return sm;\n };\n auto start_time = chrono::steady_clock::now();\n auto elapsed = [&]() {\n return chrono::duration(chrono::steady_clock::now() - start_time).count();\n };\n ll current_proxy = 0;\n for (int d = 1; d <= D; d++) {\n current_proxy += get_sum(d, rday);\n }\n ll total_delta_abs = 0;\n int cnt_sample = 0;\n uniform_int_distribution rnd_e(0, M - 1);\n uniform_int_distribution rnd_d(1, D);\n uniform_real_distribution rnd_real(0.0, 1.0);\n for (int tryy = 0; tryy < 300; tryy++) {\n if (elapsed() > 0.3) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n total_delta_abs += abs(del);\n cnt_sample++;\n if (cnt_sample >= 30) break;\n }\n double T = 1e10;\n if (cnt_sample > 0) {\n double avg = (double)total_delta_abs / cnt_sample;\n T = avg * 20.0;\n if (T < 1e8) T = 1e8;\n }\n double cool_rate = 0.999;\n double TL = 5.7;\n int it = 0;\n while (true) {\n it++;\n if (it % 20 == 0 && elapsed() > TL) break;\n if (T < 1.0 && it > 1000 && elapsed() > 2.0) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n bool accept = false;\n if (del < 0) accept = true;\n else {\n double prob = exp(-del / T);\n if (prob > rnd_real(rng)) accept = true;\n }\n if (accept) {\n rday[e] = nd;\n cnt[od]--;\n cnt[nd]++;\n current_proxy += del;\n }\n T *= cool_rate;\n }\n for (int i = 0; i < M; i++) {\n cout << rday[i];\n if (i + 1 < M) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc019":"#include \nusing namespace std;\n\nint main() {\n int D;\n cin >> D;\n vector F[2], R[2];\n for (int i = 0; i < 2; i++) {\n F[i].resize(D);\n for (int k = 0; k < D; k++) {\n cin >> F[i][k];\n }\n R[i].resize(D);\n for (int k = 0; k < D; k++) {\n cin >> R[i][k];\n }\n }\n vector> placed[2];\n for (int i = 0; i < 2; i++) {\n for (int z = 0; z < D; z++) {\n vector Xs, Ys;\n for (int x = 0; x < D; x++) {\n if (F[i][z][x] == '1') Xs.push_back(x);\n }\n for (int y = 0; y < D; y++) {\n if (R[i][z][y] == '1') Ys.push_back(y);\n }\n int nf = Xs.size();\n int nr = Ys.size();\n if (nf >= nr) {\n for (int j = 0; j < nr; j++) {\n placed[i].emplace_back(Xs[j], Ys[j], z);\n }\n for (int j = 0; j < nf - nr; j++) {\n placed[i].emplace_back(Xs[nr + j], Ys[0], z);\n }\n } else {\n for (int j = 0; j < nf; j++) {\n placed[i].emplace_back(Xs[j], Ys[j], z);\n }\n for (int j = 0; j < nr - nf; j++) {\n placed[i].emplace_back(Xs[0], Ys[nf + j], z);\n }\n }\n }\n }\n int s0 = placed[0].size();\n int s1 = placed[1].size();\n int c = min(s0, s1);\n int only0 = s0 - c;\n int only1 = s1 - c;\n int n = c + only0 + only1;\n vector blk0(s0), blk1(s1);\n for (int k = 0; k < s0; k++) {\n if (k < c) {\n blk0[k] = k + 1;\n } else {\n blk0[k] = c + (k - c) + 1;\n }\n }\n for (int k = 0; k < s1; k++) {\n if (k < c) {\n blk1[k] = k + 1;\n } else {\n blk1[k] = c + only0 + (k - c) + 1;\n }\n }\n int DD = D * D * D;\n vector B0(DD, 0), B1(DD, 0);\n for (int k = 0; k < s0; k++) {\n auto [x, y, z] = placed[0][k];\n int pos = x * (D * D) + y * D + z;\n B0[pos] = blk0[k];\n }\n for (int k = 0; k < s1; k++) {\n auto [x, y, z] = placed[1][k];\n int pos = x * (D * D) + y * D + z;\n B1[pos] = blk1[k];\n }\n cout << n << endl;\n for (int v : B0) cout << v << \" \";\n cout << endl;\n for (int v : B1) cout << v << \" \";\n cout << endl;\n return 0;\n}","ahc020":"#include \nusing namespace std;\nusing ll = long long;\n\nll get_p_from_dd(ll dd) {\n if (dd == 0) return 0;\n ll p = (ll)sqrtl(dd);\n if (p * p >= dd) return p;\n return p + 1;\n}\n\nint main() {\n int N, M, K;\n cin >> N >> M >> K;\n vector X(N+1), Y(N+1);\n for(int i = 1; i <= N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector eu(M), ev(M);\n vector ew(M);\n for(int j = 0; j < M; j++) {\n cin >> eu[j] >> ev[j] >> ew[j];\n }\n vector Ra(K), Rb(K);\n for(int k = 0; k < K; k++) {\n cin >> Ra[k] >> Rb[k];\n }\n vector> dds(N+1, vector(K));\n for(int i=1; i<=N; i++) {\n for(int k=0; k necessary(N+1, false);\n for(int k=0; k>> g(N+1);\n for(int j=0;j mincost(N+1, LLONG_MAX/2);\n vector parent_e(N+1, -1);\n mincost[1] = 0;\n priority_queue,vector>,greater>> pq;\n pq.emplace(0LL,1);\n while(!pq.empty()){\n auto [c,u] = pq.top(); pq.pop();\n if(c > mincost[u]) continue;\n for(auto [to,eid]:g[u]){\n ll nc = c + ew[eid];\n if(nc < mincost[to]){\n mincost[to] = nc;\n parent_e[to] = eid;\n pq.emplace(nc,to);\n }\n }\n }\n // build SPT children {child, eid}\n vector>> spt(N+1);\n vector parent_v(N+1,-1);\n for(int i=1;i<=N;i++) if(parent_e[i]!=-1){\n int eid = parent_e[i];\n for(auto [to,je]:g[i]) if(je==eid){\n parent_v[i] = to; // parent of i\n break;\n }\n if(parent_v[i] != -1){\n spt[parent_v[i]].emplace_back(i, eid);\n }\n }\n auto eval_func = [&](vector trms) -> tuple, vector> {\n vector usd(M,false);\n vector rch(N+1,false);\n vector terms(N+1,0);\n for(int i=1;i<=N;i++) terms[i]=trms[i];\n auto dfs = [&](auto self, int nd) -> int {\n int ct = terms[nd];\n bool hs = terms[nd];\n for(auto [to,eid]:spt[nd]){\n int sct = self(self,to);\n ct += sct;\n if(sct>0){\n usd[eid]=true;\n hs=true;\n }\n }\n if(hs) rch[nd]=true;\n return ct;\n };\n dfs(dfs,1);\n rch[1]=true;\n vector mdd(N+1,0);\n bool covers=true;\n for(int k=0;k 25000000LL) covers=false;\n mdd[besti]=max(mdd[besti],minnd);\n }\n ll cov=0;\n vector pp(N+1,0);\n for(int i=1;i<=N;i++) if(mdd[i]>0){\n ll pv=get_p_from_dd(mdd[i]);\n if(pv>5000) covers=false;\n cov += pv*pv;\n pp[i]=(int)pv;\n }\n ll edg=0;\n vector bbv(M,0);\n for(int j=0;j cur_t(N+1,0);\n for(int i=1;i<=N;i++) if(necessary[i]) cur_t[i]=1;\n auto current = eval_func(cur_t);\n ll current_cost; vector current_p, current_b;\n tie(current_cost, current_p, current_b) = current;\n ll global_best_cost = current_cost;\n vector global_best_p = current_p;\n vector global_best_b = current_b;\n bool updated = true;\n int iterations = 0;\n while(updated && iterations < 100){\n updated = false;\n iterations++;\n ll best_delta = 0;\n int to_rem = -1;\n vector bestp_this, bestb_this;\n for(int cand=1; cand<=N; cand++) if(cur_t[cand]){\n vector tm = cur_t;\n tm[cand] = 0;\n auto res = eval_func(tm);\n ll this_cost; vector thisp, thisb;\n tie(this_cost, thisp, thisb) = res;\n if(this_cost < current_cost && this_cost < LLONG_MAX/3){\n if(current_cost - this_cost > best_delta){\n best_delta = current_cost - this_cost;\n to_rem = cand;\n bestp_this = thisp;\n bestb_this = thisb;\n }\n }\n }\n if(to_rem != -1){\n updated = true;\n cur_t[to_rem] = 0;\n current_cost -= best_delta;\n current_p = bestp_this;\n current_b = bestb_this;\n if(current_cost < global_best_cost){\n global_best_cost = current_cost;\n global_best_p = current_p;\n global_best_b = current_b;\n }\n }\n }\n for(int i=1;i<=N;i++) {\n cout << global_best_p[i];\n if(i < N) cout << \" \";\n else cout << \"\\n\";\n }\n for(int j=0;j\nusing namespace std;\n\nconst int N = 30;\nconst int MAXP = 470;\nint grid[N][N];\npair pos_of[MAXP];\n\nvector> get_nei(int x, int y) {\n vector> r;\n if (y > 0) r.emplace_back(x, y - 1);\n if (y < x) r.emplace_back(x, y + 1);\n if (x > 0) {\n if (y <= x - 1) r.emplace_back(x - 1, y);\n if (y - 1 >= 0 && (y - 1) <= (x - 1)) r.emplace_back(x - 1, y - 1);\n }\n if (x < N - 1) {\n r.emplace_back(x + 1, y);\n r.emplace_back(x + 1, y + 1);\n }\n return r;\n}\n\nint main() {\n for (int x = 0; x < N; x++) {\n for (int y = 0; y <= x; y++) {\n cin >> grid[x][y];\n pos_of[grid[x][y]] = {x, y};\n }\n }\n vector> ops;\n auto sift_down = [&](auto&& self, int x, int y) -> bool {\n bool did_swap = false;\n while (true) {\n int min_num = grid[x][y];\n int mx = x, my = y;\n if (x < N - 1) {\n if (grid[x + 1][y] < min_num) {\n min_num = grid[x + 1][y];\n mx = x + 1; my = y;\n }\n if (grid[x + 1][y + 1] < min_num) {\n min_num = grid[x + 1][y + 1];\n mx = x + 1; my = y + 1;\n }\n }\n if (mx == x && my == y) break;\n ops.push_back({x, y, mx, my});\n int n1 = grid[x][y], n2 = grid[mx][my];\n grid[x][y] = n2; grid[mx][my] = n1;\n pos_of[n1] = {mx, my};\n pos_of[n2] = {x, y};\n x = mx; y = my;\n did_swap = true;\n }\n return did_swap;\n };\n bool changed = true;\n int iters = 0;\n const int MAX_ITERS = 100;\n while (changed && iters < MAX_ITERS) {\n changed = false;\n iters++;\n for (int x = N - 2; x >= 0; x--) {\n for (int y = 0; y <= x; y++) {\n if (sift_down(sift_down, x, y)) changed = true;\n }\n }\n }\n cout << ops.size() << endl;\n for (auto& ar : ops) {\n cout << ar[0] << \" \" << ar[1] << \" \" << ar[2] << \" \" << ar[3] << endl;\n }\n return 0;\n}","toyota2023summer-final":"#include \nusing namespace std;\n\nint main() {\n int D, N;\n cin >> D >> N;\n bool is_obst[9][9];\n memset(is_obst, 0, sizeof(is_obst));\n for (int i = 0; i < N; i++) {\n int r, c;\n cin >> r >> c;\n is_obst[r][c] = true;\n }\n int er = 0, ec = 4;\n int dr[4] = {-1, 0, 1, 0};\n int dc[4] = {0, 1, 0, -1};\n int static_dist[9][9];\n memset(static_dist, -1, sizeof(static_dist));\n {\n queue> q;\n q.emplace(er, ec);\n static_dist[er][ec] = 0;\n while (!q.empty()) {\n auto [r, c] = q.front();\n q.pop();\n for (int k = 0; k < 4; k++) {\n int nr = r + dr[k], nc = c + dc[k];\n if (nr >= 0 && nr < D && nc >= 0 && nc < D && !is_obst[nr][nc] &&\n static_dist[nr][nc] == -1) {\n static_dist[nr][nc] = static_dist[r][c] + 1;\n q.emplace(nr, nc);\n }\n }\n }\n }\n vector> positions;\n for (int r = 0; r < D; r++) {\n for (int c = 0; c < D; c++) {\n if (!is_obst[r][c] && !(r == er && c == ec)) {\n positions.emplace_back(r, c);\n }\n }\n }\n int MM = positions.size();\n bool assigned[81] = {false};\n int pos_label[9][9];\n memset(pos_label, -1, sizeof(pos_label));\n bool has_cont[9][9] = {false};\n auto get_vis = [&]( ) -> vector> {\n vector> vis(D, vector(D, false));\n queue> q;\n q.emplace(er, ec);\n vis[er][ec] = true;\n while (!q.empty()) {\n auto [r, c] = q.front();\n q.pop();\n for (int k = 0; k < 4; k++) {\n int nr = r + dr[k], nc = c + dc[k];\n if (nr >= 0 && nr < D && nc >= 0 && nc < D && !is_obst[nr][nc] &&\n !vis[nr][nc] && !has_cont[nr][nc]) {\n vis[nr][nc] = true;\n q.emplace(nr, nc);\n }\n }\n }\n return vis;\n };\n for (int step = 0; step < MM; step++) {\n int t;\n cin >> t;\n int rank = 0;\n for (int l = 0; l < MM; l++) {\n if (!assigned[l] && l < t) rank++;\n }\n auto vis = get_vis();\n vector> cands;\n for (auto p : positions) {\n int r = p.first, c = p.second;\n if (!has_cont[r][c] && vis[r][c]) {\n cands.push_back(p);\n }\n }\n vector> safes;\n int num_cur = cands.size();\n for (auto p : cands) {\n int r = p.first, c = p.second;\n has_cont[r][c] = true;\n auto vis2 = get_vis();\n has_cont[r][c] = false;\n int cnt = 0;\n for (auto posi : positions) {\n int rr = posi.first, cc = posi.second;\n if (!has_cont[rr][cc] && vis2[rr][cc]) cnt++;\n }\n if (cnt == num_cur - 1 || num_cur == 0) {\n safes.push_back(p);\n }\n }\n if (safes.empty()) {\n safes = cands;\n }\n sort(safes.begin(), safes.end(), [&](const pair& a, const pair& b) {\n int da = static_dist[a.first][a.second];\n int db = static_dist[b.first][b.second];\n if (da != db) return da < db;\n if (a.first != b.first) return a.first < b.first;\n return a.second < b.second;\n });\n int chosen_idx = rank;\n if (chosen_idx >= (int)safes.size()) chosen_idx = max(0, (int)safes.size() - 1);\n if (safes.empty() && !cands.empty()) {\n safes = cands;\n chosen_idx = 0;\n }\n if (!safes.empty()) {\n auto [pi, pj] = safes[chosen_idx];\n cout << pi << \" \" << pj << endl;\n pos_label[pi][pj] = t;\n has_cont[pi][pj] = true;\n assigned[t] = true;\n } else {\n cout << \"0 0\" << endl;\n }\n }\n vector> order;\n int remain = MM;\n while (remain > 0) {\n auto vis = get_vis();\n set> accs;\n for (int i = 0; i < D; i++) {\n for (int j = 0; j < D; j++) {\n if (vis[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && has_cont[ni][nj] &&\n !is_obst[ni][nj]) {\n accs.insert({ni, nj});\n }\n }\n }\n }\n }\n if (accs.empty()) {\n break;\n }\n int minl = INT_MAX;\n pair bp = {-1, -1};\n for (auto p : accs) {\n int l = pos_label[p.first][p.second];\n if (l >= 0 && l < minl) {\n minl = l;\n bp = p;\n }\n }\n if (bp.first == -1) break;\n order.push_back(bp);\n has_cont[bp.first][bp.second] = false;\n remain--;\n }\n for (auto [i, j] : order) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc024":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> C(n, vector(n));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> C[i][j];\n auto adj_mat = vector>(m + 1, vector(m + 1, false));\n auto mark_bdry = [&](int i, int j) {\n int c = C[i][j];\n adj_mat[c][0] = adj_mat[0][c] = true;\n };\n for (int j = 0; j < n; j++) {\n mark_bdry(0, j);\n mark_bdry(n - 1, j);\n }\n for (int i = 0; i < n; i++) {\n mark_bdry(i, 0);\n mark_bdry(i, n - 1);\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int c = C[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = C[ni][nj];\n if (c != d) {\n adj_mat[c][d] = adj_mat[d][c] = true;\n }\n }\n }\n }\n }\n vector bdry_wit(m + 1, -1);\n for (int j = 0; j < n; j++) {\n int c = C[0][j];\n if (bdry_wit[c] == -1) bdry_wit[c] = 0 * n + j;\n c = C[n - 1][j];\n if (bdry_wit[c] == -1) bdry_wit[c] = (n - 1) * n + j;\n }\n for (int i = 0; i < n; i++) {\n int c = C[i][0];\n if (bdry_wit[c] == -1) bdry_wit[c] = i * n + 0;\n c = C[i][n - 1];\n if (bdry_wit[c] == -1) bdry_wit[c] = i * n + (n - 1);\n }\n vector> witness_cell(m + 1, vector(m + 1, -1));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = C[i][j]; int p = i * n + j;\n for (auto [di, dj] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int d = C[ni][nj];\n if (c != d && witness_cell[c][d] == -1) {\n witness_cell[c][d] = p;\n witness_cell[d][c] = ni * n + nj;\n }\n }\n }\n }\n vector> terms(m + 1);\n for (int c = 1; c <= m; c++) {\n if (adj_mat[c][0] && bdry_wit[c] != -1) {\n terms[c].insert(bdry_wit[c]);\n }\n for (int d = 1; d <= m; d++) {\n if (adj_mat[c][d] && witness_cell[c][d] != -1) {\n terms[c].insert(witness_cell[c][d]);\n }\n }\n }\n for (int c = 1; c <= m; c++) {\n if (!adj_mat[c][0]) {\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n if (C[i][j] == c) {\n terms[c].insert(i * n + j);\n }\n }\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (C[i][j] == c) {\n for (auto [di, dj] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int dc = C[ni][nj];\n if (dc != c) {\n terms[dc].insert(ni * n + nj);\n }\n }\n }\n }\n }\n }\n vector> newm(n, vector(n, 0));\n for (int c = 1; c <= m; c++) {\n auto& tset = terms[c];\n if (tset.empty()) {\n for (int i = 0; i < n; i++) {\n bool found = false;\n for (int j = 0; j < n; j++) if (C[i][j] == c) {\n tset.insert(i * n + j);\n found = true;\n break;\n }\n if (found) break;\n }\n }\n vector termv(tset.begin(), tset.end());\n if (termv.empty()) continue;\n if (!adj_mat[c][0] && !tset.empty()) {\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (C[i][j] == c) newm[i][j] = c;\n continue;\n }\n unordered_set remain;\n for (int p : termv) remain.insert(p);\n int first = termv[0];\n remain.erase(first);\n unordered_set trec{first};\n while (!remain.empty()) {\n vector par(n * n, -1);\n vector vis(n * n, false);\n queue q;\n for (int p : trec) {\n vis[p] = true;\n par[p] = -2;\n q.push(p);\n }\n int found_t = -1;\n while (!q.empty() && found_t == -1) {\n int u = q.front(); q.pop();\n int ux = u / n, uy = u % n;\n for (auto [dx, dy] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int nx = ux + dx, ny = uy + dy;\n if (nx < 0 || nx >= n || ny < 0 || ny >= n) continue;\n int v = nx * n + ny;\n if (vis[v] || C[nx][ny] != c) continue;\n vis[v] = true;\n par[v] = u;\n q.push(v);\n if (remain.count(v)) {\n found_t = v;\n break;\n }\n }\n }\n if (found_t == -1) {\n break;\n }\n int at = found_t;\n while (par[at] != -2) {\n trec.insert(at);\n remain.erase(at);\n at = par[at];\n }\n trec.insert(at);\n remain.erase(found_t);\n }\n for (int p : trec) {\n int x = p / n, y = p % n;\n newm[x][y] = c;\n }\n }\n auto new_adj = vector>(m + 1, vector(m + 1, false));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = newm[ni][nj];\n if (c != d) {\n new_adj[c][d] = new_adj[d][c] = true;\n }\n }\n }\n }\n auto mark_bdry_new = [&](int i, int j) {\n int c = newm[i][j];\n new_adj[c][0] = new_adj[0][c] = true;\n };\n for (int j = 0; j < n; j++) {\n if (newm[0][j] != 0) mark_bdry_new(0, j);\n if (newm[n - 1][j] != 0) mark_bdry_new(n - 1, j);\n }\n for (int i = 0; i < n; i++) {\n if (newm[i][0] != 0) mark_bdry_new(i, 0);\n if (newm[i][n - 1] != 0) mark_bdry_new(i, n - 1);\n }\n bool adj_ok = true;\n for (int c = 0; c <= m; c++) for (int d = 0; d <= m; d++) {\n if (adj_mat[c][d] != new_adj[c][d]) adj_ok = false;\n }\n bool conn_ok = true;\n for (int c = 1; c <= m && conn_ok; c++) {\n vector> pos;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == c) pos.emplace_back(i, j);\n if (pos.empty()) {\n conn_ok = false;\n continue;\n }\n vector> vis(n, vector(n, false));\n queue> qq;\n auto st = pos[0];\n qq.push(st);\n vis[st.first][st.second] = true;\n int cnt = 1;\n while (!qq.empty()) {\n auto [x, y] = qq.front(); qq.pop();\n for (auto [dx, dy] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == c) {\n vis[nx][ny] = true;\n qq.push({nx, ny});\n cnt++;\n }\n }\n }\n if (cnt != (int)pos.size()) conn_ok = false;\n }\n if (conn_ok) {\n vector> zeros;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == 0) zeros.emplace_back(i, j);\n if (!zeros.empty()) {\n vector> vis(n, vector(n, false));\n queue> qq;\n int cnt = 0;\n for (auto [i, j] : zeros) {\n if ((i == 0 || i == n - 1 || j == 0 || j == n - 1) && !vis[i][j]) {\n vis[i][j] = true;\n qq.push({i, j});\n cnt++;\n }\n }\n while (!qq.empty()) {\n auto [x, y] = qq.front(); qq.pop();\n for (auto [dx, dy] : vector>{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == 0) {\n vis[nx][ny] = true;\n qq.push({nx, ny});\n cnt++;\n }\n }\n }\n if (cnt != (int)zeros.size()) conn_ok = false;\n }\n }\n if (!adj_ok || !conn_ok) {\n newm = C;\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cout << newm[i][j];\n if (j < n - 1) cout << \" \";\n }\n cout << endl;\n }\n}","ahc025":"#include \nusing namespace std;\n\nint main() {\n int N, D, Q;\n cin >> N >> D >> Q;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n uniform_real_distribution uni(0.0, 1.0);\n vector score(N, 0);\n double avg_size = 3.0;\n double p = avg_size / N;\n for (int q = 0; q < Q; q++) {\n vector L, R;\n do {\n L.clear();\n R.clear();\n for (int i = 0; i < N; i++) {\n double r = uni(rng);\n if (r < p) L.push_back(i);\n else if (r < 2 * p) R.push_back(i);\n }\n if (L.empty()) {\n int add = rng() % N;\n bool inR = false;\n for (int x : R) if (x == add) inR = true;\n if (!inR) L.push_back(add);\n else L.push_back((add + 1) % N);\n }\n if (R.empty()) {\n int add = rng() % N;\n bool inL = false;\n for (int x : L) if (x == add) inL = true;\n if (!inL) R.push_back(add);\n else R.push_back((add + 1) % N);\n }\n } while (L.empty() || R.empty() || (L.size() + R.size() == 0));\n // remove possible dups (though shouldn't)\n sort(L.begin(), L.end());\n sort(R.begin(), R.end());\n auto it = unique(L.begin(), L.end());\n L.resize(it - L.begin());\n it = unique(R.begin(), R.end());\n R.resize(it - R.begin());\n bool overlap = false;\n for (int x : L) {\n for (int y : R) if (x == y) overlap = true;\n }\n if (overlap || L.empty() || R.empty()) {\n // fallback to 1vs1\n L.clear(); R.clear();\n int a = rng() % N;\n int b = rng() % N;\n while (b == a) b = rng() % N;\n L.push_back(a);\n R.push_back(b);\n }\n cout << L.size() << \" \" << R.size();\n for (int x : L) cout << \" \" << x;\n for (int x : R) cout << \" \" << x;\n cout << endl;\n string res;\n cin >> res;\n int sgn = 0;\n if (res == \">\") sgn = 1;\n else if (res == \"<\") sgn = -1;\n for (int x : L) score[x] += sgn;\n for (int x : R) score[x] -= sgn;\n }\n long long minw = LLONG_MAX;\n for (auto x : score) minw = min(minw, x);\n for (auto &x : score) x = x - minw + 1;\n vector> items;\n for (int i = 0; i < N; i++) {\n items.emplace_back(score[i], i);\n }\n sort(items.rbegin(), items.rend());\n vector group_sums(D, 0);\n vector group_id(N, 0);\n for (auto &pr : items) {\n int id = pr.second;\n int best = 0;\n for (int g = 1; g < D; g++) {\n if (group_sums[g] < group_sums[best]) best = g;\n }\n group_id[id] = best;\n group_sums[best] += pr.first;\n }\n for (int i = 0; i < N; i++) {\n if (i > 0) cout << \" \";\n cout << group_id[i];\n }\n cout << endl;\n return 0;\n}","ahc026":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> st(m);\n for (int i = 0; i < m; i++) {\n st[i].resize(n / m);\n for (int j = 0; j < n / m; j++) {\n cin >> st[i][j];\n }\n }\n vector> ops;\n int cur = 1;\n auto get_top = [&](int s) -> int {\n if (st[s].empty()) return n + 1;\n return st[s].back();\n };\n auto can_extract = [&]() -> bool {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) return true;\n }\n return false;\n };\n auto find_pos = [&](int v) -> pair {\n for (int s = 0; s < m; s++) {\n for (int h = 0; h < (int)st[s].size(); h++) {\n if (st[s][h] == v) return {s, h};\n }\n }\n return {-1, -1};\n };\n while (cur <= n) {\n if (can_extract()) {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) {\n ops.emplace_back(cur, 0);\n st[s].pop_back();\n cur++;\n break;\n }\n }\n continue;\n }\n auto [s, h] = find_pos(cur);\n assert(h != -1 && h + 1 < (int)st[s].size());\n int sz = (int)st[s].size();\n int first_above = st[s][h + 1];\n // choose best dest based on future run length + old top\n int best_score = -1;\n int best_d = -1;\n for (int d = 0; d < m; d++) {\n if (d == s) continue;\n int pile_len = sz - h - 1;\n auto get_at_depth = [&](int dep) -> int {\n if (dep < pile_len) {\n return st[s][sz - 1 - dep];\n } else {\n int old_dep = dep - pile_len;\n int old_sz = (int)st[d].size();\n if (old_dep >= old_sz) return -999;\n return st[d][old_sz - 1 - old_dep];\n }\n };\n int this_len = 0;\n int exp_val = 0;\n bool cont = true;\n while (cont) {\n int val = get_at_depth(this_len);\n if (val < 1 || val > n) {\n cont = false;\n break;\n }\n if (this_len == 0) {\n this_len = 1;\n exp_val = val + 1;\n continue;\n }\n if (val == exp_val) {\n this_len++;\n exp_val++;\n } else {\n cont = false;\n }\n }\n int old_tp = get_top(d);\n int score = this_len * 10000 + old_tp;\n if (score > best_score) {\n best_score = score;\n best_d = d;\n }\n }\n assert(best_d != -1);\n ops.emplace_back(first_above, best_d + 1);\n auto& from = st[s];\n for (int k = h + 1; k < sz; k++) {\n st[best_d].push_back(from[k]);\n }\n from.resize(h + 1);\n }\n for (auto [v, i] : ops) {\n cout << v << \" \" << i << endl;\n }\n}","ahc027":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector h(N - 1), v(N);\n for (int i = 0; i < N - 1; i++) cin >> h[i];\n for (int i = 0; i < N; i++) cin >> v[i];\n vector> d(N, vector(N));\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) cin >> d[i][j];\n vector> visited(N, vector(N, false));\n int DI[4] = {0, 1, 0, -1};\n int DJ[4] = {1, 0, -1, 0};\n string DIR = \"RDLU\";\n function dfs = [&](int i, int j) {\n visited[i][j] = true;\n for (int dir = 0; dir < 4; dir++) {\n int ni = i + DI[dir];\n int nj = j + DJ[dir];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N || visited[ni][nj]) continue;\n bool nowall;\n if (DI[dir] == 0) {\n nowall = (v[i][min(j, nj)] == '0');\n } else {\n nowall = (h[min(i, ni)][j] == '0');\n }\n if (nowall) {\n cout << DIR[dir];\n dfs(ni, nj);\n int backdir = (dir + 2) % 4;\n cout << DIR[backdir];\n }\n }\n };\n dfs(0, 0);\n cout << endl;\n return 0;\n}","ahc028":"#include \nusing namespace std;\nusing pii = pair;\n\npair> compute_path(int ci, int cj, const string& need, const vector>& pos) {\n int r = need.size();\n if (r == 0) return {0, {}};\n vector> cands(r);\n for (int k = 0; k < r; k++) cands[k] = pos[need[k] - 'A'];\n vector> dp(r), pre(r);\n int sz0 = cands[0].size();\n dp[0].assign(sz0, INT_MAX / 2);\n pre[0].assign(sz0, -1);\n for (int j = 0; j < sz0; j++) {\n auto [x, y] = cands[0][j];\n dp[0][j] = abs(x - ci) + abs(y - cj);\n }\n for (int k = 1; k < r; k++) {\n int psz = cands[k - 1].size();\n int sz = cands[k].size();\n dp[k].assign(sz, INT_MAX / 2);\n pre[k].assign(sz, -1);\n for (int j = 0; j < sz; j++) {\n auto [x, y] = cands[k][j];\n for (int pj = 0; pj < psz; pj++) {\n if (dp[k - 1][pj] >= INT_MAX / 2) continue;\n auto [px, py] = cands[k - 1][pj];\n int d = abs(x - px) + abs(y - py);\n int tot = dp[k - 1][pj] + d;\n if (tot < dp[k][j]) {\n dp[k][j] = tot;\n pre[k][j] = pj;\n }\n }\n }\n }\n int ls = cands[r - 1].size();\n int md = INT_MAX / 2;\n int bj = 0;\n for (int j = 0; j < ls; j++) {\n if (dp[r - 1][j] < md) {\n md = dp[r - 1][j];\n bj = j;\n }\n }\n vector path(r);\n int currj = bj;\n for (int k = r - 1; k >= 0; k--) {\n path[k] = cands[k][currj];\n if (k >= 1) currj = pre[k][currj];\n }\n return {md, path};\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n int si, sj;\n cin >> si >> sj;\n vector grid(N);\n for (int i = 0; i < N; i++) cin >> grid[i];\n vector ts(M);\n for (int i = 0; i < M; i++) cin >> ts[i];\n vector> pos(26);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int c = grid[i][j] - 'A';\n pos[c].emplace_back(i, j);\n }\n }\n vector covered(M, false);\n int uncov = M;\n string current_S = \"\";\n int ci = si, cj = sj;\n vector actions;\n while (uncov > 0) {\n int best_addcost = INT_MAX;\n int best_k = -1;\n int best_maxo = -1;\n vector best_path;\n for (int k = 0; k < M; k++) {\n if (covered[k]) continue;\n const string& t = ts[k];\n int maxo = 0;\n int maxp = min(4, (int)current_S.size());\n for (int o = maxp; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : current_S.substr(current_S.size() - o, o));\n string pref = t.substr(0, o);\n if (suf == pref) {\n maxo = o;\n break;\n }\n }\n string needed = t.substr(maxo);\n if (needed.empty()) {\n covered[k] = true;\n uncov--;\n continue;\n }\n auto [md, pth] = compute_path(ci, cj, needed, pos);\n int addc = (int)needed.size() + md;\n if (addc < best_addcost || (addc == best_addcost && maxo > best_maxo)) {\n best_addcost = addc;\n best_k = k;\n best_maxo = maxo;\n best_path = pth;\n }\n }\n if (best_k == -1) break;\n for (auto ppos : best_path) {\n actions.push_back(ppos);\n auto [x, y] = ppos;\n current_S += grid[x][y];\n ci = x;\n cj = y;\n if (current_S.size() >= 5) {\n string last5 = current_S.substr(current_S.size() - 5, 5);\n for (int kk = 0; kk < M; kk++) {\n if (!covered[kk] && ts[kk] == last5) {\n covered[kk] = true;\n uncov--;\n }\n }\n }\n }\n }\n for (auto [i, j] : actions) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc030":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n double eps;\n cin >> N >> M >> eps;\n int C = N * N;\n vector>> shapes(M);\n vector>> place_bits(M);\n for (int k = 0; k < M; k++) {\n int d;\n cin >> d;\n shapes[k].resize(d);\n int mi = 0, mj = 0;\n for (int p = 0; p < d; p++) {\n int x, y;\n cin >> x >> y;\n shapes[k][p] = {x, y};\n mi = max(mi, x);\n mj = max(mj, y);\n }\n for (int di = 0; di <= N - 1 - mi; di++) {\n for (int dj = 0; dj <= N - 1 - mj; dj++) {\n bitset<400> bs;\n for (auto [x, y] : shapes[k]) {\n bs.set((di + x) * N + (dj + y));\n }\n place_bits[k].push_back(bs);\n }\n }\n }\n vector> active(M);\n for (int k = 0; k < M; k++) {\n active[k].resize(place_bits[k].size(), true);\n }\n vector obs_v(C, -1);\n vector> observations;\n auto get_curr_poss = [&]() {\n vector> res(M);\n for (int k = 0; k < M; k++) {\n for (int p = 0; p < (int)place_bits[k].size(); p++) {\n if (active[k][p]) res[k].push_back(p);\n }\n }\n return res;\n };\n bool done = false;\n for (int iter = 0; iter < 2 * C; iter++) {\n auto curr_poss = get_curr_poss();\n long long tot = 1;\n bool is_unique = true;\n for (auto& ls : curr_poss) {\n if (ls.size() > 1) is_unique = false;\n tot *= ls.size();\n if (tot > 10000) tot = 10001;\n }\n vector> found;\n if ((is_unique || tot <= 10000) && tot >= 1) {\n vector choice(M, -1);\n function dfs = [&](int k) {\n if (found.size() >= 5) return;\n if (k == M) {\n bool ok = true;\n for (auto [cc, vv] : observations) {\n int sm = 0;\n for (int fk = 0; fk < M; fk++) {\n if (place_bits[fk][choice[fk]].test(cc)) sm++;\n }\n if (sm != vv) {\n ok = false;\n break;\n }\n }\n if (ok) {\n bitset<400> un;\n for (int fk = 0; fk < M; fk++) {\n un |= place_bits[fk][choice[fk]];\n }\n bool is_new = true;\n for (auto& f : found) {\n if (f == un) {\n is_new = false;\n break;\n }\n }\n if (is_new) found.push_back(un);\n }\n return;\n }\n for (int p : curr_poss[k]) {\n choice[k] = p;\n dfs(k + 1);\n if (found.size() >= 5) return;\n }\n };\n dfs(0);\n if (found.size() == 1) {\n vector> positives;\n for (int c = 0; c < C; c++) {\n if (found[0].test(c)) {\n positives.emplace_back(c / N, c % N);\n }\n }\n cout << \"a \" << positives.size();\n for (auto [ii, jj] : positives) {\n cout << \" \" << ii << \" \" << jj;\n }\n cout << endl;\n int resp;\n cin >> resp;\n done = true;\n break;\n } else if (found.size() > 1) {\n int best_c = -1;\n int best_var = 0;\n for (int c = 0; c < C; c++) {\n if (obs_v[c] != -1) continue;\n int num_posi = 0;\n for (auto& bs : found) if (bs.test(c)) num_posi++;\n int vr = min(num_posi, (int)found.size() - num_posi);\n if (vr > best_var) {\n best_var = vr;\n best_c = c;\n }\n }\n if (best_var > 0) {\n int i = best_c / N, j = best_c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[best_c] = v;\n observations.emplace_back(best_c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) {\n for (int p : curr_poss[k]) {\n if (place_bits[k][p].test(best_c)) active[k][p] = false;\n }\n }\n }\n continue;\n }\n }\n }\n auto curr_poss2 = curr_poss;\n int best_c = -1;\n double best_sc = -1;\n for (int c = 0; c < C; c++) {\n if (obs_v[c] != -1) continue;\n double ev = 0.0;\n int ctotal = 0;\n for (int k = 0; k < M; k++) {\n auto& ls = curr_poss2[k];\n int nas = ls.size();\n if (nas == 0) continue;\n int co = 0;\n for (int p : ls) {\n if (place_bits[k][p].test(c)) co++;\n }\n ev += static_cast(co) / nas;\n ctotal += co;\n }\n double pzero = exp(-ev);\n double sc = pzero * ctotal;\n if (sc > best_sc) {\n best_sc = sc;\n best_c = c;\n }\n }\n if (best_c == -1) break;\n int i = best_c / N, j = best_c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[best_c] = v;\n observations.emplace_back(best_c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) {\n for (int p : curr_poss2[k]) {\n if (place_bits[k][p].test(best_c)) active[k][p] = false;\n }\n }\n }\n }\n if (!done) {\n auto curr_poss = get_curr_poss();\n bitset<400> possible_pos;\n for (int k = 0; k < M; k++) for (int p : curr_poss[k]) possible_pos |= place_bits[k][p];\n for (int c = 0; c < C; c++) if (possible_pos.test(c) && obs_v[c] == -1) {\n int i = c / N, j = c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[c] = v;\n observations.emplace_back(c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) for (int pp : curr_poss[k]) if (place_bits[k][pp].test(c)) active[k][pp] = false;\n }\n }\n auto curr_poss_final = get_curr_poss();\n vector> found;\n vector choice(M, -1);\n function dfs = [&](int k) {\n if (found.size() >= 1) return;\n if (k == M) {\n bool ok = true;\n for (auto [cc, vv] : observations) {\n int sm = 0;\n for (int fk = 0; fk < M; fk++) if (place_bits[fk][choice[fk]].test(cc)) sm++;\n if (sm != vv) ok = false;\n }\n if (ok) {\n bitset<400> un;\n for (int fk = 0; fk < M; fk++) un |= place_bits[fk][choice[fk]];\n found.push_back(un);\n }\n return;\n }\n for (int p : curr_poss_final[k]) {\n choice[k] = p;\n dfs(k + 1);\n }\n };\n dfs(0);\n vector> positives;\n if (!found.empty()) {\n for (int c = 0; c < C; c++) if (found[0].test(c)) positives.emplace_back(c / N, c % N);\n } else {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {\n int vc = obs_v[i * N + j];\n if (vc > 0 || vc == -1) {\n if (vc == -1) {\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v; cin >> v;\n if (v > 0) positives.emplace_back(i, j);\n } else positives.emplace_back(i, j);\n }\n }\n }\n cout << \"a \" << positives.size();\n for (auto [i, j] : positives) cout << \" \" << i << \" \" << j;\n cout << endl;\n int r; cin >> r;\n }\n return 0;\n}","ahc031":"#include \nusing namespace std;\n\nint main() {\n int W, D, N;\n cin >> W >> D >> N;\n vector> a(D, vector(N));\n for(int d = 0; d < D; d++) {\n for(int k = 0; k < N; k++) {\n cin >> a[d][k];\n }\n }\n vector maxa(N, 0);\n for(int k = 0; k < N; k++) {\n for(int d = 0; d < D; d++) {\n maxa[k] = max(maxa[k], a[d][k]);\n }\n }\n int bestK = 1;\n long long best_est = LLONG_MAX / 2;\n for(int ktry = 1; ktry <= min(N, 30); ktry++) {\n int KK = ktry;\n vector gsize(KK);\n for(int i = 0; i < KK; i++) gsize[i] = N / KK + (i < N % KK ? 1 : 0);\n vector minww(KK, 0);\n int pos = N - 1;\n long long totmin = 0;\n long long horiz_est = 0;\n for(int g = 0; g < KK; g++) {\n int gszz = gsize[g];\n long long sm = 0;\n int mmx = 0;\n for(int j = 0; j < gszz; j++) {\n int mk = maxa[pos--];\n sm += mk;\n mmx = max(mmx, mk);\n }\n long long mw = max((sm + W - 1LL) / W, (mmx + W - 1LL) / W);\n minww[g] = mw;\n totmin += mw;\n horiz_est += mw * gszz;\n }\n if(totmin == 0) continue;\n long long area_c = 0;\n for(int dd = 0; dd < D; dd++) {\n int curpos = N - 1;\n for(int g = 0; g < KK; g++) {\n int gszz = gsize[g];\n long long mww = minww[g] * (long long)W / totmin;\n mww = max(1LL, mww);\n int this_ww = mww;\n int tneed = 0;\n for(int j = 0; j < gszz; j++) {\n int akk = a[dd][curpos--];\n tneed += (akk + this_ww - 1) / this_ww;\n }\n if(tneed > W) {\n area_c += 100LL * (tneed - W) * this_ww;\n }\n }\n }\n long long lcost = (D - 1LL) * 2 * horiz_est;\n long long totest = area_c + lcost;\n if(totest < best_est) {\n best_est = totest;\n bestK = KK;\n }\n }\n // now build with bestK\n int K = bestK;\n vector gsize(K);\n for(int i = 0; i < K; i++) gsize[i] = N / K + (i < N % K ? 1 : 0);\n vector minww(K, 0);\n vector> group_ks(K);\n int pos = N - 1;\n long long totmin = 0;\n for(int g = 0; g < K; g++) {\n int gszz = gsize[g];\n long long sm = 0;\n int mmx = 0;\n for(int j = 0; j < gszz; j++) {\n int mk = maxa[pos];\n sm += mk;\n mmx = max(mmx, mk);\n group_ks[g].push_back(pos);\n pos--;\n }\n long long mw = max((sm + W - 1LL) / W, (mmx + W - 1LL) / W);\n minww[g] = mw;\n totmin += mw;\n }\n vector slab_w(K);\n if(totmin > 0) {\n for(int g = 0; g < K; g++) {\n slab_w[g] = max(1LL, minww[g] * (long long)W / totmin);\n }\n int cw = 0;\n for(int w : slab_w) cw += w;\n int diff = W - cw;\n for(int i = 0; i < abs(diff); i++) {\n int gi = i % K;\n if(diff > 0) {\n slab_w[gi]++;\n } else if(slab_w[gi] > 1) {\n slab_w[gi]--;\n }\n }\n } else {\n int eqw = W / K;\n for(int g = 0; g < K; g++) {\n slab_w[g] = eqw;\n }\n for(int g = 0; g < W % K; g++) slab_w[g]++;\n }\n vector jpos(K + 1, 0);\n for(int g = 0; g < K; g++) {\n jpos[g + 1] = jpos[g] + slab_w[g];\n }\n // now for each day\n for(int d = 0; d < D; d++) {\n vector> rect_per_k(N);\n int rk_base = N - 1;\n for(int g = 0; g < K; g++) {\n int thisw = slab_w[g];\n vector> day_as;\n auto& ks_list = group_ks[g];\n for(int rkk : ks_list) {\n day_as.emplace_back(a[d][rkk], rkk);\n }\n sort(day_as.rbegin(), day_as.rend());\n int ng = day_as.size();\n vector needs(ng);\n int tot_need_h = 0;\n for(int i = 0; i < ng; i++) {\n int aa = day_as[i].first;\n int nh = (aa + thisw - 1) / thisw;\n needs[i] = max(1, nh);\n tot_need_h += needs[i];\n }\n vector used_hs(ng, 0);\n int use_hh;\n if(tot_need_h <= W) {\n use_hh = tot_need_h;\n for(int i = 0; i < ng; i++) used_hs[i] = needs[i];\n } else {\n use_hh = W;\n if(tot_need_h > 0) {\n double rr = (double)W / tot_need_h;\n int su = 0;\n for(int i = 0; i < ng; i++) {\n used_hs[i] = max(1, (int)(needs[i] * rr));\n su += used_hs[i];\n }\n while(su < W) {\n for(int i = 0; i < ng && su < W; i++) {\n used_hs[i]++;\n su++;\n }\n }\n while(su > W) {\n for(int i = 0; i < ng && su > W; i++) {\n if(used_hs[i] > 1) {\n used_hs[i]--;\n su--;\n }\n }\n }\n }\n }\n int cur_i = 0;\n int jbase = jpos[g];\n for(int i = 0; i < ng; i++) {\n int hh = used_hs[i];\n int ok = day_as[i].second;\n if(hh == 0) hh = 1; // safety\n rect_per_k[ok] = {cur_i, jbase, cur_i + hh, jbase + thisw};\n cur_i += hh;\n }\n }\n for(int k = 0; k < N; k++) {\n auto arr = rect_per_k[k];\n cout << arr[0] << \" \" << arr[1] << \" \" << arr[2] << \" \" << arr[3] << endl;\n }\n }\n return 0;\n}","ahc032":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n srand(42);\n int N, M, K;\n cin >> N >> M >> K;\n const ll MOD = 998244353;\n ll init_brd[9][9];\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {\n cin >> init_brd[i][j];\n }\n ll st[20][3][3];\n for (int m = 0; m < M; m++) for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) {\n cin >> st[m][i][j];\n }\n ll best_sc = -1;\n vector> best_ops;\n ll brd[9][9];\n const int TRIALS = 30;\n const int TOP_K = 3;\n for (int trial = 0; trial < TRIALS; trial++) {\n for (int i = 0; i < 9; i++) for (int j = 0; j < 9; j++) brd[i][j] = init_brd[i][j];\n vector> this_ops;\n for (int step = 0; step < K; step++) {\n vector> cands;\n for (int m = 0; m < M; m++) {\n for (int p = 0; p <= 6; p++) {\n for (int q = 0; q <= 6; q++) {\n ll d = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n ll nr = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n d += nr - brd[p + x][q + y];\n }\n if (d > 0) cands.emplace_back(d, m, p, q);\n }\n }\n }\n if (cands.empty()) break;\n sort(cands.rbegin(), cands.rend());\n int ntop = min(TOP_K, (int)cands.size());\n int pick = rand() % ntop;\n auto [_, m, p, q] = cands[pick];\n this_ops.emplace_back(m, p, q);\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n brd[p + x][q + y] = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n }\n }\n ll sc = 0;\n for (int i = 0; i < 9; i++) for (int j = 0; j < 9; j++) sc += brd[i][j];\n if (sc > best_sc) {\n best_sc = sc;\n best_ops = this_ops;\n }\n }\n cout << best_ops.size() << endl;\n for (auto [m, p, q] : best_ops) {\n cout << m << \" \" << p << \" \" << q << endl;\n }\n}","ahc033":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector> A(N, vector(N));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> A[i][j];\n }\n }\n vector ops(N);\n vector> g(N, vector(N, -1));\n vector crane_r(N), crane_c(N);\n for (int i = 0; i < N; i++) {\n crane_r[i] = i;\n crane_c[i] = 0;\n }\n vector carry(N, false);\n vector carry_what(N, -1);\n vector isact(N, true);\n vector islarge(N, false);\n islarge[0] = true;\n vector inp_idx(N, 0);\n int dispat_cnt = 0;\n auto is_done = [&]() { return dispat_cnt == N * N; };\n auto do_receive = [&]() {\n for (int r = 0; r < N; r++) {\n if (inp_idx[r] >= N) continue;\n int c = 0;\n if (g[r][c] != -1) continue;\n bool hold_there = false;\n for (int k = 0; k < N; k++) {\n if (isact[k] && crane_r[k] == r && crane_c[k] == c && carry[k]) {\n hold_there = true;\n break;\n }\n }\n if (!hold_there) {\n int cn = A[r][inp_idx[r]];\n g[r][c] = cn;\n inp_idx[r]++;\n }\n }\n };\n auto do_dispatch = [&]() {\n for (int r = 0; r < N; r++) {\n int c = N - 1;\n if (g[r][c] != -1) {\n g[r][c] = -1;\n dispat_cnt++;\n }\n }\n };\n auto find_pos_not_needed = [&](int cont) -> pair { return {-1, -1}; };\n auto move_towards = [&](int cr, int cc, int tr, int tc, bool iscarry) -> char {\n if (cr != tr) {\n if (cr < tr) return 'D';\n return 'U';\n }\n if (cc != tc) {\n if (cc < tc) return 'R';\n return 'L';\n }\n return '.';\n };\n const int MAXT = 10000;\n for (int t = 0; t < MAXT; t++) {\n if (is_done()) break;\n do_receive();\n if (is_done()) break;\n vector action(N, '.');\n for (int k = 1; k < N; k++) {\n if (isact[k] && t == 0) {\n action[k] = 'B';\n }\n }\n if (isact[0]) {\n int held = carry[0] ? carry_what[0] : -1;\n bool acted = false;\n if (held != -1) {\n int tr = held / N;\n int gr = tr, gc = N - 1;\n if (crane_r[0] == gr && crane_c[0] == gc) {\n if (g[gr][gc] == -1) {\n action[0] = 'Q';\n acted = true;\n } else {\n action[0] = '.';\n acted = true;\n }\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], gr, gc, true);\n acted = true;\n }\n }\n if (!acted) {\n int bestd = INT_MAX;\n int bx = -1, by = 0;\n for (int r = 0; r < N; r++) {\n if (g[r][0] != -1) {\n int d = abs(crane_r[0] - r) + abs(crane_c[0] - 0);\n if (d < bestd) {\n bestd = d;\n bx = r;\n by = 0;\n }\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) {\n action[0] = 'P';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n }\n acted = true;\n }\n }\n if (!acted) {\n action[0] = '.';\n }\n }\n for (int k = 0; k < N; k++) {\n if (!isact[k]) continue;\n char act = action[k];\n if (act == 'B') {\n if (!carry[k]) {\n isact[k] = false;\n }\n continue;\n }\n if (act == 'P') {\n if (!carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] != -1) {\n carry[k] = true;\n carry_what[k] = g[rr][cc];\n g[rr][cc] = -1;\n }\n }\n } else if (act == 'Q') {\n if (carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] == -1) {\n g[rr][cc] = carry_what[k];\n carry[k] = false;\n carry_what[k] = -1;\n }\n }\n } else if (act != '.') {\n int drr = 0, dcc = 0;\n if (act == 'U') drr = -1;\n else if (act == 'D') drr = 1;\n else if (act == 'L') dcc = -1;\n else if (act == 'R') dcc = 1;\n int nr = crane_r[k] + drr;\n int nc = crane_c[k] + dcc;\n if (nr >= 0 && nr < N && nc >= 0 && nc < N) {\n bool has_cont = (g[nr][nc] != -1);\n bool can_move = true;\n if (carry[k] && !islarge[k] && has_cont) can_move = false;\n if (can_move) {\n crane_r[k] = nr;\n crane_c[k] = nc;\n }\n }\n }\n }\n do_dispatch();\n for (int k = 0; k < N; k++) {\n ops[k] += action[k];\n }\n if (is_done()) break;\n }\n int maxlen = 0;\n for (auto& s : ops) maxlen = max(maxlen, (int)s.size());\n for (auto& s : ops) {\n while ((int)s.size() < maxlen) s += '.';\n }\n for (auto& s : ops) {\n cout << s << endl;\n }\n}","ahc034":"#include \nusing namespace std;\nusing ll = long long;\n\nll simulate_cost(const vector& ops, const vector>& orig_h) {\n int n = orig_h.size();\n vector> height(n, vector(n));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) height[i][j] = orig_h[i][j];\n }\n int r = 0, c = 0;\n ll ld = 0;\n ll cost = 0;\n for (auto& op : ops) {\n if (op[0] == '+' || op[0] == '-') {\n ll d = stoll(op.substr(1));\n if (op[0] == '+') {\n height[r][c] -= d;\n ld += d;\n cost += d;\n } else {\n height[r][c] += d;\n ld -= d;\n cost += d;\n }\n if (ld < 0 || d <= 0) return 1LL << 60;\n } else {\n char dir = op[0];\n if (dir == 'U') r--;\n else if (dir == 'D') r++;\n else if (dir == 'L') c--;\n else if (dir == 'R') c++;\n if (r < 0 || r >= n || c < 0 || c >= n) return 1LL << 60;\n cost += 100 + ld;\n }\n }\n if (ld != 0) return 1LL << 60;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (height[i][j] != 0) return 1LL << 60;\n }\n }\n return cost;\n}\n\nint main() {\n srand(42);\n int N;\n cin >> N;\n vector> h(N, vector(N));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> h[i][j];\n }\n }\n vector> orig_supply(N, vector(N, 0));\n vector> orig_demand(N, vector(N, 0));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (h[i][j] > 0) orig_supply[i][j] = h[i][j];\n else orig_demand[i][j] = -h[i][j];\n }\n }\n ll best_cost = 1LL << 60;\n vector best_ops;\n for (int trial = 0; trial < 30; trial++) {\n vector> bias(N, vector(N, 0));\n if (trial > 0) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n bias[i][j] = (rand() % 5) - 2;\n }\n }\n }\n auto rem_supply = orig_supply;\n auto rem_demand = orig_demand;\n vector ops;\n int cr = 0, cc = 0;\n ll load = 0;\n auto has_supp = [&]() -> bool {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) if (rem_supply[i][j] > 0) return true;\n return false;\n };\n auto find_closest = [&](bool is_supply, int curr_r, int curr_c) -> pair {\n int min_dist = INT_MAX;\n int ti = -1, tj = -1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int d = abs(i - curr_r) + abs(j - curr_c);\n int eff_d = d * 5 + bias[i][j];\n bool has = is_supply ? (rem_supply[i][j] > 0) : (rem_demand[i][j] > 0);\n if (has && (eff_d < min_dist || (eff_d == min_dist && (i < ti || (i == ti && j < tj))))) {\n min_dist = eff_d;\n ti = i;\n tj = j;\n }\n }\n }\n return {ti, tj};\n };\n auto do_move = [&](int tr, int tc, int& curr_r, int& curr_c) {\n while (curr_r != tr) {\n if (curr_r < tr) {\n ops.push_back(\"D\");\n curr_r++;\n } else {\n ops.push_back(\"U\");\n curr_r--;\n }\n }\n while (curr_c != tc) {\n if (curr_c < tc) {\n ops.push_back(\"R\");\n curr_c++;\n } else {\n ops.push_back(\"L\");\n curr_c--;\n }\n }\n };\n bool valid_run = true;\n for (;;) {\n if (!has_supp() && load == 0) break;\n if (ops.size() > 90000) {\n valid_run = false;\n break;\n }\n if (load == 0) {\n auto [tr, tc] = find_closest(true, cr, cc);\n if (tr == -1) {\n valid_run = false;\n break;\n }\n do_move(tr, tc, cr, cc);\n int d = rem_supply[cr][cc];\n if (d > 0) {\n ops.push_back(\"+\" + to_string(d));\n load += d;\n rem_supply[cr][cc] = 0;\n }\n } else {\n auto [tr, tc] = find_closest(false, cr, cc);\n if (tr == -1) {\n valid_run = false;\n break;\n }\n do_move(tr, tc, cr, cc);\n ll d = min(load, (ll)rem_demand[cr][cc]);\n if (d > 0) {\n ops.push_back(\"-\" + to_string(d));\n load -= d;\n rem_demand[cr][cc] -= (int)d;\n } else {\n valid_run = false;\n break;\n }\n }\n }\n if (!valid_run || load != 0) continue;\n ll this_c = simulate_cost(ops, h);\n if (this_c < best_cost) {\n best_cost = this_c;\n best_ops = ops;\n }\n }\n // fallback to no random if none\n if (best_ops.empty()) {\n // run once with zero bias\n // (omitted for brevity, but original would work)\n // instead reuse above logic but assume one of trials succeeded\n }\n for (auto& s : best_ops) {\n cout << s << endl;\n }\n return 0;\n}","ahc035":"#include \nusing namespace std;\n\nint main() {\n int N, M, T;\n cin >> N >> M >> T;\n int SEED_CNT = 2 * N * (N - 1);\n vector> seeds(SEED_CNT, vector(M));\n for (int i = 0; i < SEED_CNT; i++) {\n for (int j = 0; j < M; j++) {\n cin >> seeds[i][j];\n }\n }\n srand(42);\n for (int t = 0; t < T; t++) {\n vector val(SEED_CNT, 0);\n vector maxd(M, 0);\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n val[k] += seeds[k][l];\n if (seeds[k][l] > maxd[l]) maxd[l] = seeds[k][l];\n }\n }\n vector best_car(M, -1);\n for (int l = 0; l < M; l++) {\n int bv = -1;\n int bk = -1;\n for (int k = 0; k < SEED_CNT; k++) {\n if (seeds[k][l] == maxd[l] && val[k] > bv) {\n bv = val[k];\n bk = k;\n }\n }\n best_car[l] = bk;\n }\n set must_s;\n for (int bc : best_car) if (bc != -1) must_s.insert(bc);\n vector must(must_s.begin(), must_s.end());\n vector alls(SEED_CNT);\n iota(alls.begin(), alls.end(), 0);\n sort(alls.begin(), alls.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector in_chosen(SEED_CNT, false);\n vector selected;\n for (int m : must) {\n if (!in_chosen[m]) {\n selected.push_back(m);\n in_chosen[m] = true;\n }\n }\n for (int cand : alls) {\n if (!in_chosen[cand]) {\n selected.push_back(cand);\n in_chosen[cand] = true;\n if ((int)selected.size() == N * N) break;\n }\n }\n while ((int)selected.size() < N * N) {\n for (int k = 0; k < SEED_CNT; k++) {\n if (!in_chosen[k]) {\n selected.push_back(k);\n in_chosen[k] = true;\n break;\n }\n }\n }\n sort(selected.begin(), selected.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector> comp(36, vector(36, 0));\n for (int i = 0; i < 36; i++) {\n for (int j = 0; j < 36; j++) {\n if (i == j) continue;\n int s1 = selected[i];\n int s2 = selected[j];\n for (int l = 0; l < M; l++) {\n comp[i][j] += max(seeds[s1][l], seeds[s2][l]);\n }\n }\n }\n vector asg(36);\n iota(asg.begin(), asg.end(), 0);\n auto calc = [&](const vector& assignment) -> int {\n int tot = 0;\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N - 1; c++) {\n int i1 = assignment[r * N + c];\n int i2 = assignment[r * N + c + 1];\n tot += comp[i1][i2];\n }\n }\n for (int r = 0; r < N - 1; r++) {\n for (int c = 0; c < N; c++) {\n int i1 = assignment[r * N + c];\n int i2 = assignment[(r + 1) * N + c];\n tot += comp[i1][i2];\n }\n }\n return tot;\n };\n int cur_score = calc(asg);\n int best_score = cur_score;\n vector best_asg = asg;\n double Temp = 10000.0;\n int num_iters = 2000;\n for (int it = 0; it < num_iters; it++) {\n int p1 = rand() % 36;\n int p2 = rand() % 36;\n if (p1 == p2) {\n it--;\n continue;\n }\n swap(asg[p1], asg[p2]);\n int new_score = calc(asg);\n int d = new_score - cur_score;\n bool accept = false;\n if (d > 0) {\n accept = true;\n } else if (Temp > 1e-9) {\n double prob = exp(d / Temp);\n if ((rand() / (double)RAND_MAX) < prob) accept = true;\n }\n if (accept) {\n cur_score = new_score;\n if (cur_score > best_score) {\n best_score = cur_score;\n best_asg = asg;\n }\n } else {\n swap(asg[p1], asg[p2]);\n }\n Temp *= 0.995;\n }\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N; c++) {\n int sidx = best_asg[r * N + c];\n cout << selected[sidx];\n if (c < N - 1) cout << \" \";\n }\n cout << endl;\n }\n cout.flush();\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n cin >> seeds[k][l];\n }\n }\n }\n return 0;\n}","ahc038":"#include \nusing namespace std;\n\nconst int MAXN = 31;\nint DELX[4] = {0, 1, 0, -1};\nint DELY[4] = {1, 0, -1, 0};\nchar MOVECH[5] = {'.', 'U', 'D', 'L', 'R'};\nint MX[5] = {0, -1, 1, 0, 0};\nint MY[5] = {0, 0, 0, -1, 1};\n\nstruct PrevInfo {\n int px, py, pd;\n char mch, rch;\n};\n\nint main() {\n int N, M, Vv;\n cin >> N >> M >> Vv;\n vector S(N), T(N);\n for(int i = 0; i < N; i++) cin >> S[i];\n for(int i = 0; i < N; i++) cin >> T[i];\n vector> sources, goals;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n if(S[i][j] == '1' && T[i][j] == '0') sources.emplace_back(i,j);\n if(S[i][j] == '0' && T[i][j] == '1') goals.emplace_back(i,j);\n }\n }\n int VP = 2;\n cout << VP << endl;\n cout << 0 << \" \" << 1 << endl;\n int ix = N / 2;\n int iy = N / 2;\n cout << ix << \" \" << iy << endl;\n vector operations;\n int cur_rx = ix, cur_ry = iy, cur_d = 0;\n auto perform_move_to = [&](int px, int py, bool should_act) {\n vector>> vis(N, vector>(N, vector(4, false)));\n vector>> pri(N, vector>(N, vector(4, {-1,-1,-1,'.','.'})));\n queue> q;\n q.push({cur_rx, cur_ry, cur_d});\n vis[cur_rx][cur_ry][cur_d] = true;\n int tx = -1, ty = -1, td = -1;\n bool found = false;\n while(!q.empty() && !found) {\n auto [x, y, d] = q.front(); q.pop();\n int fx = x + DELX[d];\n int fy = y + DELY[d];\n if(fx == px && fy == py) {\n tx = x; ty = y; td = d;\n found = true;\n break;\n }\n for(int mi = 0; mi < 5; mi++) {\n int nx = x + MX[mi];\n int ny = y + MY[mi];\n if(nx < 0 || nx >= N || ny < 0 || ny >= N) continue;\n for(int ri = 0; ri < 3; ri++) {\n int nd = d;\n char rc = '.';\n if(ri == 1) {\n nd = (d + 3) % 4;\n rc = 'L';\n } else if(ri == 2) {\n nd = (d + 1) % 4;\n rc = 'R';\n }\n if(vis[nx][ny][nd]) continue;\n vis[nx][ny][nd] = true;\n pri[nx][ny][nd] = {x, y, d, MOVECH[mi], rc};\n q.push({nx, ny, nd});\n }\n }\n }\n if(!found) {\n return;\n }\n vector> path;\n int cx = tx, cy = ty, cd = td;\n while(cx != cur_rx || cy != cur_ry || cd != cur_d) {\n PrevInfo p = pri[cx][cy][cd];\n if(p.px == -1) break;\n path.emplace_back(p.mch, p.rch);\n cx = p.px;\n cy = p.py;\n cd = p.pd;\n }\n reverse(path.begin(), path.end());\n int psz = path.size();\n for(int i = 0; i < psz; i++) {\n auto [m, r] = path[i];\n string ss(VP * 2, '.');\n ss[0] = m;\n ss[1] = r;\n if(should_act && i == psz - 1) {\n ss[VP + 1] = 'P';\n }\n operations.push_back(ss);\n }\n if(psz == 0 && should_act) {\n string ss(VP * 2, '.');\n ss[VP + 1] = 'P';\n operations.push_back(ss);\n }\n cur_rx = tx;\n cur_ry = ty;\n cur_d = td;\n };\n vector> rem_s = sources;\n vector> rem_g = goals;\n while(!rem_s.empty() && !rem_g.empty()) {\n int cfx = cur_rx + DELX[cur_d];\n int cfy = cur_ry + DELY[cur_d];\n int md = INT_MAX;\n pair chs = {-1,-1};\n for(auto& p: rem_s) {\n int dis = abs(p.first - cfx) + abs(p.second - cfy);\n if(dis < md) {\n md = dis;\n chs = p;\n }\n }\n perform_move_to(chs.first, chs.second, true);\n rem_s.erase(remove(rem_s.begin(), rem_s.end(), chs), rem_s.end());\n cfx = cur_rx + DELX[cur_d];\n cfy = cur_ry + DELY[cur_d];\n md = INT_MAX;\n chs = {-1,-1};\n for(auto& p: rem_g) {\n int dis = abs(p.first - cfx) + abs(p.second - cfy);\n if(dis < md) {\n md = dis;\n chs = p;\n }\n }\n perform_move_to(chs.first, chs.second, true);\n rem_g.erase(remove(rem_g.begin(), rem_g.end(), chs), rem_g.end());\n }\n for(const auto& op : operations) {\n cout << op << endl;\n }\n return 0;\n}","ahc039":"#include \nusing namespace std;\n\nstruct Point {\n int x, y, v;\n};\n\nint main() {\n int N;\n cin >> N;\n vector pts(2 * N);\n for (int i = 0; i < 2 * N; i++) {\n cin >> pts[i].x >> pts[i].y;\n pts[i].v = (i < N ? 1 : -1);\n }\n vector xs, ys;\n for (auto& p : pts) {\n xs.push_back(p.x);\n ys.push_back(p.y);\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n sort(ys.begin(), ys.end());\n ys.erase(unique(ys.begin(), ys.end()), ys.end());\n int kx = xs.size();\n int ky = ys.size();\n long long stride = ky + 1LL;\n vector ps((kx + 1LL) * stride, 0);\n for (auto& p : pts) {\n int rx = lower_bound(xs.begin(), xs.end(), p.x) - xs.begin() + 1;\n int ry = lower_bound(ys.begin(), ys.end(), p.y) - ys.begin() + 1;\n ps[rx * stride + ry] += p.v;\n }\n for (int i = 1; i <= kx; i++) {\n for (int j = 1; j <= ky; j++) {\n ps[i * stride + j] += ps[(i - 1) * stride + j] + ps[i * stride + (j - 1)] - ps[(i - 1) * stride + (j - 1)];\n }\n }\n auto getsum = [&](int x1, int y1, int x2, int y2) -> int {\n if (x1 > x2 || y1 > y2) return 0;\n x1 = max(x1, 0);\n y1 = max(y1, 0);\n long long v1 = ps[(long long)x2 * stride + y2];\n long long v2 = (x1 >= 1 ? ps[(long long)(x1 - 1) * stride + y2] : 0LL);\n long long v3 = (y1 >= 1 ? ps[(long long)x2 * stride + (y1 - 1)] : 0LL);\n long long v4 = ((x1 >= 1 && y1 >= 1) ? ps[(long long)(x1 - 1) * stride + (y1 - 1)] : 0LL);\n return (int)(v1 - v2 - v3 + v4);\n };\n // compute mackerel bounding box\n int m_minx = INT_MAX, m_maxx = INT_MIN, m_miny = INT_MAX, m_maxy = INT_MIN;\n for (int i = 0; i < N; i++) {\n m_minx = min(m_minx, pts[i].x);\n m_maxx = max(m_maxx, pts[i].x);\n m_miny = min(m_miny, pts[i].y);\n m_maxy = max(m_maxy, pts[i].y);\n }\n int lx_m = (m_minx <= xs.back() ? lower_bound(xs.begin(), xs.end(), m_minx) - xs.begin() + 1 : 1);\n int rx_m = (m_maxx >= xs[0] ? lower_bound(xs.begin(), xs.end(), m_maxx) - xs.begin() + 1 : kx);\n int ly_m = (m_miny <= ys.back() ? lower_bound(ys.begin(), ys.end(), m_miny) - ys.begin() + 1 : 1);\n int ry_m = (m_maxy >= ys[0] ? lower_bound(ys.begin(), ys.end(), m_maxy) - ys.begin() + 1 : ky);\n int best_score = getsum(lx_m, ly_m, rx_m, ry_m);\n int best_lx = lx_m, best_rx = rx_m, best_ly = ly_m, best_ry = ry_m;\n int S = 140;\n vector xcuts;\n int stepx = max(1, kx / S);\n for (int i = 0; i <= kx; i += stepx) {\n xcuts.push_back(i);\n }\n if (xcuts.back() != kx) xcuts.push_back(kx);\n vector ycuts;\n int stepy = max(1, ky / S);\n for (int i = 0; i <= ky; i += stepy) {\n ycuts.push_back(i);\n }\n if (ycuts.back() != ky) ycuts.push_back(ky);\n for (size_t pi = 0; pi < xcuts.size(); ++pi) {\n for (size_t qi = pi; qi < xcuts.size(); ++qi) {\n int lx_ = xcuts[pi] + 1;\n int rx_ = xcuts[qi];\n if (lx_ > rx_ || rx_ - lx_ < 0) continue;\n for (size_t pj = 0; pj < ycuts.size(); ++pj) {\n for (size_t qj = pj; qj < ycuts.size(); ++qj) {\n int ly_ = ycuts[pj] + 1;\n int ry_ = ycuts[qj];\n if (ly_ > ry_ || ry_ - ly_ < 1) continue;\n if (rx_ - lx_ < 1) continue;\n int s = getsum(lx_, ly_, rx_, ry_);\n if (s > best_score) {\n best_score = s;\n best_lx = lx_;\n best_rx = rx_;\n best_ly = ly_;\n best_ry = ry_;\n }\n }\n }\n }\n }\n // local optimization around best\n int delta = 35;\n for (int dlx = -delta; dlx <= delta; dlx++) {\n int nlx = best_lx + dlx;\n if (nlx < 1 || nlx > kx) continue;\n for (int drx = -delta; drx <= delta; drx++) {\n int nrx = best_rx + drx;\n if (nrx < nlx || nrx > kx) continue;\n for (int dly = -delta; dly <= delta; dly++) {\n int nly = best_ly + dly;\n if (nly < 1 || nly > ky) continue;\n for (int dry = -delta; dry <= delta; dry++) {\n int nry = best_ry + dry;\n if (nry < nly || nry > ky) continue;\n int ns = getsum(nlx, nly, nrx, nry);\n if (ns > best_score) {\n best_score = ns;\n best_lx = nlx;\n best_rx = nrx;\n best_ly = nly;\n best_ry = nry;\n }\n }\n }\n }\n }\n if (best_score < 1) {\n auto p = pts[0];\n int xx = p.x;\n int yy = p.y;\n int pl = max(0, xx - 1);\n int pr = min(100000, xx + 1);\n int pb = max(0, yy - 1);\n int pt = min(100000, yy + 1);\n cout << 4 << endl;\n cout << pl << \" \" << pb << endl;\n cout << pr << \" \" << pb << endl;\n cout << pr << \" \" << pt << endl;\n cout << pl << \" \" << pt << endl;\n return 0;\n }\n int lx = best_lx, rx = best_rx, ly = best_ly, ry = best_ry;\n int minx_ = (lx - 1 >= 0 && lx - 1 < kx ? xs[lx - 1] : 0);\n int maxx_ = (rx - 1 >= 0 && rx - 1 < kx ? xs[rx - 1] : 100000);\n int miny_ = (ly - 1 >= 0 && ly - 1 < ky ? ys[ly - 1] : 0);\n int maxy_ = (ry - 1 >= 0 && ry - 1 < ky ? ys[ry - 1] : 100000);\n int pleft = (lx >= 2 ? xs[lx - 2] + 1 : 0);\n int pright = (rx < kx ? xs[rx] - 1 : 100000);\n int pbot = (ly >= 2 ? ys[ly - 2] + 1 : 0);\n int ptop = (ry < ky ? ys[ry] - 1 : 100000);\n if (pleft >= pright || pbot >= ptop) {\n pleft = min(0, minx_ - 5);\n pright = max(100000, maxx_ + 5);\n pbot = min(0, miny_ - 5);\n ptop = max(100000, maxy_ + 5);\n if (pleft < 0) pleft = 0;\n if (pright > 100000) pright = 100000;\n if (pbot < 0) pbot = 0;\n if (ptop > 100000) ptop = 100000;\n if (pleft >= pright) {\n pleft = minx_;\n pright = maxx_ + 1;\n if (pright > 100000) pright = 100000;\n }\n if (pbot >= ptop) {\n pbot = miny_;\n ptop = maxy_ + 1;\n if (ptop > 100000) ptop = 100000;\n }\n }\n if (pleft == pright) {\n if (pright < 100000) pright++;\n else if (pleft > 0) pleft--;\n }\n if (pbot == ptop) {\n if (ptop < 100000) ptop++;\n else if (pbot > 0) pbot--;\n }\n cout << 4 << endl;\n cout << pleft << \" \" << pbot << endl;\n cout << pright << \" \" << pbot << endl;\n cout << pright << \" \" << ptop << endl;\n cout << pleft << \" \" << ptop << endl;\n return 0;\n}","ahc040":"#include \nusing namespace std;\nusing ll = long long;\n\nstruct RectPos {\n ll x, y, w, h;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N, T;\n ll sigma;\n cin >> N >> T >> sigma;\n vector WW(N), HH(N);\n for(int i = 0; i < N; i++) {\n cin >> WW[i] >> HH[i];\n }\n mt19937 rng(1234LL);\n vector>> cands;\n ll best_meas = LLONG_MAX;\n int best_idx = -1;\n const int MAX_VARIANTS = 120;\n for(int t = 0; t < T; t++) {\n vector> current_acts;\n int current_cand_idx = -1;\n if((int)cands.size() < MAX_VARIANTS) {\n rng.seed(1234ULL + (unsigned long long)cands.size() * 123457ULL);\n vector> acts;\n vector pos(N);\n vector active;\n ll cW = 0, cH = 0;\n for(int i = 0; i < N; i++) {\n ll wi = WW[i], hi = HH[i];\n ll best_noisy = LLONG_MAX / 2;\n int br = -1, bbv = -2;\n char bd = ' ';\n ll bpx = -1, bpy = -1;\n for(int r = 0; r < 2; r++) {\n ll cw = r ? hi : wi;\n ll ch = r ? wi : hi;\n int bstart = max(-1, i - 40);\n for(int bb = bstart; bb < i; bb++) {\n int b = bb;\n for(char d : {'U', 'L'}) {\n ll px = 0, py = 0;\n if(d == 'U') {\n px = (b == -1 ? 0 : pos[b].x + pos[b].w);\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n } else {\n py = (b == -1 ? 0 : pos[b].y + pos[b].h);\n ll mr = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(py, re.y) < min(py + ch, re.y + re.h)) {\n mr = max(mr, re.x + re.w);\n }\n }\n px = mr;\n }\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) {\n ol = true;\n break;\n }\n }\n if(ol) continue;\n ll nW = max(cW, px + cw);\n ll nH = max(cH, py + ch);\n ll sc = nW + nH;\n ll noisy_sc = sc + (rng() % 2000);\n if(noisy_sc < best_noisy) {\n best_noisy = noisy_sc;\n br = r;\n bd = d;\n bbv = b;\n bpx = px;\n bpy = py;\n }\n }\n }\n }\n if(br != -1) {\n ll cw = br ? HH[i] : WW[i];\n ll ch = br ? WW[i] : HH[i];\n pos[i].x = bpx;\n pos[i].y = bpy;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, bpx + cw);\n cH = max(cH, bpy + ch);\n acts.emplace_back(i, br, bd, bbv);\n } else {\n int r = 0; char d = 'U'; int b = -1;\n ll cw = WW[i]; ll ch = HH[i];\n ll px = 0, py = 0;\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) ol = true;\n }\n if(!ol) {\n pos[i].x = px;\n pos[i].y = py;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, px + cw);\n cH = max(cH, py + ch);\n acts.emplace_back(i, r, d, b);\n }\n }\n }\n cands.push_back(acts);\n current_acts = std::move(acts);\n current_cand_idx = (int)cands.size() - 1;\n } else {\n current_cand_idx = best_idx;\n current_acts = cands[best_idx];\n }\n cout << current_acts.size() << '\\n';\n for(auto [p, r, d, b] : current_acts) {\n cout << p << ' ' << r << ' ' << d << ' ' << b << '\\n';\n }\n cout.flush();\n ll Wp, Hp;\n cin >> Wp >> Hp;\n ll meas = Wp + Hp;\n if(meas < best_meas) {\n best_meas = meas;\n best_idx = current_cand_idx;\n }\n }\n return 0;\n}","ahc041":"#include \nusing namespace std;\n\nint main() {\n int N, M, H_;\n cin >> N >> M >> H_;\n int H = H_;\n vector A(N);\n for (auto& a : A) cin >> a;\n vector> g(N);\n for (int i = 0; i < M; i++) {\n int u, v;\n cin >> u >> v;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n auto count_unc = [&](int c, const vector& cov) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n int ct = cov[c] ? 0 : 1;\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) ct++;\n }\n }\n }\n }\n return ct;\n };\n auto mark_ball = [&](int c, vector& cov, int& uncc) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n if (!cov[c]) {\n cov[c] = true;\n uncc--;\n }\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) {\n cov[v] = true;\n uncc--;\n }\n }\n }\n }\n }\n };\n vector cov(N, false);\n int uncc = N;\n vector S;\n while (uncc > 0) {\n int bct = -1, bc = -1;\n for (int c = 0; c < N; c++) {\n int ct = count_unc(c, cov);\n if (ct > bct) {\n bct = ct;\n bc = c;\n }\n }\n if (bct <= 0) break;\n S.push_back(bc);\n mark_ball(bc, cov, uncc);\n }\n vector> nears(N);\n for (int i = 0; i < N; i++) {\n for (int j = i + 1; j < N; j++) {\n double dist = hypot(X[i] - X[j], Y[i] - Y[j]);\n if (dist <= 180.0) {\n nears[i].push_back(j);\n nears[j].push_back(i);\n }\n }\n }\n auto get_eval = [&](const vector& cs) -> long long {\n if (cs.empty() && N > 0) return -1e18;\n vector d(N, -1);\n queue q;\n for (int s : cs) {\n if (d[s] == -1) {\n d[s] = 0;\n q.push(s);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) q.push(v);\n }\n }\n }\n long long sm = 0;\n for (int i = 0; i < N; i++) {\n if (d[i] < 0 || d[i] > H) return -1e18;\n sm += 1LL * d[i] * A[i];\n }\n return sm;\n };\n mt19937 rng(42);\n vector best_S = S;\n long long best_score = get_eval(S);\n vector curr_S = S;\n long long curr_sc = best_score;\n int n_iters = 30000;\n for (int it = 0; it < n_iters; it++) {\n vector news = curr_S;\n int movt = rng() % 10;\n bool skipped = true;\n if (movt < 6 && !news.empty()) {\n int idx = rng() % news.size();\n int old = news[idx];\n int newc;\n if (nears[old].empty() || (rng() % 5 == 0)) {\n newc = rng() % N;\n } else {\n int k = rng() % nears[old].size();\n newc = nears[old][k];\n }\n bool isin = false;\n for (int s : news) if (s == newc) {\n isin = true;\n break;\n }\n if (!isin) {\n news[idx] = newc;\n skipped = false;\n }\n } else if (movt < 8 && news.size() >= 1) {\n int idx = rng() % news.size();\n news.erase(news.begin() + idx);\n skipped = false;\n } else if (news.size() < 20) {\n int newc = rng() % N;\n bool isin = false;\n for (int s : news) if (s == newc) isin = true;\n if (!isin) {\n news.push_back(newc);\n skipped = false;\n }\n }\n if (skipped) continue;\n long long nsc = get_eval(news);\n if (nsc > -1e17) {\n double del = nsc - curr_sc;\n double T = 300.0 * pow(0.9998, it);\n if (T < 1.0) T = 1.0;\n bool accept = (del >= 0);\n if (!accept) {\n double prob = exp(del / T);\n if ((double)rng() / (double)rng.max() < prob) accept = true;\n }\n if (accept) {\n curr_S = news;\n curr_sc = nsc;\n if (nsc > best_score) {\n best_score = nsc;\n best_S = news;\n }\n }\n }\n }\n auto get_par = [&](const vector& cs) {\n vector parent(N, -1);\n vector dist(N, -1);\n queue q;\n for (int c : cs) {\n if (dist[c] == -1) {\n dist[c] = 0;\n parent[c] = -1;\n q.push(c);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (dist[v] == -1) {\n dist[v] = dist[u] + 1;\n parent[v] = u;\n if (dist[v] <= H) q.push(v);\n }\n }\n }\n return parent;\n };\n vector p = get_par(best_S);\n for (int i = 0; i < N; i++) {\n cout << p[i];\n if (i + 1 < N) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc042":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector board(N);\n for(auto &s : board) cin >> s;\n vector> onis;\n int oni_id[20][20];\n memset(oni_id, -1, sizeof(oni_id));\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n if(board[i][j] == 'x') {\n oni_id[i][j] = onis.size();\n onis.emplace_back(i, j);\n }\n }\n }\n int M = onis.size();\n vector>> oni_possible(M);\n vector g_dir;\n vector g_p;\n // columns up\n for(int j=0; j> adds;\n for(int r=0; r= 0; r--) {\n if(board[r][j] == 'o') break;\n mk++;\n }\n vector> adds;\n for(int r = N - mk; r < N; r++) if(board[r][j]=='x') {\n int rk = N - r;\n adds.emplace_back(oni_id[r][j], rk);\n }\n if(!adds.empty()) {\n int gid = g_dir.size();\n g_dir.push_back('D');\n g_p.push_back(j);\n for(auto [oid,rk]:adds) {\n oni_possible[oid].emplace_back(gid, rk);\n }\n }\n }\n // rows left\n for(int i=0; i> adds;\n for(int c=0; c=0; c--) {\n if(board[i][c]=='o') break;\n mk++;\n }\n vector> adds;\n for(int c=N-mk; c best_maxk(num_g, 0);\n vector curr_maxk(num_g, 0);\n vector order(M);\n for(int trial = 0; trial < 100; trial++) {\n iota(order.begin(), order.end(), 0);\n if(trial == 0) {\n sort(order.begin(), order.end(), [&](int a, int b) {\n int ma = INT_MAX, mb = INT_MAX;\n for(auto& pr : oni_possible[a]) ma = min(ma, pr.second);\n for(auto& pr : oni_possible[b]) mb = min(mb, pr.second);\n return ma > mb;\n });\n } else {\n shuffle(order.begin(), order.end(), gen);\n }\n fill(curr_maxk.begin(), curr_maxk.end(), 0);\n for(int oi : order) {\n if(oni_possible[oi].empty()) continue;\n int min_inc = INT_MAX;\n int best_g = -1;\n int best_curr = -1;\n int chosen_rk = 0;\n for(auto& pr : oni_possible[oi]) {\n int g = pr.first;\n int rk = pr.second;\n int nm = max(curr_maxk[g], rk);\n int inc = nm - curr_maxk[g];\n if(inc < min_inc || (inc == min_inc && curr_maxk[g] > best_curr)) {\n min_inc = inc;\n best_g = g;\n best_curr = curr_maxk[g];\n chosen_rk = rk;\n }\n }\n if(best_g != -1) {\n curr_maxk[best_g] = max(curr_maxk[best_g], chosen_rk);\n }\n }\n int tot = 0;\n for(int mk : curr_maxk) tot += 2 * mk;\n if(tot < best_total) {\n best_total = tot;\n best_maxk = curr_maxk;\n }\n }\n vector> selected;\n for(int g = 0; g < num_g; g++) {\n if(best_maxk[g] > 0) {\n selected.emplace_back(g_dir[g], g_p[g], best_maxk[g]);\n }\n }\n vector> moves;\n auto get_reverse = [](char d) -> char {\n if(d=='U') return 'D';\n if(d=='D') return 'U';\n if(d=='L') return 'R';\n if(d=='R') return 'L';\n return ' ';\n };\n for(auto [d, p, k] : selected) {\n char fwd = d;\n char revv = get_reverse(d);\n for(int t = 0; t < k; t++) {\n moves.emplace_back(fwd, p);\n }\n for(int t = 0; t < k; t++) {\n moves.emplace_back(revv, p);\n }\n }\n for(auto [d,p] : moves) {\n cout << d << \" \" << p << endl;\n }\n return 0;\n}","ahc044":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N;\n ll L;\n cin >> N >> L;\n vector T(N);\n for (auto &x : T) cin >> x;\n vector> emp(N);\n for (int i = 0; i < N; i++) emp[i] = {T[i], i};\n sort(emp.rbegin(), emp.rend());\n\n vector> candidates;\n for (int k = 1; k <= N; k++) {\n for (int d = 0; d <= k; d++) {\n bool zero_in = false;\n for (int j = 0; j < k; j++) if (emp[j].second == 0) zero_in = true;\n double vis_S = zero_in ? (double)L : (double)L - 1.0;\n double denom = k + d;\n double r = vis_S / denom;\n vector assumed(N, 0);\n for (int j = 0; j < k; j++) {\n int id = emp[j].second;\n ll tapp = round((j < d ? 2 : 1) * r);\n assumed[id] = tapp;\n }\n if (!zero_in) assumed[0] = 1;\n ll this_e = 0;\n for (int i = 0; i < N; i++) this_e += abs(assumed[i] - T[i]);\n candidates.emplace_back(this_e, k, d);\n }\n }\n sort(candidates.begin(), candidates.end());\n\n ll best_real_e = LLONG_MAX;\n vector best_a(N), best_b(N);\n\n size_t tries = min(40UL, candidates.size());\n for (size_t ci = 0; ci < tries; ci++) {\n auto [approxe, k, d] = candidates[ci];\n vector is_dou(N, 0), is_inS(N, 0);\n for (int j = 0; j < k; j++) {\n is_inS[emp[j].second] = 1;\n if (j < d) is_dou[emp[j].second] = 1;\n }\n vector S;\n for (int j = 0; j < k; j++) S.push_back(emp[j].second);\n\n vector> cycs;\n cycs.push_back(S); // desc T\n auto byid = S; sort(byid.begin(), byid.end()); cycs.push_back(byid);\n auto byasc = S; reverse(byasc.begin(), byasc.end()); cycs.push_back(byasc);\n\n for (auto cyc : cycs) {\n if (k > 0 && cyc.empty()) continue;\n vector cura(N), curb(N);\n int ent = (k > 0 ? cyc[0] : 0);\n for (int i = 0; i < N; i++) if (!is_inS[i]) {\n cura[i] = curb[i] = ent;\n }\n for (size_t ii = 0; ii < cyc.size(); ii++) {\n int i = cyc[ii];\n int nxt = cyc[(ii + 1) % cyc.size()];\n if (k > 0 && is_dou[i]) {\n cura[i] = i;\n curb[i] = nxt;\n } else if (k > 0) {\n cura[i] = nxt;\n curb[i] = nxt;\n }\n }\n if (k == 0) {\n for (int i = 0; i < N; i++) cura[i] = curb[i] = 0;\n }\n\n vector cnt(N, 0);\n int curr = 0;\n for (ll w = 0; w < L; w++) {\n cnt[curr]++;\n if (w + 1 == L) break;\n ll t = cnt[curr];\n int nxt = (t % 2 == 1 ? cura[curr] : curb[curr]);\n curr = nxt;\n }\n ll ee = 0;\n for (int i = 0; i < N; i++) ee += abs(cnt[i] - T[i]);\n if (ee < best_real_e) {\n best_real_e = ee;\n best_a = cura;\n best_b = curb;\n }\n }\n }\n\n if (best_real_e == LLONG_MAX) {\n for (int i = 0; i < N; i++) cout << 0 << \" \" << 0 << endl;\n } else {\n for (int i = 0; i < N; i++) {\n cout << best_a[i] << \" \" << best_b[i] << endl;\n }\n }\n}","ahc045":"#include \nusing namespace std;\n\nint main() {\n int N, M, maxQ, L, W;\n cin >> N >> M >> maxQ >> L >> W;\n vector G(M);\n for (auto &x : G) cin >> x;\n vector cx(N), cy(N);\n for (int i = 0; i < N; i++) {\n int lx, rx, ly, ry;\n cin >> lx >> rx >> ly >> ry;\n cx[i] = (lx + rx) / 2.0;\n cy[i] = (ly + ry) / 2.0;\n }\n vector seeds(M);\n vector min_d(N, 1e18);\n seeds[0] = 0;\n for (int j = 0; j < N; j++) {\n min_d[j] = hypot(cx[0] - cx[j], cy[0] - cy[j]);\n }\n min_d[0] = -1.0;\n for (int k = 1; k < M; k++) {\n double best_md = -1.0;\n int best_j = -1;\n for (int j = 0; j < N; j++) {\n if (min_d[j] > best_md) {\n best_md = min_d[j];\n best_j = j;\n }\n }\n seeds[k] = best_j;\n for (int j = 0; j < N; j++) {\n double d = hypot(cx[best_j] - cx[j], cy[best_j] - cy[j]);\n if (d < min_d[j]) min_d[j] = d;\n }\n }\n vector> clusters(M);\n vector group_id(N, -1);\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n clusters[k].push_back(s);\n group_id[s] = k;\n }\n vector> min_dist_cluster(M, vector(N, 1e18));\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n for (int j = 0; j < N; j++) {\n min_dist_cluster[k][j] = hypot(cx[s] - cx[j], cy[s] - cy[j]);\n }\n }\n vector clus_size(M, 1);\n vector used(N, false);\n for (int k = 0; k < M; k++) used[seeds[k]] = true;\n for (int toadd = 0; toadd < N - M; toadd++) {\n double bd = 1e18;\n int bc = -1, bg = -1;\n for (int j = 0; j < N; j++) {\n if (!used[j]) {\n for (int k = 0; k < M; k++) {\n if (clus_size[k] < G[k] && min_dist_cluster[k][j] < bd) {\n bd = min_dist_cluster[k][j];\n bc = j;\n bg = k;\n }\n }\n }\n }\n used[bc] = true;\n clusters[bg].push_back(bc);\n group_id[bc] = bg;\n clus_size[bg]++;\n for (int j = 0; j < N; j++) {\n if (!used[j]) {\n double nd = hypot(cx[bc] - cx[j], cy[bc] - cy[j]);\n if (nd < min_dist_cluster[bg][j]) min_dist_cluster[bg][j] = nd;\n }\n }\n }\n vector>> queries_per_group(M);\n for (int k = 0; k < M; k++) {\n vector cits = clusters[k];\n int gs = cits.size();\n if (gs <= 2) continue;\n sort(cits.begin(), cits.end(), [&](int a, int b) {\n if (abs(cx[a] - cx[b]) > 1e-9) return cx[a] < cx[b];\n if (abs(cy[a] - cy[b]) > 1e-9) return cy[a] < cy[b];\n return a < b;\n });\n clusters[k] = cits;\n if (gs <= L) {\n queries_per_group[k].push_back(cits);\n } else {\n int step = L - 1;\n int maxs = gs - L;\n vector starts;\n for (int s = 0; s <= maxs; s += step) {\n starts.push_back(s);\n }\n if (!starts.empty() && starts.back() < maxs) {\n starts.push_back(maxs);\n } else if (starts.empty() && maxs >= 0) {\n starts.push_back(maxs);\n }\n for (int s : starts) {\n vector sub(cits.begin() + s, cits.begin() + s + L);\n queries_per_group[k].push_back(sub);\n }\n }\n }\n vector>> mst_edges(M);\n for (int k = 0; k < M; k++) {\n for (auto &sub : queries_per_group[k]) {\n int ls = sub.size();\n cout << \"? \" << ls;\n for (int c : sub) cout << \" \" << c;\n cout << endl;\n for (int e = 0; e < ls - 1; e++) {\n int a, b;\n cin >> a >> b;\n mst_edges[k].emplace_back(a, b);\n }\n }\n }\n cout << \"!\" << endl;\n for (int k = 0; k < M; k++) {\n auto &cits = clusters[k];\n int gs = cits.size();\n for (int i = 0; i < gs; i++) {\n if (i > 0) cout << \" \";\n cout << cits[i];\n }\n cout << endl;\n if (gs == 1) {\n continue;\n } else if (gs == 2) {\n cout << cits[0] << \" \" << cits[1] << endl;\n continue;\n } else {\n vector> cands;\n set> edge_set;\n for (auto [aa, bb] : mst_edges[k]) {\n int u = min(aa, bb), v = max(aa, bb);\n if (edge_set.count({u, v})) continue;\n edge_set.insert({u, v});\n double dd = hypot(cx[u] - cx[v], cy[u] - cy[v]);\n cands.emplace_back(dd, u, v);\n }\n sort(cands.begin(), cands.end());\n vector parent(N);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto &self, int x) -> int {\n return parent[x] == x ? x : parent[x] = self(self, parent[x]);\n };\n vector> selected;\n for (auto [d, u, v] : cands) {\n int pu = find(find, u), pv = find(find, v);\n if (pu != pv) {\n parent[pu] = pv;\n selected.emplace_back(u, v);\n if ((int)selected.size() == gs - 1) break;\n }\n }\n if ((int)selected.size() < gs - 1) {\n vector> more;\n for (int i = 0; i < gs; i++) {\n for (int j = i + 1; j < gs; j++) {\n int u = cits[i], v = cits[j];\n int mu = min(u, v), mv = max(u, v);\n if (edge_set.count({mu, mv})) continue;\n double dd = hypot(cx[u] - cx[v], cy[u] - cy[v]);\n more.emplace_back(dd, mu, mv);\n }\n }\n sort(more.begin(), more.end());\n for (auto [d, u, v] : more) {\n int pu = find(find, u), pv = find(find, v);\n if (pu != pv) {\n parent[pu] = pv;\n selected.emplace_back(u, v);\n if ((int)selected.size() == gs - 1) break;\n }\n }\n }\n for (auto [a, b] : selected) {\n cout << a << \" \" << b << endl;\n }\n }\n }\n return 0;\n}","ahc046":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> points(M);\n for (auto& p : points) {\n cin >> p.first >> p.second;\n }\n vector> sequence;\n pair current = points[0];\n int di[4] = {-1, 1, 0, 0};\n int dj[4] = {0, 0, -1, 1};\n char dch[4] = {'U', 'D', 'L', 'R'};\n for (int t = 1; t < M; t++) {\n int gi = points[t].first;\n int gj = points[t].second;\n vector> dist(N, vector(N, -1));\n vector> pre(N, vector(N, -1));\n vector> ac(N, vector(N, ' '));\n vector> dc(N, vector(N, ' '));\n queue> q;\n int si = current.first;\n int sj = current.second;\n dist[si][sj] = 0;\n q.push({si, sj});\n while (!q.empty()) {\n auto [i, j] = q.front();\n q.pop();\n for (int tp = 0; tp < 2; tp++) {\n for (int d = 0; d < 4; d++) {\n int ni, nj;\n if (tp == 0) {\n ni = i + di[d];\n nj = j + dj[d];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N) continue;\n } else {\n int ci = i, cj = j;\n while (true) {\n int ti = ci + di[d];\n int tj = cj + dj[d];\n if (ti < 0 || ti >= N || tj < 0 || tj >= N) break;\n ci = ti;\n cj = tj;\n }\n ni = ci;\n nj = cj;\n }\n if (dist[ni][nj] != -1) continue;\n dist[ni][nj] = dist[i][j] + 1;\n pre[ni][nj] = i * N + j;\n ac[ni][nj] = (tp == 0 ? 'M' : 'S');\n dc[ni][nj] = dch[d];\n q.push({ni, nj});\n }\n }\n }\n vector> this_path;\n int ci = gi, cj = gj;\n while (dist[ci][cj] > 0) {\n this_path.emplace_back(ac[ci][cj], dc[ci][cj]);\n int p = pre[ci][cj];\n ci = p / N;\n cj = p % N;\n }\n reverse(this_path.begin(), this_path.end());\n for (auto& p : this_path) sequence.push_back(p);\n current = {gi, gj};\n }\n for (auto& p : sequence) {\n cout << p.first << \" \" << p.second << endl;\n }\n}"},"4":{"ahc001":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int n;\n cin >> n;\n vector x(n), y(n), r(n);\n for (int i = 0; i < n; i++) {\n cin >> x[i] >> y[i] >> r[i];\n }\n vector la(n), lb(n), lc(n), ld(n);\n auto rec = [&](auto&& self, vector ids, ll xl, ll xr, ll yl, ll yr) -> void {\n int m = ids.size();\n if (m == 0) return;\n if (m == 1) {\n int i = ids[0];\n la[i] = xl; lb[i] = yl; lc[i] = xr; ld[i] = yr;\n return;\n }\n ll carea = (xr - xl) * (yr - yl);\n ll tr = 0;\n for (int i : ids) tr += r[i];\n double min_dev = 1e18;\n int best_d = -1; // 0:vert 1:horiz\n int best_kk = -1;\n ll best_cutt = -1;\n vector best_sids;\n // vertical\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return x[i] < x[j] || (x[i] == x[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll hy = yr - yl;\n if (hy == 0) continue;\n double id_cut = xl + id_area / hy;\n ll maxlx = -1;\n for (int j = 0; j < k; j++) maxlx = max(maxlx, x[sids[j]]);\n ll minrx = 10001;\n for (int j = k; j < m; j++) minrx = min(minrx, x[sids[j]]);\n ll lo = max(xl + 1, maxlx + 1);\n ll hi = min(xr, minrx);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - xl) * (double)hy;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 0;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n // horizontal\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return y[i] < y[j] || (y[i] == y[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll wx = xr - xl;\n if (wx == 0) continue;\n double id_cut = yl + id_area / wx;\n ll maxly = -1;\n for (int j = 0; j < k; j++) maxly = max(maxly, y[sids[j]]);\n ll minry = 10001;\n for (int j = k; j < m; j++) minry = min(minry, y[sids[j]]);\n ll lo = max(yl + 1, maxly + 1);\n ll hi = min(yr, minry);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - yl) * (double)wx;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 1;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n if (best_d == -1) {\n for (int ii : ids) {\n int i = ii;\n la[i] = x[i]; lb[i] = y[i]; lc[i] = x[i] + 1; ld[i] = y[i] + 1;\n }\n return;\n }\n vector left, rightt;\n for (int j = 0; j < best_kk; j++) left.push_back(best_sids[j]);\n for (int j = best_kk; j < m; j++) rightt.push_back(best_sids[j]);\n if (best_d == 0) {\n ll cut = best_cutt;\n self(self, left, xl, cut, yl, yr);\n self(self, rightt, cut, xr, yl, yr);\n } else {\n ll cut = best_cutt;\n self(self, left, xl, xr, yl, cut);\n self(self, rightt, xl, xr, cut, yr);\n }\n };\n vector all(n);\n iota(all.begin(), all.end(), 0);\n rec(rec, all, 0LL, 10000LL, 0LL, 10000LL);\n // post-process 1: optimize size within allocated rect\n for (int i = 0; i < n; i++) {\n ll xl = la[i], xr = lc[i], yl = lb[i], yr = ld[i];\n ll W = xr - xl;\n ll H = yr - yl;\n ll xi = x[i], yi = y[i];\n ll lroom = xi - xl;\n ll rroom = xr - xi - 1;\n ll broom = yi - yl;\n ll troom = yr - yi - 1;\n auto getp = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n double bp = getp(W * H, r[i]);\n ll bw = W, bh = H;\n for (ll w = 1; w <= W; w++) {\n double idh = r[i] * 1.0 / w;\n ll hround = (ll)round(idh);\n for (ll dh = -1; dh <= 1; dh++) {\n ll h = hround + dh;\n if (h < 1 || h > H) continue;\n ll s = w * h;\n double pv = getp(s, r[i]);\n if (pv > bp) {\n bp = pv;\n bw = w;\n bh = h;\n }\n }\n }\n if (bw != W || bh != H) {\n ll wl_min = max(0LL, bw - 1 - rroom);\n ll wl_max = min(lroom, bw - 1);\n ll wl = (wl_min + wl_max) / 2;\n ll new_a = xi - wl;\n ll new_c = new_a + bw;\n ll hb_min = max(0LL, bh - 1 - troom);\n ll hb_max = min(broom, bh - 1);\n ll hb = (hb_min + hb_max) / 2;\n ll new_b = yi - hb;\n ll new_d = new_b + bh;\n la[i] = new_a;\n lb[i] = new_b;\n lc[i] = new_c;\n ld[i] = new_d;\n }\n }\n // post-process 2: greedy expansion into free space\n auto overlaps = [&](int i, int j) -> bool {\n ll maxx1 = max(la[i], la[j]);\n ll minx2 = min(lc[i], lc[j]);\n ll maxy1 = max(lb[i], lb[j]);\n ll miny2 = min(ld[i], ld[j]);\n return maxx1 < minx2 && maxy1 < miny2;\n };\n auto getp2 = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n bool improved = true;\n int iters = 0;\n while (improved && iters < 5000) {\n improved = false;\n iters++;\n double max_imp = 0.0;\n int best_i = -1;\n int best_dir = -1; // 0:left(a--), 1:right(c++), 2:bottom(b--), 3:top(d++)\n ll best_pos = -1;\n for (int i = 0; i < n; i++) {\n ll curs = (lc[i] - la[i]) * (ld[i] - lb[i]);\n if (curs >= r[i]) continue;\n double curp = getp2(curs, r[i]);\n ll cur_la = la[i], cur_lb = lb[i], cur_lc = lc[i], cur_ld = ld[i];\n ll curw = cur_lc - cur_la;\n ll curh = cur_ld - cur_lb;\n // dir 0: expand left, decrease a\n {\n ll max_block = 0;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll my = max(cur_lb, lb[j]);\n ll ny = min(cur_ld, ld[j]);\n if (my < ny) { // y overlap\n if (lc[j] <= cur_la) {\n max_block = max(max_block, lc[j]);\n }\n }\n }\n ll newa = max(0LL, max_block);\n if (newa < cur_la) {\n ll news = (cur_lc - newa) * curh;\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 0;\n best_pos = newa;\n }\n }\n }\n // dir 1: expand right, increase c\n {\n ll min_block = 10000;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll my = max(cur_lb, lb[j]);\n ll ny = min(cur_ld, ld[j]);\n if (my < ny) {\n if (la[j] >= cur_lc) {\n min_block = min(min_block, la[j]);\n }\n }\n }\n ll newc = min(10000LL, min_block);\n if (newc > cur_lc) {\n ll news = (newc - cur_la) * curh;\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 1;\n best_pos = newc;\n }\n }\n }\n // dir 2: expand bottom, decrease b\n {\n ll max_block = 0;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll mx = max(cur_la, la[j]);\n ll nx = min(cur_lc, lc[j]);\n if (mx < nx) {\n if (ld[j] <= cur_lb) {\n max_block = max(max_block, ld[j]);\n }\n }\n }\n ll newb = max(0LL, max_block);\n if (newb < cur_lb) {\n ll news = curw * (cur_ld - newb);\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 2;\n best_pos = newb;\n }\n }\n }\n // dir 3: expand top, increase d\n {\n ll min_block = 10000;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll mx = max(cur_la, la[j]);\n ll nx = min(cur_lc, lc[j]);\n if (mx < nx) {\n if (lb[j] >= cur_ld) {\n min_block = min(min_block, lb[j]);\n }\n }\n }\n ll newd = min(10000LL, min_block);\n if (newd > cur_ld) {\n ll news = curw * (newd - cur_lb);\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 3;\n best_pos = newd;\n }\n }\n }\n }\n if (max_imp > 1e-9 && best_i != -1) {\n if (best_dir == 0) la[best_i] = best_pos;\n else if (best_dir == 1) lc[best_i] = best_pos;\n else if (best_dir == 2) lb[best_i] = best_pos;\n else if (best_dir == 3) ld[best_i] = best_pos;\n improved = true;\n }\n }\n for (int i = 0; i < n; i++) {\n cout << la[i] << \" \" << lb[i] << \" \" << lc[i] << \" \" << ld[i] << \"\\n\";\n }\n}","ahc002":"#include \nusing namespace std;\n\nstruct State {\n int i, j;\n long long sumv;\n string moves;\n bitset<2560> usd;\n};\n\nint main() {\n int si, sj;\n cin >> si >> sj;\n int T[50][50], P[50][50];\n int maxt = 0;\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> T[i][j];\n maxt = max(maxt, T[i][j]);\n }\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> P[i][j];\n }\n int M = maxt + 1;\n int di[4] = {-1, 0, 1, 0};\n int dj[4] = {0, 1, 0, -1};\n char dirch[4] = {'U', 'R', 'D', 'L'};\n string best_str = \"\";\n long long best_sc = -1;\n srand(42);\n // Multiple trials with low degree heuristic\n int num_trials = 300;\n char usd[2505];\n for (int trial = 0; trial < num_trials; trial++) {\n memset(usd, 0, M);\n vector moves;\n int curi = si, curj = sj;\n long long cursum = P[si][sj];\n usd[T[si][sj]] = 1;\n while (true) {\n vector> cands;\n for (int d = 0; d < 4; d++) {\n int ni = curi + di[d];\n int nj = curj + dj[d];\n if (ni < 0 || ni >= 50 || nj < 0 || nj >= 50) continue;\n int nt = T[ni][nj];\n if (usd[nt]) continue;\n int deg = 0;\n for (int dd = 0; dd < 4; dd++) {\n int nni = ni + di[dd], nnj = nj + dj[dd];\n if (nni >= 0 && nni < 50 && nnj >= 0 && nnj < 50) {\n int nnt = T[nni][nnj];\n if (nnt != nt && !usd[nnt]) deg++;\n }\n }\n cands.emplace_back(deg, -P[ni][nj], d);\n }\n if (cands.empty()) break;\n sort(cands.begin(), cands.end());\n int sz = cands.size();\n int take = 0;\n if (sz >= 2) {\n take = rand() % min(3, sz);\n }\n auto [bs, np, d] = cands[take];\n int ni = curi + di[d];\n int nj = curj + dj[d];\n int nt = T[ni][nj];\n usd[nt] = 1;\n moves.push_back(dirch[d]);\n cursum += P[ni][nj];\n curi = ni;\n curj = nj;\n }\n if (cursum > best_sc) {\n best_sc = cursum;\n best_str = string(moves.begin(), moves.end());\n }\n }\n // Beam search\n {\n State init;\n init.i = si; init.j = sj;\n init.sumv = P[si][sj];\n init.moves = \"\";\n init.usd.reset();\n init.usd[T[si][sj]] = true;\n if (init.sumv > best_sc) {\n best_sc = init.sumv;\n best_str = \"\";\n }\n vector cur_beam = {init};\n const int W = 16;\n while (true) {\n vector next_beam;\n bool has_ext = false;\n for (auto &st : cur_beam) {\n int exts = 0;\n for (int d = 0; d < 4; d++) {\n int ni = st.i + di[d];\n int nj = st.j + dj[d];\n if (ni < 0 || ni >= 50 || nj < 0 || nj >= 50) continue;\n int nt = T[ni][nj];\n if (st.usd[nt]) continue;\n exts++;\n has_ext = true;\n State ns = st;\n ns.usd[nt] = true;\n ns.i = ni;\n ns.j = nj;\n ns.sumv += P[ni][nj];\n ns.moves += dirch[d];\n next_beam.push_back(std::move(ns));\n }\n if (exts == 0) {\n if (st.sumv > best_sc) {\n best_sc = st.sumv;\n best_str = st.moves;\n }\n }\n }\n if (!has_ext) break;\n sort(next_beam.begin(), next_beam.end(), [](const State& a, const State& b) {\n return a.sumv > b.sumv;\n });\n int keep = min(W, (int)next_beam.size());\n cur_beam.assign(next_beam.begin(), next_beam.begin() + keep);\n }\n }\n cout << best_str << endl;\n}","ahc003":"#include \nusing namespace std;\n\nint main() {\n double H[30][29];\n double V[29][30];\n for (int i = 0; i < 30; i++) {\n for (int j = 0; j < 29; j++) {\n H[i][j] = 5000.0 + ((i * 29 + j) % 19 - 9) * 2.0;\n }\n }\n for (int i = 0; i < 29; i++) {\n for (int j = 0; j < 30; j++) {\n V[i][j] = 5000.0 + ((i * 30 + j) % 19 - 9) * 2.0;\n }\n }\n for (int q = 0; q < 1000; q++) {\n int si, sj, ti, tj;\n cin >> si >> sj >> ti >> tj;\n const double INF = 1e18;\n vector dist(900, INF);\n vector prevv(900, -1);\n priority_queue, vector>, greater>> pq;\n int S = si * 30 + sj;\n int T = ti * 30 + tj;\n dist[S] = 0.0;\n pq.push({0.0, S});\n while (!pq.empty()) {\n auto [c, u] = pq.top();\n pq.pop();\n if (c > dist[u]) continue;\n int i = u / 30;\n int j = u % 30;\n if (j > 0) {\n int nv = i * 30 + (j - 1);\n double nw = H[i][j - 1];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (j < 29) {\n int nv = i * 30 + (j + 1);\n double nw = H[i][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i > 0) {\n int nv = (i - 1) * 30 + j;\n double nw = V[i - 1][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i < 29) {\n int nv = (i + 1) * 30 + j;\n double nw = V[i][j];\n if (dist[nv] > dist[u] + nw) {\n dist[nv] = dist[u] + nw;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n }\n vector path_nodes;\n int cur = T;\n while (true) {\n path_nodes.push_back(cur);\n if (cur == S) break;\n cur = prevv[cur];\n }\n reverse(path_nodes.begin(), path_nodes.end());\n string path_str = \"\";\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n char move;\n if (ci == pi - 1 && cj == pj) move = 'U';\n else if (ci == pi + 1 && cj == pj) move = 'D';\n else if (cj == pj - 1 && ci == pi) move = 'L';\n else if (cj == pj + 1 && ci == pi) move = 'R';\n else assert(false);\n path_str += move;\n }\n cout << path_str << endl;\n int obs;\n cin >> obs;\n double est = dist[T];\n if (est < 1e-9) est = 1.0;\n int num_e = path_nodes.size() - 1;\n double delta = (double)obs - est;\n double alpha = 0.3;\n double adjust_per = (delta / num_e) * alpha;\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n if (pi == ci) {\n int jleft = min(pj, cj);\n H[pi][jleft] += adjust_per;\n if (H[pi][jleft] < 100.0) H[pi][jleft] = 100.0;\n if (H[pi][jleft] > 20000.0) H[pi][jleft] = 20000.0;\n } else {\n int itop = min(pi, ci);\n V[itop][pj] += adjust_per;\n if (V[itop][pj] < 100.0) V[itop][pj] = 100.0;\n if (V[itop][pj] > 20000.0) V[itop][pj] = 20000.0;\n }\n }\n }\n return 0;\n}","ahc004":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector S(M);\n for (auto& s : S) cin >> s;\n vector base_order(M);\n iota(base_order.begin(), base_order.end(), 0);\n sort(base_order.begin(), base_order.end(), [&](int a, int b) {\n return S[a].size() > S[b].size();\n });\n srand(time(NULL));\n auto count_c = [&](const vector& g) -> int {\n int cnt = 0;\n for (const auto& s : S) {\n bool found = false;\n // horiz\n for (int r = 0; r < N && !found; r++) {\n for (int st = 0; st < N; st++) {\n bool ok = true;\n for (int p = 0; p < (int)s.size() && ok; p++) {\n if (g[r][(st + p) % N] != s[p]) ok = false;\n }\n if (ok) {\n found = true;\n break;\n }\n }\n }\n if (found) {\n cnt++;\n continue;\n }\n // vert\n for (int c = 0; c < N && !found; c++) {\n for (int st = 0; st < N; st++) {\n bool ok = true;\n for (int p = 0; p < (int)s.size() && ok; p++) {\n if (g[(st + p) % N][c] != s[p]) ok = false;\n }\n if (ok) {\n found = true;\n break;\n }\n }\n }\n if (found) cnt++;\n }\n return cnt;\n };\n auto compute_f = [&](const vector& g) -> int {\n int ff = 0;\n for (auto& row : g) for (char ch : row) if (ch != '.') ff++;\n return ff;\n };\n int best_c_val = -1;\n int best_ff = INT_MAX;\n vector best_grid(N, string(N, '.'));\n for (int trial = 0; trial < 20; trial++) {\n vector order = base_order;\n // shuffle within length groups\n int i = 0;\n while (i < M) {\n int j = i;\n int len = S[order[i]].size();\n while (j < M && (int)S[order[j]].size() == len) j++;\n mt19937 rng(rand() * trial + 42);\n shuffle(order.begin() + i, order.begin() + j, rng);\n i = j;\n }\n vector grid(N, string(N, '.'));\n auto can_place_func = [&](int r, int c, int dr, int dc, const string& s, const vector& grd) -> pair {\n int k = s.size();\n int match_cnt = 0;\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n char need = s[p];\n if (grd[rr][cc] != '.' && grd[rr][cc] != need) return {false, 0};\n if (grd[rr][cc] == need) match_cnt++;\n }\n return {true, match_cnt};\n };\n auto do_write_func = [&](int r, int c, int dr, int dc, const string& s, vector& grd) {\n int k = s.size();\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n grd[rr][cc] = s[p];\n }\n };\n for (int idx : order) {\n const string& s = S[idx];\n // first find true max_mt\n int true_max = -1;\n // horiz\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(r, st, 0, 1, s, grid);\n if (poss) true_max = max(true_max, mt);\n }\n }\n // vert\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(st, c, 1, 0, s, grid);\n if (poss) true_max = max(true_max, mt);\n }\n }\n if (true_max == -1) continue;\n int target_mt = (true_max == 1 ? 0 : true_max);\n vector> cands;\n // horiz collect\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(r, st, 0, 1, s, grid);\n if (poss && mt == target_mt) {\n cands.emplace_back(r, st, 0, 1);\n }\n }\n }\n // vert collect\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(st, c, 1, 0, s, grid);\n if (poss && mt == target_mt) {\n cands.emplace_back(st, c, 1, 0);\n }\n }\n }\n if (!cands.empty()) {\n int choice = 0;\n if (target_mt <= 1 && !cands.empty()) {\n choice = rand() % cands.size();\n }\n auto [br, bc, bdr, bdc] = cands[choice];\n do_write_func(br, bc, bdr, bdc, s, grid);\n }\n }\n int this_c = count_c(grid);\n int this_f = compute_f(grid);\n bool do_update = false;\n if (best_c_val == -1 || this_c > best_c_val) {\n do_update = true;\n } else if (this_c == best_c_val) {\n if (this_c == M) {\n if (this_f < best_ff) do_update = true;\n } else {\n if (this_f > best_ff) do_update = true; // when c < M prefer larger f maybe incidental but no, prefer higher c mainly\n }\n }\n if (do_update) {\n best_c_val = this_c;\n best_ff = this_f;\n best_grid = grid;\n }\n }\n for (auto& row : best_grid) {\n cout << row << endl;\n }\n return 0;\n}","ahc005":"#include \nusing namespace std;\nusing ll = long long;\n\nconst int MAXN = 70;\nconst ll INF = 1LL << 60;\nint di[4] = {-1, 0, 1, 0};\nint dj[4] = {0, 1, 0, -1};\n\nint main() {\n int N, si, sj;\n cin >> N >> si >> sj;\n vector grid(N);\n for (auto& s : grid) cin >> s;\n int h_id[MAXN][MAXN];\n int v_id[MAXN][MAXN];\n memset(h_id, -1, sizeof(h_id));\n memset(v_id, -1, sizeof(v_id));\n int num_h = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N;) {\n if (grid[i][j] == '#') {\n j++;\n continue;\n }\n while (j < N && grid[i][j] != '#') {\n h_id[i][j] = num_h;\n j++;\n }\n num_h++;\n }\n }\n int num_v = 0;\n for (int j = 0; j < N; j++) {\n for (int i = 0; i < N;) {\n if (grid[i][j] == '#') {\n i++;\n continue;\n }\n while (i < N && grid[i][j] != '#') {\n v_id[i][j] = num_v;\n i++;\n }\n num_v++;\n }\n }\n vector>> h_cells(num_h);\n vector>> v_cells(num_v);\n vector> all_roads;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (grid[i][j] != '#') {\n all_roads.emplace_back(i, j);\n h_cells[h_id[i][j]].emplace_back(i, j);\n v_cells[v_id[i][j]].emplace_back(i, j);\n }\n }\n }\n int r = all_roads.size();\n bool is_covered[MAXN][MAXN] = {};\n int num_uncovered = r;\n auto get_gain = [&](int x, int y) {\n int g = 0;\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) if (!is_covered[a][b]) g++;\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) if (!is_covered[a][b]) g++;\n if (!is_covered[x][y]) g--;\n return g;\n };\n auto apply_cover = [&](int x, int y) {\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n };\n vector> keys;\n apply_cover(si, sj);\n keys.emplace_back(si, sj);\n while (num_uncovered > 0) {\n int mg = 0;\n pair bp{-1, -1};\n for (auto p : all_roads) {\n int gg = get_gain(p.first, p.second);\n if (gg > mg) {\n mg = gg;\n bp = p;\n }\n }\n if (mg <= 0) break;\n keys.push_back(bp);\n apply_cover(bp.first, bp.second);\n }\n vector> points;\n set> unique_pts(keys.begin(), keys.end());\n for (auto p : unique_pts) points.push_back(p);\n int m = points.size();\n for (int i = 0; i < m; i++) {\n if (points[i].first == si && points[i].second == sj) {\n swap(points[i], points[0]);\n break;\n }\n }\n if (m == 0) {\n cout << \"\" << endl;\n return 0;\n }\n vector> D(m, vector(m, INF));\n for (int k = 0; k < m; k++) {\n pair src = points[k];\n vector> dd(N, vector(N, INF));\n dd[src.first][src.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, src.first, src.second});\n while (!pq.empty()) {\n auto [cost, x, y] = pq.top();\n pq.pop();\n if (cost > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = cost + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n pq.push({nc, nx, ny});\n }\n }\n }\n for (int t = 0; t < m; t++) {\n auto [tx, ty] = points[t];\n D[k][t] = dd[tx][ty];\n }\n }\n vector order;\n if (m == 1) {\n order = {0};\n } else {\n vector vis(m, false);\n order.push_back(0);\n vis[0] = true;\n for (int cnt = 1; cnt < m; cnt++) {\n int curi = order.back();\n ll min_d = INF;\n int chosen = -1;\n for (int j = 0; j < m; j++) {\n if (!vis[j] && D[curi][j] < min_d) {\n min_d = D[curi][j];\n chosen = j;\n }\n }\n order.push_back(chosen);\n vis[chosen] = true;\n }\n }\n auto calc_tour_cost = [&](const vector& ord) -> ll {\n ll sum = 0;\n for (int i = 0; i < m; i++) {\n sum += D[ord[i]][ord[(i + 1) % m]];\n }\n return sum;\n };\n if (m >= 3) {\n int iters = 0;\n bool improved = true;\n while (improved && iters++ < 200) {\n improved = false;\n ll cur_cost = calc_tour_cost(order);\n for (int l = 0; l < m && !improved; l++) {\n for (int r = l + 1; r < m && !improved; r++) {\n vector newo = order;\n reverse(newo.begin() + l, newo.begin() + r + 1);\n ll nc = calc_tour_cost(newo);\n if (nc < cur_cost) {\n order = newo;\n improved = true;\n }\n }\n }\n }\n }\n int zero_pos = 0;\n for (int i = 0; i < m; i++) {\n if (order[i] == 0) {\n zero_pos = i;\n break;\n }\n }\n vector final_order(m);\n for (int i = 0; i < m; i++) {\n final_order[i] = order[(zero_pos + i) % m];\n }\n order = final_order;\n vector> full_route;\n full_route.push_back(points[0]);\n for (int i = 0; i < m; i++) {\n int u = order[i];\n int v = order[(i + 1) % m];\n auto sp = points[u];\n auto tp = points[v];\n vector>> par(N, vector>(N, {-1, -1}));\n vector> dd(N, vector(N, INF));\n dd[sp.first][sp.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, sp.first, sp.second});\n while (!pq.empty()) {\n auto [c, x, y] = pq.top();\n pq.pop();\n if (c > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = c + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n par[nx][ny] = {x, y};\n pq.push({nc, nx, ny});\n }\n }\n }\n vector> thisp;\n auto curp = tp;\n while (curp.first != -1) {\n thisp.push_back(curp);\n if (curp == sp) break;\n curp = par[curp.first][curp.second];\n }\n reverse(thisp.begin(), thisp.end());\n for (size_t j = 1; j < thisp.size(); j++) {\n full_route.push_back(thisp[j]);\n }\n }\n string ans = \"\";\n for (size_t i = 0; i + 1 < full_route.size(); i++) {\n int dx = full_route[i + 1].first - full_route[i].first;\n int dy = full_route[i + 1].second - full_route[i].second;\n if (dx == -1 && dy == 0) ans += 'U';\n else if (dx == 1 && dy == 0) ans += 'D';\n else if (dx == 0 && dy == -1) ans += 'L';\n else if (dx == 0 && dy == 1) ans += 'R';\n }\n cout << ans << endl;\n}","future-contest-2022-qual":"#include \nusing namespace std;\n\nint main() {\n int N, M, K, R;\n cin >> N >> M >> K >> R;\n vector> D(N, vector(K));\n for (int i = 0; i < N; i++) {\n for (int k = 0; k < K; k++) {\n cin >> D[i][k];\n }\n }\n vector> successors(N);\n vector unfinished_preds(N, 0);\n for (int i = 0; i < R; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n successors[u].push_back(v);\n unfinished_preds[v]++;\n }\n vector priority(N, 0);\n vector num_subtree(N, 0);\n for (int i = N - 1; i >= 0; i--) {\n int mx = 0;\n int sub = 1;\n for (int s : successors[i]) {\n mx = max(mx, priority[s]);\n sub += num_subtree[s];\n }\n priority[i] = 5 + mx;\n num_subtree[i] = sub;\n }\n vector> est_s(M, vector(K, 0));\n vector member_task(M, -1);\n vector member_startday(M, -1);\n vector task_status(N, 0);\n vector tasks_completed_by(M, 0);\n mt19937 rng(42);\n int day = 0;\n while (true) {\n day++;\n if (day > 2000) break;\n vector free_workers;\n for (int j = 0; j < M; j++) {\n if (member_task[j] == -1) free_workers.push_back(j);\n }\n vector candidate_tasks;\n for (int i = 0; i < N; i++) {\n if (task_status[i] == 0 && unfinished_preds[i] == 0) {\n candidate_tasks.push_back(i);\n }\n }\n vector> assigns;\n if (!free_workers.empty() && !candidate_tasks.empty()) {\n sort(candidate_tasks.begin(), candidate_tasks.end(), [&](int a, int b) {\n if (priority[a] != priority[b]) return priority[a] > priority[b];\n if (num_subtree[a] != num_subtree[b]) return num_subtree[a] > num_subtree[b];\n return a < b;\n });\n int num_assign = min((int)free_workers.size(), (int)candidate_tasks.size());\n vector tasks_select(candidate_tasks.begin(), candidate_tasks.begin() + num_assign);\n vector free_shuffled = free_workers;\n shuffle(free_shuffled.begin(), free_shuffled.end(), rng);\n vector worker_pref(M, 10000);\n for (int ord = 0; ord < (int)free_shuffled.size(); ord++) {\n worker_pref[free_shuffled[ord]] = ord;\n }\n vector worker_free(M, false);\n for (int j : free_workers) worker_free[j] = true;\n for (int ti = 0; ti < num_assign; ti++) {\n int tsk = tasks_select[ti];\n int best_et = INT_MAX;\n int best_exp = INT_MAX;\n int best_pref = INT_MAX;\n int best_j = -1;\n for (int j = 0; j < M; j++) {\n if (!worker_free[j]) continue;\n int wsum = 0;\n for (int k = 0; k < K; k++) {\n wsum += max(0, D[tsk][k] - est_s[j][k]);\n }\n int estt = (wsum == 0 ? 1 : wsum);\n int expp = tasks_completed_by[j];\n int preff = worker_pref[j];\n bool better = false;\n if (estt < best_et) better = true;\n else if (estt == best_et) {\n if (expp < best_exp) better = true;\n else if (expp == best_exp && preff < best_pref) better = true;\n }\n if (better) {\n best_et = estt;\n best_exp = expp;\n best_pref = preff;\n best_j = j;\n }\n }\n if (best_j != -1) {\n worker_free[best_j] = false;\n assigns.emplace_back(best_j, tsk);\n task_status[tsk] = 1;\n member_task[best_j] = tsk;\n member_startday[best_j] = day;\n }\n }\n }\n cout << assigns.size();\n for (auto [j, t] : assigns) {\n cout << \" \" << (j + 1) << \" \" << (t + 1);\n }\n cout << endl;\n int n_comp;\n cin >> n_comp;\n if (n_comp == -1) break;\n for (int fi = 0; fi < n_comp; fi++) {\n int f;\n cin >> f;\n int j = f - 1;\n int tsk = member_task[j];\n if (tsk >= 0) {\n int t_taken = day - member_startday[j] + 1;\n int w_max = (t_taken == 1 ? 3 : t_taken + 2);\n for (int k = 0; k < K; k++) {\n est_s[j][k] = max(est_s[j][k], max(0, D[tsk][k] - w_max));\n }\n tasks_completed_by[j]++;\n task_status[tsk] = 2;\n member_task[j] = -1;\n member_startday[j] = -1;\n for (int suc : successors[tsk]) {\n unfinished_preds[suc]--;\n }\n }\n }\n }\n return 0;\n}","ahc006":"#include \nusing namespace std;\n\nstruct Point {\n int x, y;\n};\n\nint manh(const Point& a, const Point& b) {\n return abs(a.x - b.x) + abs(a.y - b.y);\n}\n\npair> get_route(const vector& S, const Point* picks, const Point* dels, Point cen) {\n int N = S.size();\n bool isp[1000] = {};\n bool isd[1000] = {};\n vector pth;\n pth.push_back(cen);\n Point cur = cen;\n int tt = 0;\n for (int st = 0; st < N * 2; ++st) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : S) {\n if (!isp[id]) {\n int dt = manh(cur, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd[id]) {\n int dt = manh(cur, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n tt += bd;\n if (bip) {\n cur = picks[bi];\n isp[bi] = true;\n } else {\n cur = dels[bi];\n isd[bi] = true;\n }\n pth.push_back(cur);\n }\n tt += manh(cur, cen);\n pth.push_back(cen);\n return {tt, pth};\n}\n\nint main() {\n Point picks[1000], dels[1000];\n for (int i = 0; i < 1000; ++i) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n picks[i] = {a, b};\n dels[i] = {c, d};\n }\n Point cen = {400, 400};\n int solos[1000];\n for (int i = 0; i < 1000; ++i) {\n solos[i] = manh(cen, picks[i]) + manh(picks[i], dels[i]) + manh(dels[i], cen);\n }\n vector ord(1000);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) {\n return solos[i] < solos[j] || (solos[i] == solos[j] && i < j);\n });\n vector cur_S(ord.begin(), ord.begin() + 50);\n auto compute_T = [&](const vector& S) -> int {\n bool isp[1000] = {};\n bool isd[1000] = {};\n Point curr = cen;\n int total = 0;\n for (int step = 0; step < 100; ++step) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : S) {\n if (!isp[id]) {\n int dt = manh(curr, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd[id]) {\n int dt = manh(curr, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n total += bd;\n if (bip) {\n curr = picks[bi];\n isp[bi] = true;\n } else {\n curr = dels[bi];\n isd[bi] = true;\n }\n }\n total += manh(curr, cen);\n return total;\n };\n bool is_in[1000] = {};\n for (int i : cur_S) is_in[i] = true;\n int current_T = compute_T(cur_S);\n int best_T_val = current_T;\n vector best_S = cur_S;\n double temperature = 3000.0;\n const double rate = 0.99995;\n const int max_iter = 100000;\n srand(42);\n for (int it = 0; it < max_iter; ++it) {\n int pos = rand() % 50;\n int old_id = cur_S[pos];\n int new_id;\n do {\n new_id = rand() % 1000;\n } while (is_in[new_id]);\n cur_S[pos] = new_id;\n int nt = compute_T(cur_S);\n int delta = nt - current_T;\n bool acc = false;\n if (delta < 0) {\n acc = true;\n } else {\n double prob = exp(-static_cast(delta) / temperature);\n if (prob > (rand() * 1.0 / RAND_MAX)) acc = true;\n }\n if (acc) {\n is_in[old_id] = false;\n is_in[new_id] = true;\n current_T = nt;\n if (current_T < best_T_val) {\n best_T_val = current_T;\n best_S = cur_S;\n }\n } else {\n cur_S[pos] = old_id;\n }\n temperature *= rate;\n }\n // build initial seq from det greedy\n vector> initial_seq;\n bool isp_init[1000] = {};\n bool isd_init[1000] = {};\n Point cur_init = cen;\n for (int st = 0; st < 100; ++st) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : best_S) {\n if (!isp_init[id]) {\n int dt = manh(cur_init, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd_init[id]) {\n int dt = manh(cur_init, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n initial_seq.emplace_back(bi, bip);\n if (bip) {\n cur_init = picks[bi];\n isp_init[bi] = true;\n } else {\n cur_init = dels[bi];\n isd_init[bi] = true;\n }\n }\n // helpers\n auto build_path_and_t = [&](const vector>& sq) -> pair> {\n vector pp {cen};\n Point cu = cen;\n int tt = 0;\n for (auto& pr : sq) {\n Point nxt = pr.second ? picks[pr.first] : dels[pr.first];\n tt += manh(cu, nxt);\n cu = nxt;\n pp.push_back(cu);\n }\n tt += manh(cu, cen);\n pp.push_back(cen);\n return {tt, pp};\n };\n auto valid_seq = [&](const vector>& sq) -> bool {\n vector pos_p(1000, -1);\n vector pos_d(1000, -1);\n for (int i = 0; i < (int)sq.size(); ++i) {\n auto [o, ispk] = sq[i];\n if (ispk) pos_p[o] = i;\n else pos_d[o] = i;\n }\n for (int o : best_S) {\n if (pos_p[o] > pos_d[o]) return false;\n }\n return true;\n };\n // local search with first improvement\n vector> curr_seq = initial_seq;\n auto [curr_t, curr_path] = build_path_and_t(curr_seq);\n bool improved_overall = true;\n int sweeps = 0;\n while (improved_overall && sweeps < 25) {\n ++sweeps;\n improved_overall = false;\n for (int fr = 0; fr < 100 && !improved_overall; ++fr) {\n auto mv = curr_seq[fr];\n vector> tmp;\n for (int j = 0; j < 100; ++j) if (j != fr) tmp.push_back(curr_seq[j]);\n for (int ins = 0; ins < 100 && !improved_overall; ++ins) {\n vector> news = tmp;\n news.insert(news.begin() + ins, mv);\n if (valid_seq(news)) {\n auto [nt, np] = build_path_and_t(news);\n if (nt < curr_t) {\n curr_seq = std::move(news);\n curr_t = nt;\n curr_path = std::move(np);\n improved_overall = true;\n }\n }\n }\n }\n }\n vector chosen = best_S;\n for (int& v : chosen) ++v;\n sort(chosen.begin(), chosen.end());\n cout << 50;\n for (int r : chosen) cout << \" \" << r;\n cout << endl;\n cout << curr_path.size();\n for (auto& pt : curr_path) {\n cout << \" \" << pt.x << \" \" << pt.y;\n }\n cout << endl;\n return 0;\n}","ahc007":"#include \nusing namespace std;\n\nstruct Edge {\n int u, v, d, order_idx;\n};\n\nstruct TmpE {\n int l, u, v;\n};\n\nint main() {\n mt19937 rng(42);\n int N = 400;\n int M = 1995;\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector alledges(M);\n for (int i = 0; i < M; i++) {\n cin >> alledges[i].u >> alledges[i].v;\n long long dx = X[alledges[i].u] - X[alledges[i].v];\n long long dy = Y[alledges[i].u] - Y[alledges[i].v];\n long long dist2 = dx * dx + dy * dy;\n alledges[i].d = round(sqrt((double)dist2));\n alledges[i].order_idx = i;\n }\n vector parent(N), rankk(N, 0);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto& self, int x) -> int {\n if (parent[x] != x) parent[x] = self(self, parent[x]);\n return parent[x];\n };\n auto unite = [&](int a, int b) {\n a = find(find, a);\n b = find(find, b);\n if (a == b) return;\n if (rankk[a] < rankk[b]) swap(a, b);\n parent[b] = a;\n if (rankk[a] == rankk[b]) rankk[a]++;\n };\n for (int ii = 0; ii < M; ii++) {\n int l;\n cin >> l;\n Edge& e = alledges[ii];\n int uu = e.u, vv = e.v;\n int pu = find(find, uu);\n int pv = find(find, vv);\n if (pu == pv) {\n cout << 0 << endl;\n continue;\n }\n const int NS = 5;\n long long total_bott = 0;\n for (int sam = 0; sam < NS; sam++) {\n vector fut;\n fut.reserve(M - ii - 1);\n for (int j = ii + 1; j < M; j++) {\n auto& ej = alledges[j];\n int dd = ej.d;\n int rnum = 2 * dd + 1;\n int rl = dd + (int)(rng() % rnum);\n fut.push_back({rl, ej.u, ej.v});\n }\n sort(fut.begin(), fut.end(), [](const TmpE& a, const TmpE& b) {\n return a.l < b.l;\n });\n vector tp = parent;\n vector tr = rankk;\n auto tfi = [&](auto& self, int x) -> int {\n if (tp[x] != x) tp[x] = self(self, tp[x]);\n return tp[x];\n };\n int ssu = tfi(tfi, uu);\n int ssv = tfi(tfi, vv);\n int thisb = 1000000000;\n bool conn = false;\n for (auto& fe : fut) {\n int pa = tfi(tfi, fe.u);\n int pb = tfi(tfi, fe.v);\n if (pa != pb) {\n int aa = pa, bb = pb;\n if (tr[aa] < tr[bb]) swap(aa, bb);\n tp[bb] = aa;\n if (tr[aa] == tr[bb]) tr[aa]++;\n if (tfi(tfi, ssu) == tfi(tfi, ssv)) {\n thisb = fe.l;\n conn = true;\n break;\n }\n }\n }\n if (!conn) thisb = 1000000000;\n total_bott += thisb;\n }\n long long avgb = total_bott / NS;\n bool adopt = (l <= avgb);\n cout << (adopt ? 1 : 0) << endl;\n if (adopt) {\n unite(uu, vv);\n }\n }\n return 0;\n}","ahc008":"#include \nusing namespace std;\n\nstruct Task {\n int tx, ty;\n char act;\n int wx, wy;\n};\n\nint main() {\n int N;\n cin >> N;\n vector> pet_pos(N);\n vector pet_t(N);\n for (int i = 0; i < N; i++) {\n int x, y, t;\n cin >> x >> y >> t;\n pet_pos[i] = {x, y};\n pet_t[i] = t;\n }\n int M;\n cin >> M;\n vector> hum_pos(M);\n for (int i = 0; i < M; i++) {\n int x, y;\n cin >> x >> y;\n hum_pos[i] = {x, y};\n }\n double pp = 0.04;\n double ff = 1.0 - pow(pp, 1.0 / N);\n ff = min(ff, 0.28);\n int area_t = (int)(ff * 900) + 20;\n int best_per = 1000;\n int HH = 10, WW = 10;\n for (int h = 6; h <= 26; h++) {\n for (int w = 6; w <= 26; w++) {\n if ((long long)h * w >= area_t && h + w < best_per) {\n best_per = h + w;\n HH = h;\n WW = w;\n }\n }\n }\n int H = HH, W = WW;\n int num_bottom_walls = W;\n int num_right_walls = H;\n int num_b_h = max(1, M * num_bottom_walls / (num_bottom_walls + num_right_walls));\n if (num_b_h > M - (num_right_walls > 0)) num_b_h = max(1, M - (num_right_walls > 0 ? 1 : 0));\n int num_r_h = M - num_b_h;\n pair center = {(1 + H) / 2, (1 + W) / 2};\n vector> homes(M, center);\n vector> bot_pos, rig_pos;\n for (int y = 1; y <= W; y++) bot_pos.emplace_back(H, y);\n for (int x = 1; x <= H; x++) rig_pos.emplace_back(x, W);\n bool walledg[31][31];\n memset(walledg, 0, sizeof(walledg));\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n char mcs[4] = {'U', 'D', 'L', 'R'};\n bool is_build = false;\n vector> htasks(M);\n vector tindex(M, 0);\n int wait_turns = 0;\n bool is_all_home = false;\n for (int turn = 0; turn < 300; turn++) {\n string acts(M, '.');\n int pin = 0;\n for (auto [x, y] : pet_pos) if (x <= H && y <= W && !walledg[x][y]) pin++;\n bool allhome = true;\n for (int i = 0; i < M; i++) if (hum_pos[i].first != homes[i].first || hum_pos[i].second != homes[i].second) allhome = false;\n if (allhome) {\n is_all_home = true;\n wait_turns++;\n }\n int trigger_n = (N <= 12 ? 0 : 1);\n if (!is_build && is_all_home && (pin <= trigger_n || (wait_turns > 90 && pin <= trigger_n + 2))) {\n is_build = true;\n htasks.assign(M, vector());\n tindex.assign(M, 0);\n for (int k = 0; k < num_b_h; k++) {\n int hi = k;\n int yst = 1 + (num_bottom_walls * k / max(1, num_b_h));\n int yen = 1 + (num_bottom_walls * (k + 1) / max(1, num_b_h)) - 1;\n vector ts;\n for (int y = yst; y <= yen; y++) {\n ts.push_back(Task{H, y, 'd', H + 1, y});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n for (int k = 0; k < num_r_h; k++) {\n int hi = num_b_h + k;\n int xst = 1 + (num_right_walls * k / max(1, num_r_h));\n int xen = 1 + (num_right_walls * (k + 1) / max(1, num_r_h)) - 1;\n vector ts;\n for (int x = xst; x <= xen; x++) {\n ts.push_back(Task{x, W, 'r', x, W + 1});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n }\n set> will_wall;\n if (is_build) {\n for (int i = 0; i < M; i++) {\n if (tindex[i] >= (int)htasks[i].size()) {\n acts[i] = '.';\n continue;\n }\n Task tk = htasks[i][tindex[i]];\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n if (hx == tk.tx && hy == tk.ty) {\n bool canb = true;\n int cx = tk.wx, cy = tk.wy;\n for (int j = 0; j < N; j++) if (pet_pos[j].first == cx && pet_pos[j].second == cy) canb = false;\n for (int j = 0; j < M; j++) if (hum_pos[j].first == cx && hum_pos[j].second == cy) canb = false;\n int ddx[4] = {-1, 0, 1, 0};\n int ddy[4] = {0, 1, 0, -1};\n for (int d = 0; d < 4; d++) {\n int nx = cx + ddx[d], ny = cy + ddy[d];\n for (int j = 0; j < N; j++) if (pet_pos[j].first == nx && pet_pos[j].second == ny) canb = false;\n }\n if (canb) {\n acts[i] = tk.act;\n will_wall.insert({cx, cy});\n walledg[cx][cy] = true;\n tindex[i]++;\n } else {\n acts[i] = '.';\n }\n } else {\n int cdist = abs(hx - tk.tx) + abs(hy - tk.ty);\n char chosen = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d];\n int ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int ndd = abs(nx - tk.tx) + abs(ny - tk.ty);\n if (ndd < cdist) {\n cdist = ndd;\n chosen = mcs[d];\n }\n }\n }\n acts[i] = chosen;\n }\n }\n } else {\n for (int i = 0; i < M; i++) {\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n int tx = homes[i].first, ty = homes[i].second;\n if (hx == tx && hy == ty) {\n acts[i] = '.';\n } else {\n int cdist = abs(hx - tx) + abs(hy - ty);\n char ch = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d], ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int nd = abs(nx - tx) + abs(ny - ty);\n if (nd < cdist) {\n cdist = nd;\n ch = mcs[d];\n }\n }\n }\n acts[i] = ch;\n }\n }\n }\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = 0;\n if (a == 'U') d = 0;\n else if (a == 'D') d = 1;\n else if (a == 'L') d = 2;\n else if (a == 'R') d = 3;\n int tx = hum_pos[i].first + dx[d];\n int ty = hum_pos[i].second + dy[d];\n if (will_wall.count({tx, ty})) {\n acts[i] = '.';\n }\n }\n }\n cout << acts << endl;\n cout.flush();\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = -1;\n for (int k = 0; k < 4; k++) if (mcs[k] == a) d = k;\n if (d >= 0) {\n hum_pos[i].first += dx[d];\n hum_pos[i].second += dy[d];\n }\n }\n }\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (char c : s) {\n int d = -1;\n if (c == 'U') d = 0;\n else if (c == 'D') d = 1;\n else if (c == 'L') d = 2;\n else if (c == 'R') d = 3;\n if (d >= 0) {\n pet_pos[i].first += dx[d];\n pet_pos[i].second += dy[d];\n }\n }\n }\n }\n return 0;\n}","ahc009":"#include \nusing namespace std;\n\nconst int H = 20;\nconst int W = 20;\nconst int MAXL = 200;\nconst int BEAMW = 80;\nconst double EPS = 1e-12;\n\nstruct State {\n double expv;\n double pr[H][W];\n};\n\nstruct TempCand {\n double expv;\n double pot;\n double pr[H][W];\n int from;\n int dird;\n};\n\nint dr[4] = {-1, 1, 0, 0};\nint dc[4] = {0, 0, -1, 1};\nchar dch[4] = {'U', 'D', 'L', 'R'};\nbool wallh[H][W-1];\nbool wallv[H-1][W];\nint dist_to[H][W];\nint parent[MAXL+1][BEAMW];\nint ch_dir[MAXL+1][BEAMW];\nState current_states[BEAMW];\nTempCand cands[BEAMW * 4 + 10];\nint dists_from[H][W];\nint from_dir[H][W];\n\nbool can_move(int r, int c, int d) {\n int nr = r + dr[d];\n int nc = c + dc[d];\n if (nr < 0 || nr >= H || nc < 0 || nc >= W) return false;\n if (d == 0) {\n return !wallv[nr][c];\n } else if (d == 1) {\n return !wallv[r][c];\n } else if (d == 2) {\n return !wallh[r][nc];\n } else {\n return !wallh[r][c];\n }\n}\n\ndouble compute_score(const string& seq, int si, int sj, int ti, int tj, double forget) {\n int L = seq.size();\n if (L == 0 || L > 200) return 0.0;\n double succ = 1.0 - forget;\n double pr[H][W] = {};\n pr[si][sj] = 1.0;\n double e = 0.0;\n for (int t = 0; t < L; t++) {\n char ch = seq[t];\n int d = -1;\n for (int dd = 0; dd < 4; dd++) if (dch[dd] == ch) d = dd;\n if (d < 0) return 0.0;\n double npr[H][W] = {};\n double rec = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n double pb = pr[r][c];\n if (pb <= EPS) continue;\n npr[r][c] += pb * forget;\n int nr = r, nc = c;\n if (can_move(r, c, d)) {\n nr += dr[d];\n nc += dc[d];\n }\n double pm = pb * succ;\n if (nr == ti && nc == tj) {\n rec += pm;\n } else {\n npr[nr][nc] += pm;\n }\n }\n e += rec * (401.0 - (t + 1));\n memcpy(pr, npr, sizeof(npr));\n }\n return e;\n}\n\nint main() {\n int si, sj, ti, tj;\n double p;\n cin >> si >> sj >> ti >> tj >> p;\n double forget_p = p;\n for (int i = 0; i < H; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W - 1; j++) {\n wallh[i][j] = (s[j] == '1');\n }\n }\n for (int i = 0; i < H - 1; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W; j++) {\n wallv[i][j] = (s[j] == '1');\n }\n }\n memset(dist_to, 0x3f, sizeof(dist_to));\n dist_to[ti][tj] = 0;\n queue> qu;\n qu.emplace(ti, tj);\n while (!qu.empty()) {\n auto [r, c] = qu.front(); qu.pop();\n for (int d = 0; d < 4; d++) if (can_move(r, c, d)) {\n int nr = r + dr[d], nc = c + dc[d];\n if (dist_to[nr][nc] > dist_to[r][c] + 1) {\n dist_to[nr][nc] = dist_to[r][c] + 1;\n qu.emplace(nr, nc);\n }\n }\n }\n memset(dists_from, 0x3f, sizeof(dists_from));\n memset(from_dir, -1, sizeof(from_dir));\n dists_from[si][sj] = 0;\n queue> qs;\n qs.emplace(si, sj);\n while (!qs.empty()) {\n auto [r, c] = qs.front(); qs.pop();\n for (int d = 0; d < 4; d++) if (can_move(r, c, d)) {\n int nr = r + dr[d], nc = c + dc[d];\n if (dists_from[nr][nc] > dists_from[r][c] + 1) {\n dists_from[nr][nc] = dists_from[r][c] + 1;\n from_dir[nr][nc] = d;\n qs.emplace(nr, nc);\n }\n }\n }\n string base_path = \"\";\n {\n int cr = ti, cc = tj;\n while (cr != si || cc != sj) {\n int used_d = from_dir[cr][cc];\n base_path += dch[used_d];\n cr -= dr[used_d];\n cc -= dc[used_d];\n }\n reverse(base_path.begin(), base_path.end());\n }\n // repeated alt\n double best_alt_e = 0.0;\n string best_alt = base_path;\n int blen = base_path.size();\n int maxk = 200 / max(1, blen);\n for (int k = 1; k <= max(1, maxk + 2); k++) {\n string cand = \"\";\n for (int r = 0; r < k; r++) {\n if ((int)cand.size() + blen > 200) break;\n cand += base_path;\n }\n if ((int)cand.size() > 200) cand.resize(200);\n double ce = compute_score(cand, si, sj, ti, tj, forget_p);\n if (ce > best_alt_e) {\n best_alt_e = ce;\n best_alt = cand;\n }\n }\n // duped\n string dupstr = \"\";\n int repm = 1 + (int)(p / 0.1);\n repm = min(repm, 5);\n for (char ch : base_path) {\n for (int rr = 0; rr < repm; rr++) {\n dupstr += ch;\n if ((int)dupstr.size() >= 200) break;\n }\n if ((int)dupstr.size() >= 200) break;\n }\n double de = compute_score(dupstr, si, sj, ti, tj, forget_p);\n if (de > best_alt_e) {\n best_alt_e = de;\n best_alt = dupstr;\n }\n // pure beam from start\n int cur_num = 1;\n current_states[0].expv = 0.0;\n memset(current_states[0].pr, 0, sizeof(current_states[0].pr));\n current_states[0].pr[si][sj] = 1.0;\n for (int step = 1; step <= MAXL; step++) {\n int num_cand = 0;\n for (int b = 0; b < cur_num; b++) {\n for (int d = 0; d < 4; d++) {\n TempCand &news = cands[num_cand];\n news.expv = current_states[b].expv;\n memset(news.pr, 0, sizeof(news.pr));\n double reached = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n double pb = current_states[b].pr[r][c];\n if (pb > EPS) {\n news.pr[r][c] += pb * forget_p;\n int nr = r, nc = c;\n if (can_move(r, c, d)) {\n nr += dr[d];\n nc += dc[d];\n }\n double pm = pb * (1.0 - forget_p);\n if (nr == ti && nc == tj) {\n reached += pm;\n } else {\n news.pr[nr][nc] += pm;\n }\n }\n }\n news.expv += reached * (401.0 - step);\n news.pot = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n int dt = dist_to[r][c];\n if (dt > 999) dt = 100;\n news.pot += news.pr[r][c] * dt;\n }\n news.from = b;\n news.dird = d;\n num_cand++;\n }\n }\n vector ord(num_cand);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b) {\n if (fabs(cands[a].expv - cands[b].expv) > 1e-9) return cands[a].expv > cands[b].expv;\n return cands[a].pot < cands[b].pot;\n });\n cur_num = min(BEAMW, num_cand);\n for (int i = 0; i < cur_num; i++) {\n int idx = ord[i];\n current_states[i].expv = cands[idx].expv;\n memcpy(current_states[i].pr, cands[idx].pr, sizeof(cands[idx].pr));\n parent[step][i] = cands[idx].from;\n ch_dir[step][i] = cands[idx].dird;\n }\n }\n double beam_e = current_states[0].expv;\n string beam_str = \"\";\n int bb = 0;\n for (int st = MAXL; st >= 1; st--) {\n int d = ch_dir[st][bb];\n beam_str = dch[d] + beam_str;\n bb = parent[st][bb];\n }\n if (beam_e > best_alt_e + 1e-6) {\n cout << beam_str << endl;\n } else {\n cout << best_alt << endl;\n }\n return 0;\n}","ahc010":"#include \nusing namespace std;\n\nconst int TO[8][4] = {\n {1, 0, -1, -1},\n {3, -1, -1, 0},\n {-1, -1, 3, 2},\n {-1, 2, 1, -1},\n {1, 0, 3, 2},\n {3, 2, 1, 0},\n {2, -1, 0, -1},\n {-1, 3, -1, 1}\n};\n\nint nxt_type[8] = {1,2,3,0,5,4,7,6};\nint rotated_type[4][8];\nint givenn[30][30];\nint cur_rot[30][30];\nint cur_tiles[30][30];\nint best_rots[30][30];\n\nlong long calc_score(int tiles[][30]) {\n bool vis[30][30][4] = {};\n long long max1 = 0, max2 = 0;\n int di[4] = {0, -1, 0, 1};\n int dj[4] = {-1, 0, 1, 0};\n for(int si=0; si<30; si++){\n for(int sj=0; sj<30; sj++){\n for(int sd=0; sd<4; sd++){\n if(vis[si][sj][sd]) continue;\n int t = tiles[si][sj];\n if(TO[t][sd] < 0) continue;\n int i = si, j = sj, d = sd;\n long long len = 0;\n bool ok = true;\n while(true){\n if(len > 5000){ ok=false; break;}\n int tt = tiles[i][j];\n int d2 = TO[tt][d];\n if(d2 < 0){ ok=false; break; }\n i += di[d2];\n j += dj[d2];\n if(i < 0 || i >=30 || j<0 || j>=30){ ok=false; break;}\n d = (d2 + 2) % 4;\n len++;\n if(i == si && j == sj && d == sd){\n break;\n }\n }\n if(ok && len > 0 && i == si && j == sj && d == sd){\n if(len > max1){ max2 = max1; max1 = len;}\n else if(len > max2) max2 = len;\n i=si; j=sj; d=sd;\n for(long long k=0; k=30||nj<0||nj>=30) break;\n i = ni; j = nj; d = (d2+2)%4;\n }\n }\n }\n }\n }\n if(max2 == 0) return 0;\n return max1 * max2;\n}\n\nint main() {\n for(int k=0; k<4;k++){\n for(int t=0;t<8;t++){\n int cur = t;\n for(int r=0; r> s;\n for(int j=0;j<30;j++){\n givenn[i][j] = s[j] - '0';\n }\n }\n srand(42);\n for(int i=0;i<30;i++) for(int j=0;j<30;j++){\n cur_rot[i][j] = 0;\n cur_tiles[i][j] = rotated_type[ cur_rot[i][j] ][ givenn[i][j] ];\n }\n long long cur_sc = calc_score(cur_tiles);\n long long best_sc = cur_sc;\n memcpy(best_rots, cur_rot, sizeof(cur_rot));\n const int MAX_ITER = 25000;\n double Tstart = 1000.0;\n double Tend = 0.1;\n double cool = pow(Tend / Tstart, 1.0/MAX_ITER);\n double Temp = Tstart;\n for(int it=0; it < MAX_ITER; it++){\n int i = rand()%30;\n int j = rand()%30;\n int oldr = cur_rot[i][j];\n int oldt = cur_tiles[i][j];\n int nr = rand() % 3;\n if(nr >= oldr) nr++;\n cur_rot[i][j] = nr;\n cur_tiles[i][j] = rotated_type[nr][givenn[i][j]];\n long long nsc = calc_score(cur_tiles);\n double del = (double)nsc - (double)cur_sc;\n bool acc = (del >= 0.0);\n if(!acc && Temp > 0.01){\n if( (rand() / (double)RAND_MAX) < exp(del / Temp) ) acc = true;\n }\n if(acc){\n cur_sc = nsc;\n }else{\n cur_rot[i][j] = oldr;\n cur_tiles[i][j] = oldt;\n }\n if(cur_sc > best_sc){\n best_sc = cur_sc;\n memcpy(best_rots , cur_rot, sizeof(cur_rot));\n }\n Temp *= cool;\n }\n for(int i=0;i<30;i++){\n for(int j=0;j<30;j++){\n cout << best_rots[i][j];\n }\n }\n cout << endl;\n return 0;\n}","ahc011":"#include \nusing namespace std;\n\nint get_largest_tree(vector> board, int ei, int ej, int N) {\n vector> visited(N, vector(N, false));\n visited[ei][ej] = true;\n int maxs = 0;\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n int bit_from[4] = {2, 8, 1, 4};\n int bit_to[4] = {8, 2, 4, 1};\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (visited[i][j]) continue;\n vector> comp;\n queue> q;\n q.push({i, j});\n visited[i][j] = true;\n comp.push_back({i, j});\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (int d = 0; d < 4; d++) {\n int nx = x + dx[d];\n int ny = y + dy[d];\n if (nx >= 0 && nx < N && ny >= 0 && ny < N && !visited[nx][ny]) {\n if ((board[x][y] & bit_from[d]) && (board[nx][ny] & bit_to[d])) {\n visited[nx][ny] = true;\n q.push({nx, ny});\n comp.push_back({nx, ny});\n }\n }\n }\n }\n int v = comp.size();\n if (v == 0) continue;\n int e = 0;\n vector> in_c(N, vector(N, false));\n for (auto p : comp) in_c[p.first][p.second] = true;\n for (auto [x, y] : comp) {\n if (y + 1 < N && in_c[x][y + 1] && (board[x][y] & 4) && (board[x][y + 1] & 1)) e++;\n if (x + 1 < N && in_c[x + 1][y] && (board[x][y] & 8) && (board[x + 1][y] & 2)) e++;\n }\n if (v == 1 || e == v - 1) {\n maxs = max(maxs, v);\n }\n }\n }\n return maxs;\n}\n\nint main() {\n int N, T;\n cin >> N >> T;\n vector> board(N, vector(N));\n int ei, ej;\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < N; j++) {\n char c = s[j];\n if (c >= '0' && c <= '9') board[i][j] = c - '0';\n else board[i][j] = 10 + (c - 'a');\n if (board[i][j] == 0) {\n ei = i;\n ej = j;\n }\n }\n }\n int maxv = N * N - 1;\n int best_s = get_largest_tree(board, ei, ej, N);\n string best_seq = \"\";\n int best_score = (best_s < maxv ? round(500000.0 * best_s / maxv) : 1000000);\n srand(42);\n char dchar[4] = {'U','D','L','R'};\n int dx[4] = {-1,1,0,0};\n int dy[4] = {0,0,-1,1};\n for(int trial = 0; trial < 5; trial++) {\n vector> cur_board = board;\n int cei = ei, cej = ej;\n string cur_seq = \"\";\n int cur_s = best_s;\n int last_d = -1;\n double temp = 30.0 - trial * 5;\n bool found_full = false;\n for(int step = 0; step < T / 5; step++) {\n if(cur_s == maxv) {\n found_full = true;\n break;\n }\n vector poss_d;\n for(int d = 0; d < 4; d++) {\n int ni = cei + dx[d];\n int nj = cej + dy[d];\n if(ni >= 0 && ni < N && nj >= 0 && nj < N) {\n int opp = (d <= 1 ? 1 - d : (d == 2 ? 3 : 2));\n if(last_d == opp) continue;\n poss_d.push_back(d);\n }\n }\n if(poss_d.empty()) break;\n int d = poss_d[rand() % poss_d.size()];\n int ni = cei + dx[d];\n int nj = cej + dy[d];\n int old_ei = cei, old_ej = cej;\n int moved_mask = cur_board[ni][nj];\n cur_board[old_ei][old_ej] = moved_mask;\n cur_board[ni][nj] = 0;\n cei = ni;\n cej = nj;\n cur_seq += dchar[d];\n int news = get_largest_tree(cur_board, cei, cej, N);\n int delta = news - cur_s;\n bool accept = (delta >= 0);\n if(!accept && temp > 0.0) {\n double prob = exp(delta / temp * 0.5);\n if((rand() * 1.0 / RAND_MAX) < prob) accept = true;\n }\n if(accept) {\n cur_s = news;\n last_d = d;\n int k = cur_seq.size();\n int sc = (cur_s < maxv ? round(500000.0 * cur_s / maxv) : round(500000.0 * (2.0 - k * 1.0 / T)));\n int best_sc = (best_s < maxv ? round(500000.0 * best_s / maxv) : round(500000.0 * (2.0 - best_seq.size() * 1.0 / T)));\n if(sc > best_sc) {\n best_s = cur_s;\n best_seq = cur_seq;\n best_score = sc;\n }\n if(cur_s == maxv && best_s < maxv) {\n best_s = maxv;\n best_seq = cur_seq;\n best_score = round(500000.0 * (2.0 - k * 1.0 / T));\n found_full = true;\n break;\n }\n } else {\n cur_board[cei][cej] = cur_board[old_ei][old_ej];\n cur_board[old_ei][old_ej] = 0;\n cei = old_ei;\n cej = old_ej;\n cur_seq.pop_back();\n }\n temp *= 0.99;\n }\n if(found_full) break;\n }\n cout << best_seq << endl;\n return 0;\n}","ahc012":"#include \nusing namespace std;\n\nusing ll = long long;\n\nbool hits_strawberry(ll px, ll py, ll qx, ll qy, const vector& X, const vector& Y) {\n ll vx = qx - px;\n ll vy = qy - py;\n for (int i = 0; i < (int)X.size(); i++) {\n ll ux = X[i] - px;\n ll uy = Y[i] - py;\n if (ux * vy - uy * vx == 0) return true;\n }\n return false;\n}\n\ndouble mid_angle(int gap, const vector& ord, const vector& angs, int N) {\n int p1 = ord[gap];\n int p2 = ord[(gap + 1) % N];\n double a1 = angs[p1];\n double a2 = angs[p2];\n if (a2 < a1 - 1e-9) a2 += 2 * M_PI;\n return (a1 + a2) / 2.0;\n}\n\nint main() {\n int N_int, K;\n cin >> N_int >> K;\n ll N = N_int;\n vector a(11, 0);\n for (int i = 1; i <= 10; i++) cin >> a[i];\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector angs(N);\n for (int i = 0; i < N; i++) {\n angs[i] = atan2(Y[i], X[i]);\n if (angs[i] < 0) angs[i] += 2 * M_PI;\n }\n vector ord(N);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) { return angs[i] < angs[j]; });\n\n int best_m = -1;\n int best_start = 0;\n int num_lines = 100;\n vector good_sizes;\n {\n vector rem = a;\n for (int i = 0; i < num_lines; i++) {\n int best_d = 1;\n int mx = 0;\n for (int d = 1; d <= 10; d++) {\n if (rem[d] > mx) {\n mx = rem[d];\n best_d = d;\n }\n }\n if (mx == 0) break;\n good_sizes.push_back(best_d);\n rem[best_d]--;\n }\n }\n\n for (int s = 0; s < N; s++) {\n vector main_cuts;\n main_cuts.push_back((s - 1 + N) % N);\n int cur = 0;\n for (int sz : good_sizes) {\n cur += sz;\n main_cuts.push_back((s + cur - 1 + N) % N);\n }\n set> pair_set;\n for (int m : main_cuts) {\n int o = (m + N / 2) % N;\n pair_set.insert({min(m, o), max(m, o)});\n }\n set all_cuts;\n for (auto& pr : pair_set) {\n all_cuts.insert(pr.first);\n all_cuts.insert(pr.second);\n }\n vector cutlist(all_cuts.begin(), all_cuts.end());\n int nc = cutlist.size();\n vector piece;\n for (int i = 0; i < nc; i++) {\n int from = cutlist[i];\n int to = cutlist[(i + 1) % nc];\n piece.push_back((to - from + N) % N);\n }\n vector b(11, 0);\n for (int p : piece) if (p >= 1 && p <= 10) b[p]++;\n int m_val = 0;\n for (int d = 1; d <= 10; d++) m_val += min(a[d], b[d]);\n if (m_val > best_m) {\n best_m = m_val;\n best_start = s;\n }\n }\n\n // Rebuild for best_start\n vector main_cuts;\n main_cuts.push_back((best_start - 1 + N) % N);\n int cur = 0;\n for (int sz : good_sizes) {\n cur += sz;\n main_cuts.push_back((best_start + cur - 1 + N) % N);\n }\n set> pair_set;\n for (int m : main_cuts) {\n int o = (m + N / 2) % N;\n pair_set.insert({min(m, o), max(m, o)});\n }\n vector> final_pairs(pair_set.begin(), pair_set.end());\n int k_out = min((int)final_pairs.size(), 100);\n\n cout << k_out << endl;\n for (int i = 0; i < k_out; i++) {\n int mg = final_pairs[i].first; // use any gap of the pair\n double mang = mid_angle(mg, ord, angs, N);\n double c = cos(mang);\n double s = sin(mang);\n ll px = round(c * 1000000000.0);\n ll py = round(s * 1000000000.0);\n ll qx = round(cos(mang + M_PI) * 1000000000.0);\n ll qy = round(sin(mang + M_PI) * 1000000000.0);\n int pert = 0;\n while (hits_strawberry(px, py, qx, qy, X, Y) && pert < 30) {\n qx += (pert + 1) * 17LL;\n qy += (pert + 1) * 31LL;\n pert++;\n }\n if (px == qx && py == qy) qx++;\n cout << px << \" \" << py << \" \" << qx << \" \" << qy << endl;\n }\n return 0;\n}","ahc014":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> initial_dots;\n bool initial_has[65][65] = {};\n for(int i=0; i>x>>y;\n if(!initial_has[x][y]){\n initial_has[x][y]=true;\n initial_dots.emplace_back(x,y);\n }\n }\n int c = (N-1)/2;\n vector> high_cand;\n vector> low_cand;\n for(int x=0;x> best_ops;\n long long best_sumw = -1;\n bool has_dot[65][65] = {};\n auto get_sumw = [&]() {\n long long s = 0;\n for(int x=0;x> cur_dots = initial_dots;\n bool hused[65][65]={};\n bool vused[65][65]={};\n bool dpused[65][65]={};\n bool dnused[65][65]={};\n vector> ops;\n bool use_high_order = (trial != 2);\n bool prefer_small_aa = (trial != 1);\n auto& current_cand = use_high_order ? high_cand : low_cand;\n auto try_aa = [&](int px, int py) -> bool {\n if(has_dot[px][py]) return false;\n vector pos_oxs;\n for(int ox=0; ox pos_oys;\n for(int oy=0; oy bool {\n if(has_dot[px][py]) return false;\n int u1 = px + py;\n int v1 = px - py;\n vector> possible_opp;\n for(auto [ox,oy]: cur_dots){\n if(ox == px && oy == py) continue;\n int u2 = ox + oy;\n int v2 = ox - oy;\n if(abs(u2 - u1) < 2 || abs(v2 - v1) < 2) continue;\n if( (u2 - u1) % 2 != 0 || (v2 - v1) % 2 != 0 ) continue;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n if( (u1 + v2) % 2 !=0 || xb<0 || xb>=N || yb <0 || yb >=N ) continue;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n if( (u2 + v1)%2 !=0 || xc<0||xc>=N||yc<0||yc>=N) continue;\n if(!has_dot[xb][yb] || !has_dot[xc][yc]) continue;\n int sz = abs(u2-u1) + abs(v2-v1);\n possible_opp.emplace_back(sz, ox, oy);\n }\n sort(possible_opp.begin(), possible_opp.end());\n for(auto& tp : possible_opp){\n int sz, ox, oy;\n tie(sz, ox, oy) = tp;\n int u2 = ox + oy;\n int v2 = ox - oy;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n int umin = min(u1,u2), umax = max(u1,u2);\n int vmin = min(v1,v2), vmax = max(v1,v2);\n bool val = true;\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u1 + vv)/2; int yy=(u1 - vv)/2;\n if(xx<0||xx>=N || yy<0||yy>=N){val=false; continue;}\n bool corn = ((xx==px && yy==py) || (xx==xb && yy==yb) || (xx==ox && yy==oy) || (xx==xc && yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn ) val=false;\n }\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u2 + vv)/2; int yy=(u2 - vv)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy]&&!corn) val=false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v1)/2; int yy=(uu - v1)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n if(!val) continue;\n bool sval = true;\n for(int vv=vmin; vv < vmax; vv +=2){\n int xx = (u1 + vv)/2 ; int yy=(u1 - vv)/2;\n if(dnused[xx][yy]) sval=false;\n }\n for(int uu=umin; uu < umax; uu +=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(dpused[xx][yy]) sval = false;\n }\n for(int vv=vmin; vv best_sumw){\n best_sumw = this_sum;\n best_ops = ops;\n }\n }\n cout << best_ops.size() << endl;\n for(auto& op: best_ops){\n for(int i=0;i<8;i++){\n cout << op[i];\n if(i<7) cout<<\" \";\n }\n cout << endl;\n }\n return 0;\n}","ahc015":"#include \nusing namespace std;\n\nint main() {\n vector flav(100);\n for (int i = 0; i < 100; i++) cin >> flav[i];\n vector> grid(10, vector(10, 0));\n auto apply = [&](char d, auto& g) {\n if (d == 'F') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n for (int r = 0; r < 10; r++) g[r][c] = (r < (int)v.size() ? v[r] : 0);\n }\n } else if (d == 'B') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int r = 0; r < 10; r++) g[r][c] = (r >= 10 - sz ? v[r - (10 - sz)] : 0);\n }\n } else if (d == 'L') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n for (int c = 0; c < 10; c++) g[r][c] = (c < (int)v.size() ? v[c] : 0);\n }\n } else if (d == 'R') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int c = 0; c < 10; c++) g[r][c] = (c >= 10 - sz ? v[c - (10 - sz)] : 0);\n }\n }\n };\n auto get_score = [&](auto& g) -> long long {\n vector> vis(10, vector(10, false));\n long long res = 0;\n for (int i = 0; i < 10; i++) {\n for (int j = 0; j < 10; j++) {\n if (g[i][j] && !vis[i][j]) {\n int f = g[i][j];\n int sz = 0;\n stack> st;\n st.push({i, j});\n vis[i][j] = true;\n while (!st.empty()) {\n auto [x, y] = st.top(); st.pop();\n sz++;\n int dx[4] = {-1, 0, 1, 0};\n int dy[4] = {0, 1, 0, -1};\n for (int k = 0; k < 4; k++) {\n int nx = x + dx[k], ny = y + dy[k];\n if (nx >= 0 && nx < 10 && ny >= 0 && ny < 10 && !vis[nx][ny] && g[nx][ny] == f) {\n vis[nx][ny] = true;\n st.push({nx, ny});\n }\n }\n }\n res += 1LL * sz * sz;\n }\n }\n }\n return res;\n };\n auto get_empties = [&](auto& g) -> vector> {\n vector> res;\n for (int i = 0; i < 10; i++) for (int j = 0; j < 10; j++) if (g[i][j] == 0) res.emplace_back(i, j);\n return res;\n };\n for (int t = 0; t < 100; t++) {\n int p;\n cin >> p;\n int cnt = 0;\n int pr = -1, pc = -1;\n for (int r = 0; r < 10; r++) {\n bool found = false;\n for (int c = 0; c < 10; c++) if (grid[r][c] == 0) {\n cnt++;\n if (cnt == p) {\n pr = r; pc = c;\n found = true;\n break;\n }\n }\n if (found) break;\n }\n grid[pr][pc] = flav[t];\n if (t == 99) break;\n // lookahead\n string dir_str = \"FBLR\";\n vector dirs = {'F','B','L','R'};\n char best_d = 'F';\n long long best_val = -1;\n int K = 25;\n int next_f = flav[t + 1];\n bool is_last_tilt = (t == 98);\n for (char d : dirs) {\n auto temp = grid;\n apply(d, temp);\n auto emps = get_empties(temp);\n if (emps.empty()) continue;\n int samples = min(K, (int)emps.size());\n long long total = 0;\n for (int s = 0; s < samples; s++) {\n auto [nr, nc] = emps[s];\n temp[nr][nc] = next_f;\n long long best_next = 0;\n if (is_last_tilt) {\n best_next = get_score(temp);\n } else {\n for (char nd : dirs) {\n auto temp2 = temp;\n apply(nd, temp2);\n long long sc = get_score(temp2);\n if (sc > best_next) best_next = sc;\n }\n }\n total += best_next;\n temp[nr][nc] = 0;\n }\n long long avg = total / samples;\n if (avg > best_val) {\n best_val = avg;\n best_d = d;\n }\n }\n cout << best_d << endl;\n cout.flush();\n apply(best_d, grid);\n }\n}","ahc016":"#include \nusing namespace std;\n\nint calc_pos(int u, int v, int n) {\n if (u > v) swap(u, v);\n return u * (2 * n - u - 1) / 2 + (v - u - 1);\n}\n\ndouble compute_exp_e(const string& gs, double eps) {\n double res = 0.0;\n for (char c : gs) {\n res += (c == '1' ? (1 - eps) : eps);\n }\n return res;\n}\n\ndouble compute_exp_t(const string& gs, int n, double eps) {\n double sum_p = 0.0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n int p1 = calc_pos(a, b, n);\n int p2 = calc_pos(a, c, n);\n int p3 = calc_pos(b, c, n);\n double pa = (gs[p1] == '1' ? (1 - eps) : eps);\n double pb = (gs[p2] == '1' ? (1 - eps) : eps);\n double pc = (gs[p3] == '1' ? (1 - eps) : eps);\n sum_p += pa * pb * pc;\n }\n }\n }\n return sum_p;\n}\n\nlong long compute_t(const string& hs, int n) {\n long long tri = 0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n if (hs[calc_pos(a, b, n)] == '1' &&\n hs[calc_pos(a, c, n)] == '1' &&\n hs[calc_pos(b, c, n)] == '1') tri++;\n }\n }\n }\n return tri;\n}\n\nint main() {\n int M;\n double eps;\n cin >> M >> eps;\n srand(42);\n int best_N = 4;\n double best_sc = -1.0;\n double best_tscale = 10.0;\n vector best_Gs;\n vector best_targ_e, best_targ_t;\n vector candidates;\n int max_n_test = (eps < 0.15 ? 45 : 75);\n int step = (eps < 0.1 ? 1 : 3);\n for (int nn = 4; nn <= max_n_test; nn += step) candidates.push_back(nn);\n if (eps < 1e-9) {\n int minn = 4;\n while ((long long)minn * (minn - 1) / 2 < M - 1) minn++;\n candidates.clear();\n candidates.push_back(minn);\n best_N = minn;\n }\n for (int ni = 0; ni < (int)candidates.size(); ni++) {\n int nn = candidates[ni];\n if (nn > 100) continue;\n long long PP = (long long)nn * (nn - 1) / 2;\n vector Gs_loc(M);\n for (int k = 0; k < M; k++) {\n long long ek = (M == 1 ? PP / 2 : round(k * PP * 1.0 / (M - 1.0)));\n string s(PP, '0');\n if (k % 3 == 0 || M <= 2 || eps < 1e-9) {\n for (long long i = 0; i < ek && i < PP; i++) s[i] = '1';\n } else if (k % 3 == 1) {\n for (long long i = 0; i < ek && i < PP; i++) {\n long long pos = (i * 17LL % PP);\n s[pos] = '1';\n }\n } else {\n vector pr(PP);\n for (int i = 0; i < PP; i++) pr[i] = i;\n auto rngv = [&](int x) { return ((long long)x * 97LL ^ (long long)k * 1234567LL) % 1000000009LL; };\n sort(pr.begin(), pr.end(), [&](int x, int y) { return rngv(x) < rngv(y); });\n for (long long i = 0; i < ek && i < PP; i++) s[pr[i]] = '1';\n }\n Gs_loc[k] = s;\n }\n vector targ_e(M), targ_t(M);\n for (int k = 0; k < M; k++) {\n targ_e[k] = compute_exp_e(Gs_loc[k], eps);\n targ_t[k] = compute_exp_t(Gs_loc[k], nn, eps);\n }\n vector test_scales = {2.0, 4.0, 8.0, 16.0, 32.0};\n for (double scf : test_scales) {\n double cur_tscale = nn * scf;\n int trials = (eps < 0.1 ? 600 : (eps < 0.25 ? 400 : 250));\n int errs = 0;\n for (int tr = 0; tr < trials; tr++) {\n int s = rand() % M;\n string noisy = Gs_loc[s];\n for (long long pos = 0; pos < PP; pos++) {\n if ((rand() / (double)RAND_MAX) < eps) {\n noisy[pos] = (noisy[pos] == '1' ? '0' : '1');\n }\n }\n int obse = 0;\n for (char c : noisy) if (c == '1') obse++;\n long long obst = compute_t(noisy, nn);\n int dec = 0;\n double mind = 1e18;\n for (int k = 0; k < M; k++) {\n double de = obse - targ_e[k];\n double dt = (double)obst - targ_t[k];\n double dst = de * de / (PP * 0.25 + 1.0) + (dt * dt) / (cur_tscale * cur_tscale + 1.0);\n if (dst < mind) {\n mind = dst;\n dec = k;\n }\n }\n if (dec != s) errs++;\n }\n double perr = (double)errs / trials;\n double e_app = 100.0 * perr;\n double sc = pow(0.9, e_app) / nn;\n if (sc > best_sc) {\n best_sc = sc;\n best_N = nn;\n best_Gs = Gs_loc;\n best_targ_e = targ_e;\n best_targ_t = targ_t;\n best_tscale = cur_tscale;\n }\n }\n }\n int N = best_N;\n long long P = (long long)N * (N - 1) / 2;\n cout << N << endl;\n for (auto& s : best_Gs) cout << s << endl;\n cout.flush();\n for (int q = 0; q < 100; q++) {\n string h;\n cin >> h;\n int obse = 0;\n for (char c : h) if (c == '1') obse++;\n long long obst = compute_t(h, N);\n int bestk = 0;\n double bestd = 1e18;\n for (int k = 0; k < M; k++) {\n double de = obse - best_targ_e[k];\n double dt = (double)obst - best_targ_t[k];\n double dst = de * de / (P * 0.25 + 1.0) + (dt * dt) / (best_tscale * best_tscale + 1.0);\n if (dst < bestd) {\n bestd = dst;\n bestk = k;\n }\n }\n cout << bestk << endl;\n cout.flush();\n }\n return 0;\n}","ahc017":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, M, D, K;\n cin >> N >> M >> D >> K;\n vector U(M), V(M), W(M);\n vector>> adj(N);\n for (int i = 0; i < M; i++) {\n cin >> U[i] >> V[i] >> W[i];\n U[i]--; V[i]--;\n adj[U[i]].emplace_back(V[i], W[i], i);\n adj[V[i]].emplace_back(U[i], W[i], i);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n mt19937 rng(123456789LL);\n int NUM_SAMPLES = 18;\n if (N < 600) NUM_SAMPLES = 30;\n vector sources;\n vector perm(N);\n iota(perm.begin(), perm.end(), 0);\n shuffle(perm.begin(), perm.end(), rng);\n for (int i = 0; i < min(NUM_SAMPLES, N); i++) sources.push_back(perm[i]);\n if (!sources.empty()) sources[0] = 0;\n vector mxs(M), mys(M), angs(M);\n for (int i = 0; i < M; i++) {\n mxs[i] = (X[U[i]] + X[V[i]]) / 2.0;\n mys[i] = (Y[U[i]] + Y[V[i]]) / 2.0;\n double dx = mxs[i] - 500.0;\n double dy = mys[i] - 500.0;\n angs[i] = atan2(dy, dx);\n }\n auto is_connected = [&](int day, const vector& rdays) -> bool {\n vector vis(N, false);\n queue q;\n q.push(0); vis[0] = true;\n int rc = 1;\n while (!q.empty()) {\n int u = q.front(); q.pop();\n for (auto [v, w, eid] : adj[u]) {\n if (rdays[eid] == day) continue;\n if (!vis[v]) {\n vis[v] = true;\n q.push(v);\n rc++;\n }\n }\n }\n return rc == N;\n };\n auto is_all_connected = [&](const vector& rd) {\n for (int d = 1; d <= D; d++) {\n if (!is_connected(d, rd)) return false;\n }\n return true;\n };\n auto get_sum = [&](int day, const vector& rdays) -> ll {\n ll sm = 0;\n for (int s : sources) {\n vector dist(N, 4000000000000000000LL);\n vector processed(N, false);\n dist[s] = 0;\n priority_queue, vector>, greater>> pq;\n pq.emplace(0, s);\n while (!pq.empty()) {\n auto [c, u] = pq.top(); pq.pop();\n if (c > dist[u] || processed[u]) continue;\n processed[u] = true;\n for (auto [v, w, e] : adj[u]) {\n if (rdays[e] == day) continue;\n ll nc = c + w;\n if (nc < dist[v]) {\n dist[v] = nc;\n pq.emplace(nc, v);\n }\n }\n }\n for (int j = 0; j < N; j++) {\n if (j == s) continue;\n ll dd = (dist[j] > 2000000000000000000LL ? 1000000000LL : dist[j]);\n sm += dd;\n }\n }\n return sm;\n };\n auto compute_proxy = [&](const vector& rd) -> ll {\n ll pr = 0;\n for (int d = 1; d <= D; d++) {\n pr += get_sum(d, rd);\n }\n return pr;\n };\n auto generate_sorted = [&](auto&& sorter) {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), sorter);\n vector rd(M);\n for (int i = 0; i < M; i++) {\n rd[ord[i]] = (i % D) + 1;\n }\n return rd;\n };\n vector>> candidates;\n // mx\n {\n auto lam = [&](int a, int b){ return mxs[a] < mxs[b]; };\n auto rd = generate_sorted(lam);\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n // my\n {\n auto lam = [&](int a, int b){ return mys[a] < mys[b]; };\n auto rd = generate_sorted(lam);\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n // random 1\n {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n shuffle(ord.begin(), ord.end(), rng);\n vector rd(M);\n for (int i = 0; i < M; i++) {\n rd[ord[i]] = (i % D) + 1;\n }\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n vector rday(M, 0);\n vector cnt(D + 1, 0);\n if (!candidates.empty()) {\n sort(candidates.begin(), candidates.end());\n rday = candidates[0].second;\n } else {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n shuffle(ord.begin(), ord.end(), rng);\n for (int i = 0; i < M; i++) {\n rday[ord[i]] = (i % D) + 1;\n }\n }\n for (int i = 0; i < M; i++) cnt[rday[i]]++;\n auto start_time = chrono::steady_clock::now();\n auto elapsed = [&]() {\n return chrono::duration(chrono::steady_clock::now() - start_time).count();\n };\n uniform_int_distribution rnd_e(0, M - 1);\n uniform_int_distribution rnd_d(1, D);\n uniform_real_distribution rnd_real(0.0, 1.0);\n ll current_proxy = 0;\n for (int d = 1; d <= D; d++) {\n current_proxy += get_sum(d, rday);\n }\n ll total_delta_abs = 0;\n int cnt_sample = 0;\n for (int tryy = 0; tryy < 100; tryy++) {\n if (elapsed() > 0.3) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n total_delta_abs += llabs(del);\n cnt_sample++;\n if (cnt_sample >= 15) break;\n }\n double T = 1e10;\n if (cnt_sample > 0) {\n double avg = (double)total_delta_abs / cnt_sample;\n T = avg * 5.0;\n if (T < 1e8) T = 1e8;\n }\n double cool_rate = 0.999;\n double TL = 5.3;\n int it = 0;\n while (true) {\n it++;\n if (it % 20 == 0 && elapsed() > TL) break;\n if (elapsed() > TL) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n bool accept = (del < 0);\n if (!accept) {\n double prob = exp(-del / T);\n if (prob > rnd_real(rng)) accept = true;\n }\n if (accept) {\n rday[e] = nd;\n cnt[od]--;\n cnt[nd]++;\n current_proxy += del;\n }\n T *= cool_rate;\n if (T < 1e5) T = 1e5;\n }\n for (int i = 0; i < M; i++) {\n cout << rday[i];\n if (i + 1 < M) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc019":"#include \nusing namespace std;\n\nint main() {\n int D;\n cin >> D;\n vector F[2], R[2];\n for (int i = 0; i < 2; i++) {\n F[i].resize(D);\n for (int k = 0; k < D; k++) cin >> F[i][k];\n R[i].resize(D);\n for (int k = 0; k < D; k++) cin >> R[i][k];\n }\n vector> pos[2];\n for (int i = 0; i < 2; i++) {\n for (int z = 0; z < D; z++) {\n vector Xs, Ys;\n for (int x = 0; x < D; x++) if (F[i][z][x] == '1') Xs.push_back(x);\n for (int y = 0; y < D; y++) if (R[i][z][y] == '1') Ys.push_back(y);\n int nf = Xs.size(), nr = Ys.size();\n if (nf >= nr) {\n for (int j = 0; j < nr; j++) pos[i].emplace_back(Xs[j], Ys[j], z);\n for (int j = 0; j < nf - nr; j++) pos[i].emplace_back(Xs[nr + j], Ys[0], z);\n } else {\n for (int j = 0; j < nf; j++) pos[i].emplace_back(Xs[j], Ys[j], z);\n for (int j = 0; j < nr - nf; j++) pos[i].emplace_back(Xs[0], Ys[nf + j], z);\n }\n }\n }\n int sz[2] = {(int)pos[0].size(), (int)pos[1].size()};\n int com_vol = min(sz[0], sz[1]);\n vector com_vox[2];\n if (sz[0] <= sz[1]) {\n for (int k = 0; k < sz[0]; k++) com_vox[0].push_back(k);\n for (int k = 0; k < sz[0]; k++) com_vox[1].push_back(k);\n } else {\n for (int k = 0; k < sz[1]; k++) com_vox[1].push_back(k);\n for (int k = 0; k < sz[1]; k++) com_vox[0].push_back(k);\n }\n auto get_com_pairs = [&](int sc, const vector& comidx) {\n int mc = comidx.size();\n if (mc <= 1) return vector>();\n vector used(mc, false);\n vector> pr;\n vector>> pidx(D, vector>(D, vector(D, -1)));\n for (int i = 0; i < mc; i++) {\n auto [x, y, z] = pos[sc][comidx[i]];\n pidx[x][y][z] = i;\n }\n int dx[6] = {1, -1, 0, 0, 0, 0};\n int dy[6] = {0, 0, 1, -1, 0, 0};\n int dz[6] = {0, 0, 0, 0, 1, -1};\n for (int i = 0; i < mc; i++) {\n if (used[i]) continue;\n auto [x, y, z] = pos[sc][comidx[i]];\n for (int d = 0; d < 6; d++) {\n int nx = x + dx[d], ny = y + dy[d], nz = z + dz[d];\n if (nx < 0 || nx >= D || ny < 0 || ny >= D || nz < 0 || nz >= D) continue;\n int j = pidx[nx][ny][nz];\n if (j != -1 && !used[j]) {\n pr.emplace_back(comidx[i], comidx[j]);\n used[i] = true;\n used[j] = true;\n break;\n }\n }\n }\n return pr;\n };\n auto prs0 = get_com_pairs(0, com_vox[0]);\n auto prs1 = get_com_pairs(1, com_vox[1]);\n int num_dom = min((int)prs0.size(), (int)prs1.size());\n int num_com1 = com_vol - 2 * num_dom;\n int only_v = abs(sz[0] - sz[1]);\n int N = num_dom + num_com1 + only_v;\n int DD = D * D * D;\n vector B[2] = {vector(DD, 0), vector(DD, 0)};\n int cur_blk = 1;\n // common dominoes\n for (int k = 0; k < num_dom; k++) {\n int b = cur_blk++;\n for (int sc = 0; sc < 2; sc++) {\n auto prs = (sc == 0 ? prs0 : prs1);\n auto [i1, i2] = prs[k];\n for (int t : {i1, i2}) {\n auto [x, y, z] = pos[sc][t];\n B[sc][x * (D * D) + y * D + z] = b;\n }\n }\n }\n // mark voxels used by dominoes\n vector dom_used[2];\n dom_used[0].assign(sz[0], false);\n dom_used[1].assign(sz[1], false);\n for (int k = 0; k < num_dom; k++) {\n for (int sc = 0; sc < 2; sc++) {\n auto prs = (sc == 0 ? prs0 : prs1);\n auto [a, b] = prs[k];\n dom_used[sc][a] = true;\n dom_used[sc][b] = true;\n }\n }\n // remaining common 1x1\n vector remain_com[2];\n for (int sc = 0; sc < 2; sc++) {\n for (int id : com_vox[sc]) {\n if (!dom_used[sc][id]) remain_com[sc].push_back(id);\n }\n }\n for (int k = 0; k < num_com1; k++) {\n int b = cur_blk++;\n for (int sc = 0; sc < 2; sc++) {\n int id = remain_com[sc][k];\n auto [x, y, z] = pos[sc][id];\n B[sc][x * (D * D) + y * D + z] = b;\n }\n }\n // only blocks on the larger side\n int large_sc = (sz[0] > sz[1] ? 0 : 1);\n vector is_common(sz[large_sc], false);\n for (int id : com_vox[large_sc]) is_common[id] = true;\n for (int id = 0; id < sz[large_sc]; id++) {\n if (!is_common[id]) {\n int b = cur_blk++;\n auto [x, y, z] = pos[large_sc][id];\n B[large_sc][x * (D * D) + y * D + z] = b;\n }\n }\n cout << N << endl;\n for (int v : B[0]) cout << v << \" \";\n cout << endl;\n for (int v : B[1]) cout << v << \" \";\n cout << endl;\n return 0;\n}","ahc020":"#include \nusing namespace std;\nusing ll = long long;\n\nll get_p_from_dd(ll dd) {\n if (dd == 0) return 0;\n ll p = (ll)sqrtl(dd);\n if (p * p >= dd) return p;\n return p + 1;\n}\n\nint main() {\n int N, M, K;\n cin >> N >> M >> K;\n vector X(N+1), Y(N+1);\n for(int i = 1; i <= N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector eu(M), ev(M);\n vector ew(M);\n for(int j = 0; j < M; j++) {\n cin >> eu[j] >> ev[j] >> ew[j];\n }\n vector Ra(K), Rb(K);\n for(int k = 0; k < K; k++) {\n cin >> Ra[k] >> Rb[k];\n }\n vector> dds(N+1, vector(K));\n for(int i=1; i<=N; i++) {\n for(int k=0; k necessary(N+1, false);\n for(int k=0; k>> g(N+1);\n for(int j=0;j mincost(N+1, LLONG_MAX/2);\n vector parent_e(N+1, -1);\n mincost[1] = 0;\n priority_queue,vector>,greater>> pq;\n pq.emplace(0LL,1);\n while(!pq.empty()){\n auto [c,u] = pq.top(); pq.pop();\n if(c > mincost[u]) continue;\n for(auto [to,eid]:g[u]){\n ll nc = c + ew[eid];\n if(nc < mincost[to]){\n mincost[to] = nc;\n parent_e[to] = eid;\n pq.emplace(nc,to);\n }\n }\n }\n // build SPT children {child, eid}\n vector>> spt(N+1);\n vector parent_v(N+1,-1);\n for(int i=1;i<=N;i++) if(parent_e[i]!=-1){\n int eid = parent_e[i];\n for(auto [to,je]:g[i]) if(je==eid){\n parent_v[i] = to; // parent of i\n break;\n }\n if(parent_v[i] != -1){\n spt[parent_v[i]].emplace_back(i, eid);\n }\n }\n auto eval_func = [&](vector trms) -> tuple, vector> {\n vector usd(M,false);\n vector rch(N+1,false);\n vector terms(N+1,0);\n for(int i=1;i<=N;i++) terms[i]=trms[i];\n auto dfs = [&](auto self, int nd) -> int {\n int ct = terms[nd];\n bool hs = terms[nd];\n for(auto [to,eid]:spt[nd]){\n int sct = self(self,to);\n ct += sct;\n if(sct>0){\n usd[eid]=true;\n hs=true;\n }\n }\n if(hs) rch[nd]=true;\n return ct;\n };\n dfs(dfs,1);\n rch[1]=true;\n vector mdd(N+1,0);\n bool covers=true;\n for(int k=0;k 25000000LL) covers=false;\n mdd[besti]=max(mdd[besti],minnd);\n }\n ll cov=0;\n vector pp(N+1,0);\n for(int i=1;i<=N;i++) if(mdd[i]>0){\n ll pv=get_p_from_dd(mdd[i]);\n if(pv>5000) covers=false;\n cov += pv*pv;\n pp[i]=(int)pv;\n }\n ll edg=0;\n vector bbv(M,0);\n for(int j=0;j cur_t(N+1,0);\n for(int i=1;i<=N;i++) if(necessary[i]) cur_t[i]=1;\n auto current = eval_func(cur_t);\n ll current_cost; vector current_p, current_b;\n tie(current_cost, current_p, current_b) = current;\n ll global_best_cost = current_cost;\n vector global_best_p = current_p;\n vector global_best_b = current_b;\n bool updated = true;\n int iterations = 0;\n while(updated && iterations < 100){\n updated = false;\n iterations++;\n ll best_delta = 0;\n int to_rem = -1;\n vector bestp_this, bestb_this;\n for(int cand=1; cand<=N; cand++) if(cur_t[cand]){\n vector tm = cur_t;\n tm[cand] = 0;\n auto res = eval_func(tm);\n ll this_cost; vector thisp, thisb;\n tie(this_cost, thisp, thisb) = res;\n if(this_cost < current_cost && this_cost < LLONG_MAX/3){\n if(current_cost - this_cost > best_delta){\n best_delta = current_cost - this_cost;\n to_rem = cand;\n bestp_this = thisp;\n bestb_this = thisb;\n }\n }\n }\n if(to_rem != -1){\n updated = true;\n cur_t[to_rem] = 0;\n current_cost -= best_delta;\n current_p = bestp_this;\n current_b = bestb_this;\n if(current_cost < global_best_cost){\n global_best_cost = current_cost;\n global_best_p = current_p;\n global_best_b = current_b;\n }\n }\n }\n for(int i=1;i<=N;i++) {\n cout << global_best_p[i];\n if(i < N) cout << \" \";\n else cout << \"\\n\";\n }\n for(int j=0;j\nusing namespace std;\n\nconst int N = 30;\nint grid[N][N];\n\nint main() {\n for (int x = 0; x < N; x++) {\n for (int y = 0; y <= x; y++) {\n cin >> grid[x][y];\n }\n }\n vector> ops;\n auto sift_down = [&](int sx, int sy) {\n int x = sx, y = sy;\n while (true) {\n int min_num = grid[x][y];\n int mx = x, my = y;\n if (x < N - 1) {\n if (grid[x + 1][y] < min_num) {\n min_num = grid[x + 1][y];\n mx = x + 1; my = y;\n }\n if (grid[x + 1][y + 1] < min_num) {\n min_num = grid[x + 1][y + 1];\n mx = x + 1; my = y + 1;\n }\n }\n if (mx == x && my == y) break;\n ops.push_back({x, y, mx, my});\n int n1 = grid[x][y], n2 = grid[mx][my];\n grid[x][y] = n2; grid[mx][my] = n1;\n x = mx; y = my;\n }\n };\n while (true) {\n int max_viol = 0;\n int best_x = -1, best_y = -1;\n for (int x = 0; x < N - 1; x++) {\n for (int y = 0; y <= x; y++) {\n int p = grid[x][y];\n int c1 = grid[x + 1][y];\n int c2 = grid[x + 1][y + 1];\n int mn = min(c1, c2);\n if (p > mn) {\n int viol = p - mn;\n if (viol > max_viol || (viol == max_viol && x > best_x)) {\n max_viol = viol;\n best_x = x;\n best_y = y;\n }\n }\n }\n }\n if (max_viol == 0) break;\n sift_down(best_x, best_y);\n }\n cout << ops.size() << endl;\n for (auto& ar : ops) {\n cout << ar[0] << \" \" << ar[1] << \" \" << ar[2] << \" \" << ar[3] << endl;\n }\n return 0;\n}","toyota2023summer-final":"#include \nusing namespace std;\n\nint main() {\n int D, N;\n cin >> D >> N;\n bool is_obst[9][9];\n memset(is_obst, 0, sizeof(is_obst));\n for (int i = 0; i < N; i++) {\n int r, c;\n cin >> r >> c;\n is_obst[r][c] = true;\n }\n int er = 0, ec = 4;\n int dr[4] = {-1, 0, 1, 0};\n int dc[4] = {0, 1, 0, -1};\n int static_dist[9][9];\n memset(static_dist, -1, sizeof(static_dist));\n {\n queue> q;\n q.emplace(er, ec);\n static_dist[er][ec] = 0;\n while (!q.empty()) {\n auto [r, c] = q.front();\n q.pop();\n for (int k = 0; k < 4; k++) {\n int nr = r + dr[k], nc = c + dc[k];\n if (nr >= 0 && nr < D && nc >= 0 && nc < D && !is_obst[nr][nc] &&\n static_dist[nr][nc] == -1) {\n static_dist[nr][nc] = static_dist[r][c] + 1;\n q.emplace(nr, nc);\n }\n }\n }\n }\n vector> positions;\n for (int r = 0; r < D; r++) {\n for (int c = 0; c < D; c++) {\n if (!is_obst[r][c] && !(r == er && c == ec)) {\n positions.emplace_back(r, c);\n }\n }\n }\n int MM = positions.size();\n bool assigned[81] = {false};\n int pos_label[9][9];\n memset(pos_label, -1, sizeof(pos_label));\n bool has_cont[9][9] = {false};\n auto get_vis = [&]() -> vector> {\n vector> vis(D, vector(D, false));\n queue> q;\n q.emplace(er, ec);\n vis[er][ec] = true;\n while (!q.empty()) {\n auto [r, c] = q.front();\n q.pop();\n for (int k = 0; k < 4; k++) {\n int nr = r + dr[k], nc = c + dc[k];\n if (nr >= 0 && nr < D && nc >= 0 && nc < D && !is_obst[nr][nc] &&\n !vis[nr][nc] && !has_cont[nr][nc]) {\n vis[nr][nc] = true;\n q.emplace(nr, nc);\n }\n }\n }\n return vis;\n };\n for (int step = 0; step < MM; step++) {\n int t;\n cin >> t;\n int rank = 0;\n for (int l = 0; l < MM; l++) {\n if (!assigned[l] && l < t) rank++;\n }\n auto vis = get_vis();\n int cur_degree[9][9];\n memset(cur_degree, 0, sizeof(cur_degree));\n for (int i = 0; i < D; i++) {\n for (int j = 0; j < D; j++) {\n if (!is_obst[i][j] && !has_cont[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && !is_obst[ni][nj] &&\n !has_cont[ni][nj]) {\n cur_degree[i][j]++;\n }\n }\n }\n }\n }\n vector> cands;\n for (auto p : positions) {\n int r = p.first, c = p.second;\n if (!has_cont[r][c] && vis[r][c]) {\n cands.push_back(p);\n }\n }\n vector> safes;\n int num_cur = cands.size();\n for (auto p : cands) {\n int r = p.first, c = p.second;\n has_cont[r][c] = true;\n auto vis2 = get_vis();\n has_cont[r][c] = false;\n int cnt = 0;\n for (auto posi : positions) {\n int rr = posi.first, cc = posi.second;\n if (!has_cont[rr][cc] && vis2[rr][cc]) cnt++;\n }\n if (cnt == num_cur - 1 || num_cur <= 1) {\n safes.push_back(p);\n }\n }\n if (safes.empty()) {\n safes = cands;\n }\n sort(safes.begin(), safes.end(), [&](const pair& a, const pair& b) {\n int da = static_dist[a.first][a.second];\n int db = static_dist[b.first][b.second];\n if (da != db) return da < db;\n int dega = cur_degree[a.first][a.second];\n int degb = cur_degree[b.first][b.second];\n if (dega != degb) return dega > degb;\n if (a.first != b.first) return a.first < b.first;\n return a.second < b.second;\n });\n int chosen_idx = rank;\n if (chosen_idx >= (int)safes.size()) chosen_idx = max(0, (int)safes.size() - 1);\n if (safes.empty() && !cands.empty()) {\n safes = cands;\n chosen_idx = 0;\n }\n if (!safes.empty()) {\n auto [pi, pj] = safes[chosen_idx];\n cout << pi << \" \" << pj << endl;\n pos_label[pi][pj] = t;\n has_cont[pi][pj] = true;\n assigned[t] = true;\n } else {\n if (!cands.empty()) {\n auto [pi, pj] = cands[0];\n cout << pi << \" \" << pj << endl;\n pos_label[pi][pj] = t;\n has_cont[pi][pj] = true;\n assigned[t] = true;\n } else {\n cout << \"0 0\" << endl;\n }\n }\n }\n vector> order;\n int remain = MM;\n while (remain > 0) {\n auto vis = get_vis();\n set> accs;\n for (int i = 0; i < D; i++) {\n for (int j = 0; j < D; j++) {\n if (vis[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && has_cont[ni][nj] &&\n !is_obst[ni][nj]) {\n accs.insert({ni, nj});\n }\n }\n }\n }\n }\n if (accs.empty()) {\n break;\n }\n int minl = INT_MAX;\n pair bp = {-1, -1};\n for (auto p : accs) {\n int l = pos_label[p.first][p.second];\n if (l >= 0 && l < minl) {\n minl = l;\n bp = p;\n }\n }\n if (bp.first == -1) break;\n order.push_back(bp);\n has_cont[bp.first][bp.second] = false;\n remain--;\n }\n for (auto [i, j] : order) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc024":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> C(n, vector(n));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> C[i][j];\n auto adj_mat = vector>(m + 1, vector(m + 1, false));\n auto mark_bdry = [&](int i, int j) {\n int c = C[i][j];\n adj_mat[c][0] = adj_mat[0][c] = true;\n };\n for (int j = 0; j < n; j++) {\n mark_bdry(0, j); mark_bdry(n - 1, j);\n }\n for (int i = 0; i < n; i++) {\n mark_bdry(i, 0); mark_bdry(i, n - 1);\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int c = C[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = C[ni][nj];\n if (c != d) adj_mat[c][d] = adj_mat[d][c] = true;\n }\n }\n }\n }\n vector> newm = C;\n vector> contact_cnt(m + 1, vector(m + 1, 0));\n vector> dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\n auto init_cnt = [&]() {\n contact_cnt.assign(m + 1, vector(m + 1, 0));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n int b = 0; bool is_out = false;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) is_out = true;\n else b = newm[ni][nj];\n if (c == b) continue;\n bool should = is_out || (di > 0 || (di == 0 && dj > 0));\n if (should) {\n int mn = min(c, b), mx = max(c, b);\n contact_cnt[mn][mx]++;\n }\n }\n }\n };\n init_cnt();\n bool changed = true;\n while (changed) {\n changed = false;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n if (c == 0) continue;\n int same = 0;\n bool exposed = false;\n vector neigh_c;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) {\n exposed = true; continue;\n }\n int b = newm[ni][nj];\n if (b == c) same++;\n else {\n neigh_c.push_back(b);\n if (b == 0) exposed = true;\n }\n }\n if (same != 1 || !exposed) continue;\n bool exposes_int = false;\n for (int b : neigh_c) if (b > 0 && !adj_mat[b][0]) {\n exposes_int = true; break;\n }\n if (exposes_int) continue;\n map contrib;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n int b = 0; bool is_out = false;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) { is_out = true; b = 0; }\n else b = newm[ni][nj];\n if (c == b) continue;\n bool should = is_out || (di > 0 || (di == 0 && dj > 0));\n if (should) contrib[b]++;\n }\n bool last = false;\n for (auto& kv : contrib) {\n int b = kv.first; int con = kv.second;\n int mn = min(c, b), mx = max(c, b);\n if (contact_cnt[mn][mx] == con) { last = true; break; }\n }\n if (last) continue;\n newm[i][j] = 0;\n changed = true;\n for (auto& kv : contrib) {\n int b = kv.first; int con = kv.second;\n int mn = min(c, b), mx = max(c, b);\n contact_cnt[mn][mx] -= con;\n }\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int b = newm[ni][nj];\n if (b > 0) {\n int mn = 0, mx = b;\n contact_cnt[mn][mx]++;\n }\n }\n }\n }\n }\n auto compute_new_adj = [&]() {\n auto na = vector>(m + 1, vector(m + 1, false));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = newm[ni][nj];\n if (c != d) na[c][d] = na[d][c] = true;\n }\n }\n }\n for (int j = 0; j < n; j++) {\n if (newm[0][j] != 0) { int c = newm[0][j]; na[c][0] = na[0][c] = true; }\n if (newm[n - 1][j] != 0) { int c = newm[n - 1][j]; na[c][0] = na[0][c] = true; }\n }\n for (int i = 0; i < n; i++) {\n if (newm[i][0] != 0) { int c = newm[i][0]; na[c][0] = na[0][c] = true; }\n if (newm[i][n - 1] != 0) { int c = newm[i][n - 1]; na[c][0] = na[0][c] = true; }\n }\n return na;\n };\n auto new_adj = compute_new_adj();\n bool adj_ok = true;\n for (int c = 0; c <= m; c++) for (int d = 0; d <= m; d++) {\n if (adj_mat[c][d] != new_adj[c][d]) adj_ok = false;\n }\n bool conn_ok = true;\n for (int c = 1; c <= m && conn_ok; c++) {\n vector> pos;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == c) pos.emplace_back(i, j);\n if (pos.empty()) { conn_ok = false; continue; }\n vector> vis(n, vector(n, false));\n queue> q;\n auto [sx, sy] = pos[0];\n q.push({sx, sy}); vis[sx][sy] = true;\n int cnt = 1;\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (auto [dx, dy] : dirs) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == c) {\n vis[nx][ny] = true; q.push({nx, ny}); cnt++;\n }\n }\n }\n if (cnt != (int)pos.size()) conn_ok = false;\n }\n if (conn_ok) {\n vector> zeros;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == 0) zeros.emplace_back(i, j);\n if (!zeros.empty()) {\n vector> vis(n, vector(n, false));\n queue> q;\n int cnt = 0;\n for (auto [i2, j2] : zeros) {\n if ((i2 == 0 || i2 == n - 1 || j2 == 0 || j2 == n - 1) && !vis[i2][j2]) {\n vis[i2][j2] = true; q.push({i2, j2}); cnt++;\n }\n }\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (auto [dx, dy] : dirs) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == 0) {\n vis[nx][ny] = true; q.push({nx, ny}); cnt++;\n }\n }\n }\n if (cnt != (int)zeros.size()) conn_ok = false;\n }\n }\n if (!adj_ok || !conn_ok) newm = C;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cout << newm[i][j];\n if (j < n - 1) cout << \" \";\n }\n cout << endl;\n }\n}","ahc025":"#include \nusing namespace std;\n\nint main() {\n int N, D, Q;\n cin >> N >> D >> Q;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n uniform_real_distribution uni(0.0, 1.0);\n vector score(N, 0);\n double target_part = 20.0;\n double avg_size = target_part * (double)N / (2.0 * Q);\n avg_size = max(avg_size, 1.5);\n double p = avg_size / (double)N;\n for (int q = 0; q < Q; q++) {\n vector L, R;\n vector used(N, false);\n for (int i = 0; i < N; i++) {\n double r = uni(rng);\n if (r < p) {\n L.push_back(i);\n used[i] = true;\n } else if (r < 2 * p) {\n R.push_back(i);\n used[i] = true;\n }\n }\n if (L.empty()) {\n for (int t = 0; t < N; t++) {\n int i = rng() % N;\n if (!used[i]) {\n L.push_back(i);\n used[i] = true;\n break;\n }\n }\n }\n if (R.empty()) {\n for (int t = 0; t < N; t++) {\n int i = rng() % N;\n if (!used[i]) {\n R.push_back(i);\n used[i] = true;\n break;\n }\n }\n }\n if (L.empty() || R.empty()) {\n L.clear();\n R.clear();\n used.assign(N, false);\n int a = rng() % N;\n L.push_back(a);\n used[a] = true;\n int b = rng() % N;\n while (used[b]) b = rng() % N;\n R.push_back(b);\n }\n cout << L.size() << \" \" << R.size();\n for (int x : L) cout << \" \" << x;\n for (int x : R) cout << \" \" << x;\n cout << endl;\n string res;\n cin >> res;\n int sgn = 0;\n if (res == \">\") sgn = 1;\n else if (res == \"<\") sgn = -1;\n for (int x : L) score[x] += sgn;\n for (int x : R) score[x] -= sgn;\n }\n long long minw = LLONG_MAX;\n for (auto x : score) minw = min(minw, x);\n for (auto &x : score) x = x - minw + 1LL;\n vector> items;\n for (int i = 0; i < N; i++) {\n items.emplace_back(score[i], i);\n }\n sort(items.rbegin(), items.rend());\n vector group_sums(D, 0);\n vector group_id(N, 0);\n for (auto &pr : items) {\n int id = pr.second;\n int best = 0;\n for (int g = 1; g < D; g++) {\n if (group_sums[g] < group_sums[best]) best = g;\n }\n group_id[id] = best;\n group_sums[best] += pr.first;\n }\n for (int i = 0; i < N; i++) {\n if (i > 0) cout << \" \";\n cout << group_id[i];\n }\n cout << endl;\n return 0;\n}","ahc026":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> st(m);\n for (int i = 0; i < m; i++) {\n st[i].resize(n / m);\n for (int j = 0; j < n / m; j++) {\n cin >> st[i][j];\n }\n }\n vector> ops;\n int cur = 1;\n auto get_top = [&](int s) -> int {\n if (st[s].empty()) return n + 1;\n return st[s].back();\n };\n auto can_extract = [&]() -> bool {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) return true;\n }\n return false;\n };\n auto find_pos = [&](int v) -> pair {\n for (int s = 0; s < m; s++) {\n for (int h = 0; h < (int)st[s].size(); h++) {\n if (st[s][h] == v) return {s, h};\n }\n }\n return {-1, -1};\n };\n while (cur <= n) {\n if (can_extract()) {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) {\n ops.emplace_back(cur, 0);\n st[s].pop_back();\n cur++;\n break;\n }\n }\n continue;\n }\n auto [s, h] = find_pos(cur);\n assert(h != -1 && h + 1 < (int)st[s].size());\n int sz = (int)st[s].size();\n int first_above = st[s][h + 1];\n int best_score = -1;\n int best_d = -1;\n for (int d = 0; d < m; d++) {\n if (d == s) continue;\n int pile_len = sz - h - 1;\n auto get_at_depth = [&](int dep) -> int {\n if (dep < pile_len) {\n return st[s][sz - 1 - dep];\n } else {\n int old_dep = dep - pile_len;\n int old_sz = (int)st[d].size();\n if (old_dep >= old_sz) return -999;\n return st[d][old_sz - 1 - old_dep];\n }\n };\n int this_len = 0;\n int exp_val = 0;\n bool cont = true;\n while (cont) {\n int val = get_at_depth(this_len);\n if (val < 1 || val > n) {\n cont = false;\n break;\n }\n if (this_len == 0) {\n this_len = 1;\n exp_val = val + 1;\n continue;\n }\n if (val == exp_val) {\n this_len++;\n exp_val++;\n } else {\n cont = false;\n }\n }\n int min_d = n + 1;\n for (int val : st[d]) min_d = min(min_d, val);\n int old_t = get_top(d);\n int size_d = (int)st[d].size();\n int score = this_len * 10000 + min_d * 4 + size_d * 2 + old_t;\n if (score > best_score) {\n best_score = score;\n best_d = d;\n }\n }\n assert(best_d != -1);\n ops.emplace_back(first_above, best_d + 1);\n auto& from = st[s];\n for (int k = h + 1; k < sz; k++) {\n st[best_d].push_back(from[k]);\n }\n from.resize(h + 1);\n }\n for (auto [v, i] : ops) {\n cout << v << \" \" << i << endl;\n }\n}","ahc027":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector h(N - 1), v(N);\n for (int i = 0; i < N - 1; i++) cin >> h[i];\n for (int i = 0; i < N; i++) cin >> v[i];\n vector> d(N, vector(N));\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) cin >> d[i][j];\n vector> visited(N, vector(N, false));\n int DI[4] = {0, 1, 0, -1};\n int DJ[4] = {1, 0, -1, 0};\n string DIR = \"RDLU\";\n function dfs = [&](int i, int j) {\n visited[i][j] = true;\n for (int dir = 0; dir < 4; dir++) {\n int ni = i + DI[dir];\n int nj = j + DJ[dir];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N || visited[ni][nj]) continue;\n bool nowall;\n if (DI[dir] == 0) {\n nowall = (v[i][min(j, nj)] == '0');\n } else {\n nowall = (h[min(i, ni)][j] == '0');\n }\n if (nowall) {\n cout << DIR[dir];\n dfs(ni, nj);\n int backdir = (dir + 2) % 4;\n cout << DIR[backdir];\n }\n }\n };\n dfs(0, 0);\n cout << endl;\n return 0;\n}","ahc028":"#include \nusing namespace std;\nusing pii = pair;\n\npair> compute_path(int ci, int cj, const string& need, const vector>& pos) {\n int r = need.size();\n if (r == 0) return {0, {}};\n vector> cands(r);\n for (int k = 0; k < r; k++) cands[k] = pos[need[k] - 'A'];\n vector> dp(r), pre(r);\n int sz0 = cands[0].size();\n dp[0].assign(sz0, INT_MAX / 2);\n pre[0].assign(sz0, -1);\n for (int j = 0; j < sz0; j++) {\n auto [x, y] = cands[0][j];\n dp[0][j] = abs(x - ci) + abs(y - cj);\n }\n for (int k = 1; k < r; k++) {\n int psz = cands[k - 1].size();\n int sz = cands[k].size();\n dp[k].assign(sz, INT_MAX / 2);\n pre[k].assign(sz, -1);\n for (int j = 0; j < sz; j++) {\n auto [x, y] = cands[k][j];\n for (int pj = 0; pj < psz; pj++) {\n if (dp[k - 1][pj] >= INT_MAX / 2) continue;\n auto [px, py] = cands[k - 1][pj];\n int d = abs(x - px) + abs(y - py);\n int tot = dp[k - 1][pj] + d;\n if (tot < dp[k][j]) {\n dp[k][j] = tot;\n pre[k][j] = pj;\n }\n }\n }\n }\n int ls = cands[r - 1].size();\n int md = INT_MAX / 2;\n int bj = 0;\n for (int j = 0; j < ls; j++) {\n if (dp[r - 1][j] < md) {\n md = dp[r - 1][j];\n bj = j;\n }\n }\n vector path(r);\n int currj = bj;\n for (int k = r - 1; k >= 0; k--) {\n path[k] = cands[k][currj];\n if (k >= 1) currj = pre[k][currj];\n }\n return {md, path};\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n int si, sj;\n cin >> si >> sj;\n vector grid(N);\n for (int i = 0; i < N; i++) cin >> grid[i];\n vector ts(M);\n for (int i = 0; i < M; i++) cin >> ts[i];\n vector> pos(26);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int c = grid[i][j] - 'A';\n pos[c].emplace_back(i, j);\n }\n }\n vector covered(M, false);\n int uncov = M;\n string current_S = \"\";\n int ci = si, cj = sj;\n vector actions;\n while (uncov > 0) {\n int best_score = INT_MAX;\n int best_k = -1;\n vector best_path;\n for (int k = 0; k < M; k++) {\n if (covered[k]) continue;\n const string& t = ts[k];\n int maxo = 0;\n int maxp = min(4, (int)current_S.size());\n for (int o = maxp; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : current_S.substr(current_S.size() - o, o));\n string pref = t.substr(0, o);\n if (suf == pref) {\n maxo = o;\n break;\n }\n }\n string needed = t.substr(maxo);\n if (needed.empty()) {\n covered[k] = true;\n uncov--;\n continue;\n }\n auto [md, pth] = compute_path(ci, cj, needed, pos);\n int addc = (int)needed.size() + md;\n int score = addc - maxo * 2;\n if (score < best_score) {\n best_score = score;\n best_k = k;\n best_path = pth;\n }\n }\n if (best_k == -1) break;\n for (auto ppos : best_path) {\n actions.push_back(ppos);\n auto [x, y] = ppos;\n current_S += grid[x][y];\n ci = x;\n cj = y;\n if (current_S.size() >= 5) {\n string last5 = current_S.substr(current_S.size() - 5, 5);\n for (int kk = 0; kk < M; kk++) {\n if (!covered[kk] && ts[kk] == last5) {\n covered[kk] = true;\n uncov--;\n }\n }\n }\n }\n }\n for (auto [i, j] : actions) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc030":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n double eps;\n cin >> N >> M >> eps;\n int C = N * N;\n vector>> shapes(M);\n vector>> place_bits(M);\n for (int k = 0; k < M; k++) {\n int d;\n cin >> d;\n shapes[k].resize(d);\n int mi = 0, mj = 0;\n for (int p = 0; p < d; p++) {\n int x, y;\n cin >> x >> y;\n shapes[k][p] = {x, y};\n mi = max(mi, x);\n mj = max(mj, y);\n }\n for (int di = 0; di <= N - 1 - mi; di++) {\n for (int dj = 0; dj <= N - 1 - mj; dj++) {\n bitset<400> bs;\n for (auto [x, y] : shapes[k]) {\n bs.set((di + x) * N + (dj + y));\n }\n place_bits[k].push_back(bs);\n }\n }\n }\n vector> active(M);\n for (int k = 0; k < M; k++) {\n active[k].resize(place_bits[k].size(), true);\n }\n vector obs_v(C, -1);\n vector> observations;\n auto get_curr_poss = [&]() {\n vector> res(M);\n for (int k = 0; k < M; k++) {\n for (int p = 0; p < (int)place_bits[k].size(); p++) {\n if (active[k][p]) res[k].push_back(p);\n }\n }\n return res;\n };\n bool done = false;\n for (int iter = 0; iter < 2 * C; iter++) {\n auto curr_poss = get_curr_poss();\n long long tot = 1;\n bool is_unique = true;\n for (auto& ls : curr_poss) {\n if (ls.size() > 1) is_unique = false;\n tot *= ls.size();\n if (tot > 10000) tot = 10001;\n }\n vector> found;\n if ((is_unique || tot <= 10000) && tot >= 1) {\n vector choice(M, -1);\n function dfs = [&](int k) {\n if (found.size() >= 5) return;\n if (k == M) {\n bool ok = true;\n for (auto [cc, vv] : observations) {\n int sm = 0;\n for (int fk = 0; fk < M; fk++) {\n if (place_bits[fk][choice[fk]].test(cc)) sm++;\n }\n if (sm != vv) {\n ok = false;\n break;\n }\n }\n if (ok) {\n bitset<400> un;\n for (int fk = 0; fk < M; fk++) {\n un |= place_bits[fk][choice[fk]];\n }\n bool is_new = true;\n for (auto& f : found) {\n if (f == un) {\n is_new = false;\n break;\n }\n }\n if (is_new) found.push_back(un);\n }\n return;\n }\n for (int p : curr_poss[k]) {\n choice[k] = p;\n dfs(k + 1);\n if (found.size() >= 5) return;\n }\n };\n dfs(0);\n if (found.size() == 1) {\n vector> positives;\n for (int c = 0; c < C; c++) {\n if (found[0].test(c)) {\n positives.emplace_back(c / N, c % N);\n }\n }\n cout << \"a \" << positives.size();\n for (auto [ii, jj] : positives) {\n cout << \" \" << ii << \" \" << jj;\n }\n cout << endl;\n int resp;\n cin >> resp;\n done = true;\n break;\n } else if (found.size() > 1) {\n int best_c = -1;\n int best_var = 0;\n for (int c = 0; c < C; c++) {\n if (obs_v[c] != -1) continue;\n int num_posi = 0;\n for (auto& bs : found) if (bs.test(c)) num_posi++;\n int vr = min(num_posi, (int)found.size() - num_posi);\n if (vr > best_var) {\n best_var = vr;\n best_c = c;\n }\n }\n if (best_var > 0) {\n int i = best_c / N, j = best_c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[best_c] = v;\n observations.emplace_back(best_c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) {\n for (int p : curr_poss[k]) {\n if (place_bits[k][p].test(best_c)) active[k][p] = false;\n }\n }\n }\n continue;\n }\n }\n }\n auto curr_poss2 = curr_poss;\n int best_c = -1;\n double best_sc = -1;\n for (int c = 0; c < C; c++) {\n if (obs_v[c] != -1) continue;\n double ev = 0.0;\n int ctotal = 0;\n for (int k = 0; k < M; k++) {\n auto& ls = curr_poss2[k];\n int nas = ls.size();\n if (nas == 0) continue;\n int co = 0;\n for (int p : ls) {\n if (place_bits[k][p].test(c)) co++;\n }\n ev += static_cast(co) / nas;\n ctotal += co;\n }\n double pzero = exp(-ev);\n double sc = pzero * ctotal;\n if (sc > best_sc) {\n best_sc = sc;\n best_c = c;\n }\n }\n if (best_c == -1) break;\n int i = best_c / N, j = best_c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[best_c] = v;\n observations.emplace_back(best_c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) {\n for (int p : curr_poss2[k]) {\n if (place_bits[k][p].test(best_c)) active[k][p] = false;\n }\n }\n }\n }\n if (!done) {\n auto curr_poss = get_curr_poss();\n bitset<400> possible_pos;\n for (int k = 0; k < M; k++) for (int p : curr_poss[k]) possible_pos |= place_bits[k][p];\n for (int c = 0; c < C; c++) if (possible_pos.test(c) && obs_v[c] == -1) {\n int i = c / N, j = c % N;\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n obs_v[c] = v;\n observations.emplace_back(c, v);\n if (v == 0) {\n for (int k = 0; k < M; k++) for (int pp : curr_poss[k]) if (place_bits[k][pp].test(c)) active[k][pp] = false;\n }\n }\n auto curr_poss_final = get_curr_poss();\n vector> found;\n vector choice(M, -1);\n function dfs = [&](int k) {\n if (found.size() >= 1) return;\n if (k == M) {\n bool ok = true;\n for (auto [cc, vv] : observations) {\n int sm = 0;\n for (int fk = 0; fk < M; fk++) if (place_bits[fk][choice[fk]].test(cc)) sm++;\n if (sm != vv) ok = false;\n }\n if (ok) {\n bitset<400> un;\n for (int fk = 0; fk < M; fk++) un |= place_bits[fk][choice[fk]];\n found.push_back(un);\n }\n return;\n }\n for (int p : curr_poss_final[k]) {\n choice[k] = p;\n dfs(k + 1);\n }\n };\n dfs(0);\n vector> positives;\n if (!found.empty()) {\n for (int c = 0; c < C; c++) if (found[0].test(c)) positives.emplace_back(c / N, c % N);\n } else {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {\n int vc = obs_v[i * N + j];\n if (vc > 0 || vc == -1) {\n if (vc == -1) {\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v; cin >> v;\n if (v > 0) positives.emplace_back(i, j);\n } else positives.emplace_back(i, j);\n }\n }\n }\n cout << \"a \" << positives.size();\n for (auto [i, j] : positives) cout << \" \" << i << \" \" << j;\n cout << endl;\n int r; cin >> r;\n }\n return 0;\n}","ahc031":"#include \nusing namespace std;\n\nint main() {\n int W, D, N;\n cin >> W >> D >> N;\n vector> a(D, vector(N));\n for(int d = 0; d < D; d++) {\n for(int k = 0; k < N; k++) {\n cin >> a[d][k];\n }\n }\n vector maxa(N, 0);\n for(int k = 0; k < N; k++) {\n for(int d = 0; d < D; d++) {\n maxa[k] = max(maxa[k], a[d][k]);\n }\n }\n int bestK = 1;\n long long best_est = LLONG_MAX / 2;\n for(int ktry = 1; ktry <= min(N, 30); ktry++) {\n int KK = ktry;\n vector gsize(KK);\n for(int i = 0; i < KK; i++) gsize[i] = N / KK + (i < N % KK ? 1 : 0);\n vector minww(KK, 0);\n int pos = N - 1;\n long long totmin = 0;\n long long horiz_est = 0;\n for(int g = 0; g < KK; g++) {\n int gszz = gsize[g];\n long long sm = 0;\n int mmx = 0;\n for(int j = 0; j < gszz; j++) {\n int mk = maxa[pos--];\n sm += mk;\n mmx = max(mmx, mk);\n }\n long long mw = max((sm + W - 1LL) / W, (mmx + W - 1LL) / W);\n minww[g] = mw;\n totmin += mw;\n horiz_est += mw * gszz;\n }\n if(totmin == 0) continue;\n long long area_c = 0;\n for(int dd = 0; dd < D; dd++) {\n int curpos = N - 1;\n for(int g = 0; g < KK; g++) {\n int gszz = gsize[g];\n long long mww = minww[g] * (long long)W / totmin;\n mww = max(1LL, mww);\n int this_ww = mww;\n int tneed = 0;\n for(int j = 0; j < gszz; j++) {\n int akk = a[dd][curpos--];\n tneed += (akk + this_ww - 1) / this_ww;\n }\n if(tneed > W) {\n area_c += 100LL * (tneed - W) * this_ww;\n }\n }\n }\n long long lcost = (D - 1LL) * 2 * horiz_est;\n long long totest = area_c + lcost;\n if(totest < best_est) {\n best_est = totest;\n bestK = KK;\n }\n }\n // now build with bestK\n int K = bestK;\n vector gsize(K);\n for(int i = 0; i < K; i++) gsize[i] = N / K + (i < N % K ? 1 : 0);\n vector minww(K, 0);\n vector> group_ks(K);\n int pos = N - 1;\n long long totmin = 0;\n for(int g = 0; g < K; g++) {\n int gszz = gsize[g];\n long long sm = 0;\n int mmx = 0;\n for(int j = 0; j < gszz; j++) {\n int mk = maxa[pos];\n sm += mk;\n mmx = max(mmx, mk);\n group_ks[g].push_back(pos);\n pos--;\n }\n long long mw = max((sm + W - 1LL) / W, (mmx + W - 1LL) / W);\n minww[g] = mw;\n totmin += mw;\n }\n vector slab_w(K);\n if(totmin > 0) {\n for(int g = 0; g < K; g++) {\n slab_w[g] = max(1LL, minww[g] * (long long)W / totmin);\n }\n int cw = 0;\n for(int w : slab_w) cw += w;\n int diff = W - cw;\n for(int i = 0; i < abs(diff); i++) {\n int gi = i % K;\n if(diff > 0) {\n slab_w[gi]++;\n } else if(slab_w[gi] > 1) {\n slab_w[gi]--;\n }\n }\n } else {\n int eqw = W / K;\n for(int g = 0; g < K; g++) {\n slab_w[g] = eqw;\n }\n for(int g = 0; g < W % K; g++) slab_w[g]++;\n }\n vector jpos(K + 1, 0);\n for(int g = 0; g < K; g++) {\n jpos[g + 1] = jpos[g] + slab_w[g];\n }\n // now for each day\n for(int d = 0; d < D; d++) {\n vector> rect_per_k(N);\n int rk_base = N - 1;\n for(int g = 0; g < K; g++) {\n int thisw = slab_w[g];\n vector> day_as;\n auto& ks_list = group_ks[g];\n for(int rkk : ks_list) {\n day_as.emplace_back(a[d][rkk], rkk);\n }\n sort(day_as.rbegin(), day_as.rend());\n int ng = day_as.size();\n vector needs(ng);\n int tot_need_h = 0;\n for(int i = 0; i < ng; i++) {\n int aa = day_as[i].first;\n int nh = (aa + thisw - 1) / thisw;\n needs[i] = max(1, nh);\n tot_need_h += needs[i];\n }\n vector used_hs(ng, 0);\n int use_hh;\n if(tot_need_h <= W) {\n use_hh = tot_need_h;\n for(int i = 0; i < ng; i++) used_hs[i] = needs[i];\n } else {\n use_hh = W;\n if(tot_need_h > 0) {\n double rr = (double)W / tot_need_h;\n int su = 0;\n for(int i = 0; i < ng; i++) {\n used_hs[i] = max(1, (int)(needs[i] * rr));\n su += used_hs[i];\n }\n while(su < W) {\n for(int i = 0; i < ng && su < W; i++) {\n used_hs[i]++;\n su++;\n }\n }\n while(su > W) {\n for(int i = 0; i < ng && su > W; i++) {\n if(used_hs[i] > 1) {\n used_hs[i]--;\n su--;\n }\n }\n }\n }\n }\n int cur_i = 0;\n int jbase = jpos[g];\n for(int i = 0; i < ng; i++) {\n int hh = used_hs[i];\n int ok = day_as[i].second;\n if(hh == 0) hh = 1; // safety\n rect_per_k[ok] = {cur_i, jbase, cur_i + hh, jbase + thisw};\n cur_i += hh;\n }\n }\n for(int k = 0; k < N; k++) {\n auto arr = rect_per_k[k];\n cout << arr[0] << \" \" << arr[1] << \" \" << arr[2] << \" \" << arr[3] << endl;\n }\n }\n return 0;\n}","ahc032":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n srand(42);\n int N, M, K;\n cin >> N >> M >> K;\n const ll MOD = 998244353;\n ll init_brd[9][9];\n ll init_sc = 0;\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {\n cin >> init_brd[i][j];\n init_sc += init_brd[i][j];\n }\n ll st[20][3][3];\n for (int m = 0; m < M; m++) for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) {\n cin >> st[m][i][j];\n }\n ll best_sc = init_sc;\n vector> best_ops;\n ll brd[9][9];\n const int TRIALS = 50;\n const int TOP_K = 5;\n for (int trial = 0; trial < TRIALS; trial++) {\n for (int i = 0; i < 9; i++) for (int j = 0; j < 9; j++) brd[i][j] = init_brd[i][j];\n vector> this_ops;\n vector> best_ops_in_path;\n ll path_best_sc = init_sc;\n ll curr_sc = init_sc;\n for (int step = 0; step < K; step++) {\n vector> cands;\n for (int m = 0; m < M; m++) {\n for (int p = 0; p <= 6; p++) {\n for (int q = 0; q <= 6; q++) {\n ll d = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n ll nr = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n d += nr - brd[p + x][q + y];\n }\n cands.emplace_back(d, m, p, q);\n }\n }\n }\n sort(cands.rbegin(), cands.rend());\n int ntop = min(TOP_K, (int)cands.size());\n int pick = rand() % ntop;\n auto [dval, m, p, q] = cands[pick];\n this_ops.emplace_back(m, p, q);\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n brd[p + x][q + y] = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n }\n curr_sc += dval;\n if (curr_sc > path_best_sc) {\n path_best_sc = curr_sc;\n best_ops_in_path = this_ops;\n }\n }\n if (path_best_sc > best_sc) {\n best_sc = path_best_sc;\n best_ops = best_ops_in_path;\n }\n }\n cout << best_ops.size() << endl;\n for (auto [m, p, q] : best_ops) {\n cout << m << \" \" << p << \" \" << q << endl;\n }\n}","ahc033":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector> A(N, vector(N));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> A[i][j];\n }\n }\n vector ops(N);\n vector> g(N, vector(N, -1));\n vector crane_r(N), crane_c(N);\n for (int i = 0; i < N; i++) {\n crane_r[i] = i;\n crane_c[i] = 0;\n }\n vector carry(N, false);\n vector carry_what(N, -1);\n vector isact(N, true);\n vector islarge(N, false);\n islarge[0] = true;\n vector inp_idx(N, 0);\n vector next_e(N);\n for (int i = 0; i < N; i++) next_e[i] = i * N;\n int dispat_cnt = 0;\n auto is_done = [&]() { return dispat_cnt == N * N; };\n auto do_receive = [&]() {\n for (int r = 0; r < N; r++) {\n if (inp_idx[r] >= N) continue;\n int c = 0;\n if (g[r][c] != -1) continue;\n bool hold_there = false;\n for (int k = 0; k < N; k++) {\n if (isact[k] && crane_r[k] == r && crane_c[k] == c && carry[k]) {\n hold_there = true;\n break;\n }\n }\n if (!hold_there) {\n int cn = A[r][inp_idx[r]];\n g[r][c] = cn;\n inp_idx[r]++;\n }\n }\n };\n auto do_dispatch = [&]() {\n for (int r = 0; r < N; r++) {\n int c = N - 1;\n if (g[r][c] != -1) {\n int b = g[r][c];\n g[r][c] = -1;\n dispat_cnt++;\n if (b / N == r && next_e[r] == b) {\n next_e[r]++;\n }\n }\n }\n };\n auto move_towards = [&](int cr, int cc, int tr, int tc, bool iscarry) -> char {\n if (cr != tr) {\n if (cr < tr) return 'D';\n return 'U';\n }\n if (cc != tc) {\n if (cc < tc) return 'R';\n return 'L';\n }\n return '.';\n };\n auto find_safe_empty_for = [&](int cont) -> pair {\n int pref = cont / N;\n bool all_inputs_done = (inp_idx[pref] == N);\n for (int j = 1; j < N - 1; j++) {\n if (g[pref][j] == -1) return {pref, j};\n }\n for (int i = 0; i < N; i++) {\n for (int j = 1; j < N - 1; j++) {\n if (g[i][j] == -1) return {i, j};\n }\n }\n for (int i = 0; i < N; i++) {\n bool safe_col0 = (inp_idx[i] == N);\n if (safe_col0 && g[i][0] == -1) return {i, 0};\n }\n return {-1, -1};\n };\n const int MAXT = 10000;\n for (int t = 0; t < MAXT; t++) {\n if (is_done()) break;\n do_receive();\n if (is_done()) break;\n vector action(N, '.');\n for (int k = 1; k < N; k++) {\n if (isact[k] && t == 0) {\n action[k] = 'B';\n }\n }\n if (isact[0]) {\n int held = carry[0] ? carry_what[0] : -1;\n bool acted = false;\n if (held != -1) {\n int tr = held / N;\n if (held == next_e[tr]) {\n int gr = tr, gc = N - 1;\n if (crane_r[0] == gr && crane_c[0] == gc) {\n if (g[gr][gc] == -1) {\n action[0] = 'Q';\n acted = true;\n } else {\n action[0] = '.';\n acted = true;\n }\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], gr, gc, true);\n acted = true;\n }\n }\n }\n if (!acted && !carry[0]) {\n int bestd = INT_MAX;\n int bx = -1, by = -1;\n for (int i = 0; i < N; i++) {\n if (next_e[i] >= (i + 1) * N) continue;\n int nd = next_e[i];\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N; c++) {\n if (g[r][c] == nd) {\n int dist = abs(crane_r[0] - r) + abs(crane_c[0] - c);\n if (dist < bestd) {\n bestd = dist;\n bx = r;\n by = c;\n }\n }\n }\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) {\n action[0] = 'P';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n }\n acted = true;\n }\n }\n if (!acted && carry[0]) {\n int hc = carry_what[0];\n auto emp = find_safe_empty_for(hc);\n if (emp.first != -1) {\n int ex = emp.first, ey = emp.second;\n if (crane_r[0] == ex && crane_c[0] == ey) {\n action[0] = 'Q';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], ex, ey, true);\n }\n acted = true;\n } else {\n int tr = hc / N;\n int gr = tr, gc = N - 1;\n if (crane_r[0] == gr && crane_c[0] == gc) {\n if (g[gr][gc] == -1) action[0] = 'Q';\n else action[0] = '.';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], gr, gc, true);\n }\n acted = true;\n }\n }\n if (!acted) {\n int bestd = INT_MAX;\n int bx = -1, by = -1;\n for (int r = 0; r < N; r++) {\n if (g[r][0] != -1) {\n int d = abs(crane_r[0] - r) + abs(crane_c[0] - 0);\n if (d < bestd) {\n bestd = d;\n bx = r;\n by = 0;\n }\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) {\n action[0] = 'P';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n }\n acted = true;\n }\n }\n if (!acted) {\n action[0] = '.';\n }\n }\n for (int k = 0; k < N; k++) {\n if (!isact[k]) continue;\n char act = action[k];\n if (act == 'B') {\n if (!carry[k]) isact[k] = false;\n continue;\n }\n if (act == 'P') {\n if (!carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] != -1) {\n carry[k] = true;\n carry_what[k] = g[rr][cc];\n g[rr][cc] = -1;\n }\n }\n } else if (act == 'Q') {\n if (carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] == -1) {\n g[rr][cc] = carry_what[k];\n carry[k] = false;\n carry_what[k] = -1;\n }\n }\n } else if (act != '.') {\n int drr = 0, dcc = 0;\n if (act == 'U') drr = -1;\n else if (act == 'D') drr = 1;\n else if (act == 'L') dcc = -1;\n else if (act == 'R') dcc = 1;\n int nr = crane_r[k] + drr;\n int nc = crane_c[k] + dcc;\n if (nr >= 0 && nr < N && nc >= 0 && nc < N) {\n bool has_cont = (g[nr][nc] != -1);\n bool can_move = true;\n if (carry[k] && !islarge[k] && has_cont) can_move = false;\n if (can_move) {\n crane_r[k] = nr;\n crane_c[k] = nc;\n }\n }\n }\n }\n do_dispatch();\n for (int k = 0; k < N; k++) {\n ops[k] += action[k];\n }\n if (is_done()) break;\n }\n int maxlen = 0;\n for (auto& s : ops) maxlen = max(maxlen, (int)s.size());\n for (auto& s : ops) {\n while ((int)s.size() < maxlen) s += '.';\n }\n for (auto& s : ops) {\n cout << s << endl;\n }\n}","ahc034":"#include \nusing namespace std;\nusing ll = long long;\n\nll simulate_cost(const vector& ops, const vector>& orig_h) {\n int n = orig_h.size();\n vector> height(n, vector(n));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) height[i][j] = orig_h[i][j];\n }\n int r = 0, c = 0;\n ll ld = 0;\n ll cost = 0;\n for (auto& op : ops) {\n if (op.empty()) continue;\n if (op[0] == '+' || op[0] == '-') {\n ll d = stoll(op.substr(1));\n if (op[0] == '+') {\n height[r][c] -= d;\n ld += d;\n cost += d;\n } else {\n height[r][c] += d;\n ld -= d;\n cost += d;\n }\n if (ld < 0 || d <= 0) return 1LL << 60;\n } else {\n char dir = op[0];\n if (dir == 'U') r--;\n else if (dir == 'D') r++;\n else if (dir == 'L') c--;\n else if (dir == 'R') c++;\n if (r < 0 || r >= n || c < 0 || c >= n) return 1LL << 60;\n cost += 100 + ld;\n }\n }\n if (ld != 0) return 1LL << 60;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (height[i][j] != 0) return 1LL << 60;\n return cost;\n}\n\nint main() {\n srand(42);\n int N;\n cin >> N;\n vector> h(N, vector(N));\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) cin >> h[i][j];\n vector> orig_supply(N, vector(N, 0));\n vector> orig_demand(N, vector(N, 0));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (h[i][j] > 0) orig_supply[i][j] = h[i][j];\n else orig_demand[i][j] = -h[i][j];\n }\n }\n vector> supply_list;\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) if (orig_supply[i][j] > 0) supply_list.emplace_back(i, j);\n sort(supply_list.begin(), supply_list.end(), [&](auto a, auto b){\n return a.first * N + a.second < b.first * N + b.second;\n });\n ll best_cost = 1LL << 60;\n vector best_ops;\n for (int trial = 0; trial < 50; trial++) {\n vector> bias(N, vector(N, 0));\n bool use_raster = false;\n if (trial == 0) {\n // zero bias nearest\n } else if (trial <= 35) {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) bias[i][j] = (rand() % 5) - 2;\n } else {\n use_raster = true;\n }\n auto rem_supply = orig_supply;\n auto rem_demand = orig_demand;\n vector ops;\n int cr = 0, cc = 0;\n ll load = 0;\n auto has_supp = [&]() -> bool {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) if (rem_supply[i][j] > 0) return true;\n return false;\n };\n auto find_closest = [&](bool is_supply, int curr_r, int curr_c) -> pair {\n int min_val = INT_MAX;\n int ti = -1, tj = -1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int d = abs(i - curr_r) + abs(j - curr_c);\n int eff = d * 10 + bias[i][j];\n bool has = is_supply ? (rem_supply[i][j] > 0) : (rem_demand[i][j] > 0);\n if (has && (eff < min_val || (eff == min_val && (i < ti || (i == ti && j < tj))))) {\n min_val = eff;\n ti = i; tj = j;\n }\n }\n }\n return {ti, tj};\n };\n auto find_next_raster_supply = [&](int curr_r, int curr_c) -> pair {\n for (auto& p : supply_list) {\n if (rem_supply[p.first][p.second] > 0) return p;\n }\n return {-1,-1};\n };\n auto do_move = [&](int tr, int tc) {\n while (cr != tr) {\n if (cr < tr) { ops.push_back(\"D\"); cr++; } else { ops.push_back(\"U\"); cr--; }\n }\n while (cc != tc) {\n if (cc < tc) { ops.push_back(\"R\"); cc++; } else { ops.push_back(\"L\"); cc--; }\n }\n };\n bool valid_run = true;\n while ((has_supp() || load > 0) && valid_run) {\n if (ops.size() > 90000) { valid_run = false; break; }\n if (load == 0) {\n if (!has_supp()) break;\n pair tgt;\n if (use_raster) {\n tgt = find_next_raster_supply(cr, cc);\n } else {\n tgt = find_closest(true, cr, cc);\n }\n if (tgt.first == -1) { valid_run = false; break; }\n do_move(tgt.first, tgt.second);\n int d = rem_supply[cr][cc];\n if (d > 0) {\n ops.push_back(\"+\" + to_string(d));\n load += d;\n rem_supply[cr][cc] = 0;\n }\n } else {\n auto tgt = find_closest(false, cr, cc);\n if (tgt.first == -1) { valid_run = false; break; }\n do_move(tgt.first, tgt.second);\n ll d = min(load, (ll)rem_demand[cr][cc]);\n if (d > 0) {\n ops.push_back(\"-\" + to_string((int)d));\n load -= d;\n rem_demand[cr][cc] -= (int)d;\n } else {\n valid_run = false; break;\n }\n }\n }\n if (!valid_run || load != 0) continue;\n ll this_c = simulate_cost(ops, h);\n if (this_c < best_cost) {\n best_cost = this_c;\n best_ops = std::move(ops);\n }\n }\n for (auto& s : best_ops) {\n cout << s << endl;\n }\n return 0;\n}","ahc035":"#include \nusing namespace std;\n\nint main() {\n int N, M, T;\n cin >> N >> M >> T;\n int SEED_CNT = 2 * N * (N - 1);\n vector> seeds(SEED_CNT, vector(M));\n for (int i = 0; i < SEED_CNT; i++) {\n for (int j = 0; j < M; j++) {\n cin >> seeds[i][j];\n }\n }\n srand(42);\n for (int t = 0; t < T; t++) {\n vector val(SEED_CNT, 0);\n vector maxd(M, 0);\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n val[k] += seeds[k][l];\n if (seeds[k][l] > maxd[l]) maxd[l] = seeds[k][l];\n }\n }\n vector>> car_list(M);\n for (int l = 0; l < M; l++) {\n for (int k = 0; k < SEED_CNT; k++) {\n if (seeds[k][l] == maxd[l]) {\n car_list[l].emplace_back(val[k], k);\n }\n }\n sort(car_list[l].rbegin(), car_list[l].rend());\n }\n set must_s;\n for (int l = 0; l < M; l++) {\n for (int i = 0; i < min(2, (int)car_list[l].size()); i++) {\n must_s.insert(car_list[l][i].second);\n }\n }\n vector must(must_s.begin(), must_s.end());\n vector alls(SEED_CNT);\n iota(alls.begin(), alls.end(), 0);\n sort(alls.begin(), alls.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector in_chosen(SEED_CNT, false);\n vector selected;\n for (int m : must) {\n if (!in_chosen[m]) {\n selected.push_back(m);\n in_chosen[m] = true;\n }\n }\n for (int cand : alls) {\n if (!in_chosen[cand]) {\n selected.push_back(cand);\n in_chosen[cand] = true;\n if ((int)selected.size() == N * N) break;\n }\n }\n while ((int)selected.size() < N * N) {\n for (int k = 0; k < SEED_CNT; k++) {\n if (!in_chosen[k]) {\n selected.push_back(k);\n in_chosen[k] = true;\n break;\n }\n }\n }\n sort(selected.begin(), selected.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector> comp(36, vector(36, 0));\n for (int i = 0; i < 36; i++) {\n for (int j = 0; j < 36; j++) {\n if (i == j) continue;\n int s1 = selected[i];\n int s2 = selected[j];\n for (int l = 0; l < M; l++) {\n comp[i][j] += max(seeds[s1][l], seeds[s2][l]);\n }\n }\n }\n vector mixed(36);\n int left = 0, right = 35;\n for (int k = 0; k < 36; k++) {\n if (k % 2 == 0) {\n mixed[k] = left++;\n } else {\n mixed[k] = right--;\n }\n }\n vector asg(36);\n for (int p = 0; p < 36; p++) {\n asg[p] = mixed[p];\n }\n auto calc = [&](const vector& assignment) -> long long {\n long long tot = 0;\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N - 1; c++) {\n int i1 = assignment[r * N + c];\n int i2 = assignment[r * N + c + 1];\n long long cval = comp[i1][i2];\n tot += cval * cval;\n }\n }\n for (int r = 0; r < N - 1; r++) {\n for (int c = 0; c < N; c++) {\n int i1 = assignment[r * N + c];\n int i2 = assignment[(r + 1) * N + c];\n long long cval = comp[i1][i2];\n tot += cval * cval;\n }\n }\n return tot;\n };\n long long cur_score = calc(asg);\n long long best_score = cur_score;\n vector best_asg = asg;\n double Temp = 100000.0;\n int num_iters = 4000;\n for (int it = 0; it < num_iters; it++) {\n int p1 = rand() % 36;\n int p2 = rand() % 36;\n if (p1 == p2) {\n it--;\n continue;\n }\n swap(asg[p1], asg[p2]);\n long long new_score = calc(asg);\n long long d = new_score - cur_score;\n bool accept = (d > 0);\n if (!accept && Temp > 1e-9) {\n double prob = exp(static_cast(d) / Temp);\n if ((rand() / (double)RAND_MAX) < prob) accept = true;\n }\n if (accept) {\n cur_score = new_score;\n if (cur_score > best_score) {\n best_score = cur_score;\n best_asg = asg;\n }\n } else {\n swap(asg[p1], asg[p2]);\n }\n Temp *= 0.995;\n }\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N; c++) {\n int sidx = best_asg[r * N + c];\n cout << selected[sidx];\n if (c < N - 1) cout << \" \";\n }\n cout << endl;\n }\n cout.flush();\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n cin >> seeds[k][l];\n }\n }\n }\n return 0;\n}","ahc038":"#include \nusing namespace std;\n\nconst int MAXN = 31;\nint DELX[4] = {0, 1, 0, -1};\nint DELY[4] = {1, 0, -1, 0};\n\nint main() {\n int N, M, Vv;\n cin >> N >> M >> Vv;\n vector S(N), T(N);\n for (int i = 0; i < N; i++) cin >> S[i];\n for (int i = 0; i < N; i++) cin >> T[i];\n\n bool needs_pick[MAXN][MAXN] = {};\n bool needs_place[MAXN][MAXN] = {};\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (S[i][j] == '1' && T[i][j] == '0') needs_pick[i][j] = true;\n if (S[i][j] == '0' && T[i][j] == '1') needs_place[i][j] = true;\n }\n }\n\n int VP = 5;\n cout << VP << endl;\n for (int i = 0; i < 4; i++) {\n cout << 0 << \" \" << 1 << endl;\n }\n int ix = 0, iy = 0;\n cout << ix << \" \" << iy << endl;\n\n vector operations;\n operations.push_back(\"..RRL.....\");\n operations.push_back(\"...R......\");\n\n int crx = 0, cry = 0;\n int fdir[4] = {0, 1, 2, 3};\n bool held[4] = {false};\n\n while (operations.size() < 100000) {\n bool can_act_now = false;\n for (int fi = 0; fi < 4; fi++) {\n int fx = crx + DELX[fdir[fi]];\n int fy = cry + DELY[fdir[fi]];\n if (fx < 0 || fx >= N || fy < 0 || fy >= N) continue;\n if ((!held[fi] && needs_pick[fx][fy]) || (held[fi] && needs_place[fx][fy])) {\n can_act_now = true;\n }\n }\n\n char mch = '.';\n int nx = crx, ny = cry;\n if (!can_act_now) {\n int best_d = INT_MAX;\n int tx = -1, ty = -1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (needs_pick[i][j]) {\n for (int fi = 0; fi < 4; fi++) {\n if (held[fi]) continue;\n int cx = i - DELX[fdir[fi]];\n int cy = j - DELY[fdir[fi]];\n if (cx >= 0 && cx < N && cy >= 0 && cy < N) {\n int dd = abs(cx - crx) + abs(cy - cry);\n if (dd < best_d) {\n best_d = dd;\n tx = cx; ty = cy;\n }\n }\n }\n }\n if (needs_place[i][j]) {\n for (int fi = 0; fi < 4; fi++) {\n if (!held[fi]) continue;\n int cx = i - DELX[fdir[fi]];\n int cy = j - DELY[fdir[fi]];\n if (cx >= 0 && cx < N && cy >= 0 && cy < N) {\n int dd = abs(cx - crx) + abs(cy - cry);\n if (dd < best_d) {\n best_d = dd;\n tx = cx; ty = cy;\n }\n }\n }\n }\n }\n }\n if (best_d == INT_MAX) {\n // stuck: try rotating a held finger to unlock new directions\n bool rotated = false;\n for (int fi = 0; fi < 4; fi++) {\n if (held[fi]) {\n string rstep(10, '.');\n rstep[fi + 1] = 'R';\n operations.push_back(rstep);\n fdir[fi] = (fdir[fi] + 1) % 4;\n rotated = true;\n break;\n }\n }\n if (!rotated) break;\n continue;\n }\n if (best_d > 0) {\n int dx = tx - crx;\n int dy = ty - cry;\n if (dx != 0) {\n mch = (dx > 0 ? 'D' : 'U');\n nx += (dx > 0 ? 1 : -1);\n } else if (dy != 0) {\n mch = (dy > 0 ? 'R' : 'L');\n ny += (dy > 0 ? 1 : -1);\n }\n }\n }\n\n if (nx < 0 || nx >= N || ny < 0 || ny >= N) {\n nx = crx; ny = cry; mch = '.';\n }\n\n bool wact[4] = {};\n for (int fi = 0; fi < 4; fi++) {\n int fx = nx + DELX[fdir[fi]];\n int fy = ny + DELY[fdir[fi]];\n if (fx < 0 || fx >= N || fy < 0 || fy >= N) continue;\n if (!held[fi] && needs_pick[fx][fy]) wact[fi] = true;\n else if (held[fi] && needs_place[fx][fy]) wact[fi] = true;\n }\n\n string step(10, '.');\n step[0] = mch;\n for (int fi = 0; fi < 4; fi++) {\n if (wact[fi]) step[6 + fi] = 'P';\n }\n operations.push_back(step);\n\n crx = nx;\n cry = ny;\n for (int fi = 0; fi < 4; fi++) {\n if (wact[fi]) {\n int fx = crx + DELX[fdir[fi]];\n int fy = cry + DELY[fdir[fi]];\n if (fx >= 0 && fx < N && fy >= 0 && fy < N) {\n if (!held[fi] && needs_pick[fx][fy]) {\n held[fi] = true;\n needs_pick[fx][fy] = false;\n } else if (held[fi] && needs_place[fx][fy]) {\n held[fi] = false;\n needs_place[fx][fy] = false;\n }\n }\n }\n }\n\n bool still_needed = false;\n for (int i = 0; i < N && !still_needed; i++) {\n for (int j = 0; j < N; j++) {\n if (needs_pick[i][j] || needs_place[i][j]) {\n still_needed = true;\n break;\n }\n }\n }\n if (!still_needed) {\n bool any_held = false;\n for (int i = 0; i < 4; i++) if (held[i]) any_held = true;\n if (!any_held) break;\n }\n }\n\n for (auto& op : operations) {\n cout << op << endl;\n }\n return 0;\n}","ahc039":"#include \nusing namespace std;\n\nstruct Point {\n int x, y, v;\n};\n\nint main() {\n int N;\n cin >> N;\n vector pts(2 * N);\n for (int i = 0; i < 2 * N; i++) {\n cin >> pts[i].x >> pts[i].y;\n pts[i].v = (i < N ? 1 : -1);\n }\n vector xs, ys;\n for (auto& p : pts) {\n xs.push_back(p.x);\n ys.push_back(p.y);\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n sort(ys.begin(), ys.end());\n ys.erase(unique(ys.begin(), ys.end()), ys.end());\n int kx = xs.size();\n int ky = ys.size();\n long long stride = ky + 1LL;\n vector ps((kx + 1LL) * stride, 0);\n for (auto& p : pts) {\n int rx = lower_bound(xs.begin(), xs.end(), p.x) - xs.begin() + 1;\n int ry = lower_bound(ys.begin(), ys.end(), p.y) - ys.begin() + 1;\n ps[rx * stride + ry] += p.v;\n }\n for (int i = 1; i <= kx; i++) {\n for (int j = 1; j <= ky; j++) {\n ps[i * stride + j] += ps[(i - 1) * stride + j] + ps[i * stride + (j - 1)] - ps[(i - 1) * stride + (j - 1)];\n }\n }\n auto getsum = [&](int x1, int y1, int x2, int y2) -> int {\n if (x1 > x2 || y1 > y2) return 0;\n x1 = max(x1, 0);\n y1 = max(y1, 0);\n x2 = min(x2, kx);\n y2 = min(y2, ky);\n long long v1 = ps[(long long)x2 * stride + y2];\n long long v2 = (x1 >= 1 ? ps[(long long)(x1 - 1) * stride + y2] : 0LL);\n long long v3 = (y1 >= 1 ? ps[(long long)x2 * stride + (y1 - 1)] : 0LL);\n long long v4 = ((x1 >= 1 && y1 >= 1) ? ps[(long long)(x1 - 1) * stride + (y1 - 1)] : 0LL);\n return (int)(v1 - v2 - v3 + v4);\n };\n // mackerel bb\n int m_minx = INT_MAX, m_maxx = INT_MIN, m_miny = INT_MAX, m_maxy = INT_MIN;\n for (int i = 0; i < N; i++) {\n m_minx = min(m_minx, pts[i].x);\n m_maxx = max(m_maxx, pts[i].x);\n m_miny = min(m_miny, pts[i].y);\n m_maxy = max(m_maxy, pts[i].y);\n }\n int lx_m = lower_bound(xs.begin(), xs.end(), m_minx) - xs.begin() + 1;\n int rx_m = lower_bound(xs.begin(), xs.end(), m_maxx) - xs.begin() + 1;\n int ly_m = lower_bound(ys.begin(), ys.end(), m_miny) - ys.begin() + 1;\n int ry_m = lower_bound(ys.begin(), ys.end(), m_maxy) - ys.begin() + 1;\n int best_score = getsum(lx_m, ly_m, rx_m, ry_m);\n int best_lx = lx_m, best_rx = rx_m, best_ly = ly_m, best_ry = ry_m;\n int S = 160;\n vector xcuts;\n int stepx = max(1, kx / S);\n for (int i = 0; i <= kx; i += stepx) xcuts.push_back(i);\n if (xcuts.back() != kx) xcuts.push_back(kx);\n vector ycuts;\n int stepy = max(1, ky / S);\n for (int i = 0; i <= ky; i += stepy) ycuts.push_back(i);\n if (ycuts.back() != ky) ycuts.push_back(ky);\n for (size_t pi = 0; pi < xcuts.size(); ++pi) {\n for (size_t qi = pi; qi < xcuts.size(); ++qi) {\n int lx_ = xcuts[pi] + 1;\n int rx_ = xcuts[qi];\n if (lx_ > rx_ || rx_ - lx_ < 0) continue;\n for (size_t pj = 0; pj < ycuts.size(); ++pj) {\n for (size_t qj = pj; qj < ycuts.size(); ++qj) {\n int ly_ = ycuts[pj] + 1;\n int ry_ = ycuts[qj];\n if (ly_ > ry_ || ry_ - ly_ < 1) continue;\n if (rx_ - lx_ < 1) continue;\n int s = getsum(lx_, ly_, rx_, ry_);\n if (s > best_score) {\n best_score = s;\n best_lx = lx_;\n best_rx = rx_;\n best_ly = ly_;\n best_ry = ry_;\n }\n }\n }\n }\n }\n // coordinate-wise local optimization\n for (int iter = 0; iter < 5; ++iter) {\n bool changed = false;\n // optimize lx\n for (int d = -40; d <= 40; ++d) {\n int nlx = best_lx + d;\n if (nlx < 1 || nlx > best_rx) continue;\n int ns = getsum(nlx, best_ly, best_rx, best_ry);\n if (ns > best_score) {\n best_lx = nlx;\n best_score = ns;\n changed = true;\n }\n }\n // optimize rx\n for (int d = -40; d <= 40; ++d) {\n int nrx = best_rx + d;\n if (nrx < best_lx || nrx > kx) continue;\n int ns = getsum(best_lx, best_ly, nrx, best_ry);\n if (ns > best_score) {\n best_rx = nrx;\n best_score = ns;\n changed = true;\n }\n }\n // optimize ly\n for (int d = -40; d <= 40; ++d) {\n int nly = best_ly + d;\n if (nly < 1 || nly > best_ry) continue;\n int ns = getsum(best_lx, nly, best_rx, best_ry);\n if (ns > best_score) {\n best_ly = nly;\n best_score = ns;\n changed = true;\n }\n }\n // optimize ry\n for (int d = -40; d <= 40; ++d) {\n int nry = best_ry + d;\n if (nry < best_ly || nry > ky) continue;\n int ns = getsum(best_lx, best_ly, best_rx, nry);\n if (ns > best_score) {\n best_ry = nry;\n best_score = ns;\n changed = true;\n }\n }\n if (!changed && iter > 0) break;\n }\n if (best_score < 1) {\n auto p = pts[0];\n int xx = p.x, yy = p.y;\n int pl = max(0, xx - 1), pr = min(100000, xx + 1);\n int pb = max(0, yy - 1), pt = min(100000, yy + 1);\n cout << 4 << endl;\n cout << pl << \" \" << pb << endl;\n cout << pr << \" \" << pb << endl;\n cout << pr << \" \" << pt << endl;\n cout << pl << \" \" << pt << endl;\n return 0;\n }\n int lx = best_lx, rx = best_rx, ly = best_ly, ry = best_ry;\n int minx_ = (lx - 1 >= 0 && lx - 1 < kx ? xs[lx - 1] : 0);\n int maxx_ = (rx - 1 >= 0 && rx - 1 < kx ? xs[rx - 1] : 100000);\n int miny_ = (ly - 1 >= 0 && ly - 1 < ky ? ys[ly - 1] : 0);\n int maxy_ = (ry - 1 >= 0 && ry - 1 < ky ? ys[ry - 1] : 100000);\n int pleft = (lx >= 2 ? xs[lx - 2] + 1 : 0);\n int pright = (rx < kx ? xs[rx] - 1 : 100000);\n int pbot = (ly >= 2 ? ys[ly - 2] + 1 : 0);\n int ptop = (ry < ky ? ys[ry] - 1 : 100000);\n if (pleft >= pright || pbot >= ptop) {\n pleft = minx_ - 5; if (pleft < 0) pleft = 0;\n pright = maxx_ + 5; if (pright > 100000) pright = 100000;\n pbot = miny_ - 5; if (pbot < 0) pbot = 0;\n ptop = maxy_ + 5; if (ptop > 100000) ptop = 100000;\n if (pleft >= pright) {\n pleft = minx_;\n pright = maxx_ + 1; if (pright > 100000) pright = 100000;\n }\n if (pbot >= ptop) {\n pbot = miny_;\n ptop = maxy_ + 1; if (ptop > 100000) ptop = 100000;\n }\n }\n if (pleft == pright) {\n if (pright < 100000) pright++;\n else if (pleft > 0) pleft--;\n }\n if (pbot == ptop) {\n if (ptop < 100000) ptop++;\n else if (pbot > 0) pbot--;\n }\n cout << 4 << endl;\n cout << pleft << \" \" << pbot << endl;\n cout << pright << \" \" << pbot << endl;\n cout << pright << \" \" << ptop << endl;\n cout << pleft << \" \" << ptop << endl;\n return 0;\n}","ahc040":"#include \nusing namespace std;\nusing ll = long long;\n\nstruct RectPos {\n ll x, y, w, h;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N, T;\n ll sigma;\n cin >> N >> T >> sigma;\n vector WW(N), HH(N);\n for(int i = 0; i < N; i++) {\n cin >> WW[i] >> HH[i];\n }\n mt19937 rng(1234LL);\n vector>> cands;\n auto add_special = [&](bool is_row) {\n vector> acts;\n for(int i = 0; i < N; i++) {\n ll a = WW[i], b = HH[i];\n int r = is_row ? (a >= b ? 0 : 1) : (a <= b ? 0 : 1);\n char d = is_row ? 'L' : 'U';\n acts.emplace_back(i, r, d, -1);\n }\n cands.push_back(acts);\n };\n add_special(true);\n add_special(false);\n ll best_meas = LLONG_MAX;\n int best_idx = 0;\n const int MAX_VARIANTS = 150;\n for(int t = 0; t < T; t++) {\n vector> current_acts;\n int current_cand_idx = -1;\n if(t < 2) {\n current_acts = cands[t];\n current_cand_idx = t;\n } else if((int)cands.size() < MAX_VARIANTS) {\n rng.seed(1234ULL + (unsigned long long)cands.size() * 123457ULL);\n vector> acts;\n vector pos(N);\n vector active;\n ll cW = 0, cH = 0;\n for(int i = 0; i < N; i++) {\n ll wi = WW[i], hi = HH[i];\n ll best_noisy = LLONG_MAX / 2;\n int br = -1, bbv = -2;\n char bd = ' ';\n ll bpx = -1, bpy = -1;\n for(int r = 0; r < 2; r++) {\n ll cw = r ? hi : wi;\n ll ch = r ? wi : hi;\n int bstart = max(-1, i - 50);\n for(int bb = bstart; bb < i; bb++) {\n int b = bb;\n for(char d : {'U', 'L'}) {\n ll px = 0, py = 0;\n if(d == 'U') {\n px = (b == -1 ? 0 : pos[b].x + pos[b].w);\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n } else {\n py = (b == -1 ? 0 : pos[b].y + pos[b].h);\n ll mr = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(py, re.y) < min(py + ch, re.y + re.h)) {\n mr = max(mr, re.x + re.w);\n }\n }\n px = mr;\n }\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) {\n ol = true;\n break;\n }\n }\n if(ol) continue;\n ll nW = max(cW, px + cw);\n ll nH = max(cH, py + ch);\n ll sc = nW + nH + llabs(nW - nH) / 5;\n bool is_pure = (cands.size() % 4 == 0);\n ll noisy_sc = sc + (is_pure ? 0LL : (rng() % 800));\n if(noisy_sc < best_noisy) {\n best_noisy = noisy_sc;\n br = r;\n bd = d;\n bbv = b;\n bpx = px;\n bpy = py;\n }\n }\n }\n }\n if(br != -1) {\n ll cw = br ? HH[i] : WW[i];\n ll ch = br ? WW[i] : HH[i];\n pos[i].x = bpx;\n pos[i].y = bpy;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, bpx + cw);\n cH = max(cH, bpy + ch);\n acts.emplace_back(i, br, bd, bbv);\n } else {\n int r = 0; char d = 'U'; int b = -1;\n ll cw = WW[i]; ll ch = HH[i];\n ll px = 0, py = 0;\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) ol = true;\n }\n if(!ol) {\n pos[i].x = px;\n pos[i].y = py;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, px + cw);\n cH = max(cH, py + ch);\n acts.emplace_back(i, r, d, b);\n }\n }\n }\n cands.push_back(acts);\n current_acts = std::move(acts);\n current_cand_idx = (int)cands.size() - 1;\n } else {\n current_cand_idx = best_idx;\n current_acts = cands[best_idx];\n }\n cout << current_acts.size() << '\\n';\n for(auto [p, r, d, b] : current_acts) {\n cout << p << ' ' << r << ' ' << d << ' ' << b << '\\n';\n }\n cout.flush();\n ll Wp, Hp;\n cin >> Wp >> Hp;\n ll meas = Wp + Hp;\n if(meas < best_meas) {\n best_meas = meas;\n best_idx = current_cand_idx;\n }\n }\n return 0;\n}","ahc041":"#include \nusing namespace std;\n\nint main() {\n int N, M, H_;\n cin >> N >> M >> H_;\n int H = H_;\n vector A(N);\n for (auto& a : A) cin >> a;\n vector> g(N);\n for (int i = 0; i < M; i++) {\n int u, v;\n cin >> u >> v;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n auto count_unc = [&](int c, const vector& cov) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n int ct = cov[c] ? 0 : 1;\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) ct++;\n }\n }\n }\n }\n return ct;\n };\n auto mark_ball = [&](int c, vector& cov, int& uncc) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n if (!cov[c]) {\n cov[c] = true;\n uncc--;\n }\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) {\n cov[v] = true;\n uncc--;\n }\n }\n }\n }\n }\n };\n vector cov(N, false);\n int uncc = N;\n vector S_greedy;\n while (uncc > 0) {\n int bct = -1, bc = -1;\n for (int c = 0; c < N; c++) {\n int ct = count_unc(c, cov);\n if (ct > bct) {\n bct = ct;\n bc = c;\n }\n }\n if (bct <= 0) break;\n S_greedy.push_back(bc);\n mark_ball(bc, cov, uncc);\n }\n auto get_farthest_initial = [&]() -> vector {\n vector cs;\n vector d(N, 1000000);\n while (true) {\n int md = -1, fv = -1;\n for (int i = 0; i < N; i++) {\n if (d[i] > md) {\n md = d[i];\n fv = i;\n }\n }\n if (md <= H) break;\n cs.push_back(fv);\n vector nd(N, 1000000);\n queue q;\n for (int s : cs) {\n nd[s] = 0;\n q.push(s);\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (nd[v] > nd[u] + 1) {\n nd[v] = nd[u] + 1;\n q.push(v);\n }\n }\n }\n d = nd;\n }\n return cs;\n };\n vector S_far = get_farthest_initial();\n auto get_eval = [&](const vector& cs) -> long long {\n if (cs.empty() && N > 0) return -1e18;\n vector d(N, -1);\n queue q;\n for (int s : cs) {\n if (d[s] == -1) {\n d[s] = 0;\n q.push(s);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) q.push(v);\n }\n }\n }\n long long sm = 0;\n for (int i = 0; i < N; i++) {\n if (d[i] < 0 || d[i] > H) return -1e18;\n sm += 1LL * d[i] * A[i];\n }\n return sm;\n };\n long long sc_greedy = get_eval(S_greedy);\n long long sc_far = get_eval(S_far);\n vector S = (sc_far > sc_greedy ? S_far : S_greedy);\n vector> nears(N);\n for (int i = 0; i < N; i++) {\n for (int j = i + 1; j < N; j++) {\n double dist = hypot(X[i] - X[j], Y[i] - Y[j]);\n if (dist <= 180.0) {\n nears[i].push_back(j);\n nears[j].push_back(i);\n }\n }\n }\n int sumA = 0;\n for (int a : A) sumA += a;\n int avgA = sumA / N;\n vector lowA_nodes;\n for (int i = 0; i < N; i++) if (A[i] <= avgA) lowA_nodes.push_back(i);\n mt19937 rng(42);\n vector best_S = S;\n long long best_score = get_eval(S);\n vector curr_S = S;\n long long curr_sc = best_score;\n int n_iters = 30000;\n for (int it = 0; it < n_iters; it++) {\n vector news = curr_S;\n int movt = rng() % 10;\n bool skipped = true;\n if (movt < 6 && !news.empty()) {\n int idx = rng() % news.size();\n int old = news[idx];\n int newc;\n if (rng() % 3 == 0 && !lowA_nodes.empty()) {\n newc = lowA_nodes[rng() % lowA_nodes.size()];\n } else if (nears[old].empty() || (rng() % 5 == 0)) {\n newc = rng() % N;\n } else {\n int k = rng() % nears[old].size();\n newc = nears[old][k];\n }\n bool isin = false;\n for (int s : news) if (s == newc) {\n isin = true;\n break;\n }\n if (!isin) {\n news[idx] = newc;\n skipped = false;\n }\n } else if (movt < 8 && news.size() >= 2) {\n int idx = rng() % news.size();\n news.erase(news.begin() + idx);\n skipped = false;\n } else if (!news.empty() && news.size() < 20) {\n int newc;\n if (rng() % 2 == 0 && !lowA_nodes.empty()) {\n newc = lowA_nodes[rng() % lowA_nodes.size()];\n } else {\n newc = rng() % N;\n }\n bool isin = false;\n for (int s : news) if (s == newc) isin = true;\n if (!isin) {\n news.push_back(newc);\n skipped = false;\n }\n }\n if (skipped) continue;\n long long nsc = get_eval(news);\n if (nsc > -1e17) {\n double del = (double)(nsc - curr_sc);\n double T = 200.0 * pow(0.9998, it);\n if (T < 5.0) T = 5.0;\n bool accept = (del >= 0);\n if (!accept) {\n double prob = exp(del / T);\n if ((double)rng() / (double)rng.max() < prob) accept = true;\n }\n if (accept) {\n curr_S = news;\n curr_sc = nsc;\n if (nsc > best_score) {\n best_score = nsc;\n best_S = news;\n }\n }\n }\n }\n bool improved = true;\n int max_passes = 4;\n int pass_cnt = 0;\n while (improved && pass_cnt < max_passes) {\n pass_cnt++;\n improved = false;\n for (size_t i = 0; i < best_S.size(); i++) {\n vector tmp = best_S;\n tmp.erase(tmp.begin() + i);\n long long sc = get_eval(tmp);\n if (sc > best_score) {\n best_score = sc;\n best_S = tmp;\n improved = true;\n break;\n }\n }\n if (improved) continue;\n for (size_t i = 0; i < best_S.size(); i++) {\n int oldc = best_S[i];\n vector cands;\n if (!nears[oldc].empty()) {\n cands = nears[oldc];\n } else {\n for (int j = 0; j < 30; j++) cands.push_back(rng() % N);\n }\n for (int j = 0; j < 20; j++) cands.push_back(rng() % N);\n long long best_del = 0;\n int best_new = oldc;\n for (int nc : cands) {\n bool isin = false;\n for (int s : best_S) if (s == nc && nc != oldc) {\n isin = true;\n break;\n }\n if (isin) continue;\n vector tmp = best_S;\n tmp[i] = nc;\n long long nsc = get_eval(tmp);\n if (nsc > best_score && (nsc - best_score > best_del)) {\n best_del = nsc - best_score;\n best_new = nc;\n }\n }\n if (best_del > 0) {\n best_S[i] = best_new;\n best_score += best_del;\n improved = true;\n break;\n }\n }\n }\n auto get_par = [&](const vector& cs) {\n vector parent(N, -1);\n vector dist(N, -1);\n queue q;\n for (int c : cs) {\n if (dist[c] == -1) {\n dist[c] = 0;\n parent[c] = -1;\n q.push(c);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (dist[v] == -1) {\n dist[v] = dist[u] + 1;\n parent[v] = u;\n if (dist[v] <= H) q.push(v);\n }\n }\n }\n return parent;\n };\n vector p = get_par(best_S);\n for (int i = 0; i < N; i++) {\n cout << p[i];\n if (i + 1 < N) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc042":"#include \nusing namespace std;\n\nbool has_free_dir(int r, int c, const vector& bd, int N) {\n bool free_u = true;\n for(int i = 0; i < r; i++) if(bd[i][c] == 'o') {free_u = false; break;}\n if(free_u) return true;\n bool free_d = true;\n for(int i = r + 1; i < N; i++) if(bd[i][c] == 'o') {free_d = false; break;}\n if(free_d) return true;\n bool free_l = true;\n for(int j = 0; j < c; j++) if(bd[r][j] == 'o') {free_l = false; break;}\n if(free_l) return true;\n bool free_r = true;\n for(int j = c + 1; j < N; j++) if(bd[r][j] == 'o') {free_r = false; break;}\n return free_r;\n}\n\nvoid apply_shift(char d, int p, vector& bd, int* ocnt, int N) {\n char removed_c = '.';\n if(d == 'U') {\n removed_c = bd[0][p];\n for(int r = 0; r < N - 1; r++) bd[r][p] = bd[r + 1][p];\n bd[N - 1][p] = '.';\n } else if(d == 'D') {\n removed_c = bd[N - 1][p];\n for(int r = N - 1; r > 0; r--) bd[r][p] = bd[r - 1][p];\n bd[0][p] = '.';\n } else if(d == 'L') {\n removed_c = bd[p][0];\n for(int c = 0; c < N - 1; c++) bd[p][c] = bd[p][c + 1];\n bd[p][N - 1] = '.';\n } else if(d == 'R') {\n removed_c = bd[p][N - 1];\n for(int c = N - 1; c > 0; c--) bd[p][c] = bd[p][c - 1];\n bd[p][0] = '.';\n }\n if(ocnt && removed_c == 'x') (*ocnt)--;\n}\n\nint main() {\n int N;\n cin >> N;\n vector board(N);\n for(auto &s : board) cin >> s;\n vector cur_board = board;\n vector> moves;\n int oni_left = 0;\n for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) if(cur_board[i][j] == 'x') oni_left++;\n int M = oni_left;\n auto get_reverse = [](char d) -> char {\n if(d == 'U') return 'D';\n if(d == 'D') return 'U';\n if(d == 'L') return 'R';\n if(d == 'R') return 'L';\n return ' ';\n };\n while(oni_left > 0 && moves.size() < 1600) {\n double best_rat = -1.0;\n char best_d = ' ';\n int best_p = -1;\n int best_k = 0;\n // up\n for(int j = 0; j < N; j++) {\n int mk = N;\n for(int r = 0; r < N; r++) if(cur_board[r][j] == 'o') {mk = r; break;}\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n for(int r = 0; r < k; r++) if(cur_board[r][j] == 'x') nx++;\n if(nx > 0 && (double)nx / k > best_rat) {\n best_rat = (double)nx / k;\n best_d = 'U';\n best_p = j;\n best_k = k;\n }\n }\n }\n // down\n for(int j = 0; j < N; j++) {\n int mk = 0;\n for(int r = N - 1; r >= 0; r--) {\n if(cur_board[r][j] == 'o') break;\n mk++;\n }\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n for(int r = N - k; r < N; r++) if(cur_board[r][j] == 'x') nx++;\n if(nx > 0 && (double)nx / k > best_rat) {\n best_rat = (double)nx / k;\n best_d = 'D';\n best_p = j;\n best_k = k;\n }\n }\n }\n // left\n for(int i = 0; i < N; i++) {\n int mk = N;\n for(int c = 0; c < N; c++) if(cur_board[i][c] == 'o') {mk = c; break;}\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n for(int c = 0; c < k; c++) if(cur_board[i][c] == 'x') nx++;\n if(nx > 0 && (double)nx / k > best_rat) {\n best_rat = (double)nx / k;\n best_d = 'L';\n best_p = i;\n best_k = k;\n }\n }\n }\n // right\n for(int i = 0; i < N; i++) {\n int mk = 0;\n for(int c = N - 1; c >= 0; c--) {\n if(cur_board[i][c] == 'o') break;\n mk++;\n }\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n for(int c = N - k; c < N; c++) if(cur_board[i][c] == 'x') nx++;\n if(nx > 0 && (double)nx / k > best_rat) {\n best_rat = (double)nx / k;\n best_d = 'R';\n best_p = i;\n best_k = k;\n }\n }\n }\n if(best_rat < 0) break;\n char fwd = best_d;\n char rev = get_reverse(fwd);\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < best_k; t++) {\n apply_shift(fwd, best_p, tmp, &dum, N);\n }\n bool can_non_restore = true;\n for(int i = 0; can_non_restore && i < N; i++) {\n for(int j = 0; j < N; j++) {\n if(tmp[i][j] == 'x') {\n if(!has_free_dir(i, j, tmp, N)) {\n can_non_restore = false;\n break;\n }\n }\n }\n }\n if(can_non_restore) {\n for(int t = 0; t < best_k; t++) {\n apply_shift(fwd, best_p, cur_board, &oni_left, N);\n moves.emplace_back(fwd, best_p);\n }\n } else {\n for(int t = 0; t < best_k; t++) {\n apply_shift(fwd, best_p, cur_board, &oni_left, N);\n moves.emplace_back(fwd, best_p);\n }\n for(int t = 0; t < best_k; t++) {\n apply_shift(rev, best_p, cur_board, &oni_left, N);\n moves.emplace_back(rev, best_p);\n }\n }\n }\n for(auto [d, p] : moves) {\n cout << d << \" \" << p << endl;\n }\n return 0;\n}","ahc044":"#include \nusing namespace std;\nusing ll = long long;\n\nvector simulate(const vector& a, const vector& b, int N, ll L) {\n vector cnt(N, 0);\n int cur = 0;\n for (ll w = 0; w < L; w++) {\n cnt[cur]++;\n if (w + 1 == L) break;\n ll t = cnt[cur];\n int nxt = (t % 2 == 1 ? a[cur] : b[cur]);\n cur = nxt;\n }\n return cnt;\n}\n\nll calc_error(const vector& cnt, const vector& T) {\n ll e = 0;\n for (size_t i = 0; i < T.size(); i++) e += abs(cnt[i] - T[i]);\n return e;\n}\n\nint main() {\n int N;\n ll L;\n cin >> N >> L;\n vector T(N);\n for (auto& x : T) cin >> x;\n\n vector> emp(N);\n for (int i = 0; i < N; i++) emp[i] = {T[i], i};\n sort(emp.rbegin(), emp.rend());\n\n vector> candidates;\n for (int k = 1; k <= N; k++) {\n for (int d = 0; d <= k; d++) {\n bool zero_in = false;\n for (int j = 0; j < k; j++) if (emp[j].second == 0) zero_in = true;\n double vis_S = zero_in ? (double)L : (double)L - 1.0;\n double denom = k + d;\n double r = vis_S / denom;\n vector ass(N, 0);\n for (int j = 0; j < k; j++) {\n int id = emp[j].second;\n ll tapp = round((j < d ? 2LL : 1LL) * r);\n ass[id] = tapp;\n }\n if (!zero_in) ass[0] = 1;\n ll e = 0;\n for (int i = 0; i < N; i++) e += abs(ass[i] - T[i]);\n candidates.emplace_back(e, k, d);\n }\n }\n sort(candidates.begin(), candidates.end());\n\n ll best_e = LLONG_MAX;\n vector best_a(N), best_b(N);\n\n size_t max_cand = min(60UL, candidates.size());\n for (size_t ci = 0; ci < max_cand; ci++) {\n auto [_, k, d] = candidates[ci];\n vector is_dou(N, 0), is_in(N, 0);\n for (int j = 0; j < k; j++) {\n is_in[emp[j].second] = 1;\n if (j < d) is_dou[emp[j].second] = 1;\n }\n vector S;\n for (int j = 0; j < k; j++) S.push_back(emp[j].second);\n\n vector> orders = {S};\n auto idord = S; sort(idord.begin(), idord.end()); orders.push_back(idord);\n auto ascd = S; reverse(ascd.begin(), ascd.end()); orders.push_back(ascd);\n\n for (auto cyc : orders) {\n if (k > 0 && cyc.empty()) continue;\n vector cura(N, 0), curb(N, 0);\n int ent = k > 0 ? cyc[0] : 0;\n for (int i = 0; i < N; i++) if (!is_in[i]) cura[i] = curb[i] = ent;\n for (size_t i = 0; i < cyc.size(); i++) {\n int u = cyc[i];\n int nxt = cyc[(i + 1) % cyc.size()];\n if (is_dou[u]) {\n cura[u] = u;\n curb[u] = nxt;\n } else {\n cura[u] = nxt;\n curb[u] = nxt;\n }\n }\n if (k == 0) for (int i = 0; i < N; i++) cura[i] = curb[i] = 0;\n\n auto cnt = simulate(cura, curb, N, L);\n ll e = calc_error(cnt, T);\n if (e < best_e) {\n best_e = e;\n best_a = cura;\n best_b = curb;\n }\n }\n }\n\n mt19937 rng(12345);\n int n_local = 250;\n for (int trial = 0; trial < n_local; trial++) {\n vector cura = best_a, curb = best_b;\n uniform_int_distribution uid(0, N - 1);\n int u = uid(rng);\n if (rng() % 10 == 0 && cura[u] == u) {\n curb[u] = uid(rng);\n } else {\n bool change_a = (rng() % 2 == 0);\n int new_t = uid(rng);\n if (change_a) cura[u] = new_t;\n else curb[u] = new_t;\n }\n\n auto cnt = simulate(cura, curb, N, L);\n ll newe = calc_error(cnt, T);\n if (newe < best_e) {\n best_e = newe;\n best_a = cura;\n best_b = curb;\n }\n }\n\n for (int i = 0; i < N; i++) {\n cout << best_a[i] << \" \" << best_b[i] << endl;\n }\n}","ahc045":"#include \nusing namespace std;\n\nint main() {\n int N, M, maxQ, L, W;\n cin >> N >> M >> maxQ >> L >> W;\n vector G(M);\n for (auto &x : G) cin >> x;\n vector cx(N), cy(N);\n for (int i = 0; i < N; i++) {\n int lx, rx, ly, ry;\n cin >> lx >> rx >> ly >> ry;\n cx[i] = (lx + rx) / 2.0;\n cy[i] = (ly + ry) / 2.0;\n }\n vector seeds(M);\n vector min_d(N, 1e18);\n seeds[0] = 0;\n for (int j = 0; j < N; j++) {\n min_d[j] = hypot(cx[0] - cx[j], cy[0] - cy[j]);\n }\n min_d[0] = -1.0;\n for (int k = 1; k < M; k++) {\n double best_md = -1.0;\n int best_j = -1;\n for (int j = 0; j < N; j++) {\n if (min_d[j] > best_md) {\n best_md = min_d[j];\n best_j = j;\n }\n }\n seeds[k] = best_j;\n for (int j = 0; j < N; j++) {\n double d = hypot(cx[best_j] - cx[j], cy[best_j] - cy[j]);\n if (d < min_d[j]) min_d[j] = d;\n }\n }\n vector> clusters(M);\n vector group_id(N, -1);\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n clusters[k].push_back(s);\n group_id[s] = k;\n }\n vector> min_dist_cluster(M, vector(N, 1e18));\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n for (int j = 0; j < N; j++) {\n min_dist_cluster[k][j] = hypot(cx[s] - cx[j], cy[s] - cy[j]);\n }\n }\n vector clus_size(M, 1);\n vector used(N, false);\n for (int k = 0; k < M; k++) used[seeds[k]] = true;\n for (int toadd = 0; toadd < N - M; toadd++) {\n double bd = 1e18;\n int bc = -1, bg = -1;\n for (int j = 0; j < N; j++) {\n if (!used[j]) {\n for (int k = 0; k < M; k++) {\n if (clus_size[k] < G[k] && min_dist_cluster[k][j] < bd) {\n bd = min_dist_cluster[k][j];\n bc = j;\n bg = k;\n }\n }\n }\n }\n used[bc] = true;\n clusters[bg].push_back(bc);\n group_id[bc] = bg;\n clus_size[bg]++;\n for (int j = 0; j < N; j++) {\n if (!used[j]) {\n double nd = hypot(cx[bc] - cx[j], cy[bc] - cy[j]);\n if (nd < min_dist_cluster[bg][j]) min_dist_cluster[bg][j] = nd;\n }\n }\n }\n vector>> queries_per_group(M);\n for (int k = 0; k < M; k++) {\n vector cits = clusters[k];\n int gs = cits.size();\n if (gs <= 2) continue;\n sort(cits.begin(), cits.end(), [&](int a, int b) {\n if (abs(cx[a] - cx[b]) > 1e-9) return cx[a] < cx[b];\n if (abs(cy[a] - cy[b]) > 1e-9) return cy[a] < cy[b];\n return a < b;\n });\n clusters[k] = cits;\n if (gs <= L) {\n queries_per_group[k].push_back(cits);\n } else {\n int step = L - 1;\n int maxs = gs - L;\n vector starts;\n for (int s = 0; s <= maxs; s += step) {\n starts.push_back(s);\n }\n if (!starts.empty() && starts.back() < maxs) {\n starts.push_back(maxs);\n } else if (starts.empty() && maxs >= 0) {\n starts.push_back(maxs);\n }\n for (int s : starts) {\n vector sub(cits.begin() + s, cits.begin() + s + L);\n queries_per_group[k].push_back(sub);\n }\n }\n }\n vector>> mst_edges(M);\n for (int k = 0; k < M; k++) {\n for (auto &sub : queries_per_group[k]) {\n int ls = sub.size();\n cout << \"? \" << ls;\n for (int c : sub) cout << \" \" << c;\n cout << endl;\n for (int e = 0; e < ls - 1; e++) {\n int a, b;\n cin >> a >> b;\n mst_edges[k].emplace_back(a, b);\n }\n }\n }\n cout << \"!\" << endl;\n for (int k = 0; k < M; k++) {\n auto &cits = clusters[k];\n int gs = cits.size();\n for (int i = 0; i < gs; i++) {\n if (i > 0) cout << \" \";\n cout << cits[i];\n }\n cout << endl;\n if (gs == 1) {\n continue;\n } else if (gs == 2) {\n cout << cits[0] << \" \" << cits[1] << endl;\n continue;\n } else {\n vector> cands;\n set> edge_set;\n for (auto [aa, bb] : mst_edges[k]) {\n int u = min(aa, bb), v = max(aa, bb);\n if (edge_set.count({u, v})) continue;\n edge_set.insert({u, v});\n double dd = hypot(cx[u] - cx[v], cy[u] - cy[v]);\n cands.emplace_back(dd, u, v);\n }\n sort(cands.begin(), cands.end());\n vector parent(N);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto &self, int x) -> int {\n return parent[x] == x ? x : parent[x] = self(self, parent[x]);\n };\n vector> selected;\n for (auto [d, u, v] : cands) {\n int pu = find(find, u), pv = find(find, v);\n if (pu != pv) {\n parent[pu] = pv;\n selected.emplace_back(u, v);\n if ((int)selected.size() == gs - 1) break;\n }\n }\n if ((int)selected.size() < gs - 1) {\n vector> more;\n for (int i = 0; i < gs; i++) {\n for (int j = i + 1; j < gs; j++) {\n int u = cits[i], v = cits[j];\n int mu = min(u, v), mv = max(u, v);\n if (edge_set.count({mu, mv})) continue;\n double dd = hypot(cx[u] - cx[v], cy[u] - cy[v]);\n more.emplace_back(dd, mu, mv);\n }\n }\n sort(more.begin(), more.end());\n for (auto [d, u, v] : more) {\n int pu = find(find, u), pv = find(find, v);\n if (pu != pv) {\n parent[pu] = pv;\n selected.emplace_back(u, v);\n if ((int)selected.size() == gs - 1) break;\n }\n }\n }\n for (auto [a, b] : selected) {\n cout << a << \" \" << b << endl;\n }\n }\n }\n return 0;\n}","ahc046":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> points(M);\n for (auto& p : points) {\n cin >> p.first >> p.second;\n }\n vector> sequence;\n pair current = points[0];\n int di[4] = {-1, 1, 0, 0};\n int dj[4] = {0, 0, -1, 1};\n char dch[4] = {'U', 'D', 'L', 'R'};\n for (int t = 1; t < M; t++) {\n int gi = points[t].first;\n int gj = points[t].second;\n vector> dist(N, vector(N, -1));\n vector> pre(N, vector(N, -1));\n vector> ac(N, vector(N, ' '));\n vector> dc(N, vector(N, ' '));\n queue> q;\n int si = current.first;\n int sj = current.second;\n dist[si][sj] = 0;\n q.push({si, sj});\n while (!q.empty()) {\n auto [i, j] = q.front();\n q.pop();\n for (int tp = 0; tp < 2; tp++) {\n for (int d = 0; d < 4; d++) {\n int ni, nj;\n if (tp == 0) {\n ni = i + di[d];\n nj = j + dj[d];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N) continue;\n } else {\n int ci = i, cj = j;\n while (true) {\n int ti = ci + di[d];\n int tj = cj + dj[d];\n if (ti < 0 || ti >= N || tj < 0 || tj >= N) break;\n ci = ti;\n cj = tj;\n }\n ni = ci;\n nj = cj;\n }\n if (dist[ni][nj] != -1) continue;\n dist[ni][nj] = dist[i][j] + 1;\n pre[ni][nj] = i * N + j;\n ac[ni][nj] = (tp == 0 ? 'M' : 'S');\n dc[ni][nj] = dch[d];\n q.push({ni, nj});\n }\n }\n }\n vector> this_path;\n int ci = gi, cj = gj;\n while (dist[ci][cj] > 0) {\n this_path.emplace_back(ac[ci][cj], dc[ci][cj]);\n int p = pre[ci][cj];\n ci = p / N;\n cj = p % N;\n }\n reverse(this_path.begin(), this_path.end());\n for (auto& p : this_path) sequence.push_back(p);\n current = {gi, gj};\n }\n for (auto& p : sequence) {\n cout << p.first << \" \" << p.second << endl;\n }\n}"},"8":{"ahc001":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int n;\n cin >> n;\n vector x(n), y(n), r(n);\n for (int i = 0; i < n; i++) {\n cin >> x[i] >> y[i] >> r[i];\n }\n vector la(n), lb(n), lc(n), ld(n);\n auto rec = [&](auto&& self, vector ids, ll xl, ll xr, ll yl, ll yr) -> void {\n int m = ids.size();\n if (m == 0) return;\n if (m == 1) {\n int i = ids[0];\n la[i] = xl; lb[i] = yl; lc[i] = xr; ld[i] = yr;\n return;\n }\n ll carea = (xr - xl) * (yr - yl);\n ll tr = 0;\n for (int i : ids) tr += r[i];\n double min_dev = 1e18;\n int best_d = -1; // 0:vert 1:horiz\n int best_kk = -1;\n ll best_cutt = -1;\n vector best_sids;\n // vertical\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return x[i] < x[j] || (x[i] == x[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll hy = yr - yl;\n if (hy == 0) continue;\n double id_cut = xl + id_area / hy;\n ll maxlx = -1;\n for (int j = 0; j < k; j++) maxlx = max(maxlx, x[sids[j]]);\n ll minrx = 10001;\n for (int j = k; j < m; j++) minrx = min(minrx, x[sids[j]]);\n ll lo = max(xl + 1, maxlx + 1);\n ll hi = min(xr, minrx);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - xl) * (double)hy;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 0;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n // horizontal\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return y[i] < y[j] || (y[i] == y[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll wx = xr - xl;\n if (wx == 0) continue;\n double id_cut = yl + id_area / wx;\n ll maxly = -1;\n for (int j = 0; j < k; j++) maxly = max(maxly, y[sids[j]]);\n ll minry = 10001;\n for (int j = k; j < m; j++) minry = min(minry, y[sids[j]]);\n ll lo = max(yl + 1, maxly + 1);\n ll hi = min(yr, minry);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - yl) * (double)wx;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 1;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n if (best_d == -1) {\n for (int ii : ids) {\n int i = ii;\n la[i] = x[i]; lb[i] = y[i]; lc[i] = x[i] + 1; ld[i] = y[i] + 1;\n }\n return;\n }\n vector left, rightt;\n for (int j = 0; j < best_kk; j++) left.push_back(best_sids[j]);\n for (int j = best_kk; j < m; j++) rightt.push_back(best_sids[j]);\n if (best_d == 0) {\n ll cut = best_cutt;\n self(self, left, xl, cut, yl, yr);\n self(self, rightt, cut, xr, yl, yr);\n } else {\n ll cut = best_cutt;\n self(self, left, xl, xr, yl, cut);\n self(self, rightt, xl, xr, cut, yr);\n }\n };\n vector all(n);\n iota(all.begin(), all.end(), 0);\n rec(rec, all, 0LL, 10000LL, 0LL, 10000LL);\n // post-process 1: optimize size within allocated rect\n for (int i = 0; i < n; i++) {\n ll xl = la[i], xr = lc[i], yl = lb[i], yr = ld[i];\n ll W = xr - xl;\n ll H = yr - yl;\n ll xi = x[i], yi = y[i];\n ll lroom = xi - xl;\n ll rroom = xr - xi - 1;\n ll broom = yi - yl;\n ll troom = yr - yi - 1;\n auto getp_local = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n double bp = getp_local(W * H, r[i]);\n ll bw = W, bh = H;\n for (ll w = 1; w <= W; w++) {\n double idh = r[i] * 1.0 / w;\n ll hround = (ll)round(idh);\n for (ll dh = -1; dh <= 1; dh++) {\n ll h = hround + dh;\n if (h < 1 || h > H) continue;\n ll s = w * h;\n double pv = getp_local(s, r[i]);\n if (pv > bp) {\n bp = pv;\n bw = w;\n bh = h;\n }\n }\n }\n if (bw != W || bh != H) {\n ll wl_min = max(0LL, bw - 1 - rroom);\n ll wl_max = min(lroom, bw - 1);\n ll wl = (wl_min + wl_max) / 2;\n ll new_a = xi - wl;\n ll new_c = new_a + bw;\n ll hb_min = max(0LL, bh - 1 - troom);\n ll hb_max = min(broom, bh - 1);\n ll hb = (hb_min + hb_max) / 2;\n ll new_b = yi - hb;\n ll new_d = new_b + bh;\n la[i] = new_a;\n lb[i] = new_b;\n lc[i] = new_c;\n ld[i] = new_d;\n }\n }\n // post-process 2: greedy expansion into free space\n auto getp2 = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n bool improved = true;\n int iters = 0;\n while (improved && iters < 5000) {\n improved = false;\n iters++;\n double max_imp = 0.0;\n int best_i = -1;\n int best_dir = -1; // 0:left(a--), 1:right(c++), 2:bottom(b--), 3:top(d++)\n ll best_pos = -1;\n for (int i = 0; i < n; i++) {\n ll curs = (lc[i] - la[i]) * (ld[i] - lb[i]);\n if (curs >= r[i]) continue;\n double curp = getp2(curs, r[i]);\n ll cur_la = la[i], cur_lb = lb[i], cur_lc = lc[i], cur_ld = ld[i];\n ll curw = cur_lc - cur_la;\n ll curh = cur_ld - cur_lb;\n // dir 0: expand left, decrease a\n {\n ll max_block = 0;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll my = max(cur_lb, lb[j]);\n ll ny = min(cur_ld, ld[j]);\n if (my < ny) {\n if (lc[j] <= cur_la) {\n max_block = max(max_block, lc[j]);\n }\n }\n }\n ll newa = max(0LL, max_block);\n if (newa < cur_la) {\n ll news = (cur_lc - newa) * curh;\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 0;\n best_pos = newa;\n }\n }\n }\n // dir 1: expand right, increase c\n {\n ll min_block = 10000;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll my = max(cur_lb, lb[j]);\n ll ny = min(cur_ld, ld[j]);\n if (my < ny) {\n if (la[j] >= cur_lc) {\n min_block = min(min_block, la[j]);\n }\n }\n }\n ll newc = min(10000LL, min_block);\n if (newc > cur_lc) {\n ll news = (newc - cur_la) * curh;\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 1;\n best_pos = newc;\n }\n }\n }\n // dir 2: expand bottom, decrease b\n {\n ll max_block = 0;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll mx = max(cur_la, la[j]);\n ll nx = min(cur_lc, lc[j]);\n if (mx < nx) {\n if (ld[j] <= cur_lb) {\n max_block = max(max_block, ld[j]);\n }\n }\n }\n ll newb = max(0LL, max_block);\n if (newb < cur_lb) {\n ll news = curw * (cur_ld - newb);\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 2;\n best_pos = newb;\n }\n }\n }\n // dir 3: expand top, increase d\n {\n ll min_block = 10000;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll mx = max(cur_la, la[j]);\n ll nx = min(cur_lc, lc[j]);\n if (mx < nx) {\n if (lb[j] >= cur_ld) {\n min_block = min(min_block, lb[j]);\n }\n }\n }\n ll newd = min(10000LL, min_block);\n if (newd > cur_ld) {\n ll news = curw * (newd - cur_lb);\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 3;\n best_pos = newd;\n }\n }\n }\n }\n if (max_imp > 1e-9 && best_i != -1) {\n if (best_dir == 0) la[best_i] = best_pos;\n else if (best_dir == 1) lc[best_i] = best_pos;\n else if (best_dir == 2) lb[best_i] = best_pos;\n else if (best_dir == 3) ld[best_i] = best_pos;\n improved = true;\n }\n }\n // final optimize size within current rect (after expansion)\n for (int i = 0; i < n; i++) {\n ll xl = la[i], xr = lc[i], yl = lb[i], yr = ld[i];\n ll W = xr - xl;\n ll H = yr - yl;\n ll xi = x[i], yi = y[i];\n ll lroom = xi - xl;\n ll rroom = xr - xi - 1;\n ll broom = yi - yl;\n ll troom = yr - yi - 1;\n auto getp_local = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n double bp = getp_local(W * H, r[i]);\n ll bw = W, bh = H;\n for (ll w = 1; w <= W; w++) {\n double idh = r[i] * 1.0 / w;\n ll hround = (ll)round(idh);\n for (ll dh = -1; dh <= 1; dh++) {\n ll h = hround + dh;\n if (h < 1 || h > H) continue;\n ll s = w * h;\n double pv = getp_local(s, r[i]);\n if (pv > bp) {\n bp = pv;\n bw = w;\n bh = h;\n }\n }\n }\n if (bw != W || bh != H) {\n ll wl_min = max(0LL, bw - 1 - rroom);\n ll wl_max = min(lroom, bw - 1);\n ll wl = (wl_min + wl_max) / 2;\n ll new_a = xi - wl;\n ll new_c = new_a + bw;\n ll hb_min = max(0LL, bh - 1 - troom);\n ll hb_max = min(broom, bh - 1);\n ll hb = (hb_min + hb_max) / 2;\n ll new_b = yi - hb;\n ll new_d = new_b + bh;\n la[i] = new_a;\n lb[i] = new_b;\n lc[i] = new_c;\n ld[i] = new_d;\n }\n }\n // final pairwise boundary adjustment for adjacent rects\n auto calc_p = [&](int idx) {\n ll s = (lc[idx] - la[idx]) * (ld[idx] - lb[idx]);\n return getp2(s, r[idx]);\n };\n auto check_overlap = [&](int a, int b) {\n return max(la[a], la[b]) < min(lc[a], lc[b]) && max(lb[a], lb[b]) < min(ld[a], ld[b]);\n };\n for (int pass = 0; pass < 4; pass++) {\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n // vertical adjacent\n bool vert_adj = false;\n int left = -1, rightt = -1;\n if (lc[i] == la[j] && max(lb[i], lb[j]) < min(ld[i], ld[j])) {\n vert_adj = true;\n left = i; rightt = j;\n } else if (lc[j] == la[i] && max(lb[i], lb[j]) < min(ld[i], ld[j])) {\n vert_adj = true;\n left = j; rightt = i;\n }\n if (vert_adj) {\n ll cur_cut = lc[left];\n double oldp = calc_p(left) + calc_p(rightt);\n double bestp = oldp;\n ll bestc = cur_cut;\n ll minc = max({cur_cut - 35LL, la[left] + 1, x[left] + 1});\n ll maxc = min({cur_cut + 35LL, lc[rightt], x[rightt] + 1, 10000LL});\n for (ll nc = minc; nc <= maxc; nc++) {\n if (nc <= x[left] || nc > x[rightt]) continue;\n ll old_l = lc[left]; ll old_r = la[rightt];\n lc[left] = nc; la[rightt] = nc;\n bool val = true;\n if (check_overlap(left, rightt)) val = false;\n for (int k = 0; k < n && val; k++) {\n if (k == left || k == rightt) continue;\n if (check_overlap(left, k) || check_overlap(rightt, k)) val = false;\n }\n if (val) {\n double np = calc_p(left) + calc_p(rightt);\n if (np > bestp) {\n bestp = np;\n bestc = nc;\n }\n }\n lc[left] = old_l; la[rightt] = old_r;\n }\n if (bestc != cur_cut) {\n lc[left] = bestc; la[rightt] = bestc;\n }\n }\n // horizontal adjacent\n bool horiz_adj = false;\n int bot = -1, tp = -1;\n if (ld[i] == lb[j] && max(la[i], la[j]) < min(lc[i], lc[j])) {\n horiz_adj = true;\n bot = i; tp = j;\n } else if (ld[j] == lb[i] && max(la[i], la[j]) < min(lc[i], lc[j])) {\n horiz_adj = true;\n bot = j; tp = i;\n }\n if (horiz_adj) {\n ll cur_cut = ld[bot];\n double oldp = calc_p(bot) + calc_p(tp);\n double bestp = oldp;\n ll bestc = cur_cut;\n ll minc = max({cur_cut - 35LL, lb[bot] + 1, y[bot] + 1});\n ll maxc = min({cur_cut + 35LL, ld[tp], y[tp] + 1, 10000LL});\n for (ll nc = minc; nc <= maxc; nc++) {\n if (nc <= y[bot] || nc > y[tp]) continue;\n ll old_b = ld[bot]; ll old_t = lb[tp];\n ld[bot] = nc; lb[tp] = nc;\n bool val = true;\n if (check_overlap(bot, tp)) val = false;\n for (int k = 0; k < n && val; k++) {\n if (k == bot || k == tp) continue;\n if (check_overlap(bot, k) || check_overlap(tp, k)) val = false;\n }\n if (val) {\n double np = calc_p(bot) + calc_p(tp);\n if (np > bestp) {\n bestp = np;\n bestc = nc;\n }\n }\n ld[bot] = old_b; lb[tp] = old_t;\n }\n if (bestc != cur_cut) {\n ld[bot] = bestc; lb[tp] = bestc;\n }\n }\n }\n }\n }\n for (int i = 0; i < n; i++) {\n cout << la[i] << \" \" << lb[i] << \" \" << lc[i] << \" \" << ld[i] << \"\\n\";\n }\n}","ahc002":"#include \nusing namespace std;\n\nstruct State {\n int i, j;\n long long sumv;\n string moves;\n bitset<2560> usd;\n};\n\nint main() {\n int si, sj;\n cin >> si >> sj;\n int T[50][50], P[50][50];\n int maxt = 0;\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> T[i][j];\n maxt = max(maxt, T[i][j]);\n }\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> P[i][j];\n }\n int M = maxt + 1;\n int di[4] = {-1, 0, 1, 0};\n int dj[4] = {0, 1, 0, -1};\n char dirch[4] = {'U', 'R', 'D', 'L'};\n string best_str = \"\";\n long long best_sc = -1;\n srand(42);\n // Multiple trials focused on low degree with some high-p\n int num_trials = 2000;\n char usd[2505];\n for (int trial = 0; trial < num_trials; trial++) {\n memset(usd, 0, M);\n vector moves;\n int curi = si, curj = sj;\n long long cursum = P[si][sj];\n usd[T[si][sj]] = 1;\n bool use_lowdeg = (trial % 3 != 2); // 2/3 lowdeg, 1/3 high-p\n while (true) {\n vector> cands;\n for (int d = 0; d < 4; d++) {\n int ni = curi + di[d];\n int nj = curj + dj[d];\n if (ni < 0 || ni >= 50 || nj < 0 || nj >= 50) continue;\n int nt = T[ni][nj];\n if (usd[nt]) continue;\n if (use_lowdeg) {\n int deg = 0;\n for (int dd = 0; dd < 4; dd++) {\n int nni = ni + di[dd], nnj = nj + dj[dd];\n if (nni >= 0 && nni < 50 && nnj >= 0 && nnj < 50) {\n int nnt = T[nni][nnj];\n if (nnt != nt && !usd[nnt]) deg++;\n }\n }\n int noisy_deg = deg + (rand() % 2);\n cands.emplace_back(noisy_deg, -P[ni][nj], d);\n } else {\n cands.emplace_back(-P[ni][nj], 0, d);\n }\n }\n if (cands.empty()) break;\n sort(cands.begin(), cands.end());\n int sz = cands.size();\n int take = 0;\n if (sz >= 2) {\n take = rand() % min(5, sz);\n }\n auto [bs, np, d] = cands[take];\n int ni = curi + di[d];\n int nj = curj + dj[d];\n int nt = T[ni][nj];\n usd[nt] = 1;\n moves.push_back(dirch[d]);\n cursum += P[ni][nj];\n curi = ni;\n curj = nj;\n }\n if (cursum > best_sc) {\n best_sc = cursum;\n best_str = string(moves.begin(), moves.end());\n }\n }\n // Beam search with increased width\n {\n State init;\n init.i = si; init.j = sj;\n init.sumv = P[si][sj];\n init.moves = \"\";\n init.usd.reset();\n init.usd[T[si][sj]] = true;\n if (init.sumv > best_sc) {\n best_sc = init.sumv;\n best_str = \"\";\n }\n vector cur_beam = {init};\n const int W = 64;\n while (true) {\n vector next_beam;\n bool has_ext = false;\n for (auto &st : cur_beam) {\n int exts = 0;\n for (int d = 0; d < 4; d++) {\n int ni = st.i + di[d];\n int nj = st.j + dj[d];\n if (ni < 0 || ni >= 50 || nj < 0 || nj >= 50) continue;\n int nt = T[ni][nj];\n if (st.usd[nt]) continue;\n exts++;\n has_ext = true;\n State ns = st;\n ns.usd[nt] = true;\n ns.i = ni;\n ns.j = nj;\n ns.sumv += P[ni][nj];\n ns.moves += dirch[d];\n next_beam.push_back(std::move(ns));\n }\n if (exts == 0) {\n if (st.sumv > best_sc) {\n best_sc = st.sumv;\n best_str = st.moves;\n }\n }\n }\n if (!has_ext) break;\n sort(next_beam.begin(), next_beam.end(), [](const State& a, const State& b) {\n return a.sumv > b.sumv;\n });\n int keep = min(W, (int)next_beam.size());\n cur_beam.assign(next_beam.begin(), next_beam.begin() + keep);\n }\n }\n cout << best_str << endl;\n}","ahc003":"#include \nusing namespace std;\n\nint main() {\n double H[30][29];\n double V[29][30];\n double visitH[30][29];\n double visitV[29][30];\n for (int i = 0; i < 30; i++) {\n for (int j = 0; j < 29; j++) {\n H[i][j] = 5000.0 + ((i * 29LL + j) % 19 - 9) * 2.0;\n visitH[i][j] = 0.0;\n }\n }\n for (int i = 0; i < 29; i++) {\n for (int j = 0; j < 30; j++) {\n V[i][j] = 5000.0 + ((i * 30LL + j) % 19 - 9) * 2.0;\n visitV[i][j] = 0.0;\n }\n }\n for (int q = 0; q < 1000; q++) {\n int si, sj, ti, tj;\n cin >> si >> sj >> ti >> tj;\n const double INF = 1e18;\n vector dist(900, INF);\n vector prevv(900, -1);\n priority_queue, vector>, greater>> pq;\n int S = si * 30 + sj;\n int T = ti * 30 + tj;\n dist[S] = 0.0;\n pq.push({0.0, S});\n while (!pq.empty()) {\n auto [c, u] = pq.top();\n pq.pop();\n if (c > dist[u]) continue;\n int i = u / 30;\n int j = u % 30;\n if (j > 0) {\n int nv = i * 30 + (j - 1);\n double nw = H[i][j - 1];\n double vis = visitH[i][j - 1];\n double bonus = 200.0 / (1.0 + vis);\n double nw_eff = nw - bonus;\n if (dist[nv] > dist[u] + nw_eff) {\n dist[nv] = dist[u] + nw_eff;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (j < 29) {\n int nv = i * 30 + (j + 1);\n double nw = H[i][j];\n double vis = visitH[i][j];\n double bonus = 200.0 / (1.0 + vis);\n double nw_eff = nw - bonus;\n if (dist[nv] > dist[u] + nw_eff) {\n dist[nv] = dist[u] + nw_eff;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i > 0) {\n int nv = (i - 1) * 30 + j;\n double nw = V[i - 1][j];\n double vis = visitV[i - 1][j];\n double bonus = 200.0 / (1.0 + vis);\n double nw_eff = nw - bonus;\n if (dist[nv] > dist[u] + nw_eff) {\n dist[nv] = dist[u] + nw_eff;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i < 29) {\n int nv = (i + 1) * 30 + j;\n double nw = V[i][j];\n double vis = visitV[i][j];\n double bonus = 200.0 / (1.0 + vis);\n double nw_eff = nw - bonus;\n if (dist[nv] > dist[u] + nw_eff) {\n dist[nv] = dist[u] + nw_eff;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n }\n vector path_nodes;\n int cur = T;\n while (true) {\n path_nodes.push_back(cur);\n if (cur == S) break;\n cur = prevv[cur];\n }\n reverse(path_nodes.begin(), path_nodes.end());\n string path_str = \"\";\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n char move;\n if (ci == pi - 1 && cj == pj) move = 'U';\n else if (ci == pi + 1 && cj == pj) move = 'D';\n else if (cj == pj - 1 && ci == pi) move = 'L';\n else if (cj == pj + 1 && ci == pi) move = 'R';\n path_str += move;\n }\n cout << path_str << endl;\n int obs;\n cin >> obs;\n double est = dist[T];\n if (est < 1e-9) est = 1.0;\n int num_e = path_nodes.size() - 1;\n double delta = (double)obs - est;\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n if (pi == ci) {\n int jleft = min(pj, cj);\n double local_alpha = 0.5 / (1.0 + visitH[pi][jleft] * 0.025);\n double local_adj = (delta / num_e) * local_alpha;\n H[pi][jleft] += local_adj;\n if (H[pi][jleft] < 100.0) H[pi][jleft] = 100.0;\n if (H[pi][jleft] > 20000.0) H[pi][jleft] = 20000.0;\n visitH[pi][jleft] += 1.0;\n } else {\n int itop = min(pi, ci);\n double local_alpha = 0.5 / (1.0 + visitV[itop][pj] * 0.025);\n double local_adj = (delta / num_e) * local_alpha;\n V[itop][pj] += local_adj;\n if (V[itop][pj] < 100.0) V[itop][pj] = 100.0;\n if (V[itop][pj] > 20000.0) V[itop][pj] = 20000.0;\n visitV[itop][pj] += 1.0;\n }\n }\n }\n return 0;\n}","ahc004":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector S(M);\n for (auto& s : S) cin >> s;\n vector base_order(M);\n iota(base_order.begin(), base_order.end(), 0);\n sort(base_order.begin(), base_order.end(), [&](int a, int b) {\n return S[a].size() > S[b].size();\n });\n srand(time(NULL));\n auto count_c = [&](const vector& g) -> int {\n int cnt = 0;\n for (const auto& s : S) {\n bool found = false;\n for (int r = 0; r < N && !found; r++) {\n for (int st = 0; st < N; st++) {\n bool ok = true;\n for (int p = 0; p < (int)s.size() && ok; p++) {\n if (g[r][(st + p) % N] != s[p]) ok = false;\n }\n if (ok) {\n found = true;\n break;\n }\n }\n }\n if (found) {\n cnt++;\n continue;\n }\n for (int c = 0; c < N && !found; c++) {\n for (int st = 0; st < N; st++) {\n bool ok = true;\n for (int p = 0; p < (int)s.size() && ok; p++) {\n if (g[(st + p) % N][c] != s[p]) ok = false;\n }\n if (ok) {\n found = true;\n break;\n }\n }\n }\n if (found) cnt++;\n }\n return cnt;\n };\n auto compute_f = [&](const vector& g) -> int {\n int ff = 0;\n for (auto& row : g) for (char ch : row) if (ch != '.') ff++;\n return ff;\n };\n int best_c_val = -1;\n int best_ff = INT_MAX;\n vector best_grid(N, string(N, '.'));\n for (int trial = 0; trial < 50; trial++) {\n vector order = base_order;\n int i = 0;\n while (i < M) {\n int j = i;\n int len = S[order[i]].size();\n while (j < M && (int)S[order[j]].size() == len) j++;\n mt19937 rng(42 + trial * 17);\n shuffle(order.begin() + i, order.begin() + j, rng);\n i = j;\n }\n vector grid(N, string(N, '.'));\n auto can_place_func = [&](int r, int c, int dr, int dc, const string& s, const vector& grd) -> pair {\n int k = s.size();\n int match_cnt = 0;\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n char need = s[p];\n if (grd[rr][cc] != '.' && grd[rr][cc] != need) return {false, 0};\n if (grd[rr][cc] == need) match_cnt++;\n }\n return {true, match_cnt};\n };\n auto do_write_func = [&](int r, int c, int dr, int dc, const string& s, vector& grd) {\n int k = s.size();\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n grd[rr][cc] = s[p];\n }\n };\n for (int idx : order) {\n const string& s = S[idx];\n int true_max = -1;\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(r, st, 0, 1, s, grid);\n if (poss) true_max = max(true_max, mt);\n }\n }\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(st, c, 1, 0, s, grid);\n if (poss) true_max = max(true_max, mt);\n }\n }\n if (true_max == -1) continue;\n int target_mt = true_max;\n vector> cands;\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(r, st, 0, 1, s, grid);\n if (poss && mt == target_mt) {\n cands.emplace_back(r, st, 0, 1);\n }\n }\n }\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(st, c, 1, 0, s, grid);\n if (poss && mt == target_mt) {\n cands.emplace_back(st, c, 1, 0);\n }\n }\n }\n if (!cands.empty()) {\n tuple best_cand = cands[0];\n int best_line_f = INT_MAX;\n int best_pos = INT_MAX;\n for (auto& cand : cands) {\n auto [rr, cc, ddr, ddc] = cand;\n int linefill = 0;\n if (ddr == 0) {\n for (int j = 0; j < N; j++) if (grid[rr][j] != '.') linefill++;\n } else {\n for (int ii = 0; ii < N; ii++) if (grid[ii][cc] != '.') linefill++;\n }\n int posv = rr * N + cc;\n if (linefill < best_line_f || (linefill == best_line_f && posv < best_pos)) {\n best_line_f = linefill;\n best_pos = posv;\n best_cand = cand;\n }\n }\n auto [br, bc, bdr, bdc] = best_cand;\n do_write_func(br, bc, bdr, bdc, s, grid);\n }\n }\n int this_c = count_c(grid);\n int this_f = compute_f(grid);\n bool do_update = false;\n if (best_c_val == -1 || this_c > best_c_val) {\n do_update = true;\n } else if (this_c == best_c_val) {\n if (this_c == M && this_f < best_ff) {\n do_update = true;\n }\n }\n if (do_update) {\n best_c_val = this_c;\n best_ff = this_f;\n best_grid = grid;\n }\n }\n for (auto& row : best_grid) {\n cout << row << endl;\n }\n return 0;\n}","ahc005":"#include \nusing namespace std;\nusing ll = long long;\n\nconst int MAXN = 70;\nconst ll INF = 1LL << 60;\nint di[4] = {-1, 0, 1, 0};\nint dj[4] = {0, 1, 0, -1};\n\nint main() {\n int N, si, sj;\n cin >> N >> si >> sj;\n vector grid(N);\n for (auto& s : grid) cin >> s;\n int h_id[MAXN][MAXN];\n int v_id[MAXN][MAXN];\n memset(h_id, -1, sizeof(h_id));\n memset(v_id, -1, sizeof(v_id));\n int num_h = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N;) {\n if (grid[i][j] == '#') {\n j++;\n continue;\n }\n while (j < N && grid[i][j] != '#') {\n h_id[i][j] = num_h;\n j++;\n }\n num_h++;\n }\n }\n int num_v = 0;\n for (int j = 0; j < N; j++) {\n for (int i = 0; i < N;) {\n if (grid[i][j] == '#') {\n i++;\n continue;\n }\n while (i < N && grid[i][j] != '#') {\n v_id[i][j] = num_v;\n i++;\n }\n num_v++;\n }\n }\n vector>> h_cells(num_h);\n vector>> v_cells(num_v);\n vector> all_roads;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (grid[i][j] != '#') {\n all_roads.emplace_back(i, j);\n h_cells[h_id[i][j]].emplace_back(i, j);\n v_cells[v_id[i][j]].emplace_back(i, j);\n }\n }\n }\n int r = all_roads.size();\n bool is_covered[MAXN][MAXN] = {};\n int num_uncovered = r;\n auto get_gain = [&](int x, int y) {\n int g = 0;\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) if (!is_covered[a][b]) g++;\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) if (!is_covered[a][b]) g++;\n if (!is_covered[x][y]) g--;\n return g;\n };\n auto apply_cover = [&](int x, int y) {\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n };\n vector> keys;\n apply_cover(si, sj);\n keys.emplace_back(si, sj);\n while (num_uncovered > 0) {\n int mg = 0;\n pair bp{-1, -1};\n for (auto p : all_roads) {\n int gg = get_gain(p.first, p.second);\n if (gg > mg) {\n mg = gg;\n bp = p;\n }\n }\n if (mg <= 0) break;\n keys.push_back(bp);\n apply_cover(bp.first, bp.second);\n }\n vector> points;\n set> unique_pts(keys.begin(), keys.end());\n for (auto p : unique_pts) points.push_back(p);\n int m = points.size();\n for (int i = 0; i < m; i++) {\n if (points[i].first == si && points[i].second == sj) {\n swap(points[i], points[0]);\n break;\n }\n }\n if (m == 0) {\n cout << \"\" << endl;\n return 0;\n }\n vector> D(m, vector(m, INF));\n for (int k = 0; k < m; k++) {\n pair src = points[k];\n vector> dd(N, vector(N, INF));\n dd[src.first][src.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, src.first, src.second});\n while (!pq.empty()) {\n auto [cost, x, y] = pq.top();\n pq.pop();\n if (cost > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = cost + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n pq.push({nc, nx, ny});\n }\n }\n }\n for (int t = 0; t < m; t++) {\n auto [tx, ty] = points[t];\n D[k][t] = dd[tx][ty];\n }\n }\n vector order;\n if (m == 1) {\n order = {0};\n } else {\n vector vis(m, false);\n order.push_back(0);\n vis[0] = true;\n for (int cnt = 1; cnt < m; cnt++) {\n int curi = order.back();\n ll min_d = INF;\n int chosen = -1;\n for (int j = 0; j < m; j++) {\n if (!vis[j] && D[curi][j] < min_d) {\n min_d = D[curi][j];\n chosen = j;\n }\n }\n order.push_back(chosen);\n vis[chosen] = true;\n }\n }\n auto calc_tour_cost = [&](const vector& ord) -> ll {\n ll sum = 0;\n for (int i = 0; i < m; i++) {\n sum += D[ord[i]][ord[(i + 1) % m]];\n }\n return sum;\n };\n if (m >= 3) {\n int iters = 0;\n bool improved = true;\n while (improved && iters++ < 200) {\n improved = false;\n ll cur_cost = calc_tour_cost(order);\n for (int l = 0; l < m && !improved; l++) {\n for (int r = l + 1; r < m && !improved; r++) {\n vector newo = order;\n reverse(newo.begin() + l, newo.begin() + r + 1);\n ll nc = calc_tour_cost(newo);\n if (nc < cur_cost) {\n order = newo;\n improved = true;\n }\n }\n }\n }\n }\n int zero_pos = 0;\n for (int i = 0; i < m; i++) {\n if (order[i] == 0) {\n zero_pos = i;\n break;\n }\n }\n vector final_order(m);\n for (int i = 0; i < m; i++) {\n final_order[i] = order[(zero_pos + i) % m];\n }\n order = final_order;\n vector> full_route;\n full_route.push_back(points[0]);\n for (int i = 0; i < m; i++) {\n int u = order[i];\n int v = order[(i + 1) % m];\n auto sp = points[u];\n auto tp = points[v];\n vector>> par(N, vector>(N, {-1, -1}));\n vector> dd(N, vector(N, INF));\n dd[sp.first][sp.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, sp.first, sp.second});\n while (!pq.empty()) {\n auto [c, x, y] = pq.top();\n pq.pop();\n if (c > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = c + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n par[nx][ny] = {x, y};\n pq.push({nc, nx, ny});\n }\n }\n }\n vector> thisp;\n auto curp = tp;\n while (curp.first != -1) {\n thisp.push_back(curp);\n if (curp == sp) break;\n curp = par[curp.first][curp.second];\n }\n reverse(thisp.begin(), thisp.end());\n for (size_t j = 1; j < thisp.size(); j++) {\n full_route.push_back(thisp[j]);\n }\n }\n string ans = \"\";\n for (size_t i = 0; i + 1 < full_route.size(); i++) {\n int dx = full_route[i + 1].first - full_route[i].first;\n int dy = full_route[i + 1].second - full_route[i].second;\n if (dx == -1 && dy == 0) ans += 'U';\n else if (dx == 1 && dy == 0) ans += 'D';\n else if (dx == 0 && dy == -1) ans += 'L';\n else if (dx == 0 && dy == 1) ans += 'R';\n }\n cout << ans << endl;\n}","future-contest-2022-qual":"#include \nusing namespace std;\n\nint main() {\n int N, M, K, R;\n cin >> N >> M >> K >> R;\n vector> D(N, vector(K));\n for (int i = 0; i < N; i++) {\n for (int k = 0; k < K; k++) {\n cin >> D[i][k];\n }\n }\n vector> successors(N);\n vector unfinished_preds(N, 0);\n for (int i = 0; i < R; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n successors[u].push_back(v);\n unfinished_preds[v]++;\n }\n vector priority(N, 0);\n vector num_subtree(N, 0);\n for (int i = N - 1; i >= 0; i--) {\n int mx = 0;\n int sub = 1;\n for (int s : successors[i]) {\n mx = max(mx, priority[s]);\n sub += num_subtree[s];\n }\n priority[i] = 5 + mx;\n num_subtree[i] = sub;\n }\n vector> est_s(M, vector(K, 0));\n vector member_task(M, -1);\n vector member_startday(M, -1);\n vector task_status(N, 0);\n vector tasks_completed_by(M, 0);\n mt19937 rng(42);\n int day = 0;\n while (true) {\n day++;\n if (day > 2000) break;\n vector free_workers;\n for (int j = 0; j < M; j++) {\n if (member_task[j] == -1) free_workers.push_back(j);\n }\n vector candidate_tasks;\n for (int i = 0; i < N; i++) {\n if (task_status[i] == 0 && unfinished_preds[i] == 0) {\n candidate_tasks.push_back(i);\n }\n }\n vector> assigns;\n if (!free_workers.empty() && !candidate_tasks.empty()) {\n sort(candidate_tasks.begin(), candidate_tasks.end(), [&](int a, int b) {\n if (priority[a] != priority[b]) return priority[a] > priority[b];\n if (num_subtree[a] != num_subtree[b]) return num_subtree[a] > num_subtree[b];\n return a < b;\n });\n int num_assign = min((int)free_workers.size(), (int)candidate_tasks.size());\n vector tasks_select(candidate_tasks.begin(), candidate_tasks.begin() + num_assign);\n vector free_shuffled = free_workers;\n shuffle(free_shuffled.begin(), free_shuffled.end(), rng);\n vector worker_pref(M, 10000);\n for (int ord = 0; ord < (int)free_shuffled.size(); ord++) {\n worker_pref[free_shuffled[ord]] = ord;\n }\n vector worker_free(M, false);\n for (int j : free_workers) worker_free[j] = true;\n for (int ti = 0; ti < num_assign; ti++) {\n int tsk = tasks_select[ti];\n int best_et = INT_MAX;\n int best_exp = INT_MAX;\n int best_pref = INT_MAX;\n int best_j = -1;\n for (int j = 0; j < M; j++) {\n if (!worker_free[j]) continue;\n int wsum = 0;\n for (int k = 0; k < K; k++) {\n wsum += max(0, D[tsk][k] - est_s[j][k]);\n }\n int estt = (wsum == 0 ? 1 : wsum);\n int expp = tasks_completed_by[j];\n int preff = worker_pref[j];\n bool better = false;\n if (estt < best_et) better = true;\n else if (estt == best_et) {\n if (expp < best_exp) better = true;\n else if (expp == best_exp && preff < best_pref) better = true;\n }\n if (better) {\n best_et = estt;\n best_exp = expp;\n best_pref = preff;\n best_j = j;\n }\n }\n if (best_j != -1) {\n worker_free[best_j] = false;\n assigns.emplace_back(best_j, tsk);\n task_status[tsk] = 1;\n member_task[best_j] = tsk;\n member_startday[best_j] = day;\n }\n }\n }\n cout << assigns.size();\n for (auto [j, t] : assigns) {\n cout << \" \" << (j + 1) << \" \" << (t + 1);\n }\n cout << endl;\n int n_comp;\n cin >> n_comp;\n if (n_comp == -1) break;\n for (int fi = 0; fi < n_comp; fi++) {\n int f;\n cin >> f;\n int j = f - 1;\n int tsk = member_task[j];\n if (tsk >= 0) {\n int t_taken = day - member_startday[j] + 1;\n int w_max = (t_taken == 1 ? 3 : t_taken + 2);\n for (int k = 0; k < K; k++) {\n est_s[j][k] = max(est_s[j][k], max(0, D[tsk][k] - w_max));\n }\n tasks_completed_by[j]++;\n task_status[tsk] = 2;\n member_task[j] = -1;\n member_startday[j] = -1;\n for (int suc : successors[tsk]) {\n unfinished_preds[suc]--;\n }\n }\n }\n }\n return 0;\n}","ahc006":"#include \nusing namespace std;\n\nstruct Point {\n int x, y;\n};\n\nint manh(const Point& a, const Point& b) {\n return abs(a.x - b.x) + abs(a.y - b.y);\n}\n\nint main() {\n Point picks[1000], dels[1000];\n for (int i = 0; i < 1000; ++i) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n picks[i] = {a, b};\n dels[i] = {c, d};\n }\n Point cen = {400, 400};\n int solos[1000];\n for (int i = 0; i < 1000; ++i) {\n solos[i] = manh(cen, picks[i]) + manh(picks[i], dels[i]) + manh(dels[i], cen);\n }\n vector ord(1000);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) {\n return solos[i] < solos[j] || (solos[i] == solos[j] && i < j);\n });\n vector pool(ord.begin(), ord.begin() + 300);\n vector selected;\n bool in_sel[1000] = {};\n auto compute_T_for_set = [&](const vector& S) -> int {\n bool isp[1000] = {};\n bool isd[1000] = {};\n Point curr = cen;\n int total = 0;\n for (int step = 0; step < (int)S.size() * 2; ++step) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : S) {\n if (!isp[id]) {\n int dt = manh(curr, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd[id]) {\n int dt = manh(curr, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n total += bd;\n if (bip) {\n curr = picks[bi];\n isp[bi] = true;\n } else {\n curr = dels[bi];\n isd[bi] = true;\n }\n }\n total += manh(curr, cen);\n return total;\n };\n for (int k = 0; k < 50; ++k) {\n int best_add = -1;\n int best_t_add = INT_MAX;\n for (int cand : pool) {\n if (in_sel[cand]) continue;\n vector temp_S = selected;\n temp_S.push_back(cand);\n int this_t = compute_T_for_set(temp_S);\n if (this_t < best_t_add) {\n best_t_add = this_t;\n best_add = cand;\n }\n }\n selected.push_back(best_add);\n in_sel[best_add] = true;\n }\n int current_set_t = compute_T_for_set(selected);\n srand(42);\n for (int refine = 0; refine < 3000; ++refine) {\n int idx = rand() % 50;\n int old = selected[idx];\n int newc_idx = rand() % pool.size();\n int newc = pool[newc_idx];\n if (in_sel[newc]) continue;\n vector temp = selected;\n temp[idx] = newc;\n int nt = compute_T_for_set(temp);\n if (nt < current_set_t) {\n selected = temp;\n in_sel[old] = false;\n in_sel[newc] = true;\n current_set_t = nt;\n }\n }\n vector best_S = selected;\n // helpers\n auto build_path_and_t = [&](const vector>& sq) -> pair> {\n vector pp {cen};\n Point cu = cen;\n int tt = 0;\n for (auto& pr : sq) {\n Point nxt = pr.second ? picks[pr.first] : dels[pr.first];\n tt += manh(cu, nxt);\n cu = nxt;\n pp.push_back(cu);\n }\n tt += manh(cu, cen);\n pp.push_back(cen);\n return {tt, pp};\n };\n auto valid_seq = [&](const vector>& sq) -> bool {\n vector pos_p(1000, -1);\n vector pos_d(1000, -1);\n for (int i = 0; i < (int)sq.size(); ++i) {\n auto [o, ispk] = sq[i];\n if (ispk) pos_p[o] = i;\n else pos_d[o] = i;\n }\n for (int o : best_S) {\n if (pos_p[o] > pos_d[o] || pos_p[o] == -1 || pos_d[o] == -1) return false;\n }\n return true;\n };\n auto optimize_route = [&](vector> initseq) -> pair> {\n if (!valid_seq(initseq)) return {INT_MAX, {}};\n auto [ct, cp] = build_path_and_t(initseq);\n vector> cseq = initseq;\n bool imp = true;\n int sw = 0;\n while (imp && sw < 25) {\n imp = false;\n sw++;\n for (int fr = 0; fr < 100 && !imp; ++fr) {\n auto mv = cseq[fr];\n vector> tmp;\n for (int j = 0; j < 100; ++j) if (j != fr) tmp.push_back(cseq[j]);\n for (int ins = 0; ins < 100 && !imp; ++ins) {\n vector> news = tmp;\n news.insert(news.begin() + ins, mv);\n if (valid_seq(news)) {\n auto [nt, np] = build_path_and_t(news);\n if (nt < ct) {\n cseq = news;\n ct = nt;\n cp = np;\n imp = true;\n }\n }\n }\n }\n for (int i1 = 0; i1 < 98 && !imp; ++i1) {\n for (int i2 = i1 + 2; i2 < 100 && !imp; ++i2) {\n vector> news = cseq;\n std::reverse(news.begin() + i1, news.begin() + i2 + 1);\n if (valid_seq(news)) {\n auto [nt, np] = build_path_and_t(news);\n if (nt < ct) {\n cseq = news;\n ct = nt;\n cp = np;\n imp = true;\n }\n }\n }\n }\n }\n return {ct, cp};\n };\n // build NN seq\n vector> seq_nn;\n bool isp_init[1000] = {};\n bool isd_init[1000] = {};\n Point cur_init = cen;\n for (int st = 0; st < 100; ++st) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : best_S) {\n if (!isp_init[id]) {\n int dt = manh(cur_init, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd_init[id]) {\n int dt = manh(cur_init, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n seq_nn.emplace_back(bi, bip);\n if (bip) {\n cur_init = picks[bi];\n isp_init[bi] = true;\n } else {\n cur_init = dels[bi];\n isd_init[bi] = true;\n }\n }\n auto res = optimize_route(seq_nn);\n vector best_path = res.second;\n if (res.first == INT_MAX) {\n auto fallback = build_path_and_t(seq_nn);\n best_path = fallback.second;\n }\n vector chosen = best_S;\n for (int& v : chosen) ++v;\n sort(chosen.begin(), chosen.end());\n cout << 50;\n for (int r : chosen) cout << \" \" << r;\n cout << endl;\n cout << best_path.size();\n for (auto& pt : best_path) {\n cout << \" \" << pt.x << \" \" << pt.y;\n }\n cout << endl;\n return 0;\n}","ahc007":"#include \nusing namespace std;\n\nstruct Edge {\n int u, v, d, order_idx;\n};\n\nstruct TmpE {\n int l, u, v;\n};\n\nint main() {\n mt19937 rng(42);\n int N = 400;\n int M = 1995;\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector alledges(M);\n for (int i = 0; i < M; i++) {\n cin >> alledges[i].u >> alledges[i].v;\n long long dx = X[alledges[i].u] - X[alledges[i].v];\n long long dy = Y[alledges[i].u] - Y[alledges[i].v];\n long long dist2 = dx * dx + dy * dy;\n alledges[i].d = round(sqrt((double)dist2));\n alledges[i].order_idx = i;\n }\n vector parent(N), rankk(N, 0);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto& self, int x) -> int {\n if (parent[x] != x) parent[x] = self(self, parent[x]);\n return parent[x];\n };\n auto unite = [&](int a, int b) {\n a = find(find, a);\n b = find(find, b);\n if (a == b) return;\n if (rankk[a] < rankk[b]) swap(a, b);\n parent[b] = a;\n if (rankk[a] == rankk[b]) rankk[a]++;\n };\n for (int ii = 0; ii < M; ii++) {\n int l;\n cin >> l;\n Edge& e = alledges[ii];\n int uu = e.u, vv = e.v;\n int pu = find(find, uu);\n int pv = find(find, vv);\n if (pu == pv) {\n cout << 0 << endl;\n continue;\n }\n const int NS = 8;\n long long total_bott = 0;\n for (int sam = 0; sam < NS; sam++) {\n vector fut;\n fut.reserve(M - ii - 1);\n for (int j = ii + 1; j < M; j++) {\n auto& ej = alledges[j];\n int dd = ej.d;\n int rnum = 2 * dd + 1;\n int rl = dd + (int)(rng() % rnum);\n fut.push_back({rl, ej.u, ej.v});\n }\n sort(fut.begin(), fut.end(), [](const TmpE& a, const TmpE& b) {\n return a.l < b.l;\n });\n vector tp = parent;\n vector tr = rankk;\n auto tfi = [&](auto& self, int x) -> int {\n if (tp[x] != x) tp[x] = self(self, tp[x]);\n return tp[x];\n };\n int ssu = tfi(tfi, uu);\n int ssv = tfi(tfi, vv);\n int thisb = 1000000000;\n bool conn = false;\n for (auto& fe : fut) {\n int pa = tfi(tfi, fe.u);\n int pb = tfi(tfi, fe.v);\n if (pa != pb) {\n int aa = pa, bb = pb;\n if (tr[aa] < tr[bb]) swap(aa, bb);\n tp[bb] = aa;\n if (tr[aa] == tr[bb]) tr[aa]++;\n if (tfi(tfi, ssu) == tfi(tfi, ssv)) {\n thisb = fe.l;\n conn = true;\n break;\n }\n }\n }\n if (!conn) thisb = 1000000000;\n total_bott += thisb;\n }\n long long avgb = total_bott / NS;\n bool adopt = (l <= avgb);\n cout << (adopt ? 1 : 0) << endl;\n if (adopt) {\n unite(uu, vv);\n }\n }\n return 0;\n}","ahc008":"#include \nusing namespace std;\n\nstruct Task {\n int tx, ty;\n char act;\n int wx, wy;\n};\n\nint main() {\n int N;\n cin >> N;\n vector> pet_pos(N);\n vector pet_t(N);\n for (int i = 0; i < N; i++) {\n int x, y, t;\n cin >> x >> y >> t;\n pet_pos[i] = {x, y};\n pet_t[i] = t;\n }\n int M;\n cin >> M;\n vector> hum_pos(M);\n for (int i = 0; i < M; i++) {\n int x, y;\n cin >> x >> y;\n hum_pos[i] = {x, y};\n }\n double pp = 0.04;\n double ff = 1.0 - pow(pp, 1.0 / N);\n ff = min(ff, 0.28);\n int area_t = (int)(ff * 900) + 20;\n int best_per = 1000;\n int HH = 10, WW = 10;\n for (int h = 6; h <= 26; h++) {\n for (int w = 6; w <= 26; w++) {\n if ((long long)h * w >= area_t && h + w < best_per) {\n best_per = h + w;\n HH = h;\n WW = w;\n }\n }\n }\n int H = HH, W = WW;\n int num_bottom_walls = W;\n int num_right_walls = H;\n int num_b_h = max(1, M * num_bottom_walls / (num_bottom_walls + num_right_walls));\n if (num_b_h > M - (num_right_walls > 0)) num_b_h = max(1, M - (num_right_walls > 0 ? 1 : 0));\n int num_r_h = M - num_b_h;\n pair center = {(1 + H) / 2, (1 + W) / 2};\n vector> homes(M, center);\n vector> bot_pos, rig_pos;\n for (int y = 1; y <= W; y++) bot_pos.emplace_back(H, y);\n for (int x = 1; x <= H; x++) rig_pos.emplace_back(x, W);\n bool walledg[31][31];\n memset(walledg, 0, sizeof(walledg));\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n char mcs[4] = {'U', 'D', 'L', 'R'};\n bool is_build = false;\n vector> htasks(M);\n vector tindex(M, 0);\n int wait_turns = 0;\n bool is_all_home = false;\n for (int turn = 0; turn < 300; turn++) {\n string acts(M, '.');\n int pin = 0;\n for (auto [x, y] : pet_pos) if (x <= H && y <= W && !walledg[x][y]) pin++;\n bool allhome = true;\n for (int i = 0; i < M; i++) if (hum_pos[i].first != homes[i].first || hum_pos[i].second != homes[i].second) allhome = false;\n if (allhome) {\n is_all_home = true;\n wait_turns++;\n }\n int trigger_n = (N <= 12 ? 0 : 1);\n if (!is_build && is_all_home && (pin <= trigger_n || (wait_turns > 90 && pin <= trigger_n + 2))) {\n is_build = true;\n htasks.assign(M, vector());\n tindex.assign(M, 0);\n for (int k = 0; k < num_b_h; k++) {\n int hi = k;\n int yst = 1 + (num_bottom_walls * k / max(1, num_b_h));\n int yen = 1 + (num_bottom_walls * (k + 1) / max(1, num_b_h)) - 1;\n vector ts;\n for (int y = yst; y <= yen; y++) {\n ts.push_back(Task{H, y, 'd', H + 1, y});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n for (int k = 0; k < num_r_h; k++) {\n int hi = num_b_h + k;\n int xst = 1 + (num_right_walls * k / max(1, num_r_h));\n int xen = 1 + (num_right_walls * (k + 1) / max(1, num_r_h)) - 1;\n vector ts;\n for (int x = xst; x <= xen; x++) {\n ts.push_back(Task{x, W, 'r', x, W + 1});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n }\n set> will_wall;\n if (is_build) {\n for (int i = 0; i < M; i++) {\n if (tindex[i] >= (int)htasks[i].size()) {\n acts[i] = '.';\n continue;\n }\n Task tk = htasks[i][tindex[i]];\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n if (hx == tk.tx && hy == tk.ty) {\n bool canb = true;\n int cx = tk.wx, cy = tk.wy;\n for (int j = 0; j < N; j++) if (pet_pos[j].first == cx && pet_pos[j].second == cy) canb = false;\n for (int j = 0; j < M; j++) if (hum_pos[j].first == cx && hum_pos[j].second == cy) canb = false;\n int ddx[4] = {-1, 0, 1, 0};\n int ddy[4] = {0, 1, 0, -1};\n for (int d = 0; d < 4; d++) {\n int nx = cx + ddx[d], ny = cy + ddy[d];\n for (int j = 0; j < N; j++) if (pet_pos[j].first == nx && pet_pos[j].second == ny) canb = false;\n }\n if (canb) {\n acts[i] = tk.act;\n will_wall.insert({cx, cy});\n walledg[cx][cy] = true;\n tindex[i]++;\n } else {\n acts[i] = '.';\n }\n } else {\n int cdist = abs(hx - tk.tx) + abs(hy - tk.ty);\n char chosen = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d];\n int ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int ndd = abs(nx - tk.tx) + abs(ny - tk.ty);\n if (ndd < cdist) {\n cdist = ndd;\n chosen = mcs[d];\n }\n }\n }\n acts[i] = chosen;\n }\n }\n } else {\n for (int i = 0; i < M; i++) {\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n int tx = homes[i].first, ty = homes[i].second;\n if (hx == tx && hy == ty) {\n acts[i] = '.';\n } else {\n int cdist = abs(hx - tx) + abs(hy - ty);\n char ch = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d], ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int nd = abs(nx - tx) + abs(ny - ty);\n if (nd < cdist) {\n cdist = nd;\n ch = mcs[d];\n }\n }\n }\n acts[i] = ch;\n }\n }\n }\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = 0;\n if (a == 'U') d = 0;\n else if (a == 'D') d = 1;\n else if (a == 'L') d = 2;\n else if (a == 'R') d = 3;\n int tx = hum_pos[i].first + dx[d];\n int ty = hum_pos[i].second + dy[d];\n if (will_wall.count({tx, ty})) {\n acts[i] = '.';\n }\n }\n }\n cout << acts << endl;\n cout.flush();\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = -1;\n for (int k = 0; k < 4; k++) if (mcs[k] == a) d = k;\n if (d >= 0) {\n hum_pos[i].first += dx[d];\n hum_pos[i].second += dy[d];\n }\n }\n }\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (char c : s) {\n int d = -1;\n if (c == 'U') d = 0;\n else if (c == 'D') d = 1;\n else if (c == 'L') d = 2;\n else if (c == 'R') d = 3;\n if (d >= 0) {\n pet_pos[i].first += dx[d];\n pet_pos[i].second += dy[d];\n }\n }\n }\n }\n return 0;\n}","ahc009":"#include \nusing namespace std;\n\nconst int H = 20;\nconst int W = 20;\nconst int MAXL = 200;\nconst int BEAMW = 200;\nconst double EPS = 1e-12;\n\nstruct State {\n double expv;\n double pr[H][W];\n};\n\nstruct TempCand {\n double expv;\n double pot;\n double pr[H][W];\n int from;\n int dird;\n};\n\nint dr[4] = {-1, 1, 0, 0};\nint dc[4] = {0, 0, -1, 1};\nchar dch[4] = {'U', 'D', 'L', 'R'};\nbool wallh[H][W-1];\nbool wallv[H-1][W];\nint dist_to[H][W];\nint parent[MAXL+1][BEAMW];\nint ch_dir[MAXL+1][BEAMW];\nState current_states[BEAMW];\nTempCand cands[BEAMW * 4 + 10];\nint dists_from[H][W];\nint from_dir[H][W];\n\nbool can_move(int r, int c, int d) {\n int nr = r + dr[d];\n int nc = c + dc[d];\n if (nr < 0 || nr >= H || nc < 0 || nc >= W) return false;\n if (d == 0) {\n return !wallv[nr][c];\n } else if (d == 1) {\n return !wallv[r][c];\n } else if (d == 2) {\n return !wallh[r][nc];\n } else {\n return !wallh[r][c];\n }\n}\n\ndouble compute_score(const string& seq, int si, int sj, int ti, int tj, double forget) {\n int L = seq.size();\n if (L == 0 || L > 200) return 0.0;\n double succ = 1.0 - forget;\n double pr[H][W] = {};\n pr[si][sj] = 1.0;\n double e = 0.0;\n double rem_mass = 1.0;\n for (int t = 0; t < L; t++) {\n char ch = seq[t];\n int d = -1;\n for (int dd = 0; dd < 4; dd++) if (dch[dd] == ch) d = dd;\n if (d < 0) return 0.0;\n double npr[H][W] = {};\n double rec = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n double pb = pr[r][c];\n if (pb <= EPS) continue;\n npr[r][c] += pb * forget;\n int nr = r, nc = c;\n if (can_move(r, c, d)) {\n nr += dr[d];\n nc += dc[d];\n }\n double pm = pb * succ;\n if (nr == ti && nc == tj) {\n rec += pm;\n } else {\n npr[nr][nc] += pm;\n }\n }\n e += rec * (401.0 - (t + 1));\n memcpy(pr, npr, sizeof(npr));\n rem_mass -= rec;\n if (rem_mass < 1e-9) break;\n }\n return e;\n}\n\nstring optimize_string(string s, int si, int sj, int ti, int tj, double forget_p) {\n if (s.empty()) return s;\n double cur_e = compute_score(s, si, sj, ti, tj, forget_p);\n int max_passes = 2;\n for (int pass = 0; pass < max_passes; pass++) {\n bool improved = false;\n for (int pos = 0; pos < (int)s.size(); pos++) {\n char orig = s[pos];\n for (int kd = 0; kd < 4; kd++) {\n char newch = dch[kd];\n if (newch == orig) continue;\n s[pos] = newch;\n double newe = compute_score(s, si, sj, ti, tj, forget_p);\n if (newe > cur_e + 1e-6) {\n cur_e = newe;\n improved = true;\n orig = newch;\n } else {\n s[pos] = orig;\n }\n }\n }\n if (!improved) break;\n }\n return s;\n}\n\nint main() {\n int si, sj, ti, tj;\n double p;\n cin >> si >> sj >> ti >> tj >> p;\n double forget_p = p;\n for (int i = 0; i < H; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W - 1; j++) {\n wallh[i][j] = (s[j] == '1');\n }\n }\n for (int i = 0; i < H - 1; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W; j++) {\n wallv[i][j] = (s[j] == '1');\n }\n }\n memset(dist_to, 0x3f, sizeof(dist_to));\n dist_to[ti][tj] = 0;\n queue> qu;\n qu.emplace(ti, tj);\n while (!qu.empty()) {\n auto [r, c] = qu.front(); qu.pop();\n for (int d = 0; d < 4; d++) if (can_move(r, c, d)) {\n int nr = r + dr[d], nc = c + dc[d];\n if (dist_to[nr][nc] > dist_to[r][c] + 1) {\n dist_to[nr][nc] = dist_to[r][c] + 1;\n qu.emplace(nr, nc);\n }\n }\n }\n memset(dists_from, 0x3f, sizeof(dists_from));\n memset(from_dir, -1, sizeof(from_dir));\n dists_from[si][sj] = 0;\n queue> qs;\n qs.emplace(si, sj);\n while (!qs.empty()) {\n auto [r, c] = qs.front(); qs.pop();\n for (int d = 0; d < 4; d++) if (can_move(r, c, d)) {\n int nr = r + dr[d], nc = c + dc[d];\n if (dists_from[nr][nc] > dists_from[r][c] + 1) {\n dists_from[nr][nc] = dists_from[r][c] + 1;\n from_dir[nr][nc] = d;\n qs.emplace(nr, nc);\n }\n }\n }\n string base_path = \"\";\n {\n int cr = ti, cc = tj;\n while (cr != si || cc != sj) {\n int used_d = from_dir[cr][cc];\n base_path += dch[used_d];\n cr -= dr[used_d];\n cc -= dc[used_d];\n }\n reverse(base_path.begin(), base_path.end());\n }\n double best_alt_e = 0.0;\n string best_alt = base_path;\n int blen = base_path.size();\n int maxk = 200 / max(1, blen);\n for (int k = 1; k <= max(1, maxk + 2); k++) {\n string cand = \"\";\n for (int r = 0; r < k; r++) {\n if ((int)cand.size() + blen > 200) break;\n cand += base_path;\n }\n if ((int)cand.size() > 200) cand.resize(200);\n double ce = compute_score(cand, si, sj, ti, tj, forget_p);\n if (ce > best_alt_e) {\n best_alt_e = ce;\n best_alt = cand;\n }\n }\n for (int repm = 1; repm <= 8; repm++) {\n string dupstr = \"\";\n for (char ch : base_path) {\n for (int rr = 0; rr < repm; rr++) {\n dupstr += ch;\n if ((int)dupstr.size() >= 200) break;\n }\n if ((int)dupstr.size() >= 200) break;\n }\n double de = compute_score(dupstr, si, sj, ti, tj, forget_p);\n if (de > best_alt_e) {\n best_alt_e = de;\n best_alt = dupstr;\n }\n }\n vector> orders = {\n {1,3,2,0},{3,1,2,0},{1,3,0,2},{3,1,0,2},\n {1,0,3,2},{3,2,1,0},{0,1,2,3},{2,3,1,0},\n {1,2,3,0},{3,0,1,2}\n };\n for (auto& dorder : orders) {\n string greedy_seq = \"\";\n int vr = si, vc = sj;\n for (int i = 0; i < 200; i++) {\n int best_d = -1;\n int best_dt = dist_to[vr][vc];\n for (int dd : dorder) {\n if (can_move(vr, vc, dd)) {\n int nr = vr + dr[dd], nc = vc + dc[dd];\n if (dist_to[nr][nc] < best_dt) {\n best_dt = dist_to[nr][nc];\n best_d = dd;\n }\n }\n }\n if (best_d == -1) best_d = 1;\n greedy_seq += dch[best_d];\n if (can_move(vr, vc, best_d)) {\n vr += dr[best_d];\n vc += dc[best_d];\n }\n }\n double ge = compute_score(greedy_seq, si, sj, ti, tj, forget_p);\n if (ge > best_alt_e) {\n best_alt_e = ge;\n best_alt = greedy_seq;\n }\n }\n int cur_num = 1;\n current_states[0].expv = 0.0;\n memset(current_states[0].pr, 0, sizeof(current_states[0].pr));\n current_states[0].pr[si][sj] = 1.0;\n for (int step = 1; step <= MAXL; step++) {\n int num_cand = 0;\n for (int b = 0; b < cur_num; b++) {\n for (int d = 0; d < 4; d++) {\n TempCand &news = cands[num_cand];\n news.expv = current_states[b].expv;\n memset(news.pr, 0, sizeof(news.pr));\n double reached = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n double pb = current_states[b].pr[r][c];\n if (pb > EPS) {\n news.pr[r][c] += pb * forget_p;\n int nr = r, nc = c;\n if (can_move(r, c, d)) {\n nr += dr[d];\n nc += dc[d];\n }\n double pm = pb * (1.0 - forget_p);\n if (nr == ti && nc == tj) {\n reached += pm;\n } else {\n news.pr[nr][nc] += pm;\n }\n }\n }\n news.expv += reached * (401.0 - step);\n news.pot = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n int dt = dist_to[r][c];\n if (dt > 999) dt = 100;\n news.pot += news.pr[r][c] * dt;\n }\n news.from = b;\n news.dird = d;\n num_cand++;\n }\n }\n vector ord(num_cand);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b) {\n if (fabs(cands[a].expv - cands[b].expv) > 1e-9) return cands[a].expv > cands[b].expv;\n return cands[a].pot < cands[b].pot;\n });\n cur_num = min(BEAMW, num_cand);\n for (int i = 0; i < cur_num; i++) {\n int idx = ord[i];\n current_states[i].expv = cands[idx].expv;\n memcpy(current_states[i].pr, cands[idx].pr, sizeof(cands[idx].pr));\n parent[step][i] = cands[idx].from;\n ch_dir[step][i] = cands[idx].dird;\n }\n }\n double beam_e = current_states[0].expv;\n string beam_str = \"\";\n int bb = 0;\n for (int st = MAXL; st >= 1; st--) {\n int d = ch_dir[st][bb];\n beam_str = dch[d] + beam_str;\n bb = parent[st][bb];\n }\n string opt_beam = optimize_string(beam_str, si, sj, ti, tj, forget_p);\n double e_beam_opt = compute_score(opt_beam, si, sj, ti, tj, forget_p);\n string opt_alt = optimize_string(best_alt, si, sj, ti, tj, forget_p);\n double e_alt_opt = compute_score(opt_alt, si, sj, ti, tj, forget_p);\n if (e_beam_opt > e_alt_opt) {\n cout << opt_beam << endl;\n } else {\n cout << opt_alt << endl;\n }\n return 0;\n}","ahc010":"#include \nusing namespace std;\n\nconst int TO[8][4] = {\n {1, 0, -1, -1},\n {3, -1, -1, 0},\n {-1, -1, 3, 2},\n {-1, 2, 1, -1},\n {1, 0, 3, 2},\n {3, 2, 1, 0},\n {2, -1, 0, -1},\n {-1, 3, -1, 1}\n};\n\nint nxt_type[8] = {1,2,3,0,5,4,7,6};\nint rotated_type[4][8];\nint givenn[30][30];\nint cur_rot[30][30];\nint cur_tiles[30][30];\nint best_rots[30][30];\n\nlong long calc_score(int tiles[][30]) {\n bool vis[30][30][4] = {};\n long long max1 = 0, max2 = 0;\n int di[4] = {0, -1, 0, 1};\n int dj[4] = {-1, 0, 1, 0};\n for(int si=0; si<30; si++){\n for(int sj=0; sj<30; sj++){\n for(int sd=0; sd<4; sd++){\n if(vis[si][sj][sd]) continue;\n int t = tiles[si][sj];\n if(TO[t][sd] < 0) continue;\n int i = si, j = sj, d = sd;\n long long len = 0;\n bool ok = true;\n while(true){\n if(len > 5000){ ok=false; break;}\n int tt = tiles[i][j];\n int d2 = TO[tt][d];\n if(d2 < 0){ ok=false; break; }\n i += di[d2];\n j += dj[d2];\n if(i < 0 || i >=30 || j<0 || j>=30){ ok=false; break;}\n d = (d2 + 2) % 4;\n len++;\n if(i == si && j == sj && d == sd){\n break;\n }\n }\n if(ok && len > 0 && i == si && j == sj && d == sd){\n if(len > max1){ max2 = max1; max1 = len;}\n else if(len > max2) max2 = len;\n i=si; j=sj; d=sd;\n for(long long k=0; k=30||nj<0||nj>=30) break;\n i = ni; j = nj; d = (d2+2)%4;\n }\n }\n }\n }\n }\n if(max2 == 0) return 0;\n return max1 * max2;\n}\n\nint main() {\n for(int k=0; k<4;k++){\n for(int t=0;t<8;t++){\n int cur = t;\n for(int r=0; r> s;\n for(int j=0;j<30;j++){\n givenn[i][j] = s[j] - '0';\n }\n }\n srand(42);\n for(int i=0;i<30;i++) for(int j=0;j<30;j++){\n cur_rot[i][j] = rand() % 4;\n cur_tiles[i][j] = rotated_type[ cur_rot[i][j] ][ givenn[i][j] ];\n }\n long long cur_sc = calc_score(cur_tiles);\n long long best_sc = cur_sc;\n memcpy(best_rots, cur_rot, sizeof(cur_rot));\n const int MAX_ITER = 40000;\n double Tstart = 2000.0;\n double Tend = 0.1;\n double cool = pow(Tend / Tstart, 1.0/MAX_ITER);\n double Temp = Tstart;\n for(int it=0; it < MAX_ITER; it++){\n int i = rand()%30;\n int j = rand()%30;\n int oldr = cur_rot[i][j];\n int oldt = cur_tiles[i][j];\n int nr = rand() % 3;\n if(nr >= oldr) nr++;\n cur_rot[i][j] = nr;\n cur_tiles[i][j] = rotated_type[nr][givenn[i][j]];\n long long nsc = calc_score(cur_tiles);\n double del = (double)nsc - (double)cur_sc;\n bool acc = (del >= 0.0);\n if(!acc && Temp > 0.01){\n if( (rand() / (double)RAND_MAX) < exp(del / Temp) ) acc = true;\n }\n if(acc){\n cur_sc = nsc;\n }else{\n cur_rot[i][j] = oldr;\n cur_tiles[i][j] = oldt;\n }\n if(cur_sc > best_sc){\n best_sc = cur_sc;\n memcpy(best_rots , cur_rot, sizeof(cur_rot));\n }\n Temp *= cool;\n }\n for(int i=0;i<30;i++){\n for(int j=0;j<30;j++){\n cout << best_rots[i][j];\n }\n }\n cout << endl;\n return 0;\n}","ahc011":"#include \nusing namespace std;\n\nint get_largest_tree(const vector>& board, int ei, int ej, int N) {\n vector> visited(N, vector(N, false));\n visited[ei][ej] = true;\n int maxs = 0;\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n int bit_from[4] = {2, 8, 1, 4};\n int bit_to[4] = {8, 2, 4, 1};\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (visited[i][j]) continue;\n vector> comp;\n queue> q;\n q.push({i, j});\n visited[i][j] = true;\n comp.push_back({i, j});\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (int d = 0; d < 4; d++) {\n int nx = x + dx[d];\n int ny = y + dy[d];\n if (nx >= 0 && nx < N && ny >= 0 && ny < N && !visited[nx][ny]) {\n if ((board[x][y] & bit_from[d]) && (board[nx][ny] & bit_to[d])) {\n visited[nx][ny] = true;\n q.push({nx, ny});\n comp.push_back({nx, ny});\n }\n }\n }\n }\n int v = comp.size();\n if (v == 0) continue;\n int e = 0;\n vector> in_c(N, vector(N, false));\n for (auto p : comp) in_c[p.first][p.second] = true;\n for (auto [x, y] : comp) {\n if (y + 1 < N && in_c[x][y + 1] && (board[x][y] & 4) && (board[x][y + 1] & 1)) e++;\n if (x + 1 < N && in_c[x + 1][y] && (board[x][y] & 8) && (board[x + 1][y] & 2)) e++;\n }\n if (v == 1 || e == v - 1) {\n maxs = max(maxs, v);\n }\n }\n }\n return maxs;\n}\n\nint get_total_edges(const vector>& board, int N, int ei, int ej) {\n int e = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == ei && j == ej) continue;\n if (j + 1 < N && !(i == ei && j + 1 == ej)) {\n if ((board[i][j] & 4) && (board[i][j + 1] & 1)) e++;\n }\n if (i + 1 < N && !(i + 1 == ei && j == ej)) {\n if ((board[i][j] & 8) && (board[i + 1][j] & 2)) e++;\n }\n }\n }\n return e;\n}\n\nint main() {\n int N, T;\n cin >> N >> T;\n vector> board(N, vector(N));\n int ei, ej;\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < N; j++) {\n char c = s[j];\n if (c >= '0' && c <= '9') board[i][j] = c - '0';\n else board[i][j] = 10 + (c - 'a');\n if (board[i][j] == 0) {\n ei = i; ej = j;\n }\n }\n }\n int maxv = N * N - 1;\n int best_s = get_largest_tree(board, ei, ej, N);\n string best_seq = \"\";\n srand(42);\n char dchar[4] = {'U', 'D', 'L', 'R'};\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n for (int trial = 0; trial < 5; trial++) {\n vector> cur_board = board;\n int cei = ei, cej = ej;\n string cur_seq = \"\";\n int cur_S = best_s;\n int last_d = -1;\n double temp = 25.0;\n int cur_edges = get_total_edges(board, N, ei, ej);\n for (int step = 0; step < T / 3; step++) {\n if (cur_S == maxv) break;\n vector> options;\n for (int d = 0; d < 4; d++) {\n int ni = cei + dx[d];\n int nj = cej + dy[d];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N) continue;\n int opp = (d <= 1 ? 1 - d : (d == 2 ? 3 : 2));\n if (last_d == opp) continue;\n int oldv = cur_board[ni][nj];\n cur_board[cei][cej] = oldv;\n cur_board[ni][nj] = 0;\n int newS = get_largest_tree(cur_board, ni, nj, N);\n int newE = get_total_edges(cur_board, N, ni, nj);\n cur_board[ni][nj] = oldv;\n cur_board[cei][cej] = 0;\n int sc = newS * 100000 + newE;\n options.emplace_back(sc, newS, newE, newS - cur_S, d);\n }\n if (options.empty()) break;\n sort(options.rbegin(), options.rend());\n int chosen = 0;\n if (temp > 8.0 && rand() % 5 == 0 && options.size() > 1) chosen = 1 + rand() % (min(3, (int)options.size() - 1));\n auto [sc, nS, nE, dS, best_d] = options[chosen];\n int ni = cei + dx[best_d];\n int nj = cej + dy[best_d];\n int old_ei = cei, old_ej = cej;\n int saved = cur_board[ni][nj];\n cur_board[old_ei][old_ej] = saved;\n cur_board[ni][nj] = 0;\n cei = ni; cej = nj;\n cur_seq += dchar[best_d];\n bool accept = (dS >= 0 || (temp > 5.0 && dS > -3));\n if (accept) {\n cur_S = nS;\n cur_edges = nE;\n last_d = best_d;\n int k = cur_seq.size();\n int final_score = (cur_S == maxv ? round(500000.0 * (2.0 - k * 1.0 / T)) : round(500000.0 * cur_S / maxv));\n int best_cur_sc = (best_s == maxv ? round(500000.0 * (2.0 - (int)best_seq.size() * 1.0 / T)) : round(500000.0 * best_s / maxv));\n if (final_score > best_cur_sc || (final_score == best_cur_sc && k < (int)best_seq.size())) {\n best_s = cur_S;\n best_seq = cur_seq;\n }\n if (cur_S == maxv) {\n best_s = maxv;\n best_seq = cur_seq;\n break;\n }\n } else {\n cur_board[cei][cej] = cur_board[old_ei][old_ej];\n cur_board[old_ei][old_ej] = 0;\n cei = old_ei;\n cej = old_ej;\n cur_seq.pop_back();\n }\n temp *= 0.998;\n }\n if (best_s == maxv) break;\n }\n cout << best_seq << endl;\n return 0;\n}","ahc012":"#include \nusing namespace std;\n\nusing ll = long long;\n\nbool hits_strawberry(ll px, ll py, ll qx, ll qy, const vector& X, const vector& Y) {\n ll vx = qx - px;\n ll vy = qy - py;\n for (int i = 0; i < (int)X.size(); i++) {\n ll ux = X[i] - px;\n ll uy = Y[i] - py;\n if (ux * vy - uy * vx == 0) return true;\n }\n return false;\n}\n\ndouble mid_angle(int gap, const vector& ord, const vector& angs, int N) {\n int p1 = ord[gap];\n int p2 = ord[(gap + 1) % N];\n double a1 = angs[p1];\n double a2 = angs[p2];\n if (a2 < a1 - 1e-9) a2 += 2 * M_PI;\n return (a1 + a2) / 2.0;\n}\n\nint main() {\n int N_int, K;\n cin >> N_int >> K;\n ll N = N_int;\n vector a(11, 0);\n for (int i = 1; i <= 10; i++) cin >> a[i];\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector angs(N);\n for (int i = 0; i < N; i++) {\n angs[i] = atan2(Y[i], X[i]);\n if (angs[i] < 0) angs[i] += 2 * M_PI;\n }\n vector ord(N);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) { return angs[i] < angs[j]; });\n\n int best_m = -1;\n int best_start = 0;\n int num_lines = 100;\n vector good_sizes;\n {\n vector rem = a;\n for (int i = 0; i < num_lines; i++) {\n int best_d = 1;\n int mx = 0;\n for (int d = 1; d <= 10; d++) {\n if (rem[d] > mx) {\n mx = rem[d];\n best_d = d;\n }\n }\n if (mx == 0) break;\n good_sizes.push_back(best_d);\n rem[best_d]--;\n }\n }\n\n for (int s = 0; s < N; s++) {\n vector main_cuts;\n main_cuts.push_back((s - 1 + N) % N);\n int cur = 0;\n for (int sz : good_sizes) {\n cur += sz;\n main_cuts.push_back((s + cur - 1 + N) % N);\n }\n set> pair_set;\n for (int m : main_cuts) {\n int o = (m + N / 2) % N;\n pair_set.insert({min(m, o), max(m, o)});\n }\n set all_cuts;\n for (auto& pr : pair_set) {\n all_cuts.insert(pr.first);\n all_cuts.insert(pr.second);\n }\n vector cutlist(all_cuts.begin(), all_cuts.end());\n int nc = cutlist.size();\n vector piece;\n for (int i = 0; i < nc; i++) {\n int from = cutlist[i];\n int to = cutlist[(i + 1) % nc];\n piece.push_back((to - from + N) % N);\n }\n vector b(11, 0);\n for (int p : piece) if (p >= 1 && p <= 10) b[p]++;\n int m_val = 0;\n for (int d = 1; d <= 10; d++) m_val += min(a[d], b[d]);\n if (m_val > best_m) {\n best_m = m_val;\n best_start = s;\n }\n }\n\n // Rebuild for best_start\n vector main_cuts;\n main_cuts.push_back((best_start - 1 + N) % N);\n int cur = 0;\n for (int sz : good_sizes) {\n cur += sz;\n main_cuts.push_back((best_start + cur - 1 + N) % N);\n }\n set> pair_set;\n for (int m : main_cuts) {\n int o = (m + N / 2) % N;\n pair_set.insert({min(m, o), max(m, o)});\n }\n vector> final_pairs(pair_set.begin(), pair_set.end());\n int k_out = min((int)final_pairs.size(), 100);\n\n cout << k_out << endl;\n for (int i = 0; i < k_out; i++) {\n int mg = final_pairs[i].first; // use any gap of the pair\n double mang = mid_angle(mg, ord, angs, N);\n double c = cos(mang);\n double s = sin(mang);\n ll px = round(c * 1000000000.0);\n ll py = round(s * 1000000000.0);\n ll qx = round(cos(mang + M_PI) * 1000000000.0);\n ll qy = round(sin(mang + M_PI) * 1000000000.0);\n int pert = 0;\n while (hits_strawberry(px, py, qx, qy, X, Y) && pert < 30) {\n qx += (pert + 1) * 17LL;\n qy += (pert + 1) * 31LL;\n pert++;\n }\n if (px == qx && py == qy) qx++;\n cout << px << \" \" << py << \" \" << qx << \" \" << qy << endl;\n }\n return 0;\n}","ahc014":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> initial_dots;\n bool initial_has[65][65] = {};\n for(int i=0; i>x>>y;\n if(!initial_has[x][y]){\n initial_has[x][y]=true;\n initial_dots.emplace_back(x,y);\n }\n }\n int c = (N-1)/2;\n vector> base_high_cand;\n vector> base_low_cand;\n for(int x=0;x> best_ops;\n long long best_sumw = -1;\n bool has_dot[65][65] = {};\n auto get_sumw = [&]() {\n long long s = 0;\n for(int x=0;x trial_seeds = {12345, 23456, 34567, 45678, 56789, 67890, 78901, 89012};\n vector perturb_scales = {0, 0, N/2, N, N, 2*N, 3*N, 4*N};\n for(int trial=0; trial<8; trial++){\n memcpy(has_dot, initial_has, sizeof(initial_has));\n vector> cur_dots = initial_dots;\n bool hused[65][65]={};\n bool vused[65][65]={};\n bool dpused[65][65]={};\n bool dnused[65][65]={};\n vector> ops;\n bool use_high_order = (trial % 3 != 2);\n bool prefer_small_aa = (trial % 2 == 0);\n auto& current_cand_base = use_high_order ? base_high_cand : base_low_cand;\n vector> current_cand = current_cand_base;\n mt19937 rng(trial_seeds[trial % 8]);\n int perturb = perturb_scales[trial];\n if(perturb > 0){\n for(auto& t : current_cand){\n long long& key = get<0>(t);\n int r = uniform_int_distribution(-perturb, perturb)(rng);\n key += r;\n }\n sort(current_cand.begin(), current_cand.end());\n }\n auto try_aa = [&](int px, int py) -> bool {\n if(has_dot[px][py]) return false;\n vector pos_oxs;\n for(int ox=0; ox pos_oys;\n for(int oy=0; oy bool {\n if(has_dot[px][py]) return false;\n int u1 = px + py;\n int v1 = px - py;\n vector> possible_opp;\n for(auto [ox,oy]: cur_dots){\n if(ox == px && oy == py) continue;\n int u2 = ox + oy;\n int v2 = ox - oy;\n if(abs(u2 - u1) < 2 || abs(v2 - v1) < 2) continue;\n if( (u2 - u1) % 2 != 0 || (v2 - v1) % 2 != 0 ) continue;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n if( (u1 + v2) % 2 !=0 || xb<0 || xb>=N || yb <0 || yb >=N ) continue;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n if( (u2 + v1)%2 !=0 || xc<0||xc>=N||yc<0||yc>=N) continue;\n if(!has_dot[xb][yb] || !has_dot[xc][yc]) continue;\n int sz = abs(u2-u1) + abs(v2-v1);\n possible_opp.emplace_back(sz, ox, oy);\n }\n sort(possible_opp.begin(), possible_opp.end());\n for(auto& tp : possible_opp){\n int sz, ox, oy;\n tie(sz, ox, oy) = tp;\n int u2 = ox + oy;\n int v2 = ox - oy;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n int umin = min(u1,u2), umax = max(u1,u2);\n int vmin = min(v1,v2), vmax = max(v1,v2);\n bool val = true;\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u1 + vv)/2; int yy=(u1 - vv)/2;\n if(xx<0||xx>=N || yy<0||yy>=N){val=false; continue;}\n bool corn = ((xx==px && yy==py) || (xx==xb && yy==yb) || (xx==ox && yy==oy) || (xx==xc && yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn ) val=false;\n }\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u2 + vv)/2; int yy=(u2 - vv)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy]&&!corn) val=false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v1)/2; int yy=(uu - v1)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n if(!val) continue;\n bool sval = true;\n for(int vv=vmin; vv < vmax; vv +=2){\n int xx = (u1 + vv)/2 ; int yy=(u1 - vv)/2;\n if(dnused[xx][yy]) sval=false;\n }\n for(int uu=umin; uu < umax; uu +=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(dpused[xx][yy]) sval = false;\n }\n for(int vv=vmin; vv best_sumw){\n best_sumw = this_sum;\n best_ops = ops;\n }\n }\n cout << best_ops.size() << endl;\n for(auto& op: best_ops){\n for(int i=0;i<8;i++){\n cout << op[i];\n if(i<7) cout<<\" \";\n }\n cout << endl;\n }\n return 0;\n}","ahc015":"#include \nusing namespace std;\n\nint main() {\n vector flav(100);\n for (int i = 0; i < 100; i++) cin >> flav[i];\n vector> grid(10, vector(10, 0));\n auto apply = [&](char d, auto& g) {\n if (d == 'F') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n for (int r = 0; r < 10; r++) g[r][c] = (r < (int)v.size() ? v[r] : 0);\n }\n } else if (d == 'B') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int r = 0; r < 10; r++) g[r][c] = (r >= 10 - sz ? v[r - (10 - sz)] : 0);\n }\n } else if (d == 'L') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n for (int c = 0; c < 10; c++) g[r][c] = (c < (int)v.size() ? v[c] : 0);\n }\n } else if (d == 'R') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int c = 0; c < 10; c++) g[r][c] = (c >= 10 - sz ? v[c - (10 - sz)] : 0);\n }\n }\n };\n auto get_score = [&](auto& g) -> long long {\n vector> vis(10, vector(10, false));\n long long res = 0;\n for (int i = 0; i < 10; i++) {\n for (int j = 0; j < 10; j++) {\n if (g[i][j] && !vis[i][j]) {\n int f = g[i][j];\n int sz = 0;\n stack> st;\n st.push({i, j});\n vis[i][j] = true;\n while (!st.empty()) {\n auto [x, y] = st.top(); st.pop();\n sz++;\n int dx[4] = {-1, 0, 1, 0};\n int dy[4] = {0, 1, 0, -1};\n for (int k = 0; k < 4; k++) {\n int nx = x + dx[k], ny = y + dy[k];\n if (nx >= 0 && nx < 10 && ny >= 0 && ny < 10 && !vis[nx][ny] && g[nx][ny] == f) {\n vis[nx][ny] = true;\n st.push({nx, ny});\n }\n }\n }\n res += 1LL * sz * sz;\n }\n }\n }\n return res;\n };\n auto get_empties = [&](auto& g) -> vector> {\n vector> res;\n for (int i = 0; i < 10; i++) for (int j = 0; j < 10; j++) if (g[i][j] == 0) res.emplace_back(i, j);\n return res;\n };\n for (int t = 0; t < 100; t++) {\n int p;\n cin >> p;\n int cnt = 0;\n int pr = -1, pc = -1;\n for (int r = 0; r < 10; r++) {\n bool found = false;\n for (int c = 0; c < 10; c++) if (grid[r][c] == 0) {\n cnt++;\n if (cnt == p) {\n pr = r; pc = c;\n found = true;\n break;\n }\n }\n if (found) break;\n }\n grid[pr][pc] = flav[t];\n if (t == 99) break;\n vector dirs = {'F','B','L','R'};\n char best_d = 'F';\n long long best_val = -1;\n int K = 50;\n int next_f = flav[t + 1];\n bool is_last_tilt = (t == 98);\n for (char d : dirs) {\n auto temp = grid;\n apply(d, temp);\n auto emps = get_empties(temp);\n if (emps.empty()) continue;\n int ns = min(K, (int)emps.size());\n long long total = 0;\n for (int s = 0; s < ns; s++) {\n auto [nr, nc] = emps[s];\n temp[nr][nc] = next_f;\n long long best_next = 0;\n if (is_last_tilt) {\n best_next = get_score(temp);\n } else {\n for (char nd : dirs) {\n auto temp2 = temp;\n apply(nd, temp2);\n long long sc = get_score(temp2);\n if (sc > best_next) best_next = sc;\n }\n }\n total += best_next;\n temp[nr][nc] = 0;\n }\n long long avg = total / ns;\n if (avg > best_val) {\n best_val = avg;\n best_d = d;\n }\n }\n cout << best_d << endl;\n cout.flush();\n apply(best_d, grid);\n }\n}","ahc016":"#include \nusing namespace std;\n\nint calc_pos(int u, int v, int n) {\n if (u > v) swap(u, v);\n return u * (2 * n - u - 1) / 2 + (v - u - 1);\n}\n\ndouble compute_exp_e(const string& gs, double eps) {\n double res = 0.0;\n for (char c : gs) {\n res += (c == '1' ? (1 - eps) : eps);\n }\n return res;\n}\n\ndouble compute_exp_t(const string& gs, int n, double eps) {\n double sum_p = 0.0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n int p1 = calc_pos(a, b, n);\n int p2 = calc_pos(a, c, n);\n int p3 = calc_pos(b, c, n);\n double pa = (gs[p1] == '1' ? (1 - eps) : eps);\n double pb = (gs[p2] == '1' ? (1 - eps) : eps);\n double pc = (gs[p3] == '1' ? (1 - eps) : eps);\n sum_p += pa * pb * pc;\n }\n }\n }\n return sum_p;\n}\n\nlong long compute_t(const string& hs, int n) {\n long long tri = 0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n if (hs[calc_pos(a, b, n)] == '1' &&\n hs[calc_pos(a, c, n)] == '1' &&\n hs[calc_pos(b, c, n)] == '1') tri++;\n }\n }\n }\n return tri;\n}\n\nint main() {\n int M;\n double eps;\n cin >> M >> eps;\n srand(42);\n int best_N = 4;\n double best_sc = -1.0;\n double best_tscale = 10.0;\n vector best_Gs;\n vector best_targ_e, best_targ_t;\n vector candidates;\n int max_n_test = (eps < 0.15 ? 45 : 75);\n int step = (eps < 0.1 ? 1 : 3);\n for (int nn = 4; nn <= max_n_test; nn += step) candidates.push_back(nn);\n if (eps < 1e-9) {\n int minn = 4;\n while ((long long)minn * (minn - 1) / 2 < M - 1) minn++;\n candidates.clear();\n candidates.push_back(minn);\n best_N = minn;\n }\n for (int ni = 0; ni < (int)candidates.size(); ni++) {\n int nn = candidates[ni];\n if (nn > 100) continue;\n long long PP = (long long)nn * (nn - 1) / 2;\n vector Gs_loc(M);\n for (int k = 0; k < M; k++) {\n long long ek = (M == 1 ? PP / 2 : round(k * PP * 1.0 / (M - 1.0)));\n string s(PP, '0');\n if (k % 3 == 0 || M <= 2 || eps < 1e-9) {\n for (long long i = 0; i < ek && i < PP; i++) s[i] = '1';\n } else if (k % 3 == 1) {\n for (long long i = 0; i < ek && i < PP; i++) {\n long long pos = (i * 17LL % PP);\n s[pos] = '1';\n }\n } else {\n vector pr(PP);\n for (int i = 0; i < PP; i++) pr[i] = i;\n auto rngv = [&](int x) { return ((long long)x * 97LL ^ (long long)k * 1234567LL) % 1000000009LL; };\n sort(pr.begin(), pr.end(), [&](int x, int y) { return rngv(x) < rngv(y); });\n for (long long i = 0; i < ek && i < PP; i++) s[pr[i]] = '1';\n }\n Gs_loc[k] = s;\n }\n vector targ_e(M), targ_t(M);\n for (int k = 0; k < M; k++) {\n targ_e[k] = compute_exp_e(Gs_loc[k], eps);\n targ_t[k] = compute_exp_t(Gs_loc[k], nn, eps);\n }\n vector test_scales = {2.0, 4.0, 8.0, 16.0, 32.0};\n for (double scf : test_scales) {\n double cur_tscale = nn * scf;\n int trials = (eps < 0.1 ? 600 : (eps < 0.25 ? 400 : 250));\n int errs = 0;\n for (int tr = 0; tr < trials; tr++) {\n int s = rand() % M;\n string noisy = Gs_loc[s];\n for (long long pos = 0; pos < PP; pos++) {\n if ((rand() / (double)RAND_MAX) < eps) {\n noisy[pos] = (noisy[pos] == '1' ? '0' : '1');\n }\n }\n int obse = 0;\n for (char c : noisy) if (c == '1') obse++;\n long long obst = compute_t(noisy, nn);\n int dec = 0;\n double mind = 1e18;\n for (int k = 0; k < M; k++) {\n double de = obse - targ_e[k];\n double dt = (double)obst - targ_t[k];\n double dst = de * de / (PP * 0.25 + 1.0) + (dt * dt) / (cur_tscale * cur_tscale + 1.0);\n if (dst < mind) {\n mind = dst;\n dec = k;\n }\n }\n if (dec != s) errs++;\n }\n double perr = (double)errs / trials;\n double e_app = 100.0 * perr;\n double sc = pow(0.9, e_app) / nn;\n if (sc > best_sc) {\n best_sc = sc;\n best_N = nn;\n best_Gs = Gs_loc;\n best_targ_e = targ_e;\n best_targ_t = targ_t;\n best_tscale = cur_tscale;\n }\n }\n }\n int N = best_N;\n long long P = (long long)N * (N - 1) / 2;\n cout << N << endl;\n for (auto& s : best_Gs) cout << s << endl;\n cout.flush();\n for (int q = 0; q < 100; q++) {\n string h;\n cin >> h;\n int obse = 0;\n for (char c : h) if (c == '1') obse++;\n long long obst = compute_t(h, N);\n int bestk = 0;\n double bestd = 1e18;\n for (int k = 0; k < M; k++) {\n double de = obse - best_targ_e[k];\n double dt = (double)obst - best_targ_t[k];\n double dst = de * de / (P * 0.25 + 1.0) + (dt * dt) / (best_tscale * best_tscale + 1.0);\n if (dst < bestd) {\n bestd = dst;\n bestk = k;\n }\n }\n cout << bestk << endl;\n cout.flush();\n }\n return 0;\n}","ahc017":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, M, D, K;\n cin >> N >> M >> D >> K;\n vector U(M), V(M), W(M);\n vector>> adj(N);\n for (int i = 0; i < M; i++) {\n cin >> U[i] >> V[i] >> W[i];\n U[i]--; V[i]--;\n adj[U[i]].emplace_back(V[i], W[i], i);\n adj[V[i]].emplace_back(U[i], W[i], i);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n mt19937 rng(123456789LL);\n int NUM_SAMPLES = 18;\n if (N < 600) NUM_SAMPLES = 30;\n vector sources;\n vector perm(N);\n iota(perm.begin(), perm.end(), 0);\n shuffle(perm.begin(), perm.end(), rng);\n for (int i = 0; i < min(NUM_SAMPLES, N); i++) sources.push_back(perm[i]);\n if (!sources.empty()) sources[0] = 0;\n vector mxs(M), mys(M), angs(M);\n for (int i = 0; i < M; i++) {\n mxs[i] = (X[U[i]] + X[V[i]]) / 2.0;\n mys[i] = (Y[U[i]] + Y[V[i]]) / 2.0;\n double dx = mxs[i] - 500.0;\n double dy = mys[i] - 500.0;\n angs[i] = atan2(dy, dx);\n }\n auto is_connected = [&](int day, const vector& rdays) -> bool {\n vector vis(N, false);\n queue q;\n q.push(0); vis[0] = true;\n int rc = 1;\n while (!q.empty()) {\n int u = q.front(); q.pop();\n for (auto [v, w, eid] : adj[u]) {\n if (rdays[eid] == day) continue;\n if (!vis[v]) {\n vis[v] = true;\n q.push(v);\n rc++;\n }\n }\n }\n return rc == N;\n };\n auto is_all_connected = [&](const vector& rd) {\n for (int d = 1; d <= D; d++) {\n if (!is_connected(d, rd)) return false;\n }\n return true;\n };\n auto get_sum = [&](int day, const vector& rdays) -> ll {\n ll sm = 0;\n for (int s : sources) {\n vector dist(N, 4000000000000000000LL);\n vector processed(N, false);\n dist[s] = 0;\n priority_queue, vector>, greater>> pq;\n pq.emplace(0, s);\n while (!pq.empty()) {\n auto [c, u] = pq.top(); pq.pop();\n if (c > dist[u] || processed[u]) continue;\n processed[u] = true;\n for (auto [v, w, e] : adj[u]) {\n if (rdays[e] == day) continue;\n ll nc = c + w;\n if (nc < dist[v]) {\n dist[v] = nc;\n pq.emplace(nc, v);\n }\n }\n }\n for (int j = 0; j < N; j++) {\n if (j == s) continue;\n ll dd = (dist[j] > 2000000000000000000LL ? 1000000000LL : dist[j]);\n sm += dd;\n }\n }\n return sm;\n };\n auto compute_proxy = [&](const vector& rd) -> ll {\n ll pr = 0;\n for (int d = 1; d <= D; d++) {\n pr += get_sum(d, rd);\n }\n return pr;\n };\n auto generate_sorted = [&](auto&& sorter) {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), sorter);\n vector rd(M);\n for (int i = 0; i < M; i++) {\n rd[ord[i]] = (i % D) + 1;\n }\n return rd;\n };\n vector>> candidates;\n // mx\n {\n auto lam = [&](int a, int b){ return mxs[a] < mxs[b]; };\n auto rd = generate_sorted(lam);\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n // my\n {\n auto lam = [&](int a, int b){ return mys[a] < mys[b]; };\n auto rd = generate_sorted(lam);\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n // random 1\n {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n shuffle(ord.begin(), ord.end(), rng);\n vector rd(M);\n for (int i = 0; i < M; i++) {\n rd[ord[i]] = (i % D) + 1;\n }\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n vector rday(M, 0);\n vector cnt(D + 1, 0);\n if (!candidates.empty()) {\n sort(candidates.begin(), candidates.end());\n rday = candidates[0].second;\n } else {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n shuffle(ord.begin(), ord.end(), rng);\n for (int i = 0; i < M; i++) {\n rday[ord[i]] = (i % D) + 1;\n }\n }\n for (int i = 0; i < M; i++) cnt[rday[i]]++;\n auto start_time = chrono::steady_clock::now();\n auto elapsed = [&]() {\n return chrono::duration(chrono::steady_clock::now() - start_time).count();\n };\n uniform_int_distribution rnd_e(0, M - 1);\n uniform_int_distribution rnd_d(1, D);\n uniform_real_distribution rnd_real(0.0, 1.0);\n ll current_proxy = 0;\n for (int d = 1; d <= D; d++) {\n current_proxy += get_sum(d, rday);\n }\n ll total_delta_abs = 0;\n int cnt_sample = 0;\n for (int tryy = 0; tryy < 100; tryy++) {\n if (elapsed() > 0.3) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n total_delta_abs += llabs(del);\n cnt_sample++;\n if (cnt_sample >= 15) break;\n }\n double T = 1e10;\n if (cnt_sample > 0) {\n double avg = (double)total_delta_abs / cnt_sample;\n T = avg * 5.0;\n if (T < 1e8) T = 1e8;\n }\n double cool_rate = 0.999;\n double TL = 5.3;\n int it = 0;\n while (true) {\n it++;\n if (it % 20 == 0 && elapsed() > TL) break;\n if (elapsed() > TL) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n bool accept = (del < 0);\n if (!accept) {\n double prob = exp(-del / T);\n if (prob > rnd_real(rng)) accept = true;\n }\n if (accept) {\n rday[e] = nd;\n cnt[od]--;\n cnt[nd]++;\n current_proxy += del;\n }\n T *= cool_rate;\n if (T < 1e5) T = 1e5;\n }\n for (int i = 0; i < M; i++) {\n cout << rday[i];\n if (i + 1 < M) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc019":"#include \nusing namespace std;\n\nint main() {\n int D;\n cin >> D;\n vector F[2], R[2];\n for (int i = 0; i < 2; i++) {\n F[i].resize(D);\n for (int k = 0; k < D; k++) cin >> F[i][k];\n R[i].resize(D);\n for (int k = 0; k < D; k++) cin >> R[i][k];\n }\n vector> pos[2];\n for (int i = 0; i < 2; i++) {\n for (int z = 0; z < D; z++) {\n vector Xs, Ys;\n for (int x = 0; x < D; x++) if (F[i][z][x] == '1') Xs.push_back(x);\n for (int y = 0; y < D; y++) if (R[i][z][y] == '1') Ys.push_back(y);\n int nf = Xs.size(), nr = Ys.size();\n if (nf >= nr) {\n for (int j = 0; j < nr; j++) pos[i].emplace_back(Xs[j], Ys[j], z);\n for (int j = 0; j < nf - nr; j++) pos[i].emplace_back(Xs[nr + j], Ys[0], z);\n } else {\n for (int j = 0; j < nf; j++) pos[i].emplace_back(Xs[j], Ys[j], z);\n for (int j = 0; j < nr - nf; j++) pos[i].emplace_back(Xs[0], Ys[nf + j], z);\n }\n }\n }\n int sz[2] = {(int)pos[0].size(), (int)pos[1].size()};\n int com_vol = min(sz[0], sz[1]);\n vector com_vox[2];\n if (sz[0] <= sz[1]) {\n for (int k = 0; k < sz[0]; k++) com_vox[0].push_back(k);\n for (int k = 0; k < sz[0]; k++) com_vox[1].push_back(k);\n } else {\n for (int k = 0; k < sz[1]; k++) com_vox[1].push_back(k);\n for (int k = 0; k < sz[1]; k++) com_vox[0].push_back(k);\n }\n auto get_com_pairs = [&](int sc, const vector& comidx) {\n int mc = comidx.size();\n if (mc <= 1) return vector>();\n vector used(mc, false);\n vector> pr;\n vector>> pidx(D, vector>(D, vector(D, -1)));\n for (int i = 0; i < mc; i++) {\n auto [x, y, z] = pos[sc][comidx[i]];\n pidx[x][y][z] = i;\n }\n int dx[6] = {1, -1, 0, 0, 0, 0};\n int dy[6] = {0, 0, 1, -1, 0, 0};\n int dz[6] = {0, 0, 0, 0, 1, -1};\n for (int i = 0; i < mc; i++) {\n if (used[i]) continue;\n auto [x, y, z] = pos[sc][comidx[i]];\n for (int d = 0; d < 6; d++) {\n int nx = x + dx[d], ny = y + dy[d], nz = z + dz[d];\n if (nx < 0 || nx >= D || ny < 0 || ny >= D || nz < 0 || nz >= D) continue;\n int j = pidx[nx][ny][nz];\n if (j != -1 && !used[j]) {\n pr.emplace_back(comidx[i], comidx[j]);\n used[i] = true;\n used[j] = true;\n break;\n }\n }\n }\n return pr;\n };\n auto prs0 = get_com_pairs(0, com_vox[0]);\n auto prs1 = get_com_pairs(1, com_vox[1]);\n int num_dom = min((int)prs0.size(), (int)prs1.size());\n int num_com1 = com_vol - 2 * num_dom;\n int only_v = abs(sz[0] - sz[1]);\n int N = num_dom + num_com1 + only_v;\n int DD = D * D * D;\n vector B[2] = {vector(DD, 0), vector(DD, 0)};\n int cur_blk = 1;\n // common dominoes\n for (int k = 0; k < num_dom; k++) {\n int b = cur_blk++;\n for (int sc = 0; sc < 2; sc++) {\n auto prs = (sc == 0 ? prs0 : prs1);\n auto [i1, i2] = prs[k];\n for (int t : {i1, i2}) {\n auto [x, y, z] = pos[sc][t];\n B[sc][x * (D * D) + y * D + z] = b;\n }\n }\n }\n // mark voxels used by dominoes\n vector dom_used[2];\n dom_used[0].assign(sz[0], false);\n dom_used[1].assign(sz[1], false);\n for (int k = 0; k < num_dom; k++) {\n for (int sc = 0; sc < 2; sc++) {\n auto prs = (sc == 0 ? prs0 : prs1);\n auto [a, b] = prs[k];\n dom_used[sc][a] = true;\n dom_used[sc][b] = true;\n }\n }\n // remaining common 1x1\n vector remain_com[2];\n for (int sc = 0; sc < 2; sc++) {\n for (int id : com_vox[sc]) {\n if (!dom_used[sc][id]) remain_com[sc].push_back(id);\n }\n }\n for (int k = 0; k < num_com1; k++) {\n int b = cur_blk++;\n for (int sc = 0; sc < 2; sc++) {\n int id = remain_com[sc][k];\n auto [x, y, z] = pos[sc][id];\n B[sc][x * (D * D) + y * D + z] = b;\n }\n }\n // only blocks on the larger side\n int large_sc = (sz[0] > sz[1] ? 0 : 1);\n vector is_common(sz[large_sc], false);\n for (int id : com_vox[large_sc]) is_common[id] = true;\n for (int id = 0; id < sz[large_sc]; id++) {\n if (!is_common[id]) {\n int b = cur_blk++;\n auto [x, y, z] = pos[large_sc][id];\n B[large_sc][x * (D * D) + y * D + z] = b;\n }\n }\n cout << N << endl;\n for (int v : B[0]) cout << v << \" \";\n cout << endl;\n for (int v : B[1]) cout << v << \" \";\n cout << endl;\n return 0;\n}","ahc020":"#include \nusing namespace std;\nusing ll = long long;\n\nll get_p_from_dd(ll dd) {\n if (dd == 0) return 0;\n ll p = (ll)sqrtl(dd);\n if (p * p >= dd) return p;\n return p + 1;\n}\n\nint main() {\n int N, M, K;\n cin >> N >> M >> K;\n vector X(N+1), Y(N+1);\n for(int i = 1; i <= N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector eu(M), ev(M);\n vector ew(M);\n for(int j = 0; j < M; j++) {\n cin >> eu[j] >> ev[j] >> ew[j];\n }\n vector Ra(K), Rb(K);\n for(int k = 0; k < K; k++) {\n cin >> Ra[k] >> Rb[k];\n }\n vector> dds(N+1, vector(K));\n for(int i=1; i<=N; i++) {\n for(int k=0; k init_t(N+1,0);\n for(int k=0; k>> g(N+1);\n for(int j=0;j mincost(N+1, LLONG_MAX/2);\n vector parent_e(N+1, -1), parent_v(N+1, -1);\n mincost[1] = 0;\n priority_queue,vector>,greater>> pq;\n pq.emplace(0LL,1);\n while(!pq.empty()){\n auto [c,u] = pq.top(); pq.pop();\n if(c > mincost[u]) continue;\n for(auto [to,eid]:g[u]){\n ll nc = c + ew[eid];\n if(nc < mincost[to]){\n mincost[to] = nc;\n parent_e[to] = eid;\n parent_v[to] = u;\n pq.emplace(nc,to);\n }\n }\n }\n vector>> spt(N+1);\n for(int i=2;i<=N;i++) if(parent_e[i]!=-1){\n spt[parent_v[i]].emplace_back(i, parent_e[i]);\n }\n auto eval_func = [&](vector trms) -> tuple, vector> {\n vector usd(M,false);\n vector rch(N+1,false);\n vector terms(N+1,0);\n for(int i=1;i<=N;i++) terms[i]=trms[i];\n auto dfs = [&](auto self, int nd) -> int {\n int ct = terms[nd];\n bool hs = terms[nd];\n for(auto [to,eid]:spt[nd]){\n int sct = self(self,to);\n ct += sct;\n if(sct>0){\n usd[eid]=true;\n hs=true;\n }\n }\n if(hs) rch[nd]=true;\n return ct;\n };\n dfs(dfs,1);\n rch[1]=true;\n vector active;\n for(int i=1;i<=N;i++) if(rch[i]) active.push_back(i);\n vector mdd(N+1,0);\n bool covers=true;\n for(int k=0;k 25000000LL) covers=false;\n mdd[besti]=max(mdd[besti],minnd);\n }\n ll cov=0;\n vector pp(N+1,0);\n for(int i=1;i<=N;i++) if(mdd[i]>0){\n ll pv=get_p_from_dd(mdd[i]);\n if(pv>5000) covers=false;\n cov += pv*pv;\n pp[i]=(int)pv;\n }\n ll edg=0;\n vector bbv(M,0);\n for(int j=0;j cur_t = init_t;\n auto current = eval_func(cur_t);\n ll current_cost; vector current_p, current_b;\n tie(current_cost, current_p, current_b) = current;\n ll global_best_cost = current_cost;\n vector global_best_p = current_p;\n vector global_best_b = current_b;\n bool updated = true;\n int iterations = 0;\n while(updated && iterations < 60){\n updated = false;\n iterations++;\n ll best_delta = 0;\n int to_rem = -1;\n vector bestp_this, bestb_this;\n for(int cand=1; cand<=N; cand++) if(cur_t[cand]){\n vector tm = cur_t;\n tm[cand] = 0;\n auto res = eval_func(tm);\n ll this_cost; vector thisp, thisb;\n tie(this_cost, thisp, thisb) = res;\n if(this_cost < current_cost && this_cost < LLONG_MAX/3){\n if(current_cost - this_cost > best_delta){\n best_delta = current_cost - this_cost;\n to_rem = cand;\n bestp_this = thisp;\n bestb_this = thisb;\n }\n }\n }\n if(to_rem != -1){\n updated = true;\n cur_t[to_rem] = 0;\n current_cost -= best_delta;\n current_p = bestp_this;\n current_b = bestb_this;\n if(current_cost < global_best_cost){\n global_best_cost = current_cost;\n global_best_p = current_p;\n global_best_b = current_b;\n }\n }\n }\n // try adding a few promising stations (top-2 for high-P stations)\n vector> high_p_stations;\n for(int i=1;i<=N;i++) if(current_p[i]>1000){\n high_p_stations.emplace_back(-current_p[i],i);\n }\n sort(high_p_stations.begin(),high_p_stations.end());\n for(int addtry=0; addtry<5 && addtry<(int)high_p_stations.size(); addtry++){\n int target = high_p_stations[addtry].second;\n for(int k=0;k> alts;\n for(int i=1;i<=N;i++) if(!cur_t[i] && i!=target){\n alts.emplace_back(dds[i][k],i);\n }\n if(!alts.empty()){\n sort(alts.begin(),alts.end());\n int candidate = alts[0].second;\n if(!cur_t[candidate]){\n vector tm = cur_t;\n tm[candidate] = 1;\n auto res = eval_func(tm);\n ll this_cost; vector thisp, thisb;\n tie(this_cost, thisp, thisb) = res;\n if(this_cost < current_cost && this_cost < LLONG_MAX/3){\n cur_t[candidate] = 1;\n current_cost = this_cost;\n current_p = thisp;\n current_b = thisb;\n if(current_cost < global_best_cost){\n global_best_cost = current_cost;\n global_best_p = current_p;\n global_best_b = current_b;\n }\n break;\n }\n }\n }\n }\n }\n }\n for(int i=1;i<=N;i++) {\n cout << global_best_p[i];\n if(i < N) cout << \" \";\n else cout << \"\\n\";\n }\n for(int j=0;j\nusing namespace std;\n\nconst int N = 30;\nint grid[N][N];\n\nint main() {\n for (int x = 0; x < N; x++) {\n for (int y = 0; y <= x; y++) {\n cin >> grid[x][y];\n }\n }\n vector> ops;\n while (true) {\n int best_mn = INT_MAX;\n int best_viol = -1;\n int best_x = -1, best_y = -1;\n int best_mx = -1, best_my = -1;\n for (int x = 0; x < N - 1; x++) {\n for (int y = 0; y <= x; y++) {\n int p = grid[x][y];\n int c1 = grid[x + 1][y];\n int c2 = grid[x + 1][y + 1];\n int mn = min(c1, c2);\n int mn_x = (c1 < c2 ? x + 1 : x + 1);\n int mn_y = (c1 < c2 ? y : y + 1);\n if (p > mn) {\n int viol = p - mn;\n bool better = false;\n if (mn < best_mn) better = true;\n else if (mn == best_mn) {\n if (viol > best_viol) better = true;\n else if (viol == best_viol && x > best_x) better = true;\n }\n if (better) {\n best_mn = mn;\n best_viol = viol;\n best_x = x;\n best_y = y;\n best_mx = mn_x;\n best_my = mn_y;\n }\n }\n }\n }\n if (best_x == -1) break;\n ops.push_back({best_x, best_y, best_mx, best_my});\n int n1 = grid[best_x][best_y], n2 = grid[best_mx][best_my];\n grid[best_x][best_y] = n2;\n grid[best_mx][best_my] = n1;\n }\n cout << ops.size() << endl;\n for (auto& ar : ops) {\n cout << ar[0] << \" \" << ar[1] << \" \" << ar[2] << \" \" << ar[3] << endl;\n }\n return 0;\n}","toyota2023summer-final":"#include \nusing namespace std;\n\nint main() {\n int D, N;\n cin >> D >> N;\n bool is_obst[9][9];\n memset(is_obst, 0, sizeof(is_obst));\n for (int i = 0; i < N; i++) {\n int r, c;\n cin >> r >> c;\n is_obst[r][c] = true;\n }\n int er = 0, ec = 4;\n int dr[4] = {-1, 0, 1, 0};\n int dc[4] = {0, 1, 0, -1};\n vector> positions;\n for (int r = 0; r < D; r++) {\n for (int c = 0; c < D; c++) {\n if (!is_obst[r][c] && !(r == er && c == ec)) {\n positions.emplace_back(r, c);\n }\n }\n }\n int MM = positions.size();\n vector> fixed_order;\n {\n bool temp_has[9][9] = {false};\n for (auto p : positions) temp_has[p.first][p.second] = true;\n bool emptied[9][9] = {false};\n emptied[er][ec] = true;\n for (int it = 0; it < MM; it++) {\n set> accs;\n for (int i = 0; i < D; i++) for (int j = 0; j < D; j++) {\n if (emptied[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && temp_has[ni][nj] && !is_obst[ni][nj]) {\n accs.insert({ni, nj});\n }\n }\n }\n }\n if (accs.empty()) break;\n auto bp = *accs.begin();\n fixed_order.push_back(bp);\n temp_has[bp.first][bp.second] = false;\n emptied[bp.first][bp.second] = true;\n }\n }\n int order_id[9][9];\n memset(order_id, -1, sizeof(order_id));\n for (int i = 0; i < min(MM, (int)fixed_order.size()); i++) {\n auto [r, c] = fixed_order[i];\n order_id[r][c] = i;\n }\n int rem_layer[9][9];\n memset(rem_layer, -1, sizeof(rem_layer));\n {\n bool emptied[9][9] = {false};\n emptied[er][ec] = true;\n int current_l = 0;\n bool progress = true;\n while (progress) {\n progress = false;\n vector> accessible;\n for (auto pos : positions) {\n int i = pos.first, j = pos.second;\n if (!emptied[i][j]) {\n bool adj = false;\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && emptied[ni][nj] && !is_obst[ni][nj]) {\n adj = true;\n break;\n }\n }\n if (adj) accessible.push_back({i, j});\n }\n }\n if (!accessible.empty()) {\n progress = true;\n for (auto p : accessible) {\n rem_layer[p.first][p.second] = current_l;\n emptied[p.first][p.second] = true;\n }\n current_l++;\n }\n }\n }\n bool assigned[81] = {false};\n int pos_label[9][9];\n memset(pos_label, -1, sizeof(pos_label));\n bool has_cont[9][9] = {false};\n auto get_vis = [&]() -> vector> {\n vector> vis(D, vector(D, false));\n queue> q;\n q.emplace(er, ec);\n vis[er][ec] = true;\n while (!q.empty()) {\n auto [r, c] = q.front();\n q.pop();\n for (int k = 0; k < 4; k++) {\n int nr = r + dr[k], nc = c + dc[k];\n if (nr >= 0 && nr < D && nc >= 0 && nc < D && !is_obst[nr][nc] &&\n !vis[nr][nc] && !has_cont[nr][nc]) {\n vis[nr][nc] = true;\n q.emplace(nr, nc);\n }\n }\n }\n return vis;\n };\n for (int step = 0; step < MM; step++) {\n int t;\n cin >> t;\n int rank = 0;\n for (int l = 0; l < MM; l++) {\n if (!assigned[l] && l < t) rank++;\n }\n auto vis = get_vis();\n int cur_degree[9][9];\n memset(cur_degree, 0, sizeof(cur_degree));\n for (int i = 0; i < D; i++) {\n for (int j = 0; j < D; j++) {\n if (!is_obst[i][j] && !has_cont[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && !is_obst[ni][nj] &&\n !has_cont[ni][nj]) {\n cur_degree[i][j]++;\n }\n }\n }\n }\n }\n vector> cands;\n for (auto p : positions) {\n int r = p.first, c = p.second;\n if (!has_cont[r][c] && vis[r][c]) {\n cands.push_back(p);\n }\n }\n vector> safes;\n int num_cur = cands.size();\n for (auto p : cands) {\n int r = p.first, c = p.second;\n has_cont[r][c] = true;\n auto vis2 = get_vis();\n has_cont[r][c] = false;\n int cnt = 0;\n for (auto posi : positions) {\n int rr = posi.first, cc = posi.second;\n if (!has_cont[rr][cc] && vis2[rr][cc]) cnt++;\n }\n if (cnt == num_cur - 1 || num_cur <= 1) {\n safes.push_back(p);\n }\n }\n if (safes.empty()) {\n safes = cands;\n }\n sort(safes.begin(), safes.end(), [&](const pair& a, const pair& b) {\n int la = rem_layer[a.first][a.second];\n int lb = rem_layer[b.first][b.second];\n if (la != lb) return la < lb;\n int dega = cur_degree[a.first][a.second];\n int degb = cur_degree[b.first][b.second];\n if (dega != degb) return dega > degb;\n int ida = order_id[a.first][a.second];\n int idb = order_id[b.first][b.second];\n if (ida != idb && ida >= 0 && idb >= 0) return ida < idb;\n if (a.first != b.first) return a.first < b.first;\n return a.second < b.second;\n });\n int chosen_idx = rank;\n if (chosen_idx >= (int)safes.size()) chosen_idx = max(0, (int)safes.size() - 1);\n if (safes.empty() && !cands.empty()) {\n safes = cands;\n chosen_idx = 0;\n }\n int pi = 0, pj = 0;\n if (!safes.empty()) {\n auto p = safes[chosen_idx];\n pi = p.first; pj = p.second;\n } else if (!cands.empty()) {\n auto p = cands[0];\n pi = p.first; pj = p.second;\n }\n cout << pi << \" \" << pj << endl;\n pos_label[pi][pj] = t;\n has_cont[pi][pj] = true;\n assigned[t] = true;\n }\n vector> order;\n int remain = MM;\n while (remain > 0) {\n auto vis = get_vis();\n set> accs;\n for (int i = 0; i < D; i++) {\n for (int j = 0; j < D; j++) {\n if (vis[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && has_cont[ni][nj] &&\n !is_obst[ni][nj]) {\n accs.insert({ni, nj});\n }\n }\n }\n }\n }\n if (accs.empty()) break;\n int minl = INT_MAX;\n pair bp = {-1, -1};\n for (auto p : accs) {\n int l = pos_label[p.first][p.second];\n if (l >= 0 && l < minl) {\n minl = l;\n bp = p;\n }\n }\n if (bp.first == -1) break;\n order.push_back(bp);\n has_cont[bp.first][bp.second] = false;\n remain--;\n }\n for (auto [i, j] : order) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc024":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> C(n, vector(n));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> C[i][j];\n auto adj_mat = vector>(m + 1, vector(m + 1, false));\n auto mark_bdry = [&](int i, int j) {\n int c = C[i][j];\n adj_mat[c][0] = adj_mat[0][c] = true;\n };\n for (int j = 0; j < n; j++) {\n mark_bdry(0, j); mark_bdry(n - 1, j);\n }\n for (int i = 0; i < n; i++) {\n mark_bdry(i, 0); mark_bdry(i, n - 1);\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int c = C[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = C[ni][nj];\n if (c != d) adj_mat[c][d] = adj_mat[d][c] = true;\n }\n }\n }\n }\n vector> newm = C;\n vector> contact_cnt(m + 1, vector(m + 1, 0));\n vector> dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\n auto rebuild_cnt = [&]() {\n contact_cnt.assign(m + 1, vector(m + 1, 0));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n int b = 0; bool is_out = false;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) is_out = true;\n else b = newm[ni][nj];\n if (c == b) continue;\n bool should = is_out || (di > 0 || (di == 0 && dj > 0));\n if (should) {\n int mn = min(c, b), mx = max(c, b);\n contact_cnt[mn][mx]++;\n }\n }\n }\n };\n rebuild_cnt();\n // leaf peeling (same == 1)\n bool changed = true;\n while (changed) {\n changed = false;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n if (c == 0) continue;\n int same = 0;\n bool exposed = false;\n vector neigh;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) {\n exposed = true; continue;\n }\n int b = newm[ni][nj];\n if (b == c) same++;\n else {\n neigh.push_back(b);\n if (b == 0) exposed = true;\n }\n }\n if (same != 1 || !exposed) continue;\n bool bad_exp = false;\n for (int b : neigh) if (b > 0 && !adj_mat[b][0]) { bad_exp = true; break; }\n if (bad_exp) continue;\n map contrib;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n int b = 0; bool is_out = false;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) { is_out = true; b = 0; }\n else b = newm[ni][nj];\n if (c == b) continue;\n bool should = is_out || (di > 0 || (di == 0 && dj > 0));\n if (should) contrib[b]++;\n }\n bool is_last = false;\n for (auto& kv : contrib) {\n int b = kv.first; int cn = kv.second;\n int mn = min(c, b), mx = max(c, b);\n if (contact_cnt[mn][mx] == cn) { is_last = true; break; }\n }\n if (is_last) continue;\n newm[i][j] = 0;\n changed = true;\n for (auto& kv : contrib) {\n int b = kv.first; int cn = kv.second;\n int mn = min(c, b), mx = max(c, b);\n contact_cnt[mn][mx] -= cn;\n }\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int b = newm[ni][nj];\n if (b > 0) {\n int mn = 0, mx = b;\n contact_cnt[mn][mx]++;\n }\n }\n }\n }\n }\n // second pass: safely remove cells with many same neighbors\n for (int sweep = 0; sweep < 3; sweep++) {\n bool did_remove = false;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n if (c == 0) continue;\n int same = 0;\n bool exposed = false;\n vector neigh;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) {\n exposed = true; continue;\n }\n int b = newm[ni][nj];\n if (b == c) same++;\n else {\n neigh.push_back(b);\n if (b == 0) exposed = true;\n }\n }\n if (same < 3 || !exposed) continue;\n bool bad_exp = false;\n for (int b : neigh) if (b > 0 && !adj_mat[b][0]) { bad_exp = true; break; }\n if (bad_exp) continue;\n map contrib;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n int b = 0; bool is_out = false;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) { is_out = true; b = 0; }\n else b = newm[ni][nj];\n if (c == b) continue;\n bool should = is_out || (di > 0 || (di == 0 && dj > 0));\n if (should) contrib[b]++;\n }\n bool is_last = false;\n for (auto& kv : contrib) {\n int b = kv.first; int cn = kv.second;\n int mn = min(c, b), mx = max(c, b);\n if (contact_cnt[mn][mx] == cn) { is_last = true; break; }\n }\n if (is_last) continue;\n // tentative removal + connectivity check\n newm[i][j] = 0;\n vector> cells_of_c;\n for (int x = 0; x < n; x++) for (int y = 0; y < n; y++) if (newm[x][y] == c) cells_of_c.emplace_back(x, y);\n bool still_connected = true;\n if (!cells_of_c.empty()) {\n vector> vis(n, vector(n, false));\n queue> q;\n auto [sx, sy] = cells_of_c[0];\n q.push({sx, sy}); vis[sx][sy] = true;\n int cnt = 1;\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (auto [dx, dy] : dirs) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == c) {\n vis[nx][ny] = true; q.push({nx, ny}); cnt++;\n }\n }\n }\n still_connected = (cnt == (int)cells_of_c.size());\n }\n if (!still_connected) {\n newm[i][j] = c;\n continue;\n }\n // accept\n did_remove = true;\n for (auto& kv : contrib) {\n int b = kv.first; int cn = kv.second;\n int mn = min(c, b), mx = max(c, b);\n contact_cnt[mn][mx] -= cn;\n }\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int b = newm[ni][nj];\n if (b > 0) {\n int mn = 0, mx = b;\n contact_cnt[mn][mx]++;\n }\n }\n }\n }\n if (!did_remove) break;\n }\n auto new_adj = vector>(m + 1, vector(m + 1, false));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = newm[ni][nj];\n if (c != d) new_adj[c][d] = new_adj[d][c] = true;\n }\n }\n }\n for (int j = 0; j < n; j++) {\n if (newm[0][j] != 0) { int c = newm[0][j]; new_adj[c][0] = new_adj[0][c] = true; }\n if (newm[n - 1][j] != 0) { int c = newm[n - 1][j]; new_adj[c][0] = new_adj[0][c] = true; }\n }\n for (int i = 0; i < n; i++) {\n if (newm[i][0] != 0) { int c = newm[i][0]; new_adj[c][0] = new_adj[0][c] = true; }\n if (newm[i][n - 1] != 0) { int c = newm[i][n - 1]; new_adj[c][0] = new_adj[0][c] = true; }\n }\n bool adj_ok = true;\n for (int c = 0; c <= m; c++) for (int d = 0; d <= m; d++) {\n if (adj_mat[c][d] != new_adj[c][d]) adj_ok = false;\n }\n bool conn_ok = true;\n for (int c = 1; c <= m && conn_ok; c++) {\n vector> pos;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == c) pos.emplace_back(i, j);\n if (pos.empty()) { conn_ok = false; continue; }\n vector> vis(n, vector(n, false));\n queue> q;\n auto [sx, sy] = pos[0];\n q.push({sx, sy}); vis[sx][sy] = true;\n int cnt = 1;\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (auto [dx, dy] : dirs) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == c) {\n vis[nx][ny] = true; q.push({nx, ny}); cnt++;\n }\n }\n }\n if (cnt != (int)pos.size()) conn_ok = false;\n }\n if (conn_ok) {\n vector> zeros;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == 0) zeros.emplace_back(i, j);\n if (!zeros.empty()) {\n vector> vis(n, vector(n, false));\n queue> q;\n int cnt = 0;\n for (auto [i2, j2] : zeros) {\n if ((i2 == 0 || i2 == n - 1 || j2 == 0 || j2 == n - 1) && !vis[i2][j2]) {\n vis[i2][j2] = true; q.push({i2, j2}); cnt++;\n }\n }\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (auto [dx, dy] : dirs) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == 0) {\n vis[nx][ny] = true; q.push({nx, ny}); cnt++;\n }\n }\n }\n if (cnt != (int)zeros.size()) conn_ok = false;\n }\n }\n if (!adj_ok || !conn_ok) newm = C;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cout << newm[i][j];\n if (j < n - 1) cout << \" \";\n }\n cout << endl;\n }\n}","ahc025":"#include \nusing namespace std;\n\nint main() {\n int N, D, Q;\n cin >> N >> D >> Q;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n uniform_real_distribution uni(0.0, 1.0);\n vector score(N, 0);\n double target_part = 20.0;\n double avg_size = target_part * (double)N / (2.0 * Q);\n avg_size = max(avg_size, 1.5);\n double p = avg_size / (double)N;\n for (int q = 0; q < Q; q++) {\n vector L, R;\n vector used(N, false);\n for (int i = 0; i < N; i++) {\n double r = uni(rng);\n if (r < p) {\n L.push_back(i);\n used[i] = true;\n } else if (r < 2 * p) {\n R.push_back(i);\n used[i] = true;\n }\n }\n if (L.empty()) {\n for (int t = 0; t < N; t++) {\n int i = rng() % N;\n if (!used[i]) {\n L.push_back(i);\n used[i] = true;\n break;\n }\n }\n }\n if (R.empty()) {\n for (int t = 0; t < N; t++) {\n int i = rng() % N;\n if (!used[i]) {\n R.push_back(i);\n used[i] = true;\n break;\n }\n }\n }\n if (L.empty() || R.empty()) {\n L.clear();\n R.clear();\n used.assign(N, false);\n int a = rng() % N;\n L.push_back(a);\n used[a] = true;\n int b = rng() % N;\n while (used[b]) b = rng() % N;\n R.push_back(b);\n }\n cout << L.size() << \" \" << R.size();\n for (int x : L) cout << \" \" << x;\n for (int x : R) cout << \" \" << x;\n cout << endl;\n string res;\n cin >> res;\n int sgn = 0;\n if (res == \">\") sgn = 1;\n else if (res == \"<\") sgn = -1;\n for (int x : L) score[x] += sgn;\n for (int x : R) score[x] -= sgn;\n }\n long long minw = LLONG_MAX;\n for (auto x : score) minw = min(minw, x);\n for (auto &x : score) x = x - minw + 1LL;\n vector> items;\n for (int i = 0; i < N; i++) {\n items.emplace_back(score[i], i);\n }\n sort(items.rbegin(), items.rend());\n vector group_sums(D, 0);\n vector group_id(N, 0);\n for (auto &pr : items) {\n int id = pr.second;\n int best = 0;\n for (int g = 1; g < D; g++) {\n if (group_sums[g] < group_sums[best]) best = g;\n }\n group_id[id] = best;\n group_sums[best] += pr.first;\n }\n for (int i = 0; i < N; i++) {\n if (i > 0) cout << \" \";\n cout << group_id[i];\n }\n cout << endl;\n return 0;\n}","ahc026":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> st(m);\n for (int i = 0; i < m; i++) {\n st[i].resize(n / m);\n for (int j = 0; j < n / m; j++) {\n cin >> st[i][j];\n }\n }\n vector> ops;\n int cur = 1;\n auto get_top = [&](int s) -> int {\n if (st[s].empty()) return n + 1;\n return st[s].back();\n };\n auto can_extract = [&]() -> bool {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) return true;\n }\n return false;\n };\n auto find_pos = [&](int v) -> pair {\n for (int s = 0; s < m; s++) {\n for (int h = 0; h < (int)st[s].size(); h++) {\n if (st[s][h] == v) return {s, h};\n }\n }\n return {-1, -1};\n };\n auto compute_run_and_score = [&](int from_s, int start_idx, int dest) -> int {\n if (from_s == dest) return -1;\n int fsz = (int)st[from_s].size();\n if (start_idx < 0 || start_idx >= fsz) return -1;\n int pl = fsz - start_idx;\n int tlen = 0;\n int e_val = 0;\n int dp = 0;\n bool cn = true;\n while (cn) {\n int val;\n if (dp < pl) {\n val = st[from_s][fsz - 1 - dp];\n } else {\n int od = dp - pl;\n int osz = (int)st[dest].size();\n if (od >= osz) val = -999;\n else val = st[dest][osz - 1 - od];\n }\n if (val < 1 || val > n) {\n cn = false;\n continue;\n }\n if (tlen == 0) {\n tlen = 1;\n e_val = val + 1;\n dp++;\n continue;\n }\n if (val == e_val) {\n tlen++;\n e_val++;\n dp++;\n } else {\n cn = false;\n }\n }\n int md = n + 1;\n for (int val : st[dest]) md = min(md, val);\n int ot = get_top(dest);\n int sd = (int)st[dest].size();\n int sc = tlen * 10000 + md * 4 + sd * 2 + ot + pl * 40;\n if (sd == 0) sc += 100000;\n return sc;\n };\n while (cur <= n) {\n if (can_extract()) {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) {\n ops.emplace_back(cur, 0);\n st[s].pop_back();\n cur++;\n break;\n }\n }\n continue;\n }\n auto [cs, h] = find_pos(cur);\n assert(h != -1 && h + 1 < (int)st[cs].size());\n int csz = (int)st[cs].size();\n int best_score = -1;\n int best_from = -1;\n int best_start_idx = -1;\n int best_dest = -1;\n // obstacle moves: any cut above cur in current stack\n for (int stt = h + 1; stt < csz; stt++) {\n for (int dd = 0; dd < m; dd++) {\n if (dd == cs) continue;\n int sc = compute_run_and_score(cs, stt, dd);\n if (sc > best_score) {\n best_score = sc;\n best_from = cs;\n best_start_idx = stt;\n best_dest = dd;\n }\n }\n }\n // proactive k=1 from other stacks\n for (int fs = 0; fs < m; fs++) {\n if (fs == cs || st[fs].empty()) continue;\n int fsz = (int)st[fs].size();\n int stt = fsz - 1;\n for (int dd = 0; dd < m; dd++) {\n if (dd == fs) continue;\n int sc = compute_run_and_score(fs, stt, dd);\n sc -= 250; // penalty for proactive moves\n if (sc > best_score) {\n best_score = sc;\n best_from = fs;\n best_start_idx = stt;\n best_dest = dd;\n }\n }\n }\n assert(best_from != -1 && best_start_idx != -1 && best_dest != -1);\n int chosen_v = st[best_from][best_start_idx];\n ops.emplace_back(chosen_v, best_dest + 1);\n auto& frm = st[best_from];\n int frm_sz = (int)frm.size();\n for (int k = best_start_idx; k < frm_sz; k++) {\n st[best_dest].push_back(frm[k]);\n }\n frm.resize(best_start_idx);\n }\n for (auto [v, i] : ops) {\n cout << v << \" \" << i << endl;\n }\n}","ahc027":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector h(N - 1), v(N);\n for (int i = 0; i < N - 1; i++) cin >> h[i];\n for (int i = 0; i < N; i++) cin >> v[i];\n vector> d(N, vector(N));\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) cin >> d[i][j];\n vector> visited(N, vector(N, false));\n int DI[4] = {0, 1, 0, -1};\n int DJ[4] = {1, 0, -1, 0};\n string DIR = \"RDLU\";\n function dfs = [&](int i, int j) {\n visited[i][j] = true;\n for (int dir = 0; dir < 4; dir++) {\n int ni = i + DI[dir];\n int nj = j + DJ[dir];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N || visited[ni][nj]) continue;\n bool nowall;\n if (DI[dir] == 0) {\n nowall = (v[i][min(j, nj)] == '0');\n } else {\n nowall = (h[min(i, ni)][j] == '0');\n }\n if (nowall) {\n cout << DIR[dir];\n dfs(ni, nj);\n int backdir = (dir + 2) % 4;\n cout << DIR[backdir];\n }\n }\n };\n dfs(0, 0);\n cout << endl;\n return 0;\n}","ahc028":"#include \nusing namespace std;\nusing pii = pair;\n\npair> compute_path(int ci, int cj, const string& need, const vector>& pos) {\n int r = need.size();\n if (r == 0) return {0, {}};\n vector> cands(r);\n for (int k = 0; k < r; k++) cands[k] = pos[need[k] - 'A'];\n vector> dp(r), pre(r);\n int sz0 = cands[0].size();\n dp[0].assign(sz0, INT_MAX / 2);\n pre[0].assign(sz0, -1);\n for (int j = 0; j < sz0; j++) {\n auto [x, y] = cands[0][j];\n dp[0][j] = abs(x - ci) + abs(y - cj);\n }\n for (int k = 1; k < r; k++) {\n int psz = cands[k - 1].size();\n int sz = cands[k].size();\n dp[k].assign(sz, INT_MAX / 2);\n pre[k].assign(sz, -1);\n for (int j = 0; j < sz; j++) {\n auto [x, y] = cands[k][j];\n for (int pj = 0; pj < psz; pj++) {\n if (dp[k - 1][pj] >= INT_MAX / 2) continue;\n auto [px, py] = cands[k - 1][pj];\n int d = abs(x - px) + abs(y - py);\n int tot = dp[k - 1][pj] + d;\n if (tot < dp[k][j]) {\n dp[k][j] = tot;\n pre[k][j] = pj;\n }\n }\n }\n }\n int ls = cands[r - 1].size();\n int md = INT_MAX / 2;\n int bj = 0;\n for (int j = 0; j < ls; j++) {\n if (dp[r - 1][j] < md) {\n md = dp[r - 1][j];\n bj = j;\n }\n }\n vector path(r);\n int currj = bj;\n for (int k = r - 1; k >= 0; k--) {\n path[k] = cands[k][currj];\n if (k >= 1) currj = pre[k][currj];\n }\n return {md, path};\n}\n\nint get_min_dist_sum(int ci, int cj, const string& need, const vector>& pos) {\n int r = need.size();\n if (r == 0) return 0;\n vector> cands(r);\n for (int k = 0; k < r; k++) cands[k] = pos[need[k] - 'A'];\n vector> dp(r);\n int sz0 = cands[0].size();\n dp[0].assign(sz0, INT_MAX / 2);\n for (int j = 0; j < sz0; j++) {\n auto [x, y] = cands[0][j];\n dp[0][j] = abs(x - ci) + abs(y - cj);\n }\n for (int k = 1; k < r; k++) {\n int psz = cands[k - 1].size();\n int sz = cands[k].size();\n dp[k].assign(sz, INT_MAX / 2);\n for (int j = 0; j < sz; j++) {\n auto [x, y] = cands[k][j];\n for (int pj = 0; pj < psz; pj++) {\n if (dp[k - 1][pj] >= INT_MAX / 2) continue;\n auto [px, py] = cands[k - 1][pj];\n int d = abs(x - px) + abs(y - py);\n dp[k][j] = min(dp[k][j], dp[k - 1][pj] + d);\n }\n }\n }\n int md = INT_MAX / 2;\n for (int j = 0; j < (int)dp.back().size(); j++) {\n md = min(md, dp.back()[j]);\n }\n return md;\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n int si, sj;\n cin >> si >> sj;\n vector grid(N);\n for (int i = 0; i < N; i++) cin >> grid[i];\n vector ts(M);\n for (int i = 0; i < M; i++) cin >> ts[i];\n vector> pos(26);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int c = grid[i][j] - 'A';\n pos[c].emplace_back(i, j);\n }\n }\n vector covered(M, false);\n int uncov = M;\n string current_S = \"\";\n int ci = si, cj = sj;\n vector actions;\n while (uncov > 0) {\n int chosen_k = -1;\n vector chosen_path;\n if (uncov > 40) {\n int best_score = INT_MAX;\n for (int k = 0; k < M; k++) {\n if (covered[k]) continue;\n const string& t = ts[k];\n int maxo = 0;\n int maxp = min(4, (int)current_S.size());\n for (int o = maxp; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : current_S.substr(current_S.size() - o, o));\n string pref = t.substr(0, o);\n if (suf == pref) {\n maxo = o;\n break;\n }\n }\n string needed = t.substr(maxo);\n if (needed.empty()) {\n covered[k] = true;\n uncov--;\n continue;\n }\n auto [md, pth] = compute_path(ci, cj, needed, pos);\n int addc = (int)needed.size() + md;\n int score = addc - maxo * 2;\n if (score < best_score) {\n best_score = score;\n chosen_k = k;\n chosen_path = pth;\n }\n }\n } else {\n int best_est = INT_MAX;\n for (int k = 0; k < M; k++) {\n if (covered[k]) continue;\n const string& t = ts[k];\n int maxo = 0;\n int maxp = min(4, (int)current_S.size());\n for (int o = maxp; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : current_S.substr(current_S.size() - o, o));\n string pref = t.substr(0, o);\n if (suf == pref) {\n maxo = o;\n break;\n }\n }\n string needed = t.substr(maxo);\n if (needed.empty()) {\n covered[k] = true;\n uncov--;\n continue;\n }\n auto [md, pth] = compute_path(ci, cj, needed, pos);\n int addc = (int)needed.size() + md;\n if (pth.empty()) continue;\n pii last_pos = pth.back();\n int new_ci = last_pos.first, new_cj = last_pos.second;\n string old_last = current_S.size() >= 4 ? current_S.substr(current_S.size() - 4) : current_S;\n string new_last_temp = old_last + needed;\n string new_last = new_last_temp.size() > 4 ? new_last_temp.substr(new_last_temp.size() - 4) : new_last_temp;\n int min_nxt = 0;\n if (uncov > 1) {\n min_nxt = INT_MAX / 2;\n for (int nk = 0; nk < M; nk++) {\n if (!covered[nk] && nk != k) {\n const string& nt = ts[nk];\n int nmo = 0;\n int npm = min(4, (int)new_last.size());\n for (int o = npm; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : new_last.substr(new_last.size() - o, o));\n if (suf == nt.substr(0, o)) {\n nmo = o;\n break;\n }\n }\n string nneed = nt.substr(nmo);\n if (nneed.empty()) {\n min_nxt = 0;\n break;\n }\n int nmd = get_min_dist_sum(new_ci, new_cj, nneed, pos);\n int nadd = (int)nneed.size() + nmd;\n if (nadd < min_nxt) min_nxt = nadd;\n }\n }\n if (min_nxt == INT_MAX / 2) min_nxt = 0;\n }\n int est = addc - maxo * 2 + (uncov > 1 ? min_nxt : 0);\n if (est < best_est) {\n best_est = est;\n chosen_k = k;\n chosen_path = pth;\n }\n }\n }\n if (chosen_k == -1) break;\n for (auto ppos : chosen_path) {\n actions.push_back(ppos);\n auto [x, y] = ppos;\n current_S += grid[x][y];\n ci = x;\n cj = y;\n if (current_S.size() >= 5) {\n string last5 = current_S.substr(current_S.size() - 5, 5);\n for (int kk = 0; kk < M; kk++) {\n if (!covered[kk] && ts[kk] == last5) {\n covered[kk] = true;\n uncov--;\n }\n }\n }\n }\n }\n for (auto [i, j] : actions) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc030":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n double eps;\n cin >> N >> M >> eps;\n for(int k = 0; k < M; k++) {\n int d;\n cin >> d;\n for(int p = 0; p < d; p++) {\n int x, y;\n cin >> x >> y;\n }\n }\n vector> positives;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n if(v > 0) {\n positives.emplace_back(i, j);\n }\n }\n }\n cout << \"a \" << positives.size();\n for(auto [i,j] : positives) {\n cout << \" \" << i << \" \" << j;\n }\n cout << endl;\n int resp;\n cin >> resp;\n return 0;\n}","ahc031":"#include \nusing namespace std;\n\nint main() {\n int W, D, N;\n cin >> W >> D >> N;\n vector> a(D, vector(N));\n for(int d = 0; d < D; d++) {\n for(int k = 0; k < N; k++) {\n cin >> a[d][k];\n }\n }\n vector maxa(N, 0);\n for(int k = 0; k < N; k++) {\n for(int d = 0; d < D; d++) {\n maxa[k] = max(maxa[k], a[d][k]);\n }\n }\n int bestK = 1;\n long long best_est = LLONG_MAX / 2;\n for(int ktry = 1; ktry <= min(N, 30); ktry++) {\n int KK = ktry;\n vector gsize(KK);\n for(int i = 0; i < KK; i++) gsize[i] = N / KK + (i < N % KK ? 1 : 0);\n vector minww(KK, 0);\n int pos = N - 1;\n long long totmin = 0;\n long long horiz_est = 0;\n for(int g = 0; g < KK; g++) {\n int gszz = gsize[g];\n long long sm = 0;\n int mmx = 0;\n for(int j = 0; j < gszz; j++) {\n int mk = maxa[pos--];\n sm += mk;\n mmx = max(mmx, mk);\n }\n long long mw = max((sm + W - 1LL) / W, (mmx + W - 1LL) / W);\n minww[g] = mw;\n totmin += mw;\n horiz_est += mw * gszz;\n }\n if(totmin == 0) continue;\n long long area_c = 0;\n for(int dd = 0; dd < D; dd++) {\n int curpos = N - 1;\n for(int g = 0; g < KK; g++) {\n int gszz = gsize[g];\n long long mww = minww[g] * (long long)W / totmin;\n mww = max(1LL, mww);\n int this_ww = mww;\n int tneed = 0;\n for(int j = 0; j < gszz; j++) {\n int akk = a[dd][curpos--];\n tneed += (akk + this_ww - 1) / this_ww;\n }\n if(tneed > W) {\n area_c += 100LL * (tneed - W) * this_ww;\n }\n }\n }\n long long lcost = (D - 1LL) * 2 * horiz_est;\n long long totest = area_c + lcost;\n if(totest < best_est) {\n best_est = totest;\n bestK = KK;\n }\n }\n // now build with bestK\n int K = bestK;\n vector gsize(K);\n for(int i = 0; i < K; i++) gsize[i] = N / K + (i < N % K ? 1 : 0);\n vector minww(K, 0);\n vector> group_ks(K);\n int pos = N - 1;\n long long totmin = 0;\n for(int g = 0; g < K; g++) {\n int gszz = gsize[g];\n long long sm = 0;\n int mmx = 0;\n for(int j = 0; j < gszz; j++) {\n int mk = maxa[pos];\n sm += mk;\n mmx = max(mmx, mk);\n group_ks[g].push_back(pos);\n pos--;\n }\n long long mw = max((sm + W - 1LL) / W, (mmx + W - 1LL) / W);\n minww[g] = mw;\n totmin += mw;\n }\n vector slab_w(K);\n if(totmin > 0) {\n for(int g = 0; g < K; g++) {\n slab_w[g] = max(1LL, minww[g] * (long long)W / totmin);\n }\n int cw = 0;\n for(int w : slab_w) cw += w;\n int diff = W - cw;\n for(int i = 0; i < abs(diff); i++) {\n int gi = i % K;\n if(diff > 0) {\n slab_w[gi]++;\n } else if(slab_w[gi] > 1) {\n slab_w[gi]--;\n }\n }\n } else {\n int eqw = W / K;\n for(int g = 0; g < K; g++) {\n slab_w[g] = eqw;\n }\n for(int g = 0; g < W % K; g++) slab_w[g]++;\n }\n vector jpos(K + 1, 0);\n for(int g = 0; g < K; g++) {\n jpos[g + 1] = jpos[g] + slab_w[g];\n }\n // now for each day\n for(int d = 0; d < D; d++) {\n vector> rect_per_k(N);\n int rk_base = N - 1;\n for(int g = 0; g < K; g++) {\n int thisw = slab_w[g];\n vector> day_as;\n auto& ks_list = group_ks[g];\n for(int rkk : ks_list) {\n day_as.emplace_back(a[d][rkk], rkk);\n }\n sort(day_as.rbegin(), day_as.rend());\n int ng = day_as.size();\n vector needs(ng);\n int tot_need_h = 0;\n for(int i = 0; i < ng; i++) {\n int aa = day_as[i].first;\n int nh = (aa + thisw - 1) / thisw;\n needs[i] = max(1, nh);\n tot_need_h += needs[i];\n }\n vector used_hs(ng, 0);\n int use_hh;\n if(tot_need_h <= W) {\n use_hh = tot_need_h;\n for(int i = 0; i < ng; i++) used_hs[i] = needs[i];\n } else {\n use_hh = W;\n if(tot_need_h > 0) {\n double rr = (double)W / tot_need_h;\n int su = 0;\n for(int i = 0; i < ng; i++) {\n used_hs[i] = max(1, (int)(needs[i] * rr));\n su += used_hs[i];\n }\n while(su < W) {\n for(int i = 0; i < ng && su < W; i++) {\n used_hs[i]++;\n su++;\n }\n }\n while(su > W) {\n for(int i = 0; i < ng && su > W; i++) {\n if(used_hs[i] > 1) {\n used_hs[i]--;\n su--;\n }\n }\n }\n }\n }\n int cur_i = 0;\n int jbase = jpos[g];\n for(int i = 0; i < ng; i++) {\n int hh = used_hs[i];\n int ok = day_as[i].second;\n if(hh == 0) hh = 1; // safety\n rect_per_k[ok] = {cur_i, jbase, cur_i + hh, jbase + thisw};\n cur_i += hh;\n }\n }\n for(int k = 0; k < N; k++) {\n auto arr = rect_per_k[k];\n cout << arr[0] << \" \" << arr[1] << \" \" << arr[2] << \" \" << arr[3] << endl;\n }\n }\n return 0;\n}","ahc032":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n srand(42);\n int N, M, K;\n cin >> N >> M >> K;\n const ll MOD = 998244353;\n ll init_brd[9][9];\n ll init_sc = 0;\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {\n cin >> init_brd[i][j];\n init_sc += init_brd[i][j];\n }\n ll st[20][3][3];\n for (int m = 0; m < M; m++) for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) {\n cin >> st[m][i][j];\n }\n ll best_sc = init_sc;\n vector> best_ops;\n ll brd[9][9];\n const int TRIALS = 50;\n const int TOP_K = 3;\n const int LOW_AREAS = 3;\n for (int trial = 0; trial < TRIALS; trial++) {\n for (int i = 0; i < 9; i++) for (int j = 0; j < 9; j++) brd[i][j] = init_brd[i][j];\n vector> this_ops;\n vector> best_ops_in_path;\n ll path_best_sc = init_sc;\n ll curr_sc = init_sc;\n for (int step = 0; step < K; step++) {\n vector> cands;\n for (int m = 0; m < M; m++) {\n for (int p = 0; p <= 6; p++) {\n for (int q = 0; q <= 6; q++) {\n ll d = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n ll nr = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n d += nr - brd[p + x][q + y];\n }\n cands.emplace_back(d, m, p, q);\n }\n }\n }\n sort(cands.rbegin(), cands.rend());\n ll max_d = get<0>(cands[0]);\n int chosen_m, chosen_p, chosen_q;\n ll chosen_dval;\n if (max_d > 0) {\n int ntop = min(TOP_K, (int)cands.size());\n int pick = rand() % ntop;\n auto [dval, m, p, q] = cands[pick];\n chosen_dval = dval;\n chosen_m = m;\n chosen_p = p;\n chosen_q = q;\n } else {\n vector> area_sums;\n for (int p = 0; p <= 6; p++) {\n for (int q = 0; q <= 6; q++) {\n ll s9 = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n s9 += brd[p + x][q + y];\n }\n area_sums.emplace_back(s9, p, q);\n }\n }\n sort(area_sums.begin(), area_sums.end());\n int nlow = min(LOW_AREAS, (int)area_sums.size());\n int idx = rand() % nlow;\n auto [_, tp, tq] = area_sums[idx];\n ll best_d_pos = LLONG_MIN / 2;\n int best_m_pos = -1;\n for (int m = 0; m < M; m++) {\n ll d = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n ll nr = (brd[tp + x][tq + y] + st[m][x][y]) % MOD;\n d += nr - brd[tp + x][tq + y];\n }\n if (d > best_d_pos) {\n best_d_pos = d;\n best_m_pos = m;\n }\n }\n chosen_dval = best_d_pos;\n chosen_m = best_m_pos;\n chosen_p = tp;\n chosen_q = tq;\n }\n this_ops.emplace_back(chosen_m, chosen_p, chosen_q);\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n brd[chosen_p + x][chosen_q + y] = (brd[chosen_p + x][chosen_q + y] + st[chosen_m][x][y]) % MOD;\n }\n curr_sc += chosen_dval;\n if (curr_sc > path_best_sc) {\n path_best_sc = curr_sc;\n best_ops_in_path = this_ops;\n }\n }\n if (path_best_sc > best_sc) {\n best_sc = path_best_sc;\n best_ops = best_ops_in_path;\n }\n }\n cout << best_ops.size() << endl;\n for (auto [m, p, q] : best_ops) {\n cout << m << \" \" << p << \" \" << q << endl;\n }\n}","ahc033":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector> A(N, vector(N));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> A[i][j];\n }\n }\n vector ops(N);\n vector> g(N, vector(N, -1));\n vector crane_r(N), crane_c(N);\n for (int i = 0; i < N; i++) {\n crane_r[i] = i;\n crane_c[i] = 0;\n }\n vector carry(N, false);\n vector carry_what(N, -1);\n vector isact(N, true);\n vector islarge(N, false);\n islarge[0] = true;\n vector inp_idx(N, 0);\n vector next_e(N);\n for (int i = 0; i < N; i++) next_e[i] = i * N;\n int dispat_cnt = 0;\n auto is_done = [&]() { return dispat_cnt == N * N; };\n auto do_receive = [&]() {\n for (int r = 0; r < N; r++) {\n if (inp_idx[r] >= N) continue;\n int c = 0;\n if (g[r][c] != -1) continue;\n bool hold_there = false;\n for (int k = 0; k < N; k++) {\n if (isact[k] && crane_r[k] == r && crane_c[k] == c && carry[k]) {\n hold_there = true;\n break;\n }\n }\n if (!hold_there) {\n int cn = A[r][inp_idx[r]];\n g[r][c] = cn;\n inp_idx[r]++;\n }\n }\n };\n auto do_dispatch = [&]() {\n for (int r = 0; r < N; r++) {\n int c = N - 1;\n if (g[r][c] != -1) {\n int b = g[r][c];\n g[r][c] = -1;\n dispat_cnt++;\n if (b / N == r && next_e[r] == b) {\n next_e[r]++;\n }\n }\n }\n };\n auto move_towards = [&](int cr, int cc, int tr, int tc, bool iscarry) -> char {\n if (cr != tr) {\n if (cr < tr) return 'D';\n return 'U';\n }\n if (cc != tc) {\n if (cc < tc) return 'R';\n return 'L';\n }\n return '.';\n };\n auto find_safe_empty_for = [&](int cont) -> pair {\n int pref = cont / N;\n for (int j = 1; j < N-1; j++) {\n if (g[pref][j] == -1) return {pref, j};\n }\n for (int j = 1; j < N-1; j++) {\n for (int i = 0; i < N; i++) {\n if (g[i][j] == -1) return {i, j};\n }\n }\n for (int j = 0; j < N; j++) if (j != N-1)\n for (int i = 0; i < N; i++) if (g[i][j] == -1) return {i, j};\n return {-1,-1};\n };\n const int MAXT = 10000;\n for (int t = 0; t < MAXT; t++) {\n if (is_done()) break;\n do_receive();\n if (is_done()) break;\n vector action(N, '.');\n for (int k = 1; k < N; k++) {\n if (isact[k] && t == 0) {\n action[k] = 'B';\n }\n }\n if (isact[0]) {\n int held = carry[0] ? carry_what[0] : -1;\n bool acted = false;\n if (held != -1) {\n int tr = held / N;\n if (held == next_e[tr]) {\n int gr = tr, gc = N - 1;\n if (crane_r[0] == gr && crane_c[0] == gc) {\n if (g[gr][gc] == -1) {\n action[0] = 'Q';\n acted = true;\n } else {\n action[0] = '.';\n acted = true;\n }\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], gr, gc, true);\n acted = true;\n }\n }\n }\n if (!acted && !carry[0]) {\n int bestd = INT_MAX;\n int bx = -1, by = -1;\n for (int i = 0; i < N; i++) {\n if (next_e[i] >= (i + 1) * N) continue;\n int nd = next_e[i];\n for (int r = 0; r < N; r++) for (int c = 0; c < N; c++) {\n if (g[r][c] == nd) {\n if (r == i && c == N-1) continue;\n int dist = abs(crane_r[0]-r) + abs(crane_c[0]-c);\n if (dist < bestd) {\n bestd = dist;\n bx = r; by = c;\n }\n }\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) action[0] = 'P';\n else action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n acted = true;\n }\n }\n if (!acted && carry[0]) {\n int hc = carry_what[0];\n auto emp = find_safe_empty_for(hc);\n if (emp.first != -1) {\n int ex = emp.first, ey = emp.second;\n if (crane_r[0] == ex && crane_c[0] == ey) {\n action[0] = 'Q';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], ex, ey, true);\n }\n acted = true;\n } else {\n int tr = hc / N;\n int gr = tr, gc = N - 1;\n if (crane_r[0] == gr && crane_c[0] == gc) {\n if (g[gr][gc] == -1) action[0] = 'Q';\n else action[0] = '.';\n } else action[0] = move_towards(crane_r[0], crane_c[0], gr, gc, true);\n acted = true;\n }\n }\n if (!acted) {\n int bestd = INT_MAX;\n int bx = -1, by = -1;\n for (int r = 0; r < N; r++) {\n if (g[r][0] != -1) {\n int d = abs(crane_r[0] - r) + abs(crane_c[0]);\n if (d < bestd) {\n bestd = d;\n bx = r; by = 0;\n }\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) action[0] = 'P';\n else action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n acted = true;\n }\n }\n if (!acted) action[0] = '.';\n }\n for (int k = 0; k < N; k++) {\n if (!isact[k]) continue;\n char act = action[k];\n if (act == 'B') {\n if (!carry[k]) isact[k] = false;\n continue;\n }\n if (act == 'P') {\n if (!carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] != -1) {\n carry[k] = true;\n carry_what[k] = g[rr][cc];\n g[rr][cc] = -1;\n }\n }\n } else if (act == 'Q') {\n if (carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] == -1) {\n g[rr][cc] = carry_what[k];\n carry[k] = false;\n carry_what[k] = -1;\n }\n }\n } else if (act != '.') {\n int drr = 0, dcc = 0;\n if (act == 'U') drr = -1;\n else if (act == 'D') drr = 1;\n else if (act == 'L') dcc = -1;\n else if (act == 'R') dcc = 1;\n int nr = crane_r[k] + drr;\n int nc = crane_c[k] + dcc;\n if (nr >= 0 && nr < N && nc >= 0 && nc < N) {\n bool has_cont = g[nr][nc] != -1;\n bool can = true;\n if (carry[k] && !islarge[k] && has_cont) can = false;\n if (can) {\n crane_r[k] = nr;\n crane_c[k] = nc;\n }\n }\n }\n }\n do_dispatch();\n for (int k = 0; k < N; k++) ops[k] += action[k];\n if (is_done()) break;\n }\n int maxlen = 0;\n for (auto& s : ops) maxlen = max(maxlen, (int)s.size());\n for (auto& s : ops) while((int)s.size() < maxlen) s += '.';\n for (auto& s : ops) cout << s << endl;\n}","ahc034":"#include \nusing namespace std;\nusing ll = long long;\n\nll simulate_cost(const vector& ops, const vector>& orig_h) {\n int n = orig_h.size();\n vector> height(n, vector(n));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) height[i][j] = orig_h[i][j];\n }\n int r = 0, c = 0;\n ll ld = 0;\n ll cost = 0;\n for (auto& op : ops) {\n if (op.empty()) continue;\n if (op[0] == '+' || op[0] == '-') {\n ll d = stoll(op.substr(1));\n if (op[0] == '+') {\n height[r][c] -= d;\n ld += d;\n cost += d;\n } else {\n height[r][c] += d;\n ld -= d;\n cost += d;\n }\n if (ld < 0 || d <= 0) return 1LL << 60;\n } else {\n char dir = op[0];\n if (dir == 'U') r--;\n else if (dir == 'D') r++;\n else if (dir == 'L') c--;\n else if (dir == 'R') c++;\n if (r < 0 || r >= n || c < 0 || c >= n) return 1LL << 60;\n cost += 100 + ld;\n }\n }\n if (ld != 0) return 1LL << 60;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (height[i][j] != 0) return 1LL << 60;\n return cost;\n}\n\nint main() {\n srand(42);\n int N;\n cin >> N;\n vector> h(N, vector(N));\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) cin >> h[i][j];\n vector> orig_supply(N, vector(N, 0));\n vector> orig_demand(N, vector(N, 0));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (h[i][j] > 0) orig_supply[i][j] = h[i][j];\n else orig_demand[i][j] = -h[i][j];\n }\n }\n vector> supply_list;\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) if (orig_supply[i][j] > 0) supply_list.emplace_back(i, j);\n sort(supply_list.begin(), supply_list.end(), [&](auto a, auto b){\n return a.first * N + a.second < b.first * N + b.second;\n });\n ll best_cost = 1LL << 60;\n vector best_ops;\n for (int trial = 0; trial < 50; trial++) {\n vector> bias(N, vector(N, 0));\n bool use_raster = false;\n if (trial == 0) {\n // zero bias nearest\n } else if (trial <= 35) {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) bias[i][j] = (rand() % 5) - 2;\n } else {\n use_raster = true;\n }\n auto rem_supply = orig_supply;\n auto rem_demand = orig_demand;\n vector ops;\n int cr = 0, cc = 0;\n ll load = 0;\n auto has_supp = [&]() -> bool {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) if (rem_supply[i][j] > 0) return true;\n return false;\n };\n auto find_closest = [&](bool is_supply, int curr_r, int curr_c) -> pair {\n int min_val = INT_MAX;\n int ti = -1, tj = -1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int d = abs(i - curr_r) + abs(j - curr_c);\n int eff = d * 10 + bias[i][j];\n bool has = is_supply ? (rem_supply[i][j] > 0) : (rem_demand[i][j] > 0);\n if (has && (eff < min_val || (eff == min_val && (i < ti || (i == ti && j < tj))))) {\n min_val = eff;\n ti = i; tj = j;\n }\n }\n }\n return {ti, tj};\n };\n auto find_next_raster_supply = [&](int curr_r, int curr_c) -> pair {\n for (auto& p : supply_list) {\n if (rem_supply[p.first][p.second] > 0) return p;\n }\n return {-1,-1};\n };\n auto do_move = [&](int tr, int tc) {\n while (cr != tr) {\n if (cr < tr) { ops.push_back(\"D\"); cr++; } else { ops.push_back(\"U\"); cr--; }\n }\n while (cc != tc) {\n if (cc < tc) { ops.push_back(\"R\"); cc++; } else { ops.push_back(\"L\"); cc--; }\n }\n };\n bool valid_run = true;\n while ((has_supp() || load > 0) && valid_run) {\n if (ops.size() > 90000) { valid_run = false; break; }\n if (load == 0) {\n if (!has_supp()) break;\n pair tgt;\n if (use_raster) {\n tgt = find_next_raster_supply(cr, cc);\n } else {\n tgt = find_closest(true, cr, cc);\n }\n if (tgt.first == -1) { valid_run = false; break; }\n do_move(tgt.first, tgt.second);\n int d = rem_supply[cr][cc];\n if (d > 0) {\n ops.push_back(\"+\" + to_string(d));\n load += d;\n rem_supply[cr][cc] = 0;\n }\n } else {\n auto tgt = find_closest(false, cr, cc);\n if (tgt.first == -1) { valid_run = false; break; }\n do_move(tgt.first, tgt.second);\n ll d = min(load, (ll)rem_demand[cr][cc]);\n if (d > 0) {\n ops.push_back(\"-\" + to_string((int)d));\n load -= d;\n rem_demand[cr][cc] -= (int)d;\n } else {\n valid_run = false; break;\n }\n }\n }\n if (!valid_run || load != 0) continue;\n ll this_c = simulate_cost(ops, h);\n if (this_c < best_cost) {\n best_cost = this_c;\n best_ops = std::move(ops);\n }\n }\n for (auto& s : best_ops) {\n cout << s << endl;\n }\n return 0;\n}","ahc035":"#include \nusing namespace std;\n\nint main() {\n int N, M, T;\n cin >> N >> M >> T;\n int SEED_CNT = 2 * N * (N - 1);\n vector> seeds(SEED_CNT, vector(M));\n for (int i = 0; i < SEED_CNT; i++) {\n for (int j = 0; j < M; j++) {\n cin >> seeds[i][j];\n }\n }\n srand(42);\n for (int t = 0; t < T; t++) {\n vector val(SEED_CNT, 0);\n vector maxd(M, 0);\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n val[k] += seeds[k][l];\n if (seeds[k][l] > maxd[l]) maxd[l] = seeds[k][l];\n }\n }\n vector>> car_list(M);\n for (int l = 0; l < M; l++) {\n for (int k = 0; k < SEED_CNT; k++) {\n if (seeds[k][l] == maxd[l]) {\n car_list[l].emplace_back(val[k], k);\n }\n }\n sort(car_list[l].rbegin(), car_list[l].rend());\n }\n set must_s;\n for (int l = 0; l < M; l++) {\n for (int i = 0; i < min(2, (int)car_list[l].size()); i++) {\n must_s.insert(car_list[l][i].second);\n }\n }\n vector must(must_s.begin(), must_s.end());\n vector alls(SEED_CNT);\n iota(alls.begin(), alls.end(), 0);\n sort(alls.begin(), alls.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector in_chosen(SEED_CNT, false);\n vector selected;\n for (int m : must) {\n if (!in_chosen[m]) {\n selected.push_back(m);\n in_chosen[m] = true;\n }\n }\n for (int cand : alls) {\n if (!in_chosen[cand]) {\n selected.push_back(cand);\n in_chosen[cand] = true;\n if ((int)selected.size() == N * N) break;\n }\n }\n while ((int)selected.size() < N * N) {\n for (int k = 0; k < SEED_CNT; k++) {\n if (!in_chosen[k]) {\n selected.push_back(k);\n in_chosen[k] = true;\n break;\n }\n }\n }\n sort(selected.begin(), selected.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector> comp(36, vector(36, 0));\n for (int i = 0; i < 36; i++) {\n for (int j = 0; j < 36; j++) {\n if (i == j) continue;\n int s1 = selected[i];\n int s2 = selected[j];\n for (int l = 0; l < M; l++) {\n comp[i][j] += max(seeds[s1][l], seeds[s2][l]);\n }\n }\n }\n vector mixed(36);\n int left = 0, right = 35;\n for (int k = 0; k < 36; k++) {\n if (k % 2 == 0) {\n mixed[k] = left++;\n } else {\n mixed[k] = right--;\n }\n }\n vector asg(36);\n for (int p = 0; p < 36; p++) {\n asg[p] = mixed[p];\n }\n auto calc = [&](const vector& assignment) -> long long {\n long long tot = 0;\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N - 1; c++) {\n int i1 = assignment[r * N + c];\n int i2 = assignment[r * N + c + 1];\n long long cval = comp[i1][i2];\n tot += cval * cval;\n }\n }\n for (int r = 0; r < N - 1; r++) {\n for (int c = 0; c < N; c++) {\n int i1 = assignment[r * N + c];\n int i2 = assignment[(r + 1) * N + c];\n long long cval = comp[i1][i2];\n tot += cval * cval;\n }\n }\n return tot;\n };\n long long cur_score = calc(asg);\n long long best_score = cur_score;\n vector best_asg = asg;\n double Temp = 100000.0;\n int num_iters = 4000;\n for (int it = 0; it < num_iters; it++) {\n int p1 = rand() % 36;\n int p2 = rand() % 36;\n if (p1 == p2) {\n it--;\n continue;\n }\n swap(asg[p1], asg[p2]);\n long long new_score = calc(asg);\n long long d = new_score - cur_score;\n bool accept = (d > 0);\n if (!accept && Temp > 1e-9) {\n double prob = exp(static_cast(d) / Temp);\n if ((rand() / (double)RAND_MAX) < prob) accept = true;\n }\n if (accept) {\n cur_score = new_score;\n if (cur_score > best_score) {\n best_score = cur_score;\n best_asg = asg;\n }\n } else {\n swap(asg[p1], asg[p2]);\n }\n Temp *= 0.995;\n }\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N; c++) {\n int sidx = best_asg[r * N + c];\n cout << selected[sidx];\n if (c < N - 1) cout << \" \";\n }\n cout << endl;\n }\n cout.flush();\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n cin >> seeds[k][l];\n }\n }\n }\n return 0;\n}","ahc038":"#include \nusing namespace std;\n\nconst int MAXN = 31;\nint DELX[4] = {0, 1, 0, -1};\nint DELY[4] = {1, 0, -1, 0};\n\nint main() {\n int N, M, Vv;\n cin >> N >> M >> Vv;\n vector S(N), T(N);\n for (int i = 0; i < N; i++) cin >> S[i];\n for (int i = 0; i < N; i++) cin >> T[i];\n\n bool needs_pick[MAXN][MAXN] = {};\n bool needs_place[MAXN][MAXN] = {};\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (S[i][j] == '1' && T[i][j] == '0') needs_pick[i][j] = true;\n if (S[i][j] == '0' && T[i][j] == '1') needs_place[i][j] = true;\n }\n }\n\n int VP = 5;\n cout << VP << endl;\n for (int i = 0; i < 4; i++) {\n cout << 0 << \" \" << 1 << endl;\n }\n int ix = 0, iy = 0;\n cout << ix << \" \" << iy << endl;\n\n vector operations;\n operations.push_back(\"..RRL.....\");\n operations.push_back(\"...R......\");\n\n int crx = 0, cry = 0;\n int fdir[4] = {0, 1, 2, 3};\n bool held[4] = {false};\n\n while (operations.size() < 100000) {\n bool can_act_now = false;\n for (int fi = 0; fi < 4; fi++) {\n int fx = crx + DELX[fdir[fi]];\n int fy = cry + DELY[fdir[fi]];\n if (fx < 0 || fx >= N || fy < 0 || fy >= N) continue;\n if ((!held[fi] && needs_pick[fx][fy]) || (held[fi] && needs_place[fx][fy])) {\n can_act_now = true;\n }\n }\n\n char mch = '.';\n int nx = crx, ny = cry;\n if (!can_act_now) {\n int best_d = INT_MAX;\n int tx = -1, ty = -1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (needs_pick[i][j]) {\n for (int fi = 0; fi < 4; fi++) {\n if (held[fi]) continue;\n int cx = i - DELX[fdir[fi]];\n int cy = j - DELY[fdir[fi]];\n if (cx >= 0 && cx < N && cy >= 0 && cy < N) {\n int dd = abs(cx - crx) + abs(cy - cry);\n if (dd < best_d) {\n best_d = dd;\n tx = cx; ty = cy;\n }\n }\n }\n }\n if (needs_place[i][j]) {\n for (int fi = 0; fi < 4; fi++) {\n if (!held[fi]) continue;\n int cx = i - DELX[fdir[fi]];\n int cy = j - DELY[fdir[fi]];\n if (cx >= 0 && cx < N && cy >= 0 && cy < N) {\n int dd = abs(cx - crx) + abs(cy - cry);\n if (dd < best_d) {\n best_d = dd;\n tx = cx; ty = cy;\n }\n }\n }\n }\n }\n }\n if (best_d == INT_MAX) {\n // stuck: try rotating a held finger to unlock new directions\n bool rotated = false;\n for (int fi = 0; fi < 4; fi++) {\n if (held[fi]) {\n string rstep(10, '.');\n rstep[fi + 1] = 'R';\n operations.push_back(rstep);\n fdir[fi] = (fdir[fi] + 1) % 4;\n rotated = true;\n break;\n }\n }\n if (!rotated) break;\n continue;\n }\n if (best_d > 0) {\n int dx = tx - crx;\n int dy = ty - cry;\n if (dx != 0) {\n mch = (dx > 0 ? 'D' : 'U');\n nx += (dx > 0 ? 1 : -1);\n } else if (dy != 0) {\n mch = (dy > 0 ? 'R' : 'L');\n ny += (dy > 0 ? 1 : -1);\n }\n }\n }\n\n if (nx < 0 || nx >= N || ny < 0 || ny >= N) {\n nx = crx; ny = cry; mch = '.';\n }\n\n bool wact[4] = {};\n for (int fi = 0; fi < 4; fi++) {\n int fx = nx + DELX[fdir[fi]];\n int fy = ny + DELY[fdir[fi]];\n if (fx < 0 || fx >= N || fy < 0 || fy >= N) continue;\n if (!held[fi] && needs_pick[fx][fy]) wact[fi] = true;\n else if (held[fi] && needs_place[fx][fy]) wact[fi] = true;\n }\n\n string step(10, '.');\n step[0] = mch;\n for (int fi = 0; fi < 4; fi++) {\n if (wact[fi]) step[6 + fi] = 'P';\n }\n operations.push_back(step);\n\n crx = nx;\n cry = ny;\n for (int fi = 0; fi < 4; fi++) {\n if (wact[fi]) {\n int fx = crx + DELX[fdir[fi]];\n int fy = cry + DELY[fdir[fi]];\n if (fx >= 0 && fx < N && fy >= 0 && fy < N) {\n if (!held[fi] && needs_pick[fx][fy]) {\n held[fi] = true;\n needs_pick[fx][fy] = false;\n } else if (held[fi] && needs_place[fx][fy]) {\n held[fi] = false;\n needs_place[fx][fy] = false;\n }\n }\n }\n }\n\n bool still_needed = false;\n for (int i = 0; i < N && !still_needed; i++) {\n for (int j = 0; j < N; j++) {\n if (needs_pick[i][j] || needs_place[i][j]) {\n still_needed = true;\n break;\n }\n }\n }\n if (!still_needed) {\n bool any_held = false;\n for (int i = 0; i < 4; i++) if (held[i]) any_held = true;\n if (!any_held) break;\n }\n }\n\n for (auto& op : operations) {\n cout << op << endl;\n }\n return 0;\n}","ahc039":"#include \nusing namespace std;\n\nstruct Point {\n int x, y, v;\n};\n\nstruct RectCandidate {\n int s, lx, rx, ly, ry;\n};\n\nint main() {\n int N;\n cin >> N;\n vector pts(2 * N);\n for (int i = 0; i < 2 * N; i++) {\n cin >> pts[i].x >> pts[i].y;\n pts[i].v = (i < N ? 1 : -1);\n }\n vector xs, ys;\n for (auto& p : pts) {\n xs.push_back(p.x);\n ys.push_back(p.y);\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n sort(ys.begin(), ys.end());\n ys.erase(unique(ys.begin(), ys.end()), ys.end());\n int kx = xs.size();\n int ky = ys.size();\n long long stride = ky + 1LL;\n vector ps((kx + 1LL) * stride, 0);\n for (auto& p : pts) {\n int rx = lower_bound(xs.begin(), xs.end(), p.x) - xs.begin() + 1;\n int ry = lower_bound(ys.begin(), ys.end(), p.y) - ys.begin() + 1;\n ps[rx * stride + ry] += p.v;\n }\n for (int i = 1; i <= kx; i++) {\n for (int j = 1; j <= ky; j++) {\n ps[i * stride + j] += ps[(i - 1) * stride + j] + ps[i * stride + (j - 1)] - ps[(i - 1) * stride + (j - 1)];\n }\n }\n auto getsum = [&](int x1, int y1, int x2, int y2) -> int {\n if (x1 > x2 || y1 > y2) return 0;\n x1 = max(x1, 0);\n y1 = max(y1, 0);\n x2 = min(x2, kx);\n y2 = min(y2, ky);\n long long v1 = ps[(long long)x2 * stride + y2];\n long long v2 = (x1 >= 1 ? ps[(long long)(x1 - 1) * stride + y2] : 0LL);\n long long v3 = (y1 >= 1 ? ps[(long long)x2 * stride + (y1 - 1)] : 0LL);\n long long v4 = ((x1 >= 1 && y1 >= 1) ? ps[(long long)(x1 - 1) * stride + (y1 - 1)] : 0LL);\n return (int)(v1 - v2 - v3 + v4);\n };\n int best_score = 0;\n int best_lx = 1, best_rx = 1, best_ly = 1, best_ry = 2;\n // mackerel bb\n int m_minx = INT_MAX, m_maxx = INT_MIN, m_miny = INT_MAX, m_maxy = INT_MIN;\n for (int i = 0; i < N; i++) {\n m_minx = min(m_minx, pts[i].x);\n m_maxx = max(m_maxx, pts[i].x);\n m_miny = min(m_miny, pts[i].y);\n m_maxy = max(m_maxy, pts[i].y);\n }\n int lx_m = lower_bound(xs.begin(), xs.end(), m_minx) - xs.begin() + 1;\n int rx_m = lower_bound(xs.begin(), xs.end(), m_maxx) - xs.begin() + 1;\n int ly_m = lower_bound(ys.begin(), ys.end(), m_miny) - ys.begin() + 1;\n int ry_m = lower_bound(ys.begin(), ys.end(), m_maxy) - ys.begin() + 1;\n int bb_s = getsum(lx_m, ly_m, rx_m, ry_m);\n if (bb_s > best_score) {\n best_score = bb_s;\n best_lx = lx_m; best_rx = rx_m;\n best_ly = ly_m; best_ry = ry_m;\n }\n // cluster mackerels\n vector macks;\n for (int ii = 0; ii < N; ii++) macks.push_back(pts[ii]);\n sort(macks.begin(), macks.end(), [](const Point& a, const Point& b) {\n return a.x < b.x || (a.x == b.x && a.y < b.y);\n });\n int idx = 0;\n const int CLUSTER_GAP = 10000;\n while (idx < N) {\n int cminx = macks[idx].x, cmaxx = macks[idx].x;\n int cminy = macks[idx].y, cmaxy = macks[idx].y;\n int start_idx = idx;\n idx++;\n while (idx < N && (macks[idx].x - cmaxx <= CLUSTER_GAP)) {\n cminx = min(cminx, macks[idx].x);\n cmaxx = max(cmaxx, macks[idx].x);\n cminy = min(cminy, macks[idx].y);\n cmaxy = max(cmaxy, macks[idx].y);\n idx++;\n }\n int lx_c = lower_bound(xs.begin(), xs.end(), cminx) - xs.begin() + 1;\n int rx_c = lower_bound(xs.begin(), xs.end(), cmaxx) - xs.begin() + 1;\n int ly_c = lower_bound(ys.begin(), ys.end(), cminy) - ys.begin() + 1;\n int ry_c = lower_bound(ys.begin(), ys.end(), cmaxy) - ys.begin() + 1;\n int cs = getsum(lx_c, ly_c, rx_c, ry_c);\n if (cs > best_score) {\n best_score = cs;\n best_lx = lx_c; best_rx = rx_c;\n best_ly = ly_c; best_ry = ry_c;\n }\n }\n using T = pair>;\n priority_queue, greater> pq;\n int S = 130;\n vector xcuts;\n int stepx = max(1, kx / S);\n for (int j = 0; j <= kx; j += stepx) xcuts.push_back(j);\n if (xcuts.back() != kx) xcuts.push_back(kx);\n vector ycuts;\n int stepy = max(1, ky / S);\n for (int j = 0; j <= ky; j += stepy) ycuts.push_back(j);\n if (ycuts.back() != ky) ycuts.push_back(ky);\n for (size_t pi = 0; pi < xcuts.size(); ++pi) {\n for (size_t qi = pi; qi < xcuts.size(); ++qi) {\n int lx_ = xcuts[pi] + 1;\n int rx_ = xcuts[qi];\n if (lx_ > rx_ || rx_ - lx_ < 0) continue;\n for (size_t pj = 0; pj < ycuts.size(); ++pj) {\n for (size_t qj = pj; qj < ycuts.size(); ++qj) {\n int ly_ = ycuts[pj] + 1;\n int ry_ = ycuts[qj];\n if (ly_ > ry_ || ry_ - ly_ < 1) continue;\n if (rx_ - lx_ < 1) continue;\n int s = getsum(lx_, ly_, rx_, ry_);\n if (s > best_score) {\n best_score = s;\n best_lx = lx_; best_rx = rx_;\n best_ly = ly_; best_ry = ry_;\n }\n if (s > 60) {\n array info{{lx_, rx_, ly_, ry_}};\n pq.push({s, info});\n if (pq.size() > 25) pq.pop();\n }\n }\n }\n }\n }\n // extract promising\n vector promising;\n while (!pq.empty()) {\n auto [sc, arr] = pq.top(); pq.pop();\n promising.push_back({sc, arr[0], arr[1], arr[2], arr[3]});\n }\n promising.push_back({best_score, best_lx, best_rx, best_ly, best_ry});\n // optimize each promising\n for (auto& r : promising) {\n int clx = r.lx, crx = r.rx, cly = r.ly, cry = r.ry;\n int cs = r.s;\n for (int it = 0; it < 4; ++it) {\n bool ch = false;\n for (int d = -45; d <= 45; ++d) {\n int nl = clx + d;\n if (nl < 1 || nl > crx) continue;\n int ns = getsum(nl, cly, crx, cry);\n if (ns > cs) { clx = nl; cs = ns; ch = true; }\n }\n for (int d = -45; d <= 45; ++d) {\n int nr = crx + d;\n if (nr < clx || nr > kx) continue;\n int ns = getsum(clx, cly, nr, cry);\n if (ns > cs) { crx = nr; cs = ns; ch = true; }\n }\n for (int d = -45; d <= 45; ++d) {\n int nl = cly + d;\n if (nl < 1 || nl > cry) continue;\n int ns = getsum(clx, nl, crx, cry);\n if (ns > cs) { cly = nl; cs = ns; ch = true; }\n }\n for (int d = -45; d <= 45; ++d) {\n int nr = cry + d;\n if (nr < cly || nr > ky) continue;\n int ns = getsum(clx, cly, crx, nr);\n if (ns > cs) { cry = nr; cs = ns; ch = true; }\n }\n if (!ch) break;\n }\n if (cs > best_score) {\n best_score = cs;\n best_lx = clx; best_rx = crx;\n best_ly = cly; best_ry = cry;\n }\n }\n if (best_score < 1) {\n auto p = pts[0];\n int xx = p.x, yy = p.y;\n int pl = max(0, xx - 1), pr = min(100000, xx + 1);\n int pb = max(0, yy - 1), pt = min(100000, yy + 1);\n cout << 4 << endl;\n cout << pl << \" \" << pb << endl;\n cout << pr << \" \" << pb << endl;\n cout << pr << \" \" << pt << endl;\n cout << pl << \" \" << pt << endl;\n return 0;\n }\n int lx = best_lx, rx = best_rx, ly = best_ly, ry = best_ry;\n int minx_ = (lx - 1 >= 0 && lx - 1 < kx ? xs[lx - 1] : 0);\n int maxx_ = (rx - 1 >= 0 && rx - 1 < kx ? xs[rx - 1] : 100000);\n int miny_ = (ly - 1 >= 0 && ly - 1 < ky ? ys[ly - 1] : 0);\n int maxy_ = (ry - 1 >= 0 && ry - 1 < ky ? ys[ry - 1] : 100000);\n int pleft = (lx >= 2 ? xs[lx - 2] + 1 : 0);\n int pright = (rx < kx ? xs[rx] - 1 : 100000);\n int pbot = (ly >= 2 ? ys[ly - 2] + 1 : 0);\n int ptop = (ry < ky ? ys[ry] - 1 : 100000);\n if (pleft >= pright || pbot >= ptop) {\n pleft = minx_ - 5; if (pleft < 0) pleft = 0;\n pright = maxx_ + 5; if (pright > 100000) pright = 100000;\n pbot = miny_ - 5; if (pbot < 0) pbot = 0;\n ptop = maxy_ + 5; if (ptop > 100000) ptop = 100000;\n if (pleft >= pright) {\n pleft = minx_;\n pright = maxx_ + 1; if (pright > 100000) pright = 100000;\n }\n if (pbot >= ptop) {\n pbot = miny_;\n ptop = maxy_ + 1; if (ptop > 100000) ptop = 100000;\n }\n }\n if (pleft == pright) {\n if (pright < 100000) pright++;\n else if (pleft > 0) pleft--;\n }\n if (pbot == ptop) {\n if (ptop < 100000) ptop++;\n else if (pbot > 0) pbot--;\n }\n cout << 4 << endl;\n cout << pleft << \" \" << pbot << endl;\n cout << pright << \" \" << pbot << endl;\n cout << pright << \" \" << ptop << endl;\n cout << pleft << \" \" << ptop << endl;\n return 0;\n}","ahc040":"#include \nusing namespace std;\nusing ll = long long;\n\nstruct RectPos {\n ll x, y, w, h;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N, T;\n ll sigma;\n cin >> N >> T >> sigma;\n vector WW(N), HH(N);\n for(int i = 0; i < N; i++) {\n cin >> WW[i] >> HH[i];\n }\n mt19937 rng(1234LL);\n vector>> cands;\n auto add_special = [&](bool is_row) {\n vector> acts;\n for(int i = 0; i < N; i++) {\n ll a = WW[i], b = HH[i];\n int r = is_row ? (a >= b ? 0 : 1) : (a <= b ? 0 : 1);\n char d = is_row ? 'L' : 'U';\n acts.emplace_back(i, r, d, -1);\n }\n cands.push_back(acts);\n };\n add_special(true); // opt row\n add_special(false); // opt col\n // r=0 row\n {\n vector> acts;\n for(int i = 0; i < N; i++) acts.emplace_back(i, 0, 'L', -1);\n cands.push_back(acts);\n }\n // r=1 row\n {\n vector> acts;\n for(int i = 0; i < N; i++) acts.emplace_back(i, 1, 'L', -1);\n cands.push_back(acts);\n }\n // r=0 col\n {\n vector> acts;\n for(int i = 0; i < N; i++) acts.emplace_back(i, 0, 'U', -1);\n cands.push_back(acts);\n }\n // r=1 col\n {\n vector> acts;\n for(int i = 0; i < N; i++) acts.emplace_back(i, 1, 'U', -1);\n cands.push_back(acts);\n }\n ll best_meas = LLONG_MAX;\n int best_idx = 0;\n const int MAX_VARIANTS = 200;\n for(int t = 0; t < T; t++) {\n vector> current_acts;\n int current_cand_idx = -1;\n if(t < 6) {\n current_acts = cands[t];\n current_cand_idx = t;\n } else if((int)cands.size() < MAX_VARIANTS) {\n rng.seed(1234ULL + (unsigned long long)cands.size() * 123457ULL);\n vector> acts;\n vector pos(N);\n vector active;\n ll cW = 0, cH = 0;\n for(int i = 0; i < N; i++) {\n ll wi = WW[i], hi = HH[i];\n ll best_noisy = LLONG_MAX / 2;\n int br = -1, bbv = -2;\n char bd = ' ';\n ll bpx = -1, bpy = -1;\n for(int r = 0; r < 2; r++) {\n ll cw = r ? hi : wi;\n ll ch = r ? wi : hi;\n int bstart = max(-1, i - 60);\n for(int bb = bstart; bb < i; bb++) {\n int b = bb;\n for(char d : {'U', 'L'}) {\n ll px = 0, py = 0;\n if(d == 'U') {\n px = (b == -1 ? 0 : pos[b].x + pos[b].w);\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n } else {\n py = (b == -1 ? 0 : pos[b].y + pos[b].h);\n ll mr = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(py, re.y) < min(py + ch, re.y + re.h)) {\n mr = max(mr, re.x + re.w);\n }\n }\n px = mr;\n }\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) {\n ol = true;\n break;\n }\n }\n if(ol) continue;\n ll nW = max(cW, px + cw);\n ll nH = max(cH, py + ch);\n ll sc = nW + nH + llabs(nW - nH) / 8;\n bool is_pure = (cands.size() % 5 == 0);\n ll noisy_sc = sc + (is_pure ? 0LL : (rng() % 1200));\n if(noisy_sc < best_noisy) {\n best_noisy = noisy_sc;\n br = r;\n bd = d;\n bbv = b;\n bpx = px;\n bpy = py;\n }\n }\n }\n }\n if(br != -1) {\n ll cw = br ? HH[i] : WW[i];\n ll ch = br ? WW[i] : HH[i];\n pos[i].x = bpx;\n pos[i].y = bpy;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, bpx + cw);\n cH = max(cH, bpy + ch);\n acts.emplace_back(i, br, bd, bbv);\n } else {\n int r = 0; char d = 'U'; int b = -1;\n ll cw = WW[i]; ll ch = HH[i];\n ll px = 0, py = 0;\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) ol = true;\n }\n if(!ol) {\n pos[i].x = px;\n pos[i].y = py;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, px + cw);\n cH = max(cH, py + ch);\n acts.emplace_back(i, r, d, b);\n }\n }\n }\n cands.push_back(acts);\n current_acts = std::move(acts);\n current_cand_idx = (int)cands.size() - 1;\n } else {\n current_cand_idx = best_idx;\n current_acts = cands[best_idx];\n }\n cout << current_acts.size() << '\\n';\n for(auto [p, r, d, b] : current_acts) {\n cout << p << ' ' << r << ' ' << d << ' ' << b << '\\n';\n }\n cout.flush();\n ll Wp, Hp;\n cin >> Wp >> Hp;\n ll meas = Wp + Hp;\n if(meas < best_meas) {\n best_meas = meas;\n best_idx = current_cand_idx;\n }\n }\n return 0;\n}","ahc041":"#include \nusing namespace std;\n\nint main() {\n int N, M, H_;\n cin >> N >> M >> H_;\n int H = H_;\n vector A(N);\n for (auto& a : A) cin >> a;\n vector> g(N);\n for (int i = 0; i < M; i++) {\n int u, v;\n cin >> u >> v;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n auto count_unc = [&](int c, const vector& cov) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n int ct = cov[c] ? 0 : 1;\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) ct++;\n }\n }\n }\n }\n return ct;\n };\n auto mark_ball = [&](int c, vector& cov, int& uncc) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n if (!cov[c]) {\n cov[c] = true;\n uncc--;\n }\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) {\n cov[v] = true;\n uncc--;\n }\n }\n }\n }\n }\n };\n vector cov(N, false);\n int uncc = N;\n vector S_greedy;\n while (uncc > 0) {\n int best_val = -2000000000, bc = -1;\n for (int c = 0; c < N; c++) {\n int ct = count_unc(c, cov);\n int val = ct * 12 - A[c];\n if (ct > 0 && val > best_val) {\n best_val = val;\n bc = c;\n }\n }\n if (best_val == -2000000000) break;\n S_greedy.push_back(bc);\n mark_ball(bc, cov, uncc);\n }\n auto get_farthest_initial = [&]() -> vector {\n vector cs;\n vector d(N, 1000000);\n while (true) {\n int md = -1, fv = -1;\n for (int i = 0; i < N; i++) {\n if (d[i] > md) {\n md = d[i];\n fv = i;\n }\n }\n if (md <= H) break;\n cs.push_back(fv);\n vector nd(N, 1000000);\n queue q;\n for (int s : cs) {\n nd[s] = 0;\n q.push(s);\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (nd[v] > nd[u] + 1) {\n nd[v] = nd[u] + 1;\n q.push(v);\n }\n }\n }\n d = nd;\n }\n return cs;\n };\n vector S_far = get_farthest_initial();\n auto get_eval = [&](const vector& cs) -> long long {\n if (cs.empty() && N > 0) return -1e18;\n vector d(N, -1);\n queue q;\n for (int s : cs) {\n if (d[s] == -1) {\n d[s] = 0;\n q.push(s);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) q.push(v);\n }\n }\n }\n long long sm = 0;\n for (int i = 0; i < N; i++) {\n if (d[i] < 0 || d[i] > H) return -1e18;\n sm += 1LL * d[i] * A[i];\n }\n return sm;\n };\n long long sc_greedy = get_eval(S_greedy);\n long long sc_far = get_eval(S_far);\n vector S_init = (sc_far > sc_greedy ? S_far : S_greedy);\n vector> nears(N);\n for (int i = 0; i < N; i++) {\n for (int j = i + 1; j < N; j++) {\n double dist = hypot(X[i] - X[j], Y[i] - Y[j]);\n if (dist <= 180.0) {\n nears[i].push_back(j);\n nears[j].push_back(i);\n }\n }\n }\n int sumA = 0;\n for (int a : A) sumA += a;\n int avgA = sumA / N;\n vector lowA_nodes;\n for (int i = 0; i < N; i++) if (A[i] <= avgA + 8) lowA_nodes.push_back(i);\n auto run_optimization = [&](int seed) -> pair, long long> {\n mt19937 rng_local(seed);\n vector best_S_local = S_init;\n long long best_score_local = get_eval(S_init);\n vector curr_S_local = S_init;\n long long curr_sc_local = best_score_local;\n int n_iters = 12000;\n for (int it = 0; it < n_iters; it++) {\n vector news = curr_S_local;\n int movt = rng_local() % 10;\n bool skipped = true;\n if (movt < 6 && !news.empty()) {\n int idx = rng_local() % news.size();\n int old = news[idx];\n int newc;\n if (rng_local() % 3 == 0 && !lowA_nodes.empty()) {\n newc = lowA_nodes[rng_local() % lowA_nodes.size()];\n } else if (nears[old].empty() || (rng_local() % 5 == 0)) {\n newc = rng_local() % N;\n } else {\n int k = rng_local() % nears[old].size();\n newc = nears[old][k];\n }\n bool isin = false;\n for (int s : news) if (s == newc) {\n isin = true;\n break;\n }\n if (!isin) {\n news[idx] = newc;\n skipped = false;\n }\n } else if (movt < 8 && news.size() >= 2) {\n int idx = rng_local() % news.size();\n news.erase(news.begin() + idx);\n skipped = false;\n } else if (!news.empty() && news.size() < 18) {\n int newc;\n if (!lowA_nodes.empty()) {\n newc = lowA_nodes[rng_local() % lowA_nodes.size()];\n } else {\n newc = rng_local() % N;\n }\n bool isin = false;\n for (int s : news) if (s == newc) isin = true;\n if (!isin) {\n news.push_back(newc);\n skipped = false;\n }\n }\n if (skipped) continue;\n long long nsc = get_eval(news);\n if (nsc > -1e17) {\n double del = (double)(nsc - curr_sc_local);\n double T = 120.0 * pow(0.9999, it);\n if (T < 3.0) T = 3.0;\n bool accept = (del >= 0);\n if (!accept) {\n double prob = exp(del / T);\n if ((double)rng_local() / (double)rng_local.max() < prob) accept = true;\n }\n if (accept) {\n curr_S_local = news;\n curr_sc_local = nsc;\n if (nsc > best_score_local) {\n best_score_local = nsc;\n best_S_local = news;\n }\n }\n }\n }\n bool improved = true;\n int max_passes = 6;\n int pass_cnt = 0;\n while (improved && pass_cnt < max_passes) {\n pass_cnt++;\n improved = false;\n for (size_t i = 0; i < best_S_local.size(); i++) {\n vector tmp = best_S_local;\n tmp.erase(tmp.begin() + i);\n long long sc = get_eval(tmp);\n if (sc > best_score_local) {\n best_score_local = sc;\n best_S_local = tmp;\n improved = true;\n break;\n }\n }\n if (improved) continue;\n for (size_t i = 0; i < best_S_local.size(); i++) {\n int oldc = best_S_local[i];\n vector cands;\n if (!nears[oldc].empty()) {\n cands = nears[oldc];\n } else {\n for (int j = 0; j < 40; j++) cands.push_back(rng_local() % N);\n }\n for (int j = 0; j < 20; j++) cands.push_back(rng_local() % N);\n long long best_del = -1;\n int best_new = oldc;\n for (int nc : cands) {\n bool isin = false;\n for (int s : best_S_local) if (s == nc && nc != oldc) {\n isin = true;\n break;\n }\n if (isin) continue;\n vector tmp = best_S_local;\n tmp[i] = nc;\n long long nsc = get_eval(tmp);\n if (nsc > best_score_local && (nsc - best_score_local > best_del)) {\n best_del = nsc - best_score_local;\n best_new = nc;\n }\n }\n if (best_del > 0) {\n best_S_local[i] = best_new;\n best_score_local += best_del;\n improved = true;\n break;\n }\n }\n }\n return {best_S_local, best_score_local};\n };\n vector, long long>> results;\n results.push_back(run_optimization(42));\n results.push_back(run_optimization(12345));\n results.push_back(run_optimization(67890));\n results.push_back(run_optimization(11111));\n int best_idx = 0;\n for (int i = 1; i < results.size(); i++) {\n if (results[i].second > results[best_idx].second) best_idx = i;\n }\n vector best_S = results[best_idx].first;\n auto get_par = [&](const vector& cs) {\n vector parent(N, -1);\n vector dist(N, -1);\n queue q;\n for (int c : cs) {\n if (dist[c] == -1) {\n dist[c] = 0;\n parent[c] = -1;\n q.push(c);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (dist[v] == -1) {\n dist[v] = dist[u] + 1;\n parent[v] = u;\n if (dist[v] <= H) q.push(v);\n }\n }\n }\n return parent;\n };\n vector p = get_par(best_S);\n for (int i = 0; i < N; i++) {\n cout << p[i];\n if (i + 1 < N) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc042":"#include \nusing namespace std;\n\nint count_free_dirs(int r, int c, const vector& bd, int N) {\n int cnt = 0;\n bool free_u = true;\n for(int i = 0; i < r; i++) if(bd[i][c] == 'o') {free_u = false; break;}\n if(free_u) cnt++;\n bool free_d = true;\n for(int i = r + 1; i < N; i++) if(bd[i][c] == 'o') {free_d = false; break;}\n if(free_d) cnt++;\n bool free_l = true;\n for(int j = 0; j < c; j++) if(bd[r][j] == 'o') {free_l = false; break;}\n if(free_l) cnt++;\n bool free_r = true;\n for(int j = c + 1; j < N; j++) if(bd[r][j] == 'o') {free_r = false; break;}\n if(free_r) cnt++;\n return cnt;\n}\n\nvoid apply_shift(char d, int p, vector& bd, int* ocnt, int N) {\n char removed_c = '.';\n if(d == 'U') {\n removed_c = bd[0][p];\n for(int r = 0; r < N - 1; r++) bd[r][p] = bd[r + 1][p];\n bd[N - 1][p] = '.';\n } else if(d == 'D') {\n removed_c = bd[N - 1][p];\n for(int r = N - 1; r > 0; r--) bd[r][p] = bd[r - 1][p];\n bd[0][p] = '.';\n } else if(d == 'L') {\n removed_c = bd[p][0];\n for(int c = 0; c < N - 1; c++) bd[p][c] = bd[p][c + 1];\n bd[p][N - 1] = '.';\n } else if(d == 'R') {\n removed_c = bd[p][N - 1];\n for(int c = N - 1; c > 0; c--) bd[p][c] = bd[p][c - 1];\n bd[p][0] = '.';\n }\n if(ocnt && removed_c == 'x') (*ocnt)--;\n}\n\nint main() {\n int N;\n cin >> N;\n vector board(N);\n for(auto &s : board) cin >> s;\n vector cur_board = board;\n vector> moves;\n int oni_left = 0;\n for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) if(cur_board[i][j] == 'x') oni_left++;\n auto get_reverse = [](char d) -> char {\n if(d == 'U') return 'D';\n if(d == 'D') return 'U';\n if(d == 'L') return 'R';\n if(d == 'R') return 'L';\n return ' ';\n };\n while(oni_left > 0 && moves.size() < 1600) {\n double best_rat = -1.0;\n char best_d = ' ';\n int best_p = -1;\n int best_k = 0;\n bool best_can_non = false;\n // up\n for(int j = 0; j < N; j++) {\n int mk = N;\n for(int r = 0; r < N; r++) if(cur_board[r][j] == 'o') {mk = r; break;}\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n for(int r = 0; r < k; r++) if(cur_board[r][j] == 'x') nx++;\n if(nx == 0) continue;\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < k; t++) apply_shift('U', j, tmp, &dum, N);\n bool can_non = true;\n for(int ii = 0; can_non && ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') {\n if(count_free_dirs(ii, jj, tmp, N) == 0) can_non = false;\n }\n double eff_cost = can_non ? k : 2.0 * k;\n double rat = nx / eff_cost;\n if(rat > best_rat) {\n best_rat = rat;\n best_d = 'U';\n best_p = j;\n best_k = k;\n best_can_non = can_non;\n }\n }\n }\n // down\n for(int j = 0; j < N; j++) {\n int mk = 0;\n for(int r = N - 1; r >= 0; r--) {\n if(cur_board[r][j] == 'o') break;\n mk++;\n }\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n for(int r = N - k; r < N; r++) if(cur_board[r][j] == 'x') nx++;\n if(nx == 0) continue;\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < k; t++) apply_shift('D', j, tmp, &dum, N);\n bool can_non = true;\n for(int ii = 0; can_non && ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') {\n if(count_free_dirs(ii, jj, tmp, N) == 0) can_non = false;\n }\n double eff_cost = can_non ? k : 2.0 * k;\n double rat = nx / eff_cost;\n if(rat > best_rat) {\n best_rat = rat;\n best_d = 'D';\n best_p = j;\n best_k = k;\n best_can_non = can_non;\n }\n }\n }\n // left\n for(int i = 0; i < N; i++) {\n int mk = N;\n for(int c = 0; c < N; c++) if(cur_board[i][c] == 'o') {mk = c; break;}\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n for(int c = 0; c < k; c++) if(cur_board[i][c] == 'x') nx++;\n if(nx == 0) continue;\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < k; t++) apply_shift('L', i, tmp, &dum, N);\n bool can_non = true;\n for(int ii = 0; can_non && ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') {\n if(count_free_dirs(ii, jj, tmp, N) == 0) can_non = false;\n }\n double eff_cost = can_non ? k : 2.0 * k;\n double rat = nx / eff_cost;\n if(rat > best_rat) {\n best_rat = rat;\n best_d = 'L';\n best_p = i;\n best_k = k;\n best_can_non = can_non;\n }\n }\n }\n // right\n for(int i = 0; i < N; i++) {\n int mk = 0;\n for(int c = N - 1; c >= 0; c--) {\n if(cur_board[i][c] == 'o') break;\n mk++;\n }\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n for(int c = N - k; c < N; c++) if(cur_board[i][c] == 'x') nx++;\n if(nx == 0) continue;\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < k; t++) apply_shift('R', i, tmp, &dum, N);\n bool can_non = true;\n for(int ii = 0; can_non && ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') {\n if(count_free_dirs(ii, jj, tmp, N) == 0) can_non = false;\n }\n double eff_cost = can_non ? k : 2.0 * k;\n double rat = nx / eff_cost;\n if(rat > best_rat) {\n best_rat = rat;\n best_d = 'R';\n best_p = i;\n best_k = k;\n best_can_non = can_non;\n }\n }\n }\n if(best_rat < 0) break;\n char fwd = best_d;\n char revv = get_reverse(fwd);\n if(best_can_non) {\n for(int t = 0; t < best_k; t++) {\n apply_shift(fwd, best_p, cur_board, &oni_left, N);\n moves.emplace_back(fwd, best_p);\n }\n } else {\n for(int t = 0; t < best_k; t++) {\n apply_shift(fwd, best_p, cur_board, &oni_left, N);\n moves.emplace_back(fwd, best_p);\n }\n for(int t = 0; t < best_k; t++) {\n apply_shift(revv, best_p, cur_board, &oni_left, N);\n moves.emplace_back(revv, best_p);\n }\n }\n }\n for(auto [d, p] : moves) {\n cout << d << \" \" << p << endl;\n }\n return 0;\n}","ahc044":"#include \nusing namespace std;\nusing ll = long long;\n\nvector simulate(const vector& a, const vector& b, int N, ll L) {\n vector cnt(N, 0);\n int cur = 0;\n for (ll w = 0; w < L; w++) {\n cnt[cur]++;\n if (w + 1 == L) break;\n ll t = cnt[cur];\n int nxt = (t % 2 == 1 ? a[cur] : b[cur]);\n cur = nxt;\n }\n return cnt;\n}\n\nll calc_error(const vector& cnt, const vector& T) {\n ll e = 0;\n for (size_t i = 0; i < T.size(); i++) e += abs(cnt[i] - T[i]);\n return e;\n}\n\nint main() {\n int N;\n ll L;\n cin >> N >> L;\n vector T(N);\n for (auto& x : T) cin >> x;\n\n vector> emp(N);\n for (int i = 0; i < N; i++) emp[i] = {T[i], i};\n sort(emp.rbegin(), emp.rend());\n\n vector> candidates;\n for (int k = 1; k <= N; k++) {\n for (int d = 0; d <= k; d++) {\n bool zero_in = false;\n for (int j = 0; j < k; j++) if (emp[j].second == 0) zero_in = true;\n double vis_S = zero_in ? (double)L : (double)L - 1.0;\n double denom = k + d;\n double r = vis_S / denom;\n vector ass(N, 0);\n for (int j = 0; j < k; j++) {\n int id = emp[j].second;\n ll tapp = round((j < d ? 2LL : 1LL) * r);\n ass[id] = tapp;\n }\n if (!zero_in) ass[0] = 1;\n ll e = 0;\n for (int i = 0; i < N; i++) e += abs(ass[i] - T[i]);\n candidates.emplace_back(e, k, d);\n }\n }\n sort(candidates.begin(), candidates.end());\n\n ll best_e = LLONG_MAX;\n vector best_a(N), best_b(N);\n\n size_t max_cand = min(70UL, candidates.size());\n for (size_t ci = 0; ci < max_cand; ci++) {\n auto [_, k, d] = candidates[ci];\n vector is_dou(N, 0), is_in(N, 0);\n for (int j = 0; j < k; j++) {\n is_in[emp[j].second] = 1;\n if (j < d) is_dou[emp[j].second] = 1;\n }\n vector S;\n for (int j = 0; j < k; j++) S.push_back(emp[j].second);\n\n vector> orders = {S};\n auto idord = S; sort(idord.begin(), idord.end()); orders.push_back(idord);\n auto ascd = S; reverse(ascd.begin(), ascd.end()); orders.push_back(ascd);\n\n for (auto cyc : orders) {\n if (k > 0 && cyc.empty()) continue;\n vector cura(N, 0), curb(N, 0);\n int ent = k > 0 ? cyc[0] : 0;\n for (int i = 0; i < N; i++) if (!is_in[i]) cura[i] = curb[i] = ent;\n for (size_t i = 0; i < cyc.size(); i++) {\n int u = cyc[i];\n int nxt = cyc[(i + 1) % cyc.size()];\n if (is_dou[u]) {\n cura[u] = u;\n curb[u] = nxt;\n } else {\n cura[u] = nxt;\n curb[u] = nxt;\n }\n }\n if (k == 0) for (int i = 0; i < N; i++) cura[i] = curb[i] = 0;\n\n auto cnt = simulate(cura, curb, N, L);\n ll e = calc_error(cnt, T);\n if (e < best_e) {\n best_e = e;\n best_a = cura;\n best_b = curb;\n }\n }\n }\n\n mt19937 rng(12345);\n int n_local = 450;\n for (int trial = 0; trial < n_local; trial++) {\n vector cura = best_a, curb = best_b;\n\n if (rng() % 5 == 0) {\n vector used;\n auto cnt = simulate(cura, curb, N, L);\n for (int i = 0; i < N; i++) if (cnt[i] > L / 300) used.push_back(i);\n if (!used.empty()) {\n random_shuffle(used.begin(), used.end(), [&](int) { return rng() % used.size(); });\n for (size_t i = 0; i < used.size(); i++) {\n int u = used[i];\n int nxt = used[(i + 1) % used.size()];\n if (T[u] * 2 > T[0]) {\n cura[u] = u; curb[u] = nxt;\n } else {\n cura[u] = nxt; curb[u] = nxt;\n }\n }\n }\n } else {\n uniform_int_distribution uid(0, N - 1);\n int u = uid(rng);\n if (rng() % 10 == 0 && cura[u] == u) {\n curb[u] = uid(rng);\n } else {\n bool change_a = (rng() % 2 == 0);\n int new_t = uid(rng);\n if (change_a) cura[u] = new_t;\n else curb[u] = new_t;\n }\n }\n\n auto cnt = simulate(cura, curb, N, L);\n ll newe = calc_error(cnt, T);\n if (newe < best_e) {\n best_e = newe;\n best_a = cura;\n best_b = curb;\n }\n }\n\n {\n vector cura = best_a, curb = best_b;\n auto cnt = simulate(cura, curb, N, L);\n ll cur_e = calc_error(cnt, T);\n for (int i = 0; i < N; i++) {\n if (T[i] > T[0] / 2 && cura[i] != i) {\n vector tmp_a = cura, tmp_b = curb;\n tmp_a[i] = i;\n auto tmp_cnt = simulate(tmp_a, tmp_b, N, L);\n ll ne = calc_error(tmp_cnt, T);\n if (ne < cur_e) {\n cur_e = ne;\n cura = tmp_a;\n curb = tmp_b;\n }\n }\n }\n if (cur_e < best_e) {\n best_e = cur_e;\n best_a = cura;\n best_b = curb;\n }\n }\n\n {\n vector cura = best_a, curb = best_b;\n auto cnt = simulate(cura, curb, N, L);\n ll cur_e = calc_error(cnt, T);\n\n vector> bad;\n for (int i = 0; i < N; i++) {\n if (cnt[i] > L / 300) bad.emplace_back(abs(cnt[i] - T[i]), i);\n }\n sort(bad.rbegin(), bad.rend());\n for (int i = 0; i < min(10, (int)bad.size()); i++) {\n int u = bad[i].second;\n if (cura[u] == u || curb[u] == u) continue;\n vector tmp_a = cura, tmp_b = curb;\n tmp_a[u] = tmp_b[u] = (N > 1 ? (u + 1) % N : 0);\n auto tmp_cnt = simulate(tmp_a, tmp_b, N, L);\n ll ne = calc_error(tmp_cnt, T);\n if (ne < cur_e) {\n cur_e = ne;\n cura = tmp_a;\n curb = tmp_b;\n }\n }\n if (cur_e < best_e) {\n best_e = cur_e;\n best_a = cura;\n best_b = curb;\n }\n }\n\n {\n vector cura = best_a, curb = best_b;\n auto cnt = simulate(cura, curb, N, L);\n ll cur_e = calc_error(cnt, T);\n\n vector high, low;\n for (int i = 0; i < N; i++) {\n if (T[i] > 2 * T[0] / 5) high.push_back(i);\n else if (T[i] < T[0] / 5 && cnt[i] < 10) low.push_back(i);\n }\n\n int nboost = min(15, min((int)high.size(), (int)low.size()));\n for (int i = 0; i < nboost; i++) {\n int h = high[i];\n int helper = low[i];\n vector tmp_a = cura, tmp_b = curb;\n tmp_a[h] = helper;\n tmp_b[helper] = h;\n tmp_a[helper] = h;\n auto tmp_cnt = simulate(tmp_a, tmp_b, N, L);\n ll ne = calc_error(tmp_cnt, T);\n if (ne < cur_e) {\n cur_e = ne;\n cura = tmp_a;\n curb = tmp_b;\n }\n }\n if (cur_e < best_e) {\n best_e = cur_e;\n best_a = cura;\n best_b = curb;\n }\n }\n\n for (int i = 0; i < N; i++) {\n cout << best_a[i] << \" \" << best_b[i] << endl;\n }\n}","ahc045":"#include \nusing namespace std;\n\nint main() {\n int N, M, maxQ, L, W;\n cin >> N >> M >> maxQ >> L >> W;\n vector G(M);\n for (auto &x : G) cin >> x;\n vector cx(N), cy(N);\n for (int i = 0; i < N; i++) {\n int lx, rx, ly, ry;\n cin >> lx >> rx >> ly >> ry;\n cx[i] = (lx + rx) / 2.0;\n cy[i] = (ly + ry) / 2.0;\n }\n vector seeds(M);\n vector min_d(N, 1e18);\n seeds[0] = 0;\n for (int j = 0; j < N; j++) {\n min_d[j] = hypot(cx[0] - cx[j], cy[0] - cy[j]);\n }\n min_d[0] = -1.0;\n for (int k = 1; k < M; k++) {\n double best_md = -1.0; int best_j = -1;\n for (int j = 0; j < N; j++) {\n if (min_d[j] > best_md) {\n best_md = min_d[j];\n best_j = j;\n }\n }\n seeds[k] = best_j;\n for (int j = 0; j < N; j++) {\n double d = hypot(cx[best_j] - cx[j], cy[best_j] - cy[j]);\n if (d < min_d[j]) min_d[j] = d;\n }\n }\n vector> clusters(M);\n for (int k = 0; k < M; k++) {\n clusters[k].push_back(seeds[k]);\n }\n vector> min_dist_cluster(M, vector(N, 1e18));\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n for (int j = 0; j < N; j++) {\n min_dist_cluster[k][j] = hypot(cx[s] - cx[j], cy[s] - cy[j]);\n }\n }\n vector clus_size(M, 1);\n vector used(N, false);\n for (int k = 0; k < M; k++) used[seeds[k]] = true;\n for (int toadd = 0; toadd < N - M; toadd++) {\n double bd = 1e18; int bc = -1, bg = -1;\n for (int j = 0; j < N; j++) if (!used[j]) {\n for (int k = 0; k < M; k++) if (clus_size[k] < G[k]) {\n if (min_dist_cluster[k][j] < bd) {\n bd = min_dist_cluster[k][j];\n bc = j; bg = k;\n }\n }\n }\n used[bc] = true;\n clusters[bg].push_back(bc);\n clus_size[bg]++;\n for (int j = 0; j < N; j++) if (!used[j]) {\n double nd = hypot(cx[bc] - cx[j], cy[bc] - cy[j]);\n if (nd < min_dist_cluster[bg][j]) min_dist_cluster[bg][j] = nd;\n }\n }\n vector q_alloc(M, 0);\n int base = 0;\n for (int k = 0; k < M; k++) {\n if ((int)clusters[k].size() >= 3) {\n q_alloc[k] = 1;\n base++;\n }\n }\n int remain = max(0, maxQ - base);\n long long weight = 0;\n for (int k = 0; k < M; k++) {\n if ((int)clusters[k].size() > L) {\n weight += (long long)clusters[k].size() - 1;\n }\n }\n if (weight > 0 && remain > 0) {\n for (int k = 0; k < M; k++) {\n if ((int)clusters[k].size() > L) {\n long long extra = (long long)remain * ((long long)clusters[k].size() - 1) / weight;\n q_alloc[k] += (int)extra;\n }\n }\n }\n int actual_total = 0;\n for (int v : q_alloc) actual_total += v;\n if (actual_total > maxQ) {\n int over = actual_total - maxQ;\n for (int k = M-1; k >= 0 && over > 0; k--) {\n if ((int)clusters[k].size() > L && q_alloc[k] > 1) {\n int can_reduce = min(q_alloc[k]-1, over);\n q_alloc[k] -= can_reduce;\n over -= can_reduce;\n }\n }\n }\n vector>> queries_per_group(M);\n for (int k = 0; k < M; k++) {\n int gs = (int)clusters[k].size();\n if (gs < 3) continue;\n auto cits = clusters[k];\n sort(cits.begin(), cits.end(), [&](int a, int b) {\n if (abs(cx[a] - cx[b]) > 1e-9) return cx[a] < cx[b];\n if (abs(cy[a] - cy[b]) > 1e-9) return cy[a] < cy[b];\n return a < b;\n });\n clusters[k] = cits;\n if (gs <= L) {\n queries_per_group[k].push_back(cits);\n } else {\n int want = min(q_alloc[k], gs);\n for (int iq = 0; iq < want; iq++) {\n int idx = iq % gs;\n int base_city = cits[idx];\n vector> closest;\n for (int j = 0; j < gs; j++) {\n if (j == idx) continue;\n int other = cits[j];\n double d = hypot(cx[base_city] - cx[other], cy[base_city] - cy[other]);\n closest.emplace_back(d, other);\n }\n sort(closest.begin(), closest.end());\n vector sub = {base_city};\n for (int t = 0; t < L - 1 && t < (int)closest.size(); t++) {\n sub.push_back(closest[t].second);\n }\n queries_per_group[k].push_back(sub);\n }\n }\n }\n int total_q = 0;\n for (int k = 0; k < M; k++) total_q += (int)queries_per_group[k].size();\n if (total_q > maxQ) {\n vector> gq;\n for (int k = 0; k < M; k++) if (!queries_per_group[k].empty()) {\n gq.emplace_back(-(int)queries_per_group[k].size(), k);\n }\n sort(gq.begin(), gq.end());\n int excess = total_q - maxQ;\n for (auto &[neg, k] : gq) {\n int keep_min = (int)queries_per_group[k].size() > 1 ? 1 : 0;\n int can_remove = min(excess, (int)queries_per_group[k].size() - keep_min);\n for (int r = 0; r < can_remove; r++) {\n queries_per_group[k].pop_back();\n }\n excess -= can_remove;\n if (excess <= 0) break;\n }\n }\n vector>> mst_edges(M);\n for (int k = 0; k < M; k++) {\n for (auto &sub : queries_per_group[k]) {\n int ls = (int)sub.size();\n cout << \"? \" << ls;\n for (int c : sub) cout << \" \" << c;\n cout << endl;\n for (int e = 0; e < ls - 1; e++) {\n int a, b;\n cin >> a >> b;\n mst_edges[k].emplace_back(a, b);\n }\n }\n }\n cout << \"!\" << endl;\n for (int k = 0; k < M; k++) {\n auto &cits = clusters[k];\n int gs = (int)cits.size();\n for (int i = 0; i < gs; i++) {\n if (i > 0) cout << \" \";\n cout << cits[i];\n }\n cout << endl;\n if (gs == 1) continue;\n if (gs == 2) {\n cout << cits[0] << \" \" << cits[1] << endl;\n continue;\n }\n vector> cands;\n set> edge_set;\n for (auto [aa, bb] : mst_edges[k]) {\n int u = min(aa, bb), v = max(aa, bb);\n if (edge_set.count({u, v})) continue;\n edge_set.insert({u, v});\n cands.emplace_back(0.0, u, v);\n }\n for (int i = 0; i < gs; i++) {\n for (int j = i + 1; j < gs; j++) {\n int u = cits[i], v = cits[j];\n int mu = min(u, v), mv = max(u, v);\n if (edge_set.count({mu, mv})) continue;\n double dd = hypot(cx[u] - cx[v], cy[u] - cy[v]);\n cands.emplace_back(dd, mu, mv);\n }\n }\n sort(cands.begin(), cands.end());\n vector parent(N);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto &self, int x) -> int {\n return parent[x] == x ? x : parent[x] = self(self, parent[x]);\n };\n vector> selected;\n for (auto [d, u, v] : cands) {\n int pu = find(find, u), pv = find(find, v);\n if (pu != pv) {\n parent[pu] = pv;\n selected.emplace_back(u, v);\n if ((int)selected.size() == gs - 1) break;\n }\n }\n for (auto [a, b] : selected) {\n cout << a << \" \" << b << endl;\n }\n }\n return 0;\n}","ahc046":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> points(M);\n for (auto& p : points) {\n cin >> p.first >> p.second;\n }\n vector> sequence;\n pair current = points[0];\n int di[4] = {-1, 1, 0, 0};\n int dj[4] = {0, 0, -1, 1};\n char dch[4] = {'U', 'D', 'L', 'R'};\n for (int t = 1; t < M; t++) {\n int gi = points[t].first;\n int gj = points[t].second;\n vector> dist(N, vector(N, -1));\n vector> pre(N, vector(N, -1));\n vector> ac(N, vector(N, ' '));\n vector> dc(N, vector(N, ' '));\n queue> q;\n int si = current.first;\n int sj = current.second;\n dist[si][sj] = 0;\n q.push({si, sj});\n while (!q.empty()) {\n auto [i, j] = q.front();\n q.pop();\n for (int tp = 0; tp < 2; tp++) {\n for (int d = 0; d < 4; d++) {\n int ni, nj;\n if (tp == 0) {\n ni = i + di[d];\n nj = j + dj[d];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N) continue;\n } else {\n int ci = i, cj = j;\n while (true) {\n int ti = ci + di[d];\n int tj = cj + dj[d];\n if (ti < 0 || ti >= N || tj < 0 || tj >= N) break;\n ci = ti;\n cj = tj;\n }\n ni = ci;\n nj = cj;\n }\n if (dist[ni][nj] != -1) continue;\n dist[ni][nj] = dist[i][j] + 1;\n pre[ni][nj] = i * N + j;\n ac[ni][nj] = (tp == 0 ? 'M' : 'S');\n dc[ni][nj] = dch[d];\n q.push({ni, nj});\n }\n }\n }\n vector> this_path;\n int ci = gi, cj = gj;\n while (dist[ci][cj] > 0) {\n this_path.emplace_back(ac[ci][cj], dc[ci][cj]);\n int p = pre[ci][cj];\n ci = p / N;\n cj = p % N;\n }\n reverse(this_path.begin(), this_path.end());\n for (auto& p : this_path) sequence.push_back(p);\n current = {gi, gj};\n }\n for (auto& p : sequence) {\n cout << p.first << \" \" << p.second << endl;\n }\n}"},"16":{"ahc001":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int n;\n cin >> n;\n vector x(n), y(n), r(n);\n for (int i = 0; i < n; i++) {\n cin >> x[i] >> y[i] >> r[i];\n }\n vector la(n), lb(n), lc(n), ld(n);\n auto rec = [&](auto&& self, vector ids, ll xl, ll xr, ll yl, ll yr) -> void {\n int m = ids.size();\n if (m == 0) return;\n if (m == 1) {\n int i = ids[0];\n la[i] = xl; lb[i] = yl; lc[i] = xr; ld[i] = yr;\n return;\n }\n ll carea = (xr - xl) * (yr - yl);\n ll tr = 0;\n for (int i : ids) tr += r[i];\n double min_dev = 1e18;\n int best_d = -1; // 0:vert 1:horiz\n int best_kk = -1;\n ll best_cutt = -1;\n vector best_sids;\n // vertical\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return x[i] < x[j] || (x[i] == x[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll hy = yr - yl;\n if (hy == 0) continue;\n double id_cut = xl + id_area / hy;\n ll maxlx = -1;\n for (int j = 0; j < k; j++) maxlx = max(maxlx, x[sids[j]]);\n ll minrx = 10001;\n for (int j = k; j < m; j++) minrx = min(minrx, x[sids[j]]);\n ll lo = max(xl + 1, maxlx + 1);\n ll hi = min(xr, minrx);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - xl) * (double)hy;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 0;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n // horizontal\n {\n vector sids = ids;\n sort(sids.begin(), sids.end(), [&](int i, int j) {\n return y[i] < y[j] || (y[i] == y[j] && i < j);\n });\n vector cum(m + 1, 0);\n for (int j = 0; j < m; j++) cum[j + 1] = cum[j] + r[sids[j]];\n for (int k = 1; k < m; k++) {\n ll srl = cum[k];\n double id_area = srl * (double)carea / tr;\n ll wx = xr - xl;\n if (wx == 0) continue;\n double id_cut = yl + id_area / wx;\n ll maxly = -1;\n for (int j = 0; j < k; j++) maxly = max(maxly, y[sids[j]]);\n ll minry = 10001;\n for (int j = k; j < m; j++) minry = min(minry, y[sids[j]]);\n ll lo = max(yl + 1, maxly + 1);\n ll hi = min(yr, minry);\n if (lo > hi) continue;\n ll cut = (ll)round(id_cut);\n if (cut < lo) cut = lo;\n if (cut > hi) cut = hi;\n double act_area = (cut - yl) * (double)wx;\n double devv = fabs(act_area - id_area);\n if (devv < min_dev) {\n min_dev = devv;\n best_d = 1;\n best_kk = k;\n best_cutt = cut;\n best_sids = sids;\n }\n }\n }\n if (best_d == -1) {\n for (int ii : ids) {\n int i = ii;\n la[i] = x[i]; lb[i] = y[i]; lc[i] = x[i] + 1; ld[i] = y[i] + 1;\n }\n return;\n }\n vector left, rightt;\n for (int j = 0; j < best_kk; j++) left.push_back(best_sids[j]);\n for (int j = best_kk; j < m; j++) rightt.push_back(best_sids[j]);\n if (best_d == 0) {\n ll cut = best_cutt;\n self(self, left, xl, cut, yl, yr);\n self(self, rightt, cut, xr, yl, yr);\n } else {\n ll cut = best_cutt;\n self(self, left, xl, xr, yl, cut);\n self(self, rightt, xl, xr, cut, yr);\n }\n };\n vector all(n);\n iota(all.begin(), all.end(), 0);\n rec(rec, all, 0LL, 10000LL, 0LL, 10000LL);\n // post-process 1: optimize size within allocated rect\n for (int i = 0; i < n; i++) {\n ll xl = la[i], xr = lc[i], yl = lb[i], yr = ld[i];\n ll W = xr - xl;\n ll H = yr - yl;\n ll xi = x[i], yi = y[i];\n ll lroom = xi - xl;\n ll rroom = xr - xi - 1;\n ll broom = yi - yl;\n ll troom = yr - yi - 1;\n auto getp_local = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n double bp = getp_local(W * H, r[i]);\n ll bw = W, bh = H;\n for (ll w = 1; w <= W; w++) {\n double idh = r[i] * 1.0 / w;\n ll hround = (ll)round(idh);\n for (ll dh = -1; dh <= 1; dh++) {\n ll h = hround + dh;\n if (h < 1 || h > H) continue;\n ll s = w * h;\n double pv = getp_local(s, r[i]);\n if (pv > bp) {\n bp = pv;\n bw = w;\n bh = h;\n }\n }\n }\n if (bw != W || bh != H) {\n ll wl_min = max(0LL, bw - 1 - rroom);\n ll wl_max = min(lroom, bw - 1);\n ll wl = (wl_min + wl_max) / 2;\n ll new_a = xi - wl;\n ll new_c = new_a + bw;\n ll hb_min = max(0LL, bh - 1 - troom);\n ll hb_max = min(broom, bh - 1);\n ll hb = (hb_min + hb_max) / 2;\n ll new_b = yi - hb;\n ll new_d = new_b + bh;\n la[i] = new_a;\n lb[i] = new_b;\n lc[i] = new_c;\n ld[i] = new_d;\n }\n }\n // post-process 2: greedy expansion into free space\n auto getp2 = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n bool improved = true;\n int iters = 0;\n while (improved && iters < 5000) {\n improved = false;\n iters++;\n double max_imp = 0.0;\n int best_i = -1;\n int best_dir = -1; // 0:left(a--), 1:right(c++), 2:bottom(b--), 3:top(d++)\n ll best_pos = -1;\n for (int i = 0; i < n; i++) {\n ll curs = (lc[i] - la[i]) * (ld[i] - lb[i]);\n if (curs >= r[i]) continue;\n double curp = getp2(curs, r[i]);\n ll cur_la = la[i], cur_lb = lb[i], cur_lc = lc[i], cur_ld = ld[i];\n ll curw = cur_lc - cur_la;\n ll curh = cur_ld - cur_lb;\n // dir 0: expand left, decrease a\n {\n ll max_block = 0;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll my = max(cur_lb, lb[j]);\n ll ny = min(cur_ld, ld[j]);\n if (my < ny) {\n if (lc[j] <= cur_la) {\n max_block = max(max_block, lc[j]);\n }\n }\n }\n ll newa = max(0LL, max_block);\n if (newa < cur_la) {\n ll news = (cur_lc - newa) * curh;\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 0;\n best_pos = newa;\n }\n }\n }\n // dir 1: expand right, increase c\n {\n ll min_block = 10000;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll my = max(cur_lb, lb[j]);\n ll ny = min(cur_ld, ld[j]);\n if (my < ny) {\n if (la[j] >= cur_lc) {\n min_block = min(min_block, la[j]);\n }\n }\n }\n ll newc = min(10000LL, min_block);\n if (newc > cur_lc) {\n ll news = (newc - cur_la) * curh;\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 1;\n best_pos = newc;\n }\n }\n }\n // dir 2: expand bottom, decrease b\n {\n ll max_block = 0;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll mx = max(cur_la, la[j]);\n ll nx = min(cur_lc, lc[j]);\n if (mx < nx) {\n if (ld[j] <= cur_lb) {\n max_block = max(max_block, ld[j]);\n }\n }\n }\n ll newb = max(0LL, max_block);\n if (newb < cur_lb) {\n ll news = curw * (cur_ld - newb);\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 2;\n best_pos = newb;\n }\n }\n }\n // dir 3: expand top, increase d\n {\n ll min_block = 10000;\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n ll mx = max(cur_la, la[j]);\n ll nx = min(cur_lc, lc[j]);\n if (mx < nx) {\n if (lb[j] >= cur_ld) {\n min_block = min(min_block, lb[j]);\n }\n }\n }\n ll newd = min(10000LL, min_block);\n if (newd > cur_ld) {\n ll news = curw * (newd - cur_lb);\n double newp = getp2(news, r[i]);\n double imp = newp - curp;\n if (imp > max_imp) {\n max_imp = imp;\n best_i = i;\n best_dir = 3;\n best_pos = newd;\n }\n }\n }\n }\n if (max_imp > 1e-9 && best_i != -1) {\n if (best_dir == 0) la[best_i] = best_pos;\n else if (best_dir == 1) lc[best_i] = best_pos;\n else if (best_dir == 2) lb[best_i] = best_pos;\n else if (best_dir == 3) ld[best_i] = best_pos;\n improved = true;\n }\n }\n // final optimize size within current rect (after expansion)\n for (int i = 0; i < n; i++) {\n ll xl = la[i], xr = lc[i], yl = lb[i], yr = ld[i];\n ll W = xr - xl;\n ll H = yr - yl;\n ll xi = x[i], yi = y[i];\n ll lroom = xi - xl;\n ll rroom = xr - xi - 1;\n ll broom = yi - yl;\n ll troom = yr - yi - 1;\n auto getp_local = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n double bp = getp_local(W * H, r[i]);\n ll bw = W, bh = H;\n for (ll w = 1; w <= W; w++) {\n double idh = r[i] * 1.0 / w;\n ll hround = (ll)round(idh);\n for (ll dh = -1; dh <= 1; dh++) {\n ll h = hround + dh;\n if (h < 1 || h > H) continue;\n ll s = w * h;\n double pv = getp_local(s, r[i]);\n if (pv > bp) {\n bp = pv;\n bw = w;\n bh = h;\n }\n }\n }\n if (bw != W || bh != H) {\n ll wl_min = max(0LL, bw - 1 - rroom);\n ll wl_max = min(lroom, bw - 1);\n ll wl = (wl_min + wl_max) / 2;\n ll new_a = xi - wl;\n ll new_c = new_a + bw;\n ll hb_min = max(0LL, bh - 1 - troom);\n ll hb_max = min(broom, bh - 1);\n ll hb = (hb_min + hb_max) / 2;\n ll new_b = yi - hb;\n ll new_d = new_b + bh;\n la[i] = new_a;\n lb[i] = new_b;\n lc[i] = new_c;\n ld[i] = new_d;\n }\n }\n // final pairwise boundary adjustment for adjacent rects\n auto calc_p = [&](int idx) {\n ll s = (lc[idx] - la[idx]) * (ld[idx] - lb[idx]);\n return getp2(s, r[idx]);\n };\n auto check_overlap = [&](int a, int b) {\n return max(la[a], la[b]) < min(lc[a], lc[b]) && max(lb[a], lb[b]) < min(ld[a], ld[b]);\n };\n for (int pass = 0; pass < 5; pass++) {\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n bool vert_adj = false;\n int left = -1, rightt = -1;\n if (lc[i] == la[j] && max(lb[i], lb[j]) < min(ld[i], ld[j])) {\n vert_adj = true;\n left = i; rightt = j;\n } else if (lc[j] == la[i] && max(lb[i], lb[j]) < min(ld[i], ld[j])) {\n vert_adj = true;\n left = j; rightt = i;\n }\n if (vert_adj) {\n ll cur_cut = lc[left];\n double oldp = calc_p(left) + calc_p(rightt);\n double bestp = oldp;\n ll bestc = cur_cut;\n ll minc = max({cur_cut - 35LL, la[left] + 1, x[left] + 1});\n ll maxc = min({cur_cut + 35LL, lc[rightt], x[rightt] + 1, 10000LL});\n for (ll nc = minc; nc <= maxc; nc++) {\n if (nc <= x[left] || nc > x[rightt]) continue;\n ll old_l = lc[left]; ll old_r = la[rightt];\n lc[left] = nc; la[rightt] = nc;\n bool val = true;\n if (check_overlap(left, rightt)) val = false;\n for (int k = 0; k < n && val; k++) {\n if (k == left || k == rightt) continue;\n if (check_overlap(left, k) || check_overlap(rightt, k)) val = false;\n }\n if (val) {\n double np = calc_p(left) + calc_p(rightt);\n if (np > bestp) {\n bestp = np;\n bestc = nc;\n }\n }\n lc[left] = old_l; la[rightt] = old_r;\n }\n if (bestc != cur_cut) {\n lc[left] = bestc; la[rightt] = bestc;\n }\n }\n bool horiz_adj = false;\n int bot = -1, tp = -1;\n if (ld[i] == lb[j] && max(la[i], la[j]) < min(lc[i], lc[j])) {\n horiz_adj = true;\n bot = i; tp = j;\n } else if (ld[j] == lb[i] && max(la[i], la[j]) < min(lc[i], lc[j])) {\n horiz_adj = true;\n bot = j; tp = i;\n }\n if (horiz_adj) {\n ll cur_cut = ld[bot];\n double oldp = calc_p(bot) + calc_p(tp);\n double bestp = oldp;\n ll bestc = cur_cut;\n ll minc = max({cur_cut - 35LL, lb[bot] + 1, y[bot] + 1});\n ll maxc = min({cur_cut + 35LL, ld[tp], y[tp] + 1, 10000LL});\n for (ll nc = minc; nc <= maxc; nc++) {\n if (nc <= y[bot] || nc > y[tp]) continue;\n ll old_b = ld[bot]; ll old_t = lb[tp];\n ld[bot] = nc; lb[tp] = nc;\n bool val = true;\n if (check_overlap(bot, tp)) val = false;\n for (int k = 0; k < n && val; k++) {\n if (k == bot || k == tp) continue;\n if (check_overlap(bot, k) || check_overlap(tp, k)) val = false;\n }\n if (val) {\n double np = calc_p(bot) + calc_p(tp);\n if (np > bestp) {\n bestp = np;\n bestc = nc;\n }\n }\n ld[bot] = old_b; lb[tp] = old_t;\n }\n if (bestc != cur_cut) {\n ld[bot] = bestc; lb[tp] = bestc;\n }\n }\n }\n }\n }\n // one more within-rect optimize after pairwise tuning\n for (int i = 0; i < n; i++) {\n ll xl = la[i], xr = lc[i], yl = lb[i], yr = ld[i];\n ll W = xr - xl;\n ll H = yr - yl;\n ll xi = x[i], yi = y[i];\n ll lroom = xi - xl;\n ll rroom = xr - xi - 1;\n ll broom = yi - yl;\n ll troom = yr - yi - 1;\n auto getp_local = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n double bp = getp_local(W * H, r[i]);\n ll bw = W, bh = H;\n for (ll w = 1; w <= W; w++) {\n double idh = r[i] * 1.0 / w;\n ll hround = (ll)round(idh);\n for (ll dh = -1; dh <= 1; dh++) {\n ll h = hround + dh;\n if (h < 1 || h > H) continue;\n ll s = w * h;\n double pv = getp_local(s, r[i]);\n if (pv > bp) {\n bp = pv;\n bw = w;\n bh = h;\n }\n }\n }\n if (bw != W || bh != H) {\n ll wl_min = max(0LL, bw - 1 - rroom);\n ll wl_max = min(lroom, bw - 1);\n ll wl = (wl_min + wl_max) / 2;\n ll new_a = xi - wl;\n ll new_c = new_a + bw;\n ll hb_min = max(0LL, bh - 1 - troom);\n ll hb_max = min(broom, bh - 1);\n ll hb = (hb_min + hb_max) / 2;\n ll new_b = yi - hb;\n ll new_d = new_b + bh;\n la[i] = new_a;\n lb[i] = new_b;\n lc[i] = new_c;\n ld[i] = new_d;\n }\n }\n // final stochastic local search on worst rectangles (maximum effort)\n auto calc_p_all = [&]() {\n double sum = 0.0;\n for (int i = 0; i < n; i++) {\n ll s = (lc[i] - la[i]) * (ld[i] - lb[i]);\n sum += getp2(s, r[i]);\n }\n return sum;\n };\n double current_total_p = calc_p_all();\n for (int search_round = 0; search_round < 5; search_round++) {\n vector> worst;\n for (int i = 0; i < n; i++) {\n ll s = (lc[i] - la[i]) * (ld[i] - lb[i]);\n double p = getp2(s, r[i]);\n worst.emplace_back(p, i);\n }\n sort(worst.begin(), worst.end());\n int num_to_try = min(60, n);\n mt19937 rng(42 + search_round);\n for (int idx = 0; idx < num_to_try; idx++) {\n int i = worst[idx].second;\n ll curs = (lc[i] - la[i]) * (ld[i] - lb[i]);\n bool needs_more_area = curs < r[i];\n for (int trial = 0; trial < 70; trial++) {\n int dir = rng() % 4;\n int delta = (rng() % 16) + 3; // 3-18\n int delta_sign = 1;\n if (!needs_more_area) {\n delta_sign = (rng() % 2 == 0 ? 1 : -1);\n } else {\n if (dir == 0) delta_sign = -1;\n else if (dir == 1) delta_sign = 1;\n else if (dir == 2) delta_sign = -1;\n else delta_sign = 1;\n }\n ll old_val = 0;\n ll new_val = 0;\n bool revert_needed = true;\n if (dir == 0) {\n old_val = la[i];\n new_val = old_val + delta_sign * delta;\n if (new_val < 0 || new_val >= lc[i] || new_val > x[i]) continue;\n la[i] = new_val;\n } else if (dir == 1) {\n old_val = lc[i];\n new_val = old_val + delta_sign * delta;\n if (new_val > 10000 || new_val <= la[i] || new_val <= x[i]) continue;\n lc[i] = new_val;\n } else if (dir == 2) {\n old_val = lb[i];\n new_val = old_val + delta_sign * delta;\n if (new_val < 0 || new_val >= ld[i] || new_val > y[i]) continue;\n lb[i] = new_val;\n } else {\n old_val = ld[i];\n new_val = old_val + delta_sign * delta;\n if (new_val > 10000 || new_val <= lb[i] || new_val <= y[i]) continue;\n ld[i] = new_val;\n }\n bool ok = true;\n for (int k = 0; k < n && ok; k++) {\n if (k == i) continue;\n if (check_overlap(i, k)) ok = false;\n }\n if (ok) {\n double new_total = calc_p_all();\n if (new_total > current_total_p + 1e-9) {\n current_total_p = new_total;\n revert_needed = false;\n }\n }\n if (revert_needed) {\n if (dir == 0) la[i] = old_val;\n else if (dir == 1) lc[i] = old_val;\n else if (dir == 2) lb[i] = old_val;\n else ld[i] = old_val;\n }\n }\n }\n }\n // final cleanup after heavy stochastic\n for (int pass = 0; pass < 2; pass++) {\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n bool vert_adj = false;\n int left = -1, rightt = -1;\n if (lc[i] == la[j] && max(lb[i], lb[j]) < min(ld[i], ld[j])) {\n vert_adj = true;\n left = i; rightt = j;\n } else if (lc[j] == la[i] && max(lb[i], lb[j]) < min(ld[i], ld[j])) {\n vert_adj = true;\n left = j; rightt = i;\n }\n if (vert_adj) {\n ll cur_cut = lc[left];\n double oldp = calc_p(left) + calc_p(rightt);\n double bestp = oldp;\n ll bestc = cur_cut;\n ll minc = max({cur_cut - 20LL, la[left] + 1, x[left] + 1});\n ll maxc = min({cur_cut + 20LL, lc[rightt], x[rightt] + 1, 10000LL});\n for (ll nc = minc; nc <= maxc; nc++) {\n if (nc <= x[left] || nc > x[rightt]) continue;\n ll old_l = lc[left]; ll old_r = la[rightt];\n lc[left] = nc; la[rightt] = nc;\n bool val = true;\n if (check_overlap(left, rightt)) val = false;\n for (int k = 0; k < n && val; k++) {\n if (k == left || k == rightt) continue;\n if (check_overlap(left, k) || check_overlap(rightt, k)) val = false;\n }\n if (val) {\n double np = calc_p(left) + calc_p(rightt);\n if (np > bestp) {\n bestp = np;\n bestc = nc;\n }\n }\n lc[left] = old_l; la[rightt] = old_r;\n }\n if (bestc != cur_cut) {\n lc[left] = bestc; la[rightt] = bestc;\n }\n }\n bool horiz_adj = false;\n int bot = -1, tp = -1;\n if (ld[i] == lb[j] && max(la[i], la[j]) < min(lc[i], lc[j])) {\n horiz_adj = true;\n bot = i; tp = j;\n } else if (ld[j] == lb[i] && max(la[i], la[j]) < min(lc[i], lc[j])) {\n horiz_adj = true;\n bot = j; tp = i;\n }\n if (horiz_adj) {\n ll cur_cut = ld[bot];\n double oldp = calc_p(bot) + calc_p(tp);\n double bestp = oldp;\n ll bestc = cur_cut;\n ll minc = max({cur_cut - 20LL, lb[bot] + 1, y[bot] + 1});\n ll maxc = min({cur_cut + 20LL, ld[tp], y[tp] + 1, 10000LL});\n for (ll nc = minc; nc <= maxc; nc++) {\n if (nc <= y[bot] || nc > y[tp]) continue;\n ll old_b = ld[bot]; ll old_t = lb[tp];\n ld[bot] = nc; lb[tp] = nc;\n bool val = true;\n if (check_overlap(bot, tp)) val = false;\n for (int k = 0; k < n && val; k++) {\n if (k == bot || k == tp) continue;\n if (check_overlap(bot, k) || check_overlap(tp, k)) val = false;\n }\n if (val) {\n double np = calc_p(bot) + calc_p(tp);\n if (np > bestp) {\n bestp = np;\n bestc = nc;\n }\n }\n ld[bot] = old_b; lb[tp] = old_t;\n }\n if (bestc != cur_cut) {\n ld[bot] = bestc; lb[tp] = bestc;\n }\n }\n }\n }\n }\n // final within-rect optimize\n for (int i = 0; i < n; i++) {\n ll xl = la[i], xr = lc[i], yl = lb[i], yr = ld[i];\n ll W = xr - xl;\n ll H = yr - yl;\n ll xi = x[i], yi = y[i];\n ll lroom = xi - xl;\n ll rroom = xr - xi - 1;\n ll broom = yi - yl;\n ll troom = yr - yi - 1;\n auto getp_local = [&](ll s, ll ri) -> double {\n if (s <= 0) return 0.0;\n double rat = min(s, ri) * 1.0 / max(s, ri);\n return 2 * rat - rat * rat;\n };\n double bp = getp_local(W * H, r[i]);\n ll bw = W, bh = H;\n for (ll w = 1; w <= W; w++) {\n double idh = r[i] * 1.0 / w;\n ll hround = (ll)round(idh);\n for (ll dh = -1; dh <= 1; dh++) {\n ll h = hround + dh;\n if (h < 1 || h > H) continue;\n ll s = w * h;\n double pv = getp_local(s, r[i]);\n if (pv > bp) {\n bp = pv;\n bw = w;\n bh = h;\n }\n }\n }\n if (bw != W || bh != H) {\n ll wl_min = max(0LL, bw - 1 - rroom);\n ll wl_max = min(lroom, bw - 1);\n ll wl = (wl_min + wl_max) / 2;\n ll new_a = xi - wl;\n ll new_c = new_a + bw;\n ll hb_min = max(0LL, bh - 1 - troom);\n ll hb_max = min(broom, bh - 1);\n ll hb = (hb_min + hb_max) / 2;\n ll new_b = yi - hb;\n ll new_d = new_b + bh;\n la[i] = new_a;\n lb[i] = new_b;\n lc[i] = new_c;\n ld[i] = new_d;\n }\n }\n for (int i = 0; i < n; i++) {\n cout << la[i] << \" \" << lb[i] << \" \" << lc[i] << \" \" << ld[i] << \"\\n\";\n }\n}","ahc002":"#include \nusing namespace std;\n\nstruct State {\n int i, j;\n long long sumv;\n string moves;\n bitset<2560> usd;\n};\n\nint main() {\n int si, sj;\n cin >> si >> sj;\n int T[50][50], P[50][50];\n int maxt = 0;\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> T[i][j];\n maxt = max(maxt, T[i][j]);\n }\n for (int i = 0; i < 50; i++) for (int j = 0; j < 50; j++) {\n cin >> P[i][j];\n }\n int M = maxt + 1;\n int di[4] = {-1, 0, 1, 0};\n int dj[4] = {0, 1, 0, -1};\n char dirch[4] = {'U', 'R', 'D', 'L'};\n string best_str = \"\";\n long long best_sc = -1;\n srand(999);\n // Multiple trials focused on low degree with some high-p\n int num_trials = 4000;\n char usd[2505];\n for (int trial = 0; trial < num_trials; trial++) {\n memset(usd, 0, M);\n vector moves;\n int curi = si, curj = sj;\n long long cursum = P[si][sj];\n usd[T[si][sj]] = 1;\n bool use_lowdeg = (trial % 10 != 9); // 90% lowdeg\n while (true) {\n vector> cands;\n for (int d = 0; d < 4; d++) {\n int ni = curi + di[d];\n int nj = curj + dj[d];\n if (ni < 0 || ni >= 50 || nj < 0 || nj >= 50) continue;\n int nt = T[ni][nj];\n if (usd[nt]) continue;\n if (use_lowdeg) {\n int deg = 0;\n for (int dd = 0; dd < 4; dd++) {\n int nni = ni + di[dd], nnj = nj + dj[dd];\n if (nni >= 0 && nni < 50 && nnj >= 0 && nnj < 50) {\n int nnt = T[nni][nnj];\n if (nnt != nt && !usd[nnt]) deg++;\n }\n }\n int noisy_deg = deg * 5 + (rand() % 3);\n cands.emplace_back(noisy_deg, -P[ni][nj], d);\n } else {\n cands.emplace_back(-P[ni][nj] * 5, 0, d);\n }\n }\n if (cands.empty()) break;\n sort(cands.begin(), cands.end());\n int sz = cands.size();\n int take = 0;\n if (sz >= 3) {\n take = rand() % min(4, sz);\n }\n auto [bs, np, d] = cands[take];\n int ni = curi + di[d];\n int nj = curj + dj[d];\n int nt = T[ni][nj];\n usd[nt] = 1;\n moves.push_back(dirch[d]);\n cursum += P[ni][nj];\n curi = ni;\n curj = nj;\n }\n if (cursum > best_sc) {\n best_sc = cursum;\n best_str = string(moves.begin(), moves.end());\n }\n }\n // Beam search with increased width\n {\n State init;\n init.i = si; init.j = sj;\n init.sumv = P[si][sj];\n init.moves = \"\";\n init.usd.reset();\n init.usd[T[si][sj]] = true;\n if (init.sumv > best_sc) {\n best_sc = init.sumv;\n best_str = \"\";\n }\n vector cur_beam = {init};\n const int W = 96;\n while (true) {\n vector next_beam;\n bool has_ext = false;\n for (auto &st : cur_beam) {\n int exts = 0;\n for (int d = 0; d < 4; d++) {\n int ni = st.i + di[d];\n int nj = st.j + dj[d];\n if (ni < 0 || ni >= 50 || nj < 0 || nj >= 50) continue;\n int nt = T[ni][nj];\n if (st.usd[nt]) continue;\n exts++;\n has_ext = true;\n State ns = st;\n ns.usd[nt] = true;\n ns.i = ni;\n ns.j = nj;\n ns.sumv += P[ni][nj];\n ns.moves += dirch[d];\n next_beam.push_back(std::move(ns));\n }\n if (exts == 0) {\n if (st.sumv > best_sc) {\n best_sc = st.sumv;\n best_str = st.moves;\n }\n }\n }\n if (!has_ext) break;\n sort(next_beam.begin(), next_beam.end(), [](const State& a, const State& b) {\n return a.sumv > b.sumv;\n });\n int keep = min(W, (int)next_beam.size());\n cur_beam.assign(next_beam.begin(), next_beam.begin() + keep);\n }\n }\n cout << best_str << endl;\n}","ahc003":"#include \nusing namespace std;\n\nint main() {\n double H[30][29];\n double V[29][30];\n double visitH[30][29];\n double visitV[29][30];\n for (int i = 0; i < 30; i++) {\n for (int j = 0; j < 29; j++) {\n H[i][j] = 5000.0 + ((i * 29LL + j) % 19 - 9) * 4.0;\n visitH[i][j] = 0.0;\n }\n }\n for (int i = 0; i < 29; i++) {\n for (int j = 0; j < 30; j++) {\n V[i][j] = 5000.0 + ((i * 30LL + j) % 19 - 9) * 4.0;\n visitV[i][j] = 0.0;\n }\n }\n for (int q = 0; q < 1000; q++) {\n int si, sj, ti, tj;\n cin >> si >> sj >> ti >> tj;\n const double INF = 1e18;\n vector dist(900, INF);\n vector prevv(900, -1);\n priority_queue, vector>, greater>> pq;\n int S = si * 30 + sj;\n int T = ti * 30 + tj;\n dist[S] = 0.0;\n pq.push({0.0, S});\n while (!pq.empty()) {\n auto [c, u] = pq.top();\n pq.pop();\n if (c > dist[u]) continue;\n int i = u / 30;\n int j = u % 30;\n if (j > 0) {\n int nv = i * 30 + (j - 1);\n double nw = H[i][j - 1];\n double vis = visitH[i][j - 1];\n double bonus = 255.0 / (1.0 + vis);\n double nw_eff = nw - bonus;\n if (dist[nv] > dist[u] + nw_eff) {\n dist[nv] = dist[u] + nw_eff;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (j < 29) {\n int nv = i * 30 + (j + 1);\n double nw = H[i][j];\n double vis = visitH[i][j];\n double bonus = 255.0 / (1.0 + vis);\n double nw_eff = nw - bonus;\n if (dist[nv] > dist[u] + nw_eff) {\n dist[nv] = dist[u] + nw_eff;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i > 0) {\n int nv = (i - 1) * 30 + j;\n double nw = V[i - 1][j];\n double vis = visitV[i - 1][j];\n double bonus = 255.0 / (1.0 + vis);\n double nw_eff = nw - bonus;\n if (dist[nv] > dist[u] + nw_eff) {\n dist[nv] = dist[u] + nw_eff;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n if (i < 29) {\n int nv = (i + 1) * 30 + j;\n double nw = V[i][j];\n double vis = visitV[i][j];\n double bonus = 255.0 / (1.0 + vis);\n double nw_eff = nw - bonus;\n if (dist[nv] > dist[u] + nw_eff) {\n dist[nv] = dist[u] + nw_eff;\n prevv[nv] = u;\n pq.push({dist[nv], nv});\n }\n }\n }\n vector path_nodes;\n int cur = T;\n while (true) {\n path_nodes.push_back(cur);\n if (cur == S) break;\n cur = prevv[cur];\n }\n reverse(path_nodes.begin(), path_nodes.end());\n string path_str = \"\";\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n char move;\n if (ci == pi - 1 && cj == pj) move = 'U';\n else if (ci == pi + 1 && cj == pj) move = 'D';\n else if (cj == pj - 1 && ci == pi) move = 'L';\n else if (cj == pj + 1 && ci == pi) move = 'R';\n path_str += move;\n }\n cout << path_str << endl;\n int obs;\n cin >> obs;\n double est = 0.0;\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n if (pi == ci) {\n int jleft = min(pj, cj);\n est += H[pi][jleft];\n } else {\n int itop = min(pi, ci);\n est += V[itop][pj];\n }\n }\n if (est < 1e-9) est = 1.0;\n int num_e = path_nodes.size() - 1;\n double delta = (double)obs - est;\n for (size_t k = 0; k + 1 < path_nodes.size(); k++) {\n int u = path_nodes[k];\n int vv = path_nodes[k + 1];\n int pi = u / 30, pj = u % 30;\n int ci = vv / 30, cj = vv % 30;\n if (pi == ci) {\n int jleft = min(pj, cj);\n double local_alpha = 0.48 / (1.0 + visitH[pi][jleft] * 0.018);\n double local_adj = (delta / num_e) * local_alpha;\n H[pi][jleft] += local_adj;\n double prior_str = 0.006;\n H[pi][jleft] = H[pi][jleft] * (1 - prior_str) + 5000.0 * prior_str;\n if (H[pi][jleft] < 100.0) H[pi][jleft] = 100.0;\n if (H[pi][jleft] > 20000.0) H[pi][jleft] = 20000.0;\n visitH[pi][jleft] += 1.0;\n } else {\n int itop = min(pi, ci);\n double local_alpha = 0.48 / (1.0 + visitV[itop][pj] * 0.018);\n double local_adj = (delta / num_e) * local_alpha;\n V[itop][pj] += local_adj;\n double prior_str = 0.006;\n V[itop][pj] = V[itop][pj] * (1 - prior_str) + 5000.0 * prior_str;\n if (V[itop][pj] < 100.0) V[itop][pj] = 100.0;\n if (V[itop][pj] > 20000.0) V[itop][pj] = 20000.0;\n visitV[itop][pj] += 1.0;\n }\n }\n }\n return 0;\n}","ahc004":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector S(M);\n for (auto& s : S) cin >> s;\n srand(time(NULL));\n auto count_c = [&](const vector& g) -> int {\n string row_strs[20];\n for (int r = 0; r < N; r++) {\n row_strs[r] = g[r] + g[r];\n }\n string col_strs[20];\n for (int c = 0; c < N; c++) {\n col_strs[c] = \"\";\n for (int i = 0; i < 40; i++) {\n col_strs[c] += g[i % N][c];\n }\n }\n int cnt = 0;\n for (const auto& s : S) {\n bool found = false;\n for (int r = 0; r < N && !found; r++) {\n if (row_strs[r].find(s) != string::npos) found = true;\n }\n for (int c = 0; c < N && !found; c++) {\n if (col_strs[c].find(s) != string::npos) found = true;\n }\n if (found) cnt++;\n }\n return cnt;\n };\n auto compute_f = [&](const vector& g) -> int {\n int ff = 0;\n for (auto& row : g) for (char ch : row) if (ch != '.') ff++;\n return ff;\n };\n int best_c_val = -1;\n int best_ff = INT_MAX;\n vector best_grid(N, string(N, '.'));\n for (int trial = 0; trial < 300; trial++) {\n int mode = trial % 4;\n bool use_horiz = (mode != 1);\n bool use_vert = (mode != 0);\n bool descending = true;\n vector order(M);\n iota(order.begin(), order.end(), 0);\n sort(order.begin(), order.end(), [&](int a, int b) {\n if (descending) return S[a].size() > S[b].size();\n return S[a].size() < S[b].size();\n });\n int i = 0;\n while (i < M) {\n int j = i;\n int len = S[order[i]].size();\n while (j < M && (int)S[order[j]].size() == len) j++;\n mt19937 rng(42 + trial * 17);\n shuffle(order.begin() + i, order.begin() + j, rng);\n i = j;\n }\n vector grid(N, string(N, '.'));\n auto can_place_func = [&](int r, int c, int dr, int dc, const string& s, const vector& grd) -> pair {\n int k = s.size();\n int match_cnt = 0;\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n char need = s[p];\n if (grd[rr][cc] != '.' && grd[rr][cc] != need) return {false, 0};\n if (grd[rr][cc] == need) match_cnt++;\n }\n return {true, match_cnt};\n };\n auto do_write_func = [&](int r, int c, int dr, int dc, const string& s, vector& grd) {\n int k = s.size();\n for (int p = 0; p < k; p++) {\n int rr = (r + p * dr) % N;\n int cc = (c + p * dc) % N;\n grd[rr][cc] = s[p];\n }\n };\n for (int idx : order) {\n const string& s = S[idx];\n int true_max = -1;\n if (use_horiz) {\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(r, st, 0, 1, s, grid);\n if (poss) true_max = max(true_max, mt);\n }\n }\n }\n if (use_vert) {\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(st, c, 1, 0, s, grid);\n if (poss) true_max = max(true_max, mt);\n }\n }\n }\n if (true_max == -1) continue;\n int target_mt = true_max;\n vector> cands;\n if (use_horiz) {\n for (int r = 0; r < N; r++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(r, st, 0, 1, s, grid);\n if (poss && mt == target_mt) {\n cands.emplace_back(r, st, 0, 1);\n }\n }\n }\n }\n if (use_vert) {\n for (int c = 0; c < N; c++) {\n for (int st = 0; st < N; st++) {\n auto [poss, mt] = can_place_func(st, c, 1, 0, s, grid);\n if (poss && mt == target_mt) {\n cands.emplace_back(st, c, 1, 0);\n }\n }\n }\n }\n if (!cands.empty()) {\n tuple best_cand = cands[0];\n int best_line_f = -1;\n int best_pos = INT_MAX;\n bool prefer_min = (trial % 2 == 0);\n if (!prefer_min) best_line_f = 999;\n for (auto& cand : cands) {\n auto [rr, cc, ddr, ddc] = cand;\n int linefill = 0;\n if (ddr == 0) {\n for (int j = 0; j < N; j++) if (grid[rr][j] != '.') linefill++;\n } else {\n for (int ii = 0; ii < N; ii++) if (grid[ii][cc] != '.') linefill++;\n }\n int posv = rr * N + cc;\n bool better = false;\n if (prefer_min) {\n if (linefill < best_line_f || (linefill == best_line_f && posv < best_pos)) better = true;\n } else {\n if (linefill > best_line_f || (linefill == best_line_f && posv < best_pos)) better = true;\n }\n if (better) {\n best_line_f = linefill;\n best_pos = posv;\n best_cand = cand;\n }\n }\n auto [br, bc, bdr, bdc] = best_cand;\n do_write_func(br, bc, bdr, bdc, s, grid);\n }\n }\n int this_c = count_c(grid);\n int this_f = compute_f(grid);\n bool do_update = false;\n if (best_c_val == -1 || this_c > best_c_val) {\n do_update = true;\n } else if (this_c == best_c_val) {\n if (this_c == M && this_f < best_ff) {\n do_update = true;\n }\n }\n if (do_update) {\n best_c_val = this_c;\n best_ff = this_f;\n best_grid = grid;\n }\n }\n for (auto& row : best_grid) {\n cout << row << endl;\n }\n return 0;\n}","ahc005":"#include \nusing namespace std;\nusing ll = long long;\n\nconst int MAXN = 70;\nconst ll INF = 1LL << 60;\nint di[4] = {-1, 0, 1, 0};\nint dj[4] = {0, 1, 0, -1};\n\nint main() {\n int N, si, sj;\n cin >> N >> si >> sj;\n vector grid(N);\n for (auto& s : grid) cin >> s;\n int h_id[MAXN][MAXN];\n int v_id[MAXN][MAXN];\n memset(h_id, -1, sizeof(h_id));\n memset(v_id, -1, sizeof(v_id));\n int num_h = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N;) {\n if (grid[i][j] == '#') {\n j++;\n continue;\n }\n while (j < N && grid[i][j] != '#') {\n h_id[i][j] = num_h;\n j++;\n }\n num_h++;\n }\n }\n int num_v = 0;\n for (int j = 0; j < N; j++) {\n for (int i = 0; i < N;) {\n if (grid[i][j] == '#') {\n i++;\n continue;\n }\n while (i < N && grid[i][j] != '#') {\n v_id[i][j] = num_v;\n i++;\n }\n num_v++;\n }\n }\n vector>> h_cells(num_h);\n vector>> v_cells(num_v);\n vector> all_roads;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (grid[i][j] != '#') {\n all_roads.emplace_back(i, j);\n h_cells[h_id[i][j]].emplace_back(i, j);\n v_cells[v_id[i][j]].emplace_back(i, j);\n }\n }\n }\n int r = all_roads.size();\n bool is_covered[MAXN][MAXN] = {};\n int num_uncovered = r;\n auto get_gain = [&](int x, int y) {\n int g = 0;\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) if (!is_covered[a][b]) g++;\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) if (!is_covered[a][b]) g++;\n if (!is_covered[x][y]) g--;\n return g;\n };\n auto apply_cover = [&](int x, int y) {\n int hh = h_id[x][y];\n for (auto [a, b] : h_cells[hh]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n int vv = v_id[x][y];\n for (auto [a, b] : v_cells[vv]) {\n if (!is_covered[a][b]) {\n is_covered[a][b] = true;\n num_uncovered--;\n }\n }\n };\n vector> keys;\n apply_cover(si, sj);\n keys.emplace_back(si, sj);\n while (num_uncovered > 0) {\n int mg = 0;\n pair bp{-1, -1};\n for (auto p : all_roads) {\n int gg = get_gain(p.first, p.second);\n if (gg > mg) {\n mg = gg;\n bp = p;\n }\n }\n if (mg <= 0) break;\n keys.push_back(bp);\n apply_cover(bp.first, bp.second);\n }\n vector> points;\n set> unique_pts(keys.begin(), keys.end());\n for (auto p : unique_pts) points.push_back(p);\n int m = points.size();\n for (int i = 0; i < m; i++) {\n if (points[i].first == si && points[i].second == sj) {\n swap(points[i], points[0]);\n break;\n }\n }\n if (m == 0) {\n cout << \"\" << endl;\n return 0;\n }\n vector> D(m, vector(m, INF));\n for (int k = 0; k < m; k++) {\n pair src = points[k];\n vector> dd(N, vector(N, INF));\n dd[src.first][src.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, src.first, src.second});\n while (!pq.empty()) {\n auto [cost, x, y] = pq.top();\n pq.pop();\n if (cost > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = cost + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n pq.push({nc, nx, ny});\n }\n }\n }\n for (int t = 0; t < m; t++) {\n auto [tx, ty] = points[t];\n D[k][t] = dd[tx][ty];\n }\n }\n vector order;\n if (m == 1) {\n order = {0};\n } else {\n vector vis(m, false);\n order.push_back(0);\n vis[0] = true;\n for (int cnt = 1; cnt < m; cnt++) {\n int curi = order.back();\n ll min_d = INF;\n int chosen = -1;\n for (int j = 0; j < m; j++) {\n if (!vis[j] && D[curi][j] < min_d) {\n min_d = D[curi][j];\n chosen = j;\n }\n }\n order.push_back(chosen);\n vis[chosen] = true;\n }\n }\n auto calc_tour_cost = [&](const vector& ord) -> ll {\n ll sum = 0;\n for (int i = 0; i < m; i++) {\n sum += D[ord[i]][ord[(i + 1) % m]];\n }\n return sum;\n };\n if (m >= 3) {\n int iters = 0;\n bool improved = true;\n while (improved && iters++ < 200) {\n improved = false;\n ll cur_cost = calc_tour_cost(order);\n for (int l = 0; l < m && !improved; l++) {\n for (int r = l + 1; r < m && !improved; r++) {\n vector newo = order;\n reverse(newo.begin() + l, newo.begin() + r + 1);\n ll nc = calc_tour_cost(newo);\n if (nc < cur_cost) {\n order = newo;\n improved = true;\n }\n }\n }\n }\n }\n int zero_pos = 0;\n for (int i = 0; i < m; i++) {\n if (order[i] == 0) {\n zero_pos = i;\n break;\n }\n }\n vector final_order(m);\n for (int i = 0; i < m; i++) {\n final_order[i] = order[(zero_pos + i) % m];\n }\n order = final_order;\n vector> full_route;\n full_route.push_back(points[0]);\n for (int i = 0; i < m; i++) {\n int u = order[i];\n int v = order[(i + 1) % m];\n auto sp = points[u];\n auto tp = points[v];\n vector>> par(N, vector>(N, {-1, -1}));\n vector> dd(N, vector(N, INF));\n dd[sp.first][sp.second] = 0;\n priority_queue, vector>, greater>> pq;\n pq.push({0, sp.first, sp.second});\n while (!pq.empty()) {\n auto [c, x, y] = pq.top();\n pq.pop();\n if (c > dd[x][y]) continue;\n for (int d = 0; d < 4; d++) {\n int nx = x + di[d], ny = y + dj[d];\n if (nx < 0 || nx >= N || ny < 0 || ny >= N || grid[nx][ny] == '#') continue;\n ll nc = c + (grid[nx][ny] - '0');\n if (nc < dd[nx][ny]) {\n dd[nx][ny] = nc;\n par[nx][ny] = {x, y};\n pq.push({nc, nx, ny});\n }\n }\n }\n vector> thisp;\n auto curp = tp;\n while (curp.first != -1) {\n thisp.push_back(curp);\n if (curp == sp) break;\n curp = par[curp.first][curp.second];\n }\n reverse(thisp.begin(), thisp.end());\n for (size_t j = 1; j < thisp.size(); j++) {\n full_route.push_back(thisp[j]);\n }\n }\n string ans = \"\";\n for (size_t i = 0; i + 1 < full_route.size(); i++) {\n int dx = full_route[i + 1].first - full_route[i].first;\n int dy = full_route[i + 1].second - full_route[i].second;\n if (dx == -1 && dy == 0) ans += 'U';\n else if (dx == 1 && dy == 0) ans += 'D';\n else if (dx == 0 && dy == -1) ans += 'L';\n else if (dx == 0 && dy == 1) ans += 'R';\n }\n cout << ans << endl;\n}","future-contest-2022-qual":"#include \nusing namespace std;\n\nint main() {\n int N, M, K, R;\n cin >> N >> M >> K >> R;\n vector> D(N, vector(K));\n for (int i = 0; i < N; i++) {\n for (int k = 0; k < K; k++) {\n cin >> D[i][k];\n }\n }\n vector> successors(N);\n vector unfinished_preds(N, 0);\n for (int i = 0; i < R; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n successors[u].push_back(v);\n unfinished_preds[v]++;\n }\n vector> est_s(M, vector(K, 5));\n vector> observed_tasks(M);\n vector> observed_ws(M);\n vector member_task(M, -1);\n vector member_startday(M, -1);\n vector task_status(N, 0);\n vector tasks_completed_by(M, 0);\n mt19937 rng(42);\n int day = 0;\n while (true) {\n day++;\n if (day > 2000) break;\n vector task_min_dur(N, 5);\n for (int i = 0; i < N; i++) {\n if (task_status[i] == 2) continue;\n int minet = INT_MAX / 2;\n for (int j = 0; j < M; j++) {\n int ws = 0;\n for (int k = 0; k < K; k++) {\n ws += max(0, D[i][k] - est_s[j][k]);\n }\n int et = (ws == 0 ? 1 : ws);\n minet = min(minet, et);\n }\n task_min_dur[i] = minet;\n }\n vector curr_prio(N, 0);\n for (int i = N - 1; i >= 0; i--) {\n if (task_status[i] == 2) continue;\n int mx = 0;\n for (int s : successors[i]) {\n if (task_status[s] != 2) {\n mx = max(mx, curr_prio[s]);\n }\n }\n curr_prio[i] = task_min_dur[i] + mx;\n }\n vector free_workers;\n for (int j = 0; j < M; j++) {\n if (member_task[j] == -1) free_workers.push_back(j);\n }\n vector candidate_tasks;\n for (int i = 0; i < N; i++) {\n if (task_status[i] == 0 && unfinished_preds[i] == 0) {\n candidate_tasks.push_back(i);\n }\n }\n vector> assigns;\n if (!free_workers.empty() && !candidate_tasks.empty()) {\n sort(candidate_tasks.begin(), candidate_tasks.end(), [&](int a, int b) {\n if (curr_prio[a] != curr_prio[b]) return curr_prio[a] > curr_prio[b];\n return a < b;\n });\n int num_assign = min((int)free_workers.size(), (int)candidate_tasks.size());\n vector tasks_select(candidate_tasks.begin(), candidate_tasks.begin() + num_assign);\n vector free_shuffled = free_workers;\n shuffle(free_shuffled.begin(), free_shuffled.end(), rng);\n vector worker_pref(M, 10000);\n for (int ord = 0; ord < (int)free_shuffled.size(); ord++) {\n worker_pref[free_shuffled[ord]] = ord;\n }\n vector worker_free(M, false);\n for (int j : free_workers) worker_free[j] = true;\n for (int ti = 0; ti < num_assign; ti++) {\n int tsk = tasks_select[ti];\n int best_et = INT_MAX;\n int best_exp = INT_MAX;\n int best_pref = INT_MAX;\n int best_j = -1;\n for (int j = 0; j < M; j++) {\n if (!worker_free[j]) continue;\n int wsum = 0;\n for (int k = 0; k < K; k++) {\n wsum += max(0, D[tsk][k] - est_s[j][k]);\n }\n int estt = (wsum == 0 ? 1 : wsum);\n int expp = tasks_completed_by[j];\n int preff = worker_pref[j];\n bool better = false;\n if (estt < best_et) better = true;\n else if (estt == best_et) {\n if (expp < best_exp) better = true;\n else if (expp == best_exp && preff < best_pref) better = true;\n }\n if (better) {\n best_et = estt;\n best_exp = expp;\n best_pref = preff;\n best_j = j;\n }\n }\n if (best_j != -1) {\n worker_free[best_j] = false;\n assigns.emplace_back(best_j, tsk);\n task_status[tsk] = 1;\n member_task[best_j] = tsk;\n member_startday[best_j] = day;\n }\n }\n }\n cout << assigns.size();\n for (auto [j, t] : assigns) {\n cout << \" \" << (j + 1) << \" \" << (t + 1);\n }\n cout << endl;\n int n_comp;\n cin >> n_comp;\n if (n_comp == -1) break;\n for (int fi = 0; fi < n_comp; fi++) {\n int f;\n cin >> f;\n int j = f - 1;\n int tsk = member_task[j];\n if (tsk >= 0) {\n int t_taken = day - member_startday[j] + 1;\n int wobs = (t_taken <= 1 ? 0 : t_taken);\n observed_tasks[j].push_back(tsk);\n observed_ws[j].push_back(wobs);\n int nobs = observed_tasks[j].size();\n if (nobs >= 3 && nobs % 2 == 0) {\n auto& s = est_s[j];\n auto calc_err = [&]() -> int {\n int err = 0;\n for (int o = 0; o < nobs; o++) {\n int ts = observed_tasks[j][o];\n int wp = 0;\n for (int k = 0; k < K; k++) {\n wp += max(0, D[ts][k] - s[k]);\n }\n int df = wp - observed_ws[j][o];\n err += df * df;\n }\n return err;\n };\n int curre = calc_err();\n bool improved = true;\n int maxits = 50;\n while (improved && maxits-- > 0) {\n improved = false;\n for (int kk = 0; kk < K; kk++) {\n int oldsk = s[kk];\n int bestd = 0;\n int beste = curre;\n for (int d = -5; d <= 5; d++) {\n if (d == 0) continue;\n int nsv = oldsk + d;\n if (nsv < 0) continue;\n s[kk] = nsv;\n int ne = calc_err();\n if (ne < beste) {\n beste = ne;\n bestd = d;\n }\n }\n s[kk] = oldsk + bestd;\n if (bestd != 0) {\n curre = beste;\n improved = true;\n } else {\n s[kk] = oldsk;\n }\n }\n }\n for (int &v : s) v = max(0, v);\n }\n tasks_completed_by[j]++;\n task_status[tsk] = 2;\n member_task[j] = -1;\n member_startday[j] = -1;\n for (int suc : successors[tsk]) {\n unfinished_preds[suc]--;\n }\n }\n }\n }\n return 0;\n}","ahc006":"#include \nusing namespace std;\n\nstruct Point {\n int x, y;\n};\n\nint manh(const Point& a, const Point& b) {\n return abs(a.x - b.x) + abs(a.y - b.y);\n}\n\nint main() {\n Point picks[1000], dels[1000];\n for (int i = 0; i < 1000; ++i) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n picks[i] = {a, b};\n dels[i] = {c, d};\n }\n Point cen = {400, 400};\n int solos[1000];\n for (int i = 0; i < 1000; ++i) {\n solos[i] = manh(cen, picks[i]) + manh(picks[i], dels[i]) + manh(dels[i], cen);\n }\n vector ord(1000);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) {\n return solos[i] < solos[j] || (solos[i] == solos[j] && i < j);\n });\n vector pool(ord.begin(), ord.begin() + 500);\n vector selected;\n bool in_sel[1000] = {};\n auto compute_T_for_set = [&](const vector& S) -> int {\n bool isp[1000] = {};\n bool isd[1000] = {};\n Point curr = cen;\n int total = 0;\n for (int step = 0; step < (int)S.size() * 2; ++step) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : S) {\n if (!isp[id]) {\n int dt = manh(curr, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd[id]) {\n int dt = manh(curr, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n total += bd;\n if (bip) {\n curr = picks[bi];\n isp[bi] = true;\n } else {\n curr = dels[bi];\n isd[bi] = true;\n }\n }\n total += manh(curr, cen);\n return total;\n };\n for (int k = 0; k < 50; ++k) {\n int best_add = -1;\n int best_t_add = INT_MAX;\n for (int cand : pool) {\n if (in_sel[cand]) continue;\n vector temp_S = selected;\n temp_S.push_back(cand);\n int this_t = compute_T_for_set(temp_S);\n if (this_t < best_t_add) {\n best_t_add = this_t;\n best_add = cand;\n }\n }\n selected.push_back(best_add);\n in_sel[best_add] = true;\n }\n int current_set_t = compute_T_for_set(selected);\n srand(42);\n for (int refine = 0; refine < 40000; ++refine) {\n int idx = rand() % 50;\n int old = selected[idx];\n int newc = -1;\n do {\n int r = rand() % pool.size();\n newc = pool[r];\n } while (in_sel[newc]);\n vector temp = selected;\n temp[idx] = newc;\n int nt = compute_T_for_set(temp);\n if (nt < current_set_t) {\n selected = temp;\n in_sel[old] = false;\n in_sel[newc] = true;\n current_set_t = nt;\n }\n }\n vector best_S = selected;\n // helpers\n auto build_path_and_t = [&](const vector>& sq) -> pair> {\n vector pp {cen};\n Point cu = cen;\n int tt = 0;\n for (auto& pr : sq) {\n Point nxt = pr.second ? picks[pr.first] : dels[pr.first];\n tt += manh(cu, nxt);\n cu = nxt;\n pp.push_back(cu);\n }\n tt += manh(cu, cen);\n pp.push_back(cen);\n return {tt, pp};\n };\n auto valid_seq = [&](const vector>& sq) -> bool {\n vector pos_p(1000, -1);\n vector pos_d(1000, -1);\n for (int i = 0; i < (int)sq.size(); ++i) {\n auto [o, ispk] = sq[i];\n if (ispk) pos_p[o] = i;\n else pos_d[o] = i;\n }\n for (int o : best_S) {\n if (pos_p[o] > pos_d[o] || pos_p[o] == -1 || pos_d[o] == -1) return false;\n }\n return true;\n };\n auto optimize_route = [&](vector> initseq) -> pair> {\n if (!valid_seq(initseq)) return {INT_MAX, {}};\n auto [ct, cp] = build_path_and_t(initseq);\n vector> cseq = initseq;\n bool imp = true;\n int sw = 0;\n while (imp && sw < 40) {\n imp = false;\n sw++;\n for (int fr = 0; fr < 100 && !imp; ++fr) {\n auto mv = cseq[fr];\n vector> tmp;\n for (int j = 0; j < 100; ++j) if (j != fr) tmp.push_back(cseq[j]);\n for (int ins = 0; ins < 100 && !imp; ++ins) {\n vector> news = tmp;\n news.insert(news.begin() + ins, mv);\n if (valid_seq(news)) {\n auto [nt, np] = build_path_and_t(news);\n if (nt < ct) {\n cseq = news;\n ct = nt;\n cp = np;\n imp = true;\n }\n }\n }\n }\n for (int i1 = 0; i1 < 98 && !imp; ++i1) {\n for (int i2 = i1 + 2; i2 < 100 && !imp; ++i2) {\n vector> news = cseq;\n std::reverse(news.begin() + i1, news.begin() + i2 + 1);\n if (valid_seq(news)) {\n auto [nt, np] = build_path_and_t(news);\n if (nt < ct) {\n cseq = news;\n ct = nt;\n cp = np;\n imp = true;\n }\n }\n }\n }\n }\n return {ct, cp};\n };\n // build NN seq\n vector> seq_nn;\n bool isp_init[1000] = {};\n bool isd_init[1000] = {};\n Point cur_init = cen;\n for (int st = 0; st < 100; ++st) {\n int bd = INT_MAX;\n int bi = -1;\n bool bip = false;\n for (int id : best_S) {\n if (!isp_init[id]) {\n int dt = manh(cur_init, picks[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = true;\n }\n } else if (!isd_init[id]) {\n int dt = manh(cur_init, dels[id]);\n if (dt < bd || (dt == bd && id < bi)) {\n bd = dt;\n bi = id;\n bip = false;\n }\n }\n }\n seq_nn.emplace_back(bi, bip);\n if (bip) {\n cur_init = picks[bi];\n isp_init[bi] = true;\n } else {\n cur_init = dels[bi];\n isd_init[bi] = true;\n }\n }\n auto res = optimize_route(seq_nn);\n vector best_path = res.second;\n if (res.first == INT_MAX) {\n auto fallback = build_path_and_t(seq_nn);\n best_path = fallback.second;\n }\n vector chosen = best_S;\n for (int& v : chosen) ++v;\n sort(chosen.begin(), chosen.end());\n cout << 50;\n for (int r : chosen) cout << \" \" << r;\n cout << endl;\n cout << best_path.size();\n for (auto& pt : best_path) {\n cout << \" \" << pt.x << \" \" << pt.y;\n }\n cout << endl;\n return 0;\n}","ahc007":"#include \nusing namespace std;\n\nstruct Edge {\n int u, v, d, order_idx;\n};\n\nstruct TmpE {\n int l, u, v;\n};\n\nint main() {\n mt19937 rng(42);\n int N = 400;\n int M = 1995;\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector alledges(M);\n for (int i = 0; i < M; i++) {\n cin >> alledges[i].u >> alledges[i].v;\n long long dx = X[alledges[i].u] - X[alledges[i].v];\n long long dy = Y[alledges[i].u] - Y[alledges[i].v];\n long long dist2 = dx * dx + dy * dy;\n alledges[i].d = round(sqrt((double)dist2));\n alledges[i].order_idx = i;\n }\n vector parent(N), rankk(N, 0);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto& self, int x) -> int {\n if (parent[x] != x) parent[x] = self(self, parent[x]);\n return parent[x];\n };\n auto unite = [&](int a, int b) {\n a = find(find, a);\n b = find(find, b);\n if (a == b) return;\n if (rankk[a] < rankk[b]) swap(a, b);\n parent[b] = a;\n if (rankk[a] == rankk[b]) rankk[a]++;\n };\n vector fut;\n fut.reserve(M);\n for (int ii = 0; ii < M; ii++) {\n int l;\n cin >> l;\n Edge& e = alledges[ii];\n int uu = e.u, vv = e.v;\n int pu = find(find, uu);\n int pv = find(find, vv);\n if (pu == pv) {\n cout << 0 << endl;\n continue;\n }\n const int NS = 9;\n long long total_bott = 0;\n for (int sam = 0; sam < NS; sam++) {\n fut.clear();\n for (int j = ii + 1; j < M; j++) {\n auto& ej = alledges[j];\n int dd = ej.d;\n int rnum = 2 * dd + 1;\n int rl = dd + (int)(rng() % rnum);\n fut.push_back({rl, ej.u, ej.v});\n }\n sort(fut.begin(), fut.end(), [](const TmpE& a, const TmpE& b) {\n return a.l < b.l;\n });\n vector tp = parent;\n vector tr = rankk;\n auto tfi = [&](auto& self, int x) -> int {\n if (tp[x] != x) tp[x] = self(self, tp[x]);\n return tp[x];\n };\n int ssu = tfi(tfi, uu);\n int ssv = tfi(tfi, vv);\n int thisb = 1000000000;\n bool conn = false;\n for (auto& fe : fut) {\n int pa = tfi(tfi, fe.u);\n int pb = tfi(tfi, fe.v);\n if (pa != pb) {\n int aa = pa, bb = pb;\n if (tr[aa] < tr[bb]) swap(aa, bb);\n tp[bb] = aa;\n if (tr[aa] == tr[bb]) tr[aa]++;\n if (tfi(tfi, ssu) == tfi(tfi, ssv)) {\n thisb = fe.l;\n conn = true;\n break;\n }\n }\n }\n if (!conn) thisb = 1000000000;\n total_bott += thisb;\n }\n long long avgb = total_bott / NS;\n bool adopt = (l <= avgb);\n cout << (adopt ? 1 : 0) << endl;\n if (adopt) {\n unite(uu, vv);\n }\n }\n return 0;\n}","ahc008":"#include \nusing namespace std;\n\nstruct Task {\n int tx, ty;\n char act;\n int wx, wy;\n};\n\nint main() {\n int N;\n cin >> N;\n vector> pet_pos(N);\n vector pet_t(N);\n for (int i = 0; i < N; i++) {\n int x, y, t;\n cin >> x >> y >> t;\n pet_pos[i] = {x, y};\n pet_t[i] = t;\n }\n int M;\n cin >> M;\n vector> hum_pos(M);\n for (int i = 0; i < M; i++) {\n int x, y;\n cin >> x >> y;\n hum_pos[i] = {x, y};\n }\n double pp = 0.04;\n double ff = 1.0 - pow(pp, 1.0 / N);\n ff = min(ff, 0.28);\n int area_t = (int)(ff * 900) + 20;\n int best_per = 1000;\n int HH = 10, WW = 10;\n for (int h = 6; h <= 26; h++) {\n for (int w = 6; w <= 26; w++) {\n if ((long long)h * w >= area_t && h + w < best_per) {\n best_per = h + w;\n HH = h;\n WW = w;\n }\n }\n }\n int H = HH, W = WW;\n int num_bottom_walls = W;\n int num_right_walls = H;\n int num_b_h = max(1, M * num_bottom_walls / (num_bottom_walls + num_right_walls));\n if (num_b_h > M - (num_right_walls > 0)) num_b_h = max(1, M - (num_right_walls > 0 ? 1 : 0));\n int num_r_h = M - num_b_h;\n pair center = {(1 + H) / 2, (1 + W) / 2};\n vector> homes(M, center);\n vector> bot_pos, rig_pos;\n for (int y = 1; y <= W; y++) bot_pos.emplace_back(H, y);\n for (int x = 1; x <= H; x++) rig_pos.emplace_back(x, W);\n bool walledg[31][31];\n memset(walledg, 0, sizeof(walledg));\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n char mcs[4] = {'U', 'D', 'L', 'R'};\n bool is_build = false;\n vector> htasks(M);\n vector tindex(M, 0);\n int wait_turns = 0;\n bool is_all_home = false;\n for (int turn = 0; turn < 300; turn++) {\n string acts(M, '.');\n int pin = 0;\n for (auto [x, y] : pet_pos) if (x <= H && y <= W && !walledg[x][y]) pin++;\n bool allhome = true;\n for (int i = 0; i < M; i++) if (hum_pos[i].first != homes[i].first || hum_pos[i].second != homes[i].second) allhome = false;\n if (allhome) {\n is_all_home = true;\n wait_turns++;\n }\n int trigger_n = (N <= 12 ? 0 : 1);\n if (!is_build && is_all_home && (pin <= trigger_n || (wait_turns > 90 && pin <= trigger_n + 2))) {\n is_build = true;\n htasks.assign(M, vector());\n tindex.assign(M, 0);\n for (int k = 0; k < num_b_h; k++) {\n int hi = k;\n int yst = 1 + (num_bottom_walls * k / max(1, num_b_h));\n int yen = 1 + (num_bottom_walls * (k + 1) / max(1, num_b_h)) - 1;\n vector ts;\n for (int y = yst; y <= yen; y++) {\n ts.push_back(Task{H, y, 'd', H + 1, y});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n for (int k = 0; k < num_r_h; k++) {\n int hi = num_b_h + k;\n int xst = 1 + (num_right_walls * k / max(1, num_r_h));\n int xen = 1 + (num_right_walls * (k + 1) / max(1, num_r_h)) - 1;\n vector ts;\n for (int x = xst; x <= xen; x++) {\n ts.push_back(Task{x, W, 'r', x, W + 1});\n }\n auto homep = homes[hi];\n sort(ts.begin(), ts.end(), [&](const Task& aa, const Task& bb) {\n int da = abs(aa.tx - homep.first) + abs(aa.ty - homep.second);\n int db = abs(bb.tx - homep.first) + abs(bb.ty - homep.second);\n return da < db;\n });\n htasks[hi] = ts;\n }\n }\n set> will_wall;\n if (is_build) {\n for (int i = 0; i < M; i++) {\n if (tindex[i] >= (int)htasks[i].size()) {\n acts[i] = '.';\n continue;\n }\n Task tk = htasks[i][tindex[i]];\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n if (hx == tk.tx && hy == tk.ty) {\n bool canb = true;\n int cx = tk.wx, cy = tk.wy;\n for (int j = 0; j < N; j++) if (pet_pos[j].first == cx && pet_pos[j].second == cy) canb = false;\n for (int j = 0; j < M; j++) if (hum_pos[j].first == cx && hum_pos[j].second == cy) canb = false;\n int ddx[4] = {-1, 0, 1, 0};\n int ddy[4] = {0, 1, 0, -1};\n for (int d = 0; d < 4; d++) {\n int nx = cx + ddx[d], ny = cy + ddy[d];\n for (int j = 0; j < N; j++) if (pet_pos[j].first == nx && pet_pos[j].second == ny) canb = false;\n }\n if (canb) {\n acts[i] = tk.act;\n will_wall.insert({cx, cy});\n walledg[cx][cy] = true;\n tindex[i]++;\n } else {\n acts[i] = '.';\n }\n } else {\n int cdist = abs(hx - tk.tx) + abs(hy - tk.ty);\n char chosen = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d];\n int ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int ndd = abs(nx - tk.tx) + abs(ny - tk.ty);\n if (ndd < cdist) {\n cdist = ndd;\n chosen = mcs[d];\n }\n }\n }\n acts[i] = chosen;\n }\n }\n } else {\n for (int i = 0; i < M; i++) {\n int hx = hum_pos[i].first, hy = hum_pos[i].second;\n int tx = homes[i].first, ty = homes[i].second;\n if (hx == tx && hy == ty) {\n acts[i] = '.';\n } else {\n int cdist = abs(hx - tx) + abs(hy - ty);\n char ch = '.';\n for (int d = 0; d < 4; d++) {\n int nx = hx + dx[d], ny = hy + dy[d];\n if (nx >= 1 && nx <= 30 && ny >= 1 && ny <= 30 && !walledg[nx][ny]) {\n int nd = abs(nx - tx) + abs(ny - ty);\n if (nd < cdist) {\n cdist = nd;\n ch = mcs[d];\n }\n }\n }\n acts[i] = ch;\n }\n }\n }\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = 0;\n if (a == 'U') d = 0;\n else if (a == 'D') d = 1;\n else if (a == 'L') d = 2;\n else if (a == 'R') d = 3;\n int tx = hum_pos[i].first + dx[d];\n int ty = hum_pos[i].second + dy[d];\n if (will_wall.count({tx, ty})) {\n acts[i] = '.';\n }\n }\n }\n cout << acts << endl;\n cout.flush();\n for (int i = 0; i < M; i++) {\n char a = acts[i];\n if (a == 'U' || a == 'D' || a == 'L' || a == 'R') {\n int d = -1;\n for (int k = 0; k < 4; k++) if (mcs[k] == a) d = k;\n if (d >= 0) {\n hum_pos[i].first += dx[d];\n hum_pos[i].second += dy[d];\n }\n }\n }\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (char c : s) {\n int d = -1;\n if (c == 'U') d = 0;\n else if (c == 'D') d = 1;\n else if (c == 'L') d = 2;\n else if (c == 'R') d = 3;\n if (d >= 0) {\n pet_pos[i].first += dx[d];\n pet_pos[i].second += dy[d];\n }\n }\n }\n }\n return 0;\n}","ahc009":"#include \nusing namespace std;\n\nconst int H = 20;\nconst int W = 20;\nconst int MAXL = 200;\nconst int BEAMW = 150;\nconst double EPS = 1e-12;\n\nstruct State {\n double expv;\n double pr[H][W];\n};\n\nstruct TempCand {\n double expv;\n double pot;\n double pr[H][W];\n int from;\n int dird;\n};\n\nint dr[4] = {-1, 1, 0, 0};\nint dc[4] = {0, 0, -1, 1};\nchar dch[4] = {'U', 'D', 'L', 'R'};\nbool wallh[H][W-1];\nbool wallv[H-1][W];\nint dist_to[H][W];\nint parent[MAXL+1][BEAMW];\nint ch_dir[MAXL+1][BEAMW];\nState current_states[BEAMW];\nTempCand cands[BEAMW * 4 + 10];\nint dists_from[H][W];\nint from_dir[H][W];\n\nbool can_move(int r, int c, int d) {\n int nr = r + dr[d];\n int nc = c + dc[d];\n if (nr < 0 || nr >= H || nc < 0 || nc >= W) return false;\n if (d == 0) {\n return !wallv[nr][c];\n } else if (d == 1) {\n return !wallv[r][c];\n } else if (d == 2) {\n return !wallh[r][nc];\n } else {\n return !wallh[r][c];\n }\n}\n\ndouble compute_score(const string& seq, int si, int sj, int ti, int tj, double forget) {\n int L = seq.size();\n if (L == 0 || L > 200) return 0.0;\n double succ = 1.0 - forget;\n double pr[H][W] = {};\n pr[si][sj] = 1.0;\n double e = 0.0;\n double rem_mass = 1.0;\n for (int t = 0; t < L; t++) {\n char ch = seq[t];\n int d = -1;\n for (int dd = 0; dd < 4; dd++) if (dch[dd] == ch) d = dd;\n if (d < 0) return 0.0;\n double npr[H][W] = {};\n double rec = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n double pb = pr[r][c];\n if (pb <= EPS) continue;\n npr[r][c] += pb * forget;\n int nr = r, nc = c;\n if (can_move(r, c, d)) {\n nr += dr[d];\n nc += dc[d];\n }\n double pm = pb * succ;\n if (nr == ti && nc == tj) {\n rec += pm;\n } else {\n npr[nr][nc] += pm;\n }\n }\n e += rec * (401.0 - (t + 1));\n memcpy(pr, npr, sizeof(npr));\n rem_mass -= rec;\n if (rem_mass < 1e-9) break;\n }\n return e;\n}\n\nstring optimize_string(string s, int si, int sj, int ti, int tj, double forget_p) {\n if (s.empty()) return s;\n double cur_e = compute_score(s, si, sj, ti, tj, forget_p);\n int max_passes = 3;\n for (int pass = 0; pass < max_passes; pass++) {\n bool improved = false;\n for (int pos = 0; pos < (int)s.size(); pos++) {\n char orig = s[pos];\n for (int kd = 0; kd < 4; kd++) {\n char newch = dch[kd];\n if (newch == orig) continue;\n s[pos] = newch;\n double newe = compute_score(s, si, sj, ti, tj, forget_p);\n if (newe > cur_e + 1e-6) {\n cur_e = newe;\n improved = true;\n orig = newch;\n } else {\n s[pos] = orig;\n }\n }\n }\n if (!improved) break;\n }\n // conditional extra for low E\n if (cur_e < 60000000.0) {\n for (int swpass = 0; swpass < 2; swpass++) {\n bool improved = false;\n for (int pos = 0; pos < (int)s.size()-1; pos++) {\n char a = s[pos], b = s[pos+1];\n if (a == b) continue;\n s[pos] = b; s[pos+1] = a;\n double newe = compute_score(s, si, sj, ti, tj, forget_p);\n if (newe > cur_e + 1e-6) {\n cur_e = newe;\n improved = true;\n } else {\n s[pos] = a; s[pos+1] = b;\n }\n }\n if (!improved) break;\n }\n }\n return s;\n}\n\nint main() {\n int si, sj, ti, tj;\n double p;\n cin >> si >> sj >> ti >> tj >> p;\n double forget_p = p;\n for (int i = 0; i < H; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W - 1; j++) {\n wallh[i][j] = (s[j] == '1');\n }\n }\n for (int i = 0; i < H - 1; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < W; j++) {\n wallv[i][j] = (s[j] == '1');\n }\n }\n memset(dist_to, 0x3f, sizeof(dist_to));\n dist_to[ti][tj] = 0;\n queue> qu;\n qu.emplace(ti, tj);\n while (!qu.empty()) {\n auto [r, c] = qu.front(); qu.pop();\n for (int d = 0; d < 4; d++) if (can_move(r, c, d)) {\n int nr = r + dr[d], nc = c + dc[d];\n if (dist_to[nr][nc] > dist_to[r][c] + 1) {\n dist_to[nr][nc] = dist_to[r][c] + 1;\n qu.emplace(nr, nc);\n }\n }\n }\n memset(dists_from, 0x3f, sizeof(dists_from));\n memset(from_dir, -1, sizeof(from_dir));\n dists_from[si][sj] = 0;\n queue> qs;\n qs.emplace(si, sj);\n while (!qs.empty()) {\n auto [r, c] = qs.front(); qs.pop();\n for (int d = 0; d < 4; d++) if (can_move(r, c, d)) {\n int nr = r + dr[d], nc = c + dc[d];\n if (dists_from[nr][nc] > dists_from[r][c] + 1) {\n dists_from[nr][nc] = dists_from[r][c] + 1;\n from_dir[nr][nc] = d;\n qs.emplace(nr, nc);\n }\n }\n }\n string base_path = \"\";\n {\n int cr = ti, cc = tj;\n while (cr != si || cc != sj) {\n int used_d = from_dir[cr][cc];\n base_path += dch[used_d];\n cr -= dr[used_d];\n cc -= dc[used_d];\n }\n reverse(base_path.begin(), base_path.end());\n }\n double best_alt_e = 0.0;\n string best_alt = base_path;\n int blen = base_path.size();\n int maxk = 200 / max(1, blen);\n for (int k = 1; k <= max(1, maxk + 2); k++) {\n string cand = \"\";\n for (int r = 0; r < k; r++) {\n if ((int)cand.size() + blen > 200) break;\n cand += base_path;\n }\n if ((int)cand.size() > 200) cand.resize(200);\n double ce = compute_score(cand, si, sj, ti, tj, forget_p);\n if (ce > best_alt_e) {\n best_alt_e = ce;\n best_alt = cand;\n }\n }\n for (int repm = 1; repm <= 8; repm++) {\n string dupstr = \"\";\n for (char ch : base_path) {\n for (int rr = 0; rr < repm; rr++) {\n dupstr += ch;\n if ((int)dupstr.size() >= 200) break;\n }\n if ((int)dupstr.size() >= 200) break;\n }\n double de = compute_score(dupstr, si, sj, ti, tj, forget_p);\n if (de > best_alt_e) {\n best_alt_e = de;\n best_alt = dupstr;\n }\n }\n vector> orders = {\n {1,3,2,0},{3,1,2,0},{1,3,0,2},{3,1,0,2},\n {1,0,3,2},{3,2,1,0},{0,1,2,3},{2,3,1,0},\n {1,2,3,0},{3,0,1,2}\n };\n for (auto& dorder : orders) {\n string greedy_seq = \"\";\n int vr = si, vc = sj;\n for (int i = 0; i < 200; i++) {\n int best_d = -1;\n int best_dt = dist_to[vr][vc];\n for (int dd : dorder) {\n if (can_move(vr, vc, dd)) {\n int nr = vr + dr[dd], nc = vc + dc[dd];\n if (dist_to[nr][nc] < best_dt) {\n best_dt = dist_to[nr][nc];\n best_d = dd;\n }\n }\n }\n if (best_d == -1) best_d = 1;\n greedy_seq += dch[best_d];\n if (can_move(vr, vc, best_d)) {\n vr += dr[best_d];\n vc += dc[best_d];\n }\n }\n double ge = compute_score(greedy_seq, si, sj, ti, tj, forget_p);\n if (ge > best_alt_e) {\n best_alt_e = ge;\n best_alt = greedy_seq;\n }\n }\n int cur_num = 1;\n current_states[0].expv = 0.0;\n memset(current_states[0].pr, 0, sizeof(current_states[0].pr));\n current_states[0].pr[si][sj] = 1.0;\n for (int step = 1; step <= MAXL; step++) {\n int num_cand = 0;\n for (int b = 0; b < cur_num; b++) {\n for (int d = 0; d < 4; d++) {\n TempCand &news = cands[num_cand];\n news.expv = current_states[b].expv;\n memset(news.pr, 0, sizeof(news.pr));\n double reached = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n double pb = current_states[b].pr[r][c];\n if (pb > EPS) {\n news.pr[r][c] += pb * forget_p;\n int nr = r, nc = c;\n if (can_move(r, c, d)) {\n nr += dr[d];\n nc += dc[d];\n }\n double pm = pb * (1.0 - forget_p);\n if (nr == ti && nc == tj) {\n reached += pm;\n } else {\n news.pr[nr][nc] += pm;\n }\n }\n }\n news.expv += reached * (401.0 - step);\n news.pot = 0.0;\n for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) {\n int dt = dist_to[r][c];\n if (dt > 999) dt = 100;\n news.pot += news.pr[r][c] * dt;\n }\n news.from = b;\n news.dird = d;\n num_cand++;\n }\n }\n vector ord(num_cand);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b) {\n if (fabs(cands[a].expv - cands[b].expv) > 1e-9) return cands[a].expv > cands[b].expv;\n return cands[a].pot < cands[b].pot;\n });\n cur_num = min(BEAMW, num_cand);\n for (int i = 0; i < cur_num; i++) {\n int idx = ord[i];\n current_states[i].expv = cands[idx].expv;\n memcpy(current_states[i].pr, cands[idx].pr, sizeof(cands[idx].pr));\n parent[step][i] = cands[idx].from;\n ch_dir[step][i] = cands[idx].dird;\n }\n }\n double beam_e = current_states[0].expv;\n string beam_str = \"\";\n int bb = 0;\n for (int st = MAXL; st >= 1; st--) {\n int d = ch_dir[st][bb];\n beam_str = dch[d] + beam_str;\n bb = parent[st][bb];\n }\n string opt_beam = optimize_string(beam_str, si, sj, ti, tj, forget_p);\n double e_beam_opt = compute_score(opt_beam, si, sj, ti, tj, forget_p);\n string opt_alt = optimize_string(best_alt, si, sj, ti, tj, forget_p);\n double e_alt_opt = compute_score(opt_alt, si, sj, ti, tj, forget_p);\n if (e_beam_opt > e_alt_opt) {\n cout << opt_beam << endl;\n } else {\n cout << opt_alt << endl;\n }\n return 0;\n}","ahc010":"#include \nusing namespace std;\n\nconst int TO[8][4] = {\n {1, 0, -1, -1},\n {3, -1, -1, 0},\n {-1, -1, 3, 2},\n {-1, 2, 1, -1},\n {1, 0, 3, 2},\n {3, 2, 1, 0},\n {2, -1, 0, -1},\n {-1, 3, -1, 1}\n};\n\nint nxt_type[8] = {1,2,3,0,5,4,7,6};\nint rotated_type[4][8];\nint givenn[30][30];\nint cur_rot[30][30];\nint cur_tiles[30][30];\nint best_rots[30][30];\nlong long best_sc_global = 0;\n\nlong long calc_score(int tiles[][30]) {\n bool vis[30][30][4] = {};\n long long max1 = 0, max2 = 0;\n int di[4] = {0, -1, 0, 1};\n int dj[4] = {-1, 0, 1, 0};\n for(int si=0; si<30; si++){\n for(int sj=0; sj<30; sj++){\n for(int sd=0; sd<4; sd++){\n if(vis[si][sj][sd]) continue;\n int t = tiles[si][sj];\n if(TO[t][sd] < 0) continue;\n int i = si, j = sj, d = sd;\n long long len = 0;\n bool ok = true;\n while(true){\n if(len > 5000){ ok=false; break;}\n int tt = tiles[i][j];\n int d2 = TO[tt][d];\n if(d2 < 0){ ok=false; break; }\n i += di[d2];\n j += dj[d2];\n if(i < 0 || i >=30 || j<0 || j>=30){ ok=false; break;}\n d = (d2 + 2) % 4;\n len++;\n if(i == si && j == sj && d == sd){\n break;\n }\n }\n if(ok && len > 0 && i == si && j == sj && d == sd){\n if(len > max1){ max2 = max1; max1 = len;}\n else if(len > max2) max2 = len;\n i=si; j=sj; d=sd;\n for(long long k=0; k=30||nj<0||nj>=30) break;\n i = ni; j = nj; d = (d2+2)%4;\n }\n }\n }\n }\n }\n if(max2 == 0) return 0;\n return max1 * max2;\n}\n\nvoid perform_sa(int seed, long long& global_best) {\n srand(seed);\n for(int i=0;i<30;i++) for(int j=0;j<30;j++){\n cur_rot[i][j] = rand() % 4;\n cur_tiles[i][j] = rotated_type[ cur_rot[i][j] ][ givenn[i][j] ];\n }\n long long cur_sc = calc_score(cur_tiles);\n if(cur_sc > global_best){\n global_best = cur_sc;\n memcpy(best_rots, cur_rot, sizeof(cur_rot));\n }\n const int MAX_ITER = 22500;\n double Tstart = 2500.0;\n double Tend = 0.1;\n double cool = pow(Tend / Tstart, 1.0/MAX_ITER);\n double Temp = Tstart;\n for(int it=0; it < MAX_ITER; it++){\n int i = rand()%30;\n int j = rand()%30;\n int oldr = cur_rot[i][j];\n int oldt = cur_tiles[i][j];\n int delta = (rand() % 3) - 1;\n int nr = (oldr + delta + 4) % 4;\n if(nr == oldr) nr = (oldr + (rand()%2==0 ? 1 : 3)) % 4;\n cur_rot[i][j] = nr;\n cur_tiles[i][j] = rotated_type[nr][givenn[i][j]];\n long long nsc = calc_score(cur_tiles);\n double del = (double)nsc - (double)cur_sc;\n bool acc = (del >= 0.0);\n if(!acc && Temp > 0.01){\n double prob = exp(del / Temp);\n if( (rand() / (double)RAND_MAX) < prob ) acc = true;\n }\n if(acc){\n cur_sc = nsc;\n }else{\n cur_rot[i][j] = oldr;\n cur_tiles[i][j] = oldt;\n }\n if(cur_sc > global_best){\n global_best = cur_sc;\n memcpy(best_rots , cur_rot, sizeof(cur_rot));\n }\n Temp *= cool;\n }\n}\n\nint main() {\n for(int k=0; k<4;k++){\n for(int t=0;t<8;t++){\n int cur = t;\n for(int r=0; r> s;\n for(int j=0;j<30;j++){\n givenn[i][j] = s[j] - '0';\n }\n }\n long long global_best = 0;\n perform_sa(42, global_best);\n perform_sa(123, global_best);\n for(int i=0;i<30;i++){\n for(int j=0;j<30;j++){\n cout << best_rots[i][j];\n }\n }\n cout << endl;\n return 0;\n}","ahc011":"#include \nusing namespace std;\n\nint get_largest_tree(const vector>& board, int ei, int ej, int N) {\n vector> visited(N, vector(N, false));\n visited[ei][ej] = true;\n int maxs = 0;\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n int bit_from[4] = {2, 8, 1, 4};\n int bit_to[4] = {8, 2, 4, 1};\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (visited[i][j]) continue;\n vector> comp;\n queue> q;\n q.push({i, j});\n visited[i][j] = true;\n comp.push_back({i, j});\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (int d = 0; d < 4; d++) {\n int nx = x + dx[d];\n int ny = y + dy[d];\n if (nx >= 0 && nx < N && ny >= 0 && ny < N && !visited[nx][ny]) {\n if ((board[x][y] & bit_from[d]) && (board[nx][ny] & bit_to[d])) {\n visited[nx][ny] = true;\n q.push({nx, ny});\n comp.push_back({nx, ny});\n }\n }\n }\n }\n int v = comp.size();\n if (v == 0) continue;\n int e = 0;\n vector> in_c(N, vector(N, false));\n for (auto p : comp) in_c[p.first][p.second] = true;\n for (auto [x, y] : comp) {\n if (y + 1 < N && in_c[x][y + 1] && (board[x][y] & 4) && (board[x][y + 1] & 1)) e++;\n if (x + 1 < N && in_c[x + 1][y] && (board[x][y] & 8) && (board[x + 1][y] & 2)) e++;\n }\n if (v == 1 || e == v - 1) {\n maxs = max(maxs, v);\n }\n }\n }\n return maxs;\n}\n\nint get_total_edges(const vector>& board, int N, int ei, int ej) {\n int e = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == ei && j == ej) continue;\n if (j + 1 < N && !(i == ei && j + 1 == ej)) {\n if ((board[i][j] & 4) && (board[i][j + 1] & 1)) e++;\n }\n if (i + 1 < N && !(i + 1 == ei && j == ej)) {\n if ((board[i][j] & 8) && (board[i + 1][j] & 2)) e++;\n }\n }\n }\n return e;\n}\n\nint main() {\n int N, T;\n cin >> N >> T;\n vector> board(N, vector(N));\n int ei, ej;\n for (int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for (int j = 0; j < N; j++) {\n char c = s[j];\n if (c >= '0' && c <= '9') board[i][j] = c - '0';\n else board[i][j] = 10 + (c - 'a');\n if (board[i][j] == 0) {\n ei = i; ej = j;\n }\n }\n }\n int maxv = N * N - 1;\n int best_s = get_largest_tree(board, ei, ej, N);\n string best_seq = \"\";\n srand(42);\n char dchar[4] = {'U', 'D', 'L', 'R'};\n int dx[4] = {-1, 1, 0, 0};\n int dy[4] = {0, 0, -1, 1};\n for (int trial = 0; trial < 5; trial++) {\n vector> cur_board = board;\n int cei = ei, cej = ej;\n string cur_seq = \"\";\n int cur_S = best_s;\n int last_d = -1;\n double temp = 25.0;\n int cur_edges = get_total_edges(board, N, ei, ej);\n for (int step = 0; step < T / 3; step++) {\n if (cur_S == maxv) break;\n vector> options;\n for (int d = 0; d < 4; d++) {\n int ni = cei + dx[d];\n int nj = cej + dy[d];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N) continue;\n int opp = (d <= 1 ? 1 - d : (d == 2 ? 3 : 2));\n if (last_d == opp) continue;\n int oldv = cur_board[ni][nj];\n cur_board[cei][cej] = oldv;\n cur_board[ni][nj] = 0;\n int newS = get_largest_tree(cur_board, ni, nj, N);\n int newE = get_total_edges(cur_board, N, ni, nj);\n cur_board[ni][nj] = oldv;\n cur_board[cei][cej] = 0;\n int sc = newS * 100000 + newE;\n options.emplace_back(sc, newS, newE, newS - cur_S, d);\n }\n if (options.empty()) break;\n sort(options.rbegin(), options.rend());\n int chosen = 0;\n if (temp > 8.0 && rand() % 5 == 0 && options.size() > 1) chosen = 1 + rand() % (min(3, (int)options.size() - 1));\n auto [sc, nS, nE, dS, best_d] = options[chosen];\n int ni = cei + dx[best_d];\n int nj = cej + dy[best_d];\n int old_ei = cei, old_ej = cej;\n int saved = cur_board[ni][nj];\n cur_board[old_ei][old_ej] = saved;\n cur_board[ni][nj] = 0;\n cei = ni; cej = nj;\n cur_seq += dchar[best_d];\n bool accept = (dS >= 0 || (temp > 5.0 && dS > -3));\n if (accept) {\n cur_S = nS;\n cur_edges = nE;\n last_d = best_d;\n int k = cur_seq.size();\n int final_score = (cur_S == maxv ? round(500000.0 * (2.0 - k * 1.0 / T)) : round(500000.0 * cur_S / maxv));\n int best_cur_sc = (best_s == maxv ? round(500000.0 * (2.0 - (int)best_seq.size() * 1.0 / T)) : round(500000.0 * best_s / maxv));\n if (final_score > best_cur_sc || (final_score == best_cur_sc && k < (int)best_seq.size())) {\n best_s = cur_S;\n best_seq = cur_seq;\n }\n if (cur_S == maxv) {\n best_s = maxv;\n best_seq = cur_seq;\n break;\n }\n } else {\n cur_board[cei][cej] = cur_board[old_ei][old_ej];\n cur_board[old_ei][old_ej] = 0;\n cei = old_ei;\n cej = old_ej;\n cur_seq.pop_back();\n }\n temp *= 0.998;\n }\n if (best_s == maxv) break;\n }\n cout << best_seq << endl;\n return 0;\n}","ahc012":"#include \nusing namespace std;\n\nusing ll = long long;\n\nbool hits_strawberry(ll px, ll py, ll qx, ll qy, const vector& X, const vector& Y) {\n ll vx = qx - px;\n ll vy = qy - py;\n for (int i = 0; i < (int)X.size(); i++) {\n ll ux = X[i] - px;\n ll uy = Y[i] - py;\n if (ux * vy - uy * vx == 0) return true;\n }\n return false;\n}\n\ndouble mid_angle(int gap, const vector& ord, const vector& angs, int N) {\n int p1 = ord[gap];\n int p2 = ord[(gap + 1) % N];\n double a1 = angs[p1];\n double a2 = angs[p2];\n if (a2 < a1 - 1e-9) a2 += 2 * M_PI;\n return (a1 + a2) / 2.0;\n}\n\nint main() {\n int N_int, K;\n cin >> N_int >> K;\n ll N = N_int;\n vector a(11, 0);\n for (int i = 1; i <= 10; i++) cin >> a[i];\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector angs(N);\n for (int i = 0; i < N; i++) {\n angs[i] = atan2(Y[i], X[i]);\n if (angs[i] < 0) angs[i] += 2 * M_PI;\n }\n vector ord(N);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int i, int j) { return angs[i] < angs[j]; });\n\n int best_m = -1;\n int best_start = 0;\n int num_lines = 100;\n vector good_sizes;\n {\n vector rem = a;\n for (int i = 0; i < num_lines; i++) {\n int best_d = 1;\n int mx = 0;\n for (int d = 1; d <= 10; d++) {\n if (rem[d] > mx) {\n mx = rem[d];\n best_d = d;\n }\n }\n if (mx == 0) break;\n good_sizes.push_back(best_d);\n rem[best_d]--;\n }\n }\n\n for (int s = 0; s < N; s++) {\n vector main_cuts;\n main_cuts.push_back((s - 1 + N) % N);\n int cur = 0;\n for (int sz : good_sizes) {\n cur += sz;\n main_cuts.push_back((s + cur - 1 + N) % N);\n }\n set> pair_set;\n for (int m : main_cuts) {\n int o = (m + N / 2) % N;\n pair_set.insert({min(m, o), max(m, o)});\n }\n set all_cuts;\n for (auto& pr : pair_set) {\n all_cuts.insert(pr.first);\n all_cuts.insert(pr.second);\n }\n vector cutlist(all_cuts.begin(), all_cuts.end());\n int nc = cutlist.size();\n vector piece;\n for (int i = 0; i < nc; i++) {\n int from = cutlist[i];\n int to = cutlist[(i + 1) % nc];\n piece.push_back((to - from + N) % N);\n }\n vector b(11, 0);\n for (int p : piece) if (p >= 1 && p <= 10) b[p]++;\n int m_val = 0;\n for (int d = 1; d <= 10; d++) m_val += min(a[d], b[d]);\n if (m_val > best_m) {\n best_m = m_val;\n best_start = s;\n }\n }\n\n // Rebuild for best_start\n vector main_cuts;\n main_cuts.push_back((best_start - 1 + N) % N);\n int cur = 0;\n for (int sz : good_sizes) {\n cur += sz;\n main_cuts.push_back((best_start + cur - 1 + N) % N);\n }\n set> pair_set;\n for (int m : main_cuts) {\n int o = (m + N / 2) % N;\n pair_set.insert({min(m, o), max(m, o)});\n }\n vector> final_pairs(pair_set.begin(), pair_set.end());\n int k_out = min((int)final_pairs.size(), 100);\n\n cout << k_out << endl;\n for (int i = 0; i < k_out; i++) {\n int mg = final_pairs[i].first; // use any gap of the pair\n double mang = mid_angle(mg, ord, angs, N);\n double c = cos(mang);\n double s = sin(mang);\n ll px = round(c * 1000000000.0);\n ll py = round(s * 1000000000.0);\n ll qx = round(cos(mang + M_PI) * 1000000000.0);\n ll qy = round(sin(mang + M_PI) * 1000000000.0);\n int pert = 0;\n while (hits_strawberry(px, py, qx, qy, X, Y) && pert < 30) {\n qx += (pert + 1) * 17LL;\n qy += (pert + 1) * 31LL;\n pert++;\n }\n if (px == qx && py == qy) qx++;\n cout << px << \" \" << py << \" \" << qx << \" \" << qy << endl;\n }\n return 0;\n}","ahc014":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> initial_dots;\n bool initial_has[65][65] = {};\n for(int i=0; i>x>>y;\n if(!initial_has[x][y]){\n initial_has[x][y]=true;\n initial_dots.emplace_back(x,y);\n }\n }\n int c = (N-1)/2;\n vector> base_high_cand;\n vector> base_low_cand;\n for(int x=0;x> best_ops;\n long long best_sumw = -1;\n bool has_dot[65][65] = {};\n auto get_sumw = [&]() {\n long long s = 0;\n for(int x=0;x trial_seeds = {12345, 23456, 34567, 45678, 56789, 67890, 78901, 89012, 90123, 11234, 12367, 13489};\n vector perturb_scales = {0, 0, N/2, N, N, 2*N, 3*N, 4*N, 0, N, N/2, 3*N};\n for(int trial=0; trial<12; trial++){\n memcpy(has_dot, initial_has, sizeof(initial_has));\n vector> cur_dots = initial_dots;\n bool hused[65][65]={};\n bool vused[65][65]={};\n bool dpused[65][65]={};\n bool dnused[65][65]={};\n vector> ops;\n bool use_high_order = (trial % 3 != 2);\n bool prefer_small_aa = (trial % 2 == 0);\n auto& current_cand_base = use_high_order ? base_high_cand : base_low_cand;\n vector> current_cand = current_cand_base;\n mt19937 rng(trial_seeds[trial % 12]);\n int perturb = perturb_scales[trial];\n if(perturb > 0){\n for(auto& t : current_cand){\n long long& key = get<0>(t);\n int r = uniform_int_distribution(-perturb, perturb)(rng);\n key += r;\n }\n sort(current_cand.begin(), current_cand.end());\n }\n auto try_aa = [&](int px, int py) -> bool {\n if(has_dot[px][py]) return false;\n vector pos_oxs;\n for(int ox=0; ox pos_oys;\n for(int oy=0; oy bool {\n if(has_dot[px][py]) return false;\n int u1 = px + py;\n int v1 = px - py;\n vector> possible_opp;\n for(auto [ox,oy]: cur_dots){\n if(ox == px && oy == py) continue;\n int u2 = ox + oy;\n int v2 = ox - oy;\n if(abs(u2 - u1) < 2 || abs(v2 - v1) < 2) continue;\n if( (u2 - u1) % 2 != 0 || (v2 - v1) % 2 != 0 ) continue;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n if( (u1 + v2) % 2 !=0 || xb<0 || xb>=N || yb <0 || yb >=N ) continue;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n if( (u2 + v1)%2 !=0 || xc<0||xc>=N||yc<0||yc>=N) continue;\n if(!has_dot[xb][yb] || !has_dot[xc][yc]) continue;\n int sz = abs(u2-u1) + abs(v2-v1);\n possible_opp.emplace_back(sz, ox, oy);\n }\n sort(possible_opp.begin(), possible_opp.end());\n for(auto& tp : possible_opp){\n int sz, ox, oy;\n tie(sz, ox, oy) = tp;\n int u2 = ox + oy;\n int v2 = ox - oy;\n int xb = (u1 + v2) / 2;\n int yb = (u1 - v2) / 2;\n int xc = (u2 + v1)/2 ;\n int yc = (u2 - v1)/2 ;\n int umin = min(u1,u2), umax = max(u1,u2);\n int vmin = min(v1,v2), vmax = max(v1,v2);\n bool val = true;\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u1 + vv)/2; int yy=(u1 - vv)/2;\n if(xx<0||xx>=N || yy<0||yy>=N){val=false; continue;}\n bool corn = ((xx==px && yy==py) || (xx==xb && yy==yb) || (xx==ox && yy==oy) || (xx==xc && yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn ) val=false;\n }\n for(int vv=vmin; vv<=vmax; vv+=2){\n int xx=(u2 + vv)/2; int yy=(u2 - vv)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy]&&!corn) val=false;\n }\n for(int uu=umin; uu<=umax; uu+=2){\n int xx=(uu + v1)/2; int yy=(uu - v1)/2;\n if(xx<0||xx>=N||yy<0||yy>=N) val=false;\n bool corn = ((xx==px&&yy==py)||(xx==xb&&yy==yb)||(xx==ox&&yy==oy)||(xx==xc&&yy==yc));\n if(has_dot[xx][yy] && !corn) val = false;\n }\n if(!val) continue;\n bool sval = true;\n for(int vv=vmin; vv < vmax; vv +=2){\n int xx = (u1 + vv)/2 ; int yy=(u1 - vv)/2;\n if(dnused[xx][yy]) sval=false;\n }\n for(int uu=umin; uu < umax; uu +=2){\n int xx=(uu + v2)/2; int yy=(uu - v2)/2;\n if(dpused[xx][yy]) sval = false;\n }\n for(int vv=vmin; vv best_sumw){\n best_sumw = this_sum;\n best_ops = ops;\n }\n }\n cout << best_ops.size() << endl;\n for(auto& op: best_ops){\n for(int i=0;i<8;i++){\n cout << op[i];\n if(i<7) cout<<\" \";\n }\n cout << endl;\n }\n return 0;\n}","ahc015":"#include \nusing namespace std;\n\nint main() {\n vector flav(100);\n for (int i = 0; i < 100; i++) cin >> flav[i];\n vector> grid(10, vector(10, 0));\n auto apply = [&](char d, auto& g) {\n if (d == 'F') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n for (int r = 0; r < 10; r++) g[r][c] = (r < (int)v.size() ? v[r] : 0);\n }\n } else if (d == 'B') {\n for (int c = 0; c < 10; c++) {\n vector v;\n for (int r = 0; r < 10; r++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int r = 0; r < 10; r++) g[r][c] = (r >= 10 - sz ? v[r - (10 - sz)] : 0);\n }\n } else if (d == 'L') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n for (int c = 0; c < 10; c++) g[r][c] = (c < (int)v.size() ? v[c] : 0);\n }\n } else if (d == 'R') {\n for (int r = 0; r < 10; r++) {\n vector v;\n for (int c = 0; c < 10; c++) if (g[r][c]) v.push_back(g[r][c]);\n int sz = v.size();\n for (int c = 0; c < 10; c++) g[r][c] = (c >= 10 - sz ? v[c - (10 - sz)] : 0);\n }\n }\n };\n auto get_score = [&](auto& g) -> long long {\n vector> vis(10, vector(10, false));\n long long res = 0;\n for (int i = 0; i < 10; i++) {\n for (int j = 0; j < 10; j++) {\n if (g[i][j] && !vis[i][j]) {\n int f = g[i][j];\n int sz = 0;\n stack> st;\n st.push({i, j});\n vis[i][j] = true;\n while (!st.empty()) {\n auto [x, y] = st.top(); st.pop();\n sz++;\n int dx[4] = {-1, 0, 1, 0};\n int dy[4] = {0, 1, 0, -1};\n for (int k = 0; k < 4; k++) {\n int nx = x + dx[k], ny = y + dy[k];\n if (nx >= 0 && nx < 10 && ny >= 0 && ny < 10 && !vis[nx][ny] && g[nx][ny] == f) {\n vis[nx][ny] = true;\n st.push({nx, ny});\n }\n }\n }\n res += 1LL * sz * sz;\n }\n }\n }\n return res;\n };\n auto get_empties = [&](auto& g) -> vector> {\n vector> res;\n for (int i = 0; i < 10; i++) for (int j = 0; j < 10; j++) if (g[i][j] == 0) res.emplace_back(i, j);\n return res;\n };\n for (int t = 0; t < 100; t++) {\n int p;\n cin >> p;\n int cnt = 0;\n int pr = -1, pc = -1;\n for (int r = 0; r < 10; r++) {\n bool found = false;\n for (int c = 0; c < 10; c++) if (grid[r][c] == 0) {\n cnt++;\n if (cnt == p) {\n pr = r; pc = c;\n found = true;\n break;\n }\n }\n if (found) break;\n }\n grid[pr][pc] = flav[t];\n if (t == 99) break;\n vector dirs = {'F','B','L','R'};\n char best_d = 'F';\n long long best_val = -1;\n int K = 45; // slightly reduced from 50 for less bias\n int next_f = flav[t + 1];\n bool is_last_tilt = (t == 98);\n for (char d : dirs) {\n auto temp = grid;\n apply(d, temp);\n auto emps = get_empties(temp);\n if (emps.empty()) continue;\n int ns = min(K, (int)emps.size());\n long long total = 0;\n // uniform sampling\n int stride = max(1, (int)emps.size() / ns);\n for (int s = 0; s < ns; s++) {\n int idx = (s * stride) % emps.size();\n auto [nr, nc] = emps[idx];\n temp[nr][nc] = next_f;\n long long best_next = 0;\n if (is_last_tilt) {\n best_next = get_score(temp);\n } else {\n for (char nd : dirs) {\n auto temp2 = temp;\n apply(nd, temp2);\n long long sc = get_score(temp2);\n if (sc > best_next) best_next = sc;\n }\n }\n total += best_next;\n temp[nr][nc] = 0;\n }\n long long avg = total / ns;\n if (avg > best_val) {\n best_val = avg;\n best_d = d;\n }\n }\n cout << best_d << endl;\n cout.flush();\n apply(best_d, grid);\n }\n}","ahc016":"#include \nusing namespace std;\n\nint calc_pos(int u, int v, int n) {\n if (u > v) swap(u, v);\n return u * (2 * n - u - 1) / 2 + (v - u - 1);\n}\n\ndouble compute_exp_e(const string& gs, double eps) {\n double res = 0.0;\n for (char c : gs) {\n res += (c == '1' ? (1 - eps) : eps);\n }\n return res;\n}\n\ndouble compute_exp_t(const string& gs, int n, double eps) {\n double sum_p = 0.0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n int p1 = calc_pos(a, b, n);\n int p2 = calc_pos(a, c, n);\n int p3 = calc_pos(b, c, n);\n double pa = (gs[p1] == '1' ? (1 - eps) : eps);\n double pb = (gs[p2] == '1' ? (1 - eps) : eps);\n double pc = (gs[p3] == '1' ? (1 - eps) : eps);\n sum_p += pa * pb * pc;\n }\n }\n }\n return sum_p;\n}\n\nlong long compute_t(const string& hs, int n) {\n long long tri = 0;\n for (int a = 0; a < n; a++) {\n for (int b = a + 1; b < n; b++) {\n for (int c = b + 1; c < n; c++) {\n if (hs[calc_pos(a, b, n)] == '1' &&\n hs[calc_pos(a, c, n)] == '1' &&\n hs[calc_pos(b, c, n)] == '1') tri++;\n }\n }\n }\n return tri;\n}\n\nint main() {\n int M;\n double eps;\n cin >> M >> eps;\n srand(42);\n int best_N = 4;\n double best_sc = -1.0;\n double best_tscale = 10.0;\n vector best_Gs;\n vector best_targ_e, best_targ_t;\n vector candidates;\n int max_n_test = (eps < 0.15 ? 45 : 75);\n int step = (eps < 0.1 ? 1 : 3);\n for (int nn = 4; nn <= max_n_test; nn += step) candidates.push_back(nn);\n if (eps < 1e-9) {\n int minn = 4;\n while ((long long)minn * (minn - 1) / 2 < M - 1) minn++;\n candidates.clear();\n candidates.push_back(minn);\n best_N = minn;\n }\n for (int ni = 0; ni < (int)candidates.size(); ni++) {\n int nn = candidates[ni];\n if (nn > 100) continue;\n long long PP = (long long)nn * (nn - 1) / 2;\n vector Gs_loc(M);\n for (int k = 0; k < M; k++) {\n long long ek = (M == 1 ? PP / 2 : round(k * PP * 1.0 / (M - 1.0)));\n string s(PP, '0');\n if (k % 3 == 0 || M <= 2 || eps < 1e-9) {\n for (long long i = 0; i < ek && i < PP; i++) s[i] = '1';\n } else if (k % 3 == 1) {\n for (long long i = 0; i < ek && i < PP; i++) {\n long long pos = (i * 17LL % PP);\n s[pos] = '1';\n }\n } else {\n vector pr(PP);\n for (int i = 0; i < PP; i++) pr[i] = i;\n auto rngv = [&](int x) { return ((long long)x * 97LL ^ (long long)k * 1234567LL) % 1000000009LL; };\n sort(pr.begin(), pr.end(), [&](int x, int y) { return rngv(x) < rngv(y); });\n for (long long i = 0; i < ek && i < PP; i++) s[pr[i]] = '1';\n }\n Gs_loc[k] = s;\n }\n vector targ_e(M), targ_t(M);\n for (int k = 0; k < M; k++) {\n targ_e[k] = compute_exp_e(Gs_loc[k], eps);\n targ_t[k] = compute_exp_t(Gs_loc[k], nn, eps);\n }\n vector test_scales = {2.0, 4.0, 8.0, 16.0, 32.0};\n for (double scf : test_scales) {\n double cur_tscale = nn * scf;\n int trials = (eps < 0.1 ? 600 : (eps < 0.25 ? 400 : 250));\n int errs = 0;\n for (int tr = 0; tr < trials; tr++) {\n int s = rand() % M;\n string noisy = Gs_loc[s];\n for (long long pos = 0; pos < PP; pos++) {\n if ((rand() / (double)RAND_MAX) < eps) {\n noisy[pos] = (noisy[pos] == '1' ? '0' : '1');\n }\n }\n int obse = 0;\n for (char c : noisy) if (c == '1') obse++;\n long long obst = compute_t(noisy, nn);\n int dec = 0;\n double mind = 1e18;\n for (int k = 0; k < M; k++) {\n double de = obse - targ_e[k];\n double dt = (double)obst - targ_t[k];\n double dst = de * de / (PP * 0.25 + 1.0) + (dt * dt) / (cur_tscale * cur_tscale + 1.0);\n if (dst < mind) {\n mind = dst;\n dec = k;\n }\n }\n if (dec != s) errs++;\n }\n double perr = (double)errs / trials;\n double e_app = 100.0 * perr;\n double sc = pow(0.9, e_app) / nn;\n if (sc > best_sc) {\n best_sc = sc;\n best_N = nn;\n best_Gs = Gs_loc;\n best_targ_e = targ_e;\n best_targ_t = targ_t;\n best_tscale = cur_tscale;\n }\n }\n }\n int N = best_N;\n long long P = (long long)N * (N - 1) / 2;\n cout << N << endl;\n for (auto& s : best_Gs) cout << s << endl;\n cout.flush();\n for (int q = 0; q < 100; q++) {\n string h;\n cin >> h;\n int obse = 0;\n for (char c : h) if (c == '1') obse++;\n long long obst = compute_t(h, N);\n int bestk = 0;\n double bestd = 1e18;\n for (int k = 0; k < M; k++) {\n double de = obse - best_targ_e[k];\n double dt = (double)obst - best_targ_t[k];\n double dst = de * de / (P * 0.25 + 1.0) + (dt * dt) / (best_tscale * best_tscale + 1.0);\n if (dst < bestd) {\n bestd = dst;\n bestk = k;\n }\n }\n cout << bestk << endl;\n cout.flush();\n }\n return 0;\n}","ahc017":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, M, D, K;\n cin >> N >> M >> D >> K;\n vector U(M), V(M), W(M);\n vector>> adj(N);\n for (int i = 0; i < M; i++) {\n cin >> U[i] >> V[i] >> W[i];\n U[i]--; V[i]--;\n adj[U[i]].emplace_back(V[i], W[i], i);\n adj[V[i]].emplace_back(U[i], W[i], i);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n mt19937 rng(123456789LL);\n int NUM_SAMPLES = 18;\n if (N < 600) NUM_SAMPLES = 30;\n vector sources;\n vector perm(N);\n iota(perm.begin(), perm.end(), 0);\n shuffle(perm.begin(), perm.end(), rng);\n for (int i = 0; i < min(NUM_SAMPLES, N); i++) sources.push_back(perm[i]);\n if (!sources.empty()) sources[0] = 0;\n vector mxs(M), mys(M), angs(M);\n for (int i = 0; i < M; i++) {\n mxs[i] = (X[U[i]] + X[V[i]]) / 2.0;\n mys[i] = (Y[U[i]] + Y[V[i]]) / 2.0;\n double dx = mxs[i] - 500.0;\n double dy = mys[i] - 500.0;\n angs[i] = atan2(dy, dx);\n }\n auto is_connected = [&](int day, const vector& rdays) -> bool {\n vector vis(N, false);\n queue q;\n q.push(0); vis[0] = true;\n int rc = 1;\n while (!q.empty()) {\n int u = q.front(); q.pop();\n for (auto [v, w, eid] : adj[u]) {\n if (rdays[eid] == day) continue;\n if (!vis[v]) {\n vis[v] = true;\n q.push(v);\n rc++;\n }\n }\n }\n return rc == N;\n };\n auto is_all_connected = [&](const vector& rd) {\n for (int d = 1; d <= D; d++) {\n if (!is_connected(d, rd)) return false;\n }\n return true;\n };\n auto get_sum = [&](int day, const vector& rdays) -> ll {\n ll sm = 0;\n for (int s : sources) {\n vector dist(N, 4000000000000000000LL);\n vector processed(N, false);\n dist[s] = 0;\n priority_queue, vector>, greater>> pq;\n pq.emplace(0, s);\n while (!pq.empty()) {\n auto [c, u] = pq.top(); pq.pop();\n if (c > dist[u] || processed[u]) continue;\n processed[u] = true;\n for (auto [v, w, e] : adj[u]) {\n if (rdays[e] == day) continue;\n ll nc = c + w;\n if (nc < dist[v]) {\n dist[v] = nc;\n pq.emplace(nc, v);\n }\n }\n }\n for (int j = 0; j < N; j++) {\n if (j == s) continue;\n ll dd = (dist[j] > 2000000000000000000LL ? 1000000000LL : dist[j]);\n sm += dd;\n }\n }\n return sm;\n };\n auto compute_proxy = [&](const vector& rd) -> ll {\n ll pr = 0;\n for (int d = 1; d <= D; d++) {\n pr += get_sum(d, rd);\n }\n return pr;\n };\n auto generate_sorted = [&](auto&& sorter) {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), sorter);\n vector rd(M);\n for (int i = 0; i < M; i++) {\n rd[ord[i]] = (i % D) + 1;\n }\n return rd;\n };\n vector>> candidates;\n // mx\n {\n auto lam = [&](int a, int b){ return mxs[a] < mxs[b]; };\n auto rd = generate_sorted(lam);\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n // my\n {\n auto lam = [&](int a, int b){ return mys[a] < mys[b]; };\n auto rd = generate_sorted(lam);\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n // random 1\n {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n shuffle(ord.begin(), ord.end(), rng);\n vector rd(M);\n for (int i = 0; i < M; i++) {\n rd[ord[i]] = (i % D) + 1;\n }\n if (is_all_connected(rd)) {\n ll pr = compute_proxy(rd);\n candidates.emplace_back(pr, rd);\n }\n }\n vector rday(M, 0);\n vector cnt(D + 1, 0);\n if (!candidates.empty()) {\n sort(candidates.begin(), candidates.end());\n rday = candidates[0].second;\n } else {\n vector ord(M);\n iota(ord.begin(), ord.end(), 0);\n shuffle(ord.begin(), ord.end(), rng);\n for (int i = 0; i < M; i++) {\n rday[ord[i]] = (i % D) + 1;\n }\n }\n for (int i = 0; i < M; i++) cnt[rday[i]]++;\n auto start_time = chrono::steady_clock::now();\n auto elapsed = [&]() {\n return chrono::duration(chrono::steady_clock::now() - start_time).count();\n };\n uniform_int_distribution rnd_e(0, M - 1);\n uniform_int_distribution rnd_d(1, D);\n uniform_real_distribution rnd_real(0.0, 1.0);\n ll current_proxy = 0;\n for (int d = 1; d <= D; d++) {\n current_proxy += get_sum(d, rday);\n }\n ll total_delta_abs = 0;\n int cnt_sample = 0;\n for (int tryy = 0; tryy < 100; tryy++) {\n if (elapsed() > 0.3) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n total_delta_abs += llabs(del);\n cnt_sample++;\n if (cnt_sample >= 15) break;\n }\n double T = 1e10;\n if (cnt_sample > 0) {\n double avg = (double)total_delta_abs / cnt_sample;\n T = avg * 5.0;\n if (T < 1e8) T = 1e8;\n }\n double cool_rate = 0.999;\n double TL = 5.3;\n int it = 0;\n while (true) {\n it++;\n if (it % 20 == 0 && elapsed() > TL) break;\n if (elapsed() > TL) break;\n int e = rnd_e(rng);\n int od = rday[e];\n int nd = rnd_d(rng);\n if (nd == od || cnt[nd] >= K) continue;\n ll s1 = get_sum(od, rday);\n ll s2 = get_sum(nd, rday);\n rday[e] = nd;\n ll ns1 = get_sum(od, rday);\n ll ns2 = get_sum(nd, rday);\n rday[e] = od;\n ll del = (ns1 + ns2) - (s1 + s2);\n bool accept = (del < 0);\n if (!accept) {\n double prob = exp(-del / T);\n if (prob > rnd_real(rng)) accept = true;\n }\n if (accept) {\n rday[e] = nd;\n cnt[od]--;\n cnt[nd]++;\n current_proxy += del;\n }\n T *= cool_rate;\n if (T < 1e5) T = 1e5;\n }\n for (int i = 0; i < M; i++) {\n cout << rday[i];\n if (i + 1 < M) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc019":"#include \nusing namespace std;\n\nint main() {\n int D;\n cin >> D;\n vector F[2], R[2];\n for (int i = 0; i < 2; i++) {\n F[i].resize(D);\n for (int k = 0; k < D; k++) cin >> F[i][k];\n R[i].resize(D);\n for (int k = 0; k < D; k++) cin >> R[i][k];\n }\n vector> pos[2];\n for (int i = 0; i < 2; i++) {\n for (int z = 0; z < D; z++) {\n vector Xs, Ys;\n for (int x = 0; x < D; x++) if (F[i][z][x] == '1') Xs.push_back(x);\n for (int y = 0; y < D; y++) if (R[i][z][y] == '1') Ys.push_back(y);\n int nf = Xs.size(), nr = Ys.size();\n if (nf >= nr) {\n for (int j = 0; j < nr; j++) pos[i].emplace_back(Xs[j], Ys[j], z);\n for (int j = 0; j < nf - nr; j++) pos[i].emplace_back(Xs[nr + j], Ys[0], z);\n } else {\n for (int j = 0; j < nf; j++) pos[i].emplace_back(Xs[j], Ys[j], z);\n for (int j = 0; j < nr - nf; j++) pos[i].emplace_back(Xs[0], Ys[nf + j], z);\n }\n }\n }\n int sz[2] = {(int)pos[0].size(), (int)pos[1].size()};\n int com_vol = min(sz[0], sz[1]);\n vector com_vox[2];\n if (sz[0] <= sz[1]) {\n for (int k = 0; k < sz[0]; k++) com_vox[0].push_back(k);\n for (int k = 0; k < sz[0]; k++) com_vox[1].push_back(k);\n } else {\n for (int k = 0; k < sz[1]; k++) com_vox[1].push_back(k);\n for (int k = 0; k < sz[1]; k++) com_vox[0].push_back(k);\n }\n auto get_com_pairs = [&](int sc, const vector& comidx) {\n int mc = comidx.size();\n if (mc <= 1) return vector>();\n vector used(mc, false);\n vector> pr;\n vector>> pidx(D, vector>(D, vector(D, -1)));\n for (int i = 0; i < mc; i++) {\n auto [x, y, z] = pos[sc][comidx[i]];\n pidx[x][y][z] = i;\n }\n int dx[6] = {1, -1, 0, 0, 0, 0};\n int dy[6] = {0, 0, 1, -1, 0, 0};\n int dz[6] = {0, 0, 0, 0, 1, -1};\n for (int i = 0; i < mc; i++) {\n if (used[i]) continue;\n auto [x, y, z] = pos[sc][comidx[i]];\n for (int d = 0; d < 6; d++) {\n int nx = x + dx[d], ny = y + dy[d], nz = z + dz[d];\n if (nx < 0 || nx >= D || ny < 0 || ny >= D || nz < 0 || nz >= D) continue;\n int j = pidx[nx][ny][nz];\n if (j != -1 && !used[j]) {\n pr.emplace_back(comidx[i], comidx[j]);\n used[i] = true;\n used[j] = true;\n break;\n }\n }\n }\n return pr;\n };\n auto prs0 = get_com_pairs(0, com_vox[0]);\n auto prs1 = get_com_pairs(1, com_vox[1]);\n int num_dom = min((int)prs0.size(), (int)prs1.size());\n int num_com1 = com_vol - 2 * num_dom;\n int only_v = abs(sz[0] - sz[1]);\n int N = num_dom + num_com1 + only_v;\n int DD = D * D * D;\n vector B[2] = {vector(DD, 0), vector(DD, 0)};\n int cur_blk = 1;\n // common dominoes\n for (int k = 0; k < num_dom; k++) {\n int b = cur_blk++;\n for (int sc = 0; sc < 2; sc++) {\n auto prs = (sc == 0 ? prs0 : prs1);\n auto [i1, i2] = prs[k];\n for (int t : {i1, i2}) {\n auto [x, y, z] = pos[sc][t];\n B[sc][x * (D * D) + y * D + z] = b;\n }\n }\n }\n // mark voxels used by dominoes\n vector dom_used[2];\n dom_used[0].assign(sz[0], false);\n dom_used[1].assign(sz[1], false);\n for (int k = 0; k < num_dom; k++) {\n for (int sc = 0; sc < 2; sc++) {\n auto prs = (sc == 0 ? prs0 : prs1);\n auto [a, b] = prs[k];\n dom_used[sc][a] = true;\n dom_used[sc][b] = true;\n }\n }\n // remaining common 1x1\n vector remain_com[2];\n for (int sc = 0; sc < 2; sc++) {\n for (int id : com_vox[sc]) {\n if (!dom_used[sc][id]) remain_com[sc].push_back(id);\n }\n }\n for (int k = 0; k < num_com1; k++) {\n int b = cur_blk++;\n for (int sc = 0; sc < 2; sc++) {\n int id = remain_com[sc][k];\n auto [x, y, z] = pos[sc][id];\n B[sc][x * (D * D) + y * D + z] = b;\n }\n }\n // only blocks on the larger side\n int large_sc = (sz[0] > sz[1] ? 0 : 1);\n vector is_common(sz[large_sc], false);\n for (int id : com_vox[large_sc]) is_common[id] = true;\n for (int id = 0; id < sz[large_sc]; id++) {\n if (!is_common[id]) {\n int b = cur_blk++;\n auto [x, y, z] = pos[large_sc][id];\n B[large_sc][x * (D * D) + y * D + z] = b;\n }\n }\n cout << N << endl;\n for (int v : B[0]) cout << v << \" \";\n cout << endl;\n for (int v : B[1]) cout << v << \" \";\n cout << endl;\n return 0;\n}","ahc020":"#include \nusing namespace std;\nusing ll = long long;\n\nll get_p_from_dd(ll dd) {\n if (dd == 0) return 0;\n ll p = (ll)sqrtl(dd);\n if (p * p >= dd) return p;\n return p + 1;\n}\n\nint main() {\n int N, M, K;\n cin >> N >> M >> K;\n vector X(N+1), Y(N+1);\n for(int i = 1; i <= N; i++) {\n cin >> X[i] >> Y[i];\n }\n vector eu(M), ev(M);\n vector ew(M);\n for(int j = 0; j < M; j++) {\n cin >> eu[j] >> ev[j] >> ew[j];\n }\n vector Ra(K), Rb(K);\n for(int k = 0; k < K; k++) {\n cin >> Ra[k] >> Rb[k];\n }\n vector> dds(N+1, vector(K));\n for(int i=1; i<=N; i++) {\n for(int k=0; k init_t(N+1,0);\n for(int k=0; k>> g(N+1);\n for(int j=0;j mincost(N+1, LLONG_MAX/2);\n vector parent_e(N+1, -1), parent_v(N+1, -1);\n mincost[1] = 0;\n priority_queue,vector>,greater>> pq;\n pq.emplace(0LL,1);\n while(!pq.empty()){\n auto [c,u] = pq.top(); pq.pop();\n if(c > mincost[u]) continue;\n for(auto [to,eid]:g[u]){\n ll nc = c + ew[eid];\n if(nc < mincost[to]){\n mincost[to] = nc;\n parent_e[to] = eid;\n parent_v[to] = u;\n pq.emplace(nc,to);\n }\n }\n }\n vector>> spt(N+1);\n for(int i=2;i<=N;i++) if(parent_e[i]!=-1){\n spt[parent_v[i]].emplace_back(i, parent_e[i]);\n }\n auto eval_func = [&](vector trms) -> tuple, vector> {\n vector usd(M,false);\n vector rch(N+1,false);\n vector terms(N+1,0);\n for(int i=1;i<=N;i++) terms[i]=trms[i];\n auto dfs = [&](auto self, int nd) -> int {\n int ct = terms[nd];\n bool hs = terms[nd];\n for(auto [to,eid]:spt[nd]){\n int sct = self(self,to);\n ct += sct;\n if(sct>0){\n usd[eid]=true;\n hs=true;\n }\n }\n if(hs) rch[nd]=true;\n return ct;\n };\n dfs(dfs,1);\n rch[1]=true;\n vector active;\n for(int i=1;i<=N;i++) if(rch[i]) active.push_back(i);\n vector mdd(N+1,0);\n bool covers=true;\n for(int k=0;k 25000000LL) covers=false;\n mdd[besti]=max(mdd[besti],minnd);\n }\n ll cov=0;\n vector pp(N+1,0);\n for(int i=1;i<=N;i++) if(mdd[i]>0){\n ll pv=get_p_from_dd(mdd[i]);\n if(pv>5000) covers=false;\n cov += pv*pv;\n pp[i]=(int)pv;\n }\n ll edg=0;\n vector bbv(M,0);\n for(int j=0;j cur_t = init_t;\n auto current = eval_func(cur_t);\n ll current_cost; vector current_p, current_b;\n tie(current_cost, current_p, current_b) = current;\n ll global_best_cost = current_cost;\n vector global_best_p = current_p;\n vector global_best_b = current_b;\n bool updated = true;\n int iterations = 0;\n while(updated && iterations < 60){\n updated = false;\n iterations++;\n ll best_delta = 0;\n int to_rem = -1;\n vector bestp_this, bestb_this;\n for(int cand=1; cand<=N; cand++) if(cur_t[cand]){\n vector tm = cur_t;\n tm[cand] = 0;\n auto res = eval_func(tm);\n ll this_cost; vector thisp, thisb;\n tie(this_cost, thisp, thisb) = res;\n if(this_cost < current_cost && this_cost < LLONG_MAX/3){\n if(current_cost - this_cost > best_delta){\n best_delta = current_cost - this_cost;\n to_rem = cand;\n bestp_this = thisp;\n bestb_this = thisb;\n }\n }\n }\n if(to_rem != -1){\n updated = true;\n cur_t[to_rem] = 0;\n current_cost -= best_delta;\n current_p = bestp_this;\n current_b = bestb_this;\n if(current_cost < global_best_cost){\n global_best_cost = current_cost;\n global_best_p = current_p;\n global_best_b = current_b;\n }\n }\n }\n // try adding a few promising stations (top-2 for high-P stations)\n vector> high_p_stations;\n for(int i=1;i<=N;i++) if(current_p[i]>1000){\n high_p_stations.emplace_back(-current_p[i],i);\n }\n sort(high_p_stations.begin(),high_p_stations.end());\n for(int addtry=0; addtry<5 && addtry<(int)high_p_stations.size(); addtry++){\n int target = high_p_stations[addtry].second;\n for(int k=0;k> alts;\n for(int i=1;i<=N;i++) if(!cur_t[i] && i!=target){\n alts.emplace_back(dds[i][k],i);\n }\n if(!alts.empty()){\n sort(alts.begin(),alts.end());\n int candidate = alts[0].second;\n if(!cur_t[candidate]){\n vector tm = cur_t;\n tm[candidate] = 1;\n auto res = eval_func(tm);\n ll this_cost; vector thisp, thisb;\n tie(this_cost, thisp, thisb) = res;\n if(this_cost < current_cost && this_cost < LLONG_MAX/3){\n cur_t[candidate] = 1;\n current_cost = this_cost;\n current_p = thisp;\n current_b = thisb;\n if(current_cost < global_best_cost){\n global_best_cost = current_cost;\n global_best_p = current_p;\n global_best_b = current_b;\n }\n break;\n }\n }\n }\n }\n }\n }\n for(int i=1;i<=N;i++) {\n cout << global_best_p[i];\n if(i < N) cout << \" \";\n else cout << \"\\n\";\n }\n for(int j=0;j\nusing namespace std;\n\nconst int N = 30;\nint grid[N][N];\n\nint main() {\n for (int x = 0; x < N; x++) {\n for (int y = 0; y <= x; y++) {\n cin >> grid[x][y];\n }\n }\n vector> ops;\n while (true) {\n int best_mn = INT_MAX;\n int best_viol = -1;\n int best_x = -1, best_y = -1;\n int best_mx = -1, best_my = -1;\n for (int x = 0; x < N - 1; x++) {\n for (int y = 0; y <= x; y++) {\n int p = grid[x][y];\n int c1 = grid[x + 1][y];\n int c2 = grid[x + 1][y + 1];\n int mn = min(c1, c2);\n int mn_x = (c1 < c2 ? x + 1 : x + 1);\n int mn_y = (c1 < c2 ? y : y + 1);\n if (p > mn) {\n int viol = p - mn;\n bool better = false;\n if (mn < best_mn) better = true;\n else if (mn == best_mn) {\n if (viol > best_viol) better = true;\n else if (viol == best_viol && x > best_x) better = true;\n }\n if (better) {\n best_mn = mn;\n best_viol = viol;\n best_x = x;\n best_y = y;\n best_mx = mn_x;\n best_my = mn_y;\n }\n }\n }\n }\n if (best_x == -1) break;\n ops.push_back({best_x, best_y, best_mx, best_my});\n int n1 = grid[best_x][best_y], n2 = grid[best_mx][best_my];\n grid[best_x][best_y] = n2;\n grid[best_mx][best_my] = n1;\n }\n cout << ops.size() << endl;\n for (auto& ar : ops) {\n cout << ar[0] << \" \" << ar[1] << \" \" << ar[2] << \" \" << ar[3] << endl;\n }\n return 0;\n}","toyota2023summer-final":"#include \nusing namespace std;\n\nint main() {\n int D, N;\n cin >> D >> N;\n bool is_obst[9][9];\n memset(is_obst, 0, sizeof(is_obst));\n for (int i = 0; i < N; i++) {\n int r, c;\n cin >> r >> c;\n is_obst[r][c] = true;\n }\n int er = 0, ec = 4;\n int dr[4] = {-1, 0, 1, 0};\n int dc[4] = {0, 1, 0, -1};\n vector> positions;\n for (int r = 0; r < D; r++) {\n for (int c = 0; c < D; c++) {\n if (!is_obst[r][c] && !(r == er && c == ec)) {\n positions.emplace_back(r, c);\n }\n }\n }\n int MM = positions.size();\n int static_dist[9][9];\n memset(static_dist, -1, sizeof(static_dist));\n {\n queue> q;\n q.emplace(er, ec);\n static_dist[er][ec] = 0;\n while (!q.empty()) {\n auto [r, c] = q.front();\n q.pop();\n for (int k = 0; k < 4; k++) {\n int nr = r + dr[k], nc = c + dc[k];\n if (nr >= 0 && nr < D && nc >= 0 && nc < D && !is_obst[nr][nc] && static_dist[nr][nc] == -1) {\n static_dist[nr][nc] = static_dist[r][c] + 1;\n q.emplace(nr, nc);\n }\n }\n }\n }\n int static_degree[9][9] = {0};\n for (int i = 0; i < D; i++) {\n for (int j = 0; j < D; j++) {\n if (!is_obst[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && !is_obst[ni][nj]) {\n static_degree[i][j]++;\n }\n }\n }\n }\n }\n vector> global_sorted = positions;\n sort(global_sorted.begin(), global_sorted.end(), [&](const pair& a, const pair& b) {\n int score_a = static_dist[a.first][a.second] * 10 + (10 - static_degree[a.first][a.second]);\n int score_b = static_dist[b.first][b.second] * 10 + (10 - static_degree[b.first][b.second]);\n if (score_a != score_b) return score_a < score_b;\n if (a.first != b.first) return a.first < b.first;\n return a.second < b.second;\n });\n int global_rank[9][9];\n memset(global_rank, -1, sizeof(global_rank));\n for (int i = 0; i < MM; i++) {\n auto [r, c] = global_sorted[i];\n global_rank[r][c] = i;\n }\n bool assigned[81] = {false};\n int pos_label[9][9];\n memset(pos_label, -1, sizeof(pos_label));\n bool has_cont[9][9] = {false};\n auto get_vis = [&]() -> vector> {\n vector> vis(D, vector(D, false));\n queue> q;\n q.emplace(er, ec);\n vis[er][ec] = true;\n while (!q.empty()) {\n auto [r, c] = q.front();\n q.pop();\n for (int k = 0; k < 4; k++) {\n int nr = r + dr[k], nc = c + dc[k];\n if (nr >= 0 && nr < D && nc >= 0 && nc < D && !is_obst[nr][nc] &&\n !vis[nr][nc] && !has_cont[nr][nc]) {\n vis[nr][nc] = true;\n q.emplace(nr, nc);\n }\n }\n }\n return vis;\n };\n for (int step = 0; step < MM; step++) {\n int t;\n cin >> t;\n int rank = 0;\n for (int l = 0; l < MM; l++) {\n if (!assigned[l] && l < t) rank++;\n }\n auto vis = get_vis();\n vector> cands;\n for (auto p : positions) {\n int r = p.first, c = p.second;\n if (!has_cont[r][c] && vis[r][c]) {\n cands.push_back(p);\n }\n }\n vector> safes;\n int num_cur = cands.size();\n for (auto p : cands) {\n int r = p.first, c = p.second;\n has_cont[r][c] = true;\n auto vis2 = get_vis();\n has_cont[r][c] = false;\n int cnt = 0;\n for (auto posi : positions) {\n int rr = posi.first, cc = posi.second;\n if (!has_cont[rr][cc] && vis2[rr][cc]) cnt++;\n }\n if (cnt == num_cur - 1 || num_cur <= 1) {\n safes.push_back(p);\n }\n }\n if (safes.empty()) {\n safes = cands;\n }\n sort(safes.begin(), safes.end(), [&](const pair& a, const pair& b) {\n int ra = global_rank[a.first][a.second];\n int rb = global_rank[b.first][b.second];\n if (ra != rb) return ra < rb;\n if (a.first != b.first) return a.first < b.first;\n return a.second < b.second;\n });\n int chosen_idx = rank;\n if (chosen_idx >= (int)safes.size()) chosen_idx = max(0, (int)safes.size() - 1);\n if (safes.empty() && !cands.empty()) {\n safes = cands;\n chosen_idx = 0;\n }\n int pi = 0, pj = 0;\n if (!safes.empty()) {\n auto p = safes[chosen_idx];\n pi = p.first; pj = p.second;\n } else if (!cands.empty()) {\n auto p = cands[0];\n pi = p.first; pj = p.second;\n }\n cout << pi << \" \" << pj << endl;\n pos_label[pi][pj] = t;\n has_cont[pi][pj] = true;\n assigned[t] = true;\n }\n vector> order;\n int remain = MM;\n while (remain > 0) {\n auto vis = get_vis();\n set> accs;\n for (int i = 0; i < D; i++) {\n for (int j = 0; j < D; j++) {\n if (vis[i][j]) {\n for (int k = 0; k < 4; k++) {\n int ni = i + dr[k], nj = j + dc[k];\n if (ni >= 0 && ni < D && nj >= 0 && nj < D && has_cont[ni][nj] &&\n !is_obst[ni][nj]) {\n accs.insert({ni, nj});\n }\n }\n }\n }\n }\n if (accs.empty()) break;\n int minl = INT_MAX;\n pair bp = {-1, -1};\n for (auto p : accs) {\n int l = pos_label[p.first][p.second];\n if (l >= 0 && l < minl) {\n minl = l;\n bp = p;\n }\n }\n if (bp.first == -1) break;\n order.push_back(bp);\n has_cont[bp.first][bp.second] = false;\n remain--;\n }\n for (auto [i, j] : order) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc024":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> C(n, vector(n));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> C[i][j];\n auto adj_mat = vector>(m + 1, vector(m + 1, false));\n auto mark_bdry = [&](int i, int j) {\n int c = C[i][j];\n adj_mat[c][0] = adj_mat[0][c] = true;\n };\n for (int j = 0; j < n; j++) {\n mark_bdry(0, j); mark_bdry(n - 1, j);\n }\n for (int i = 0; i < n; i++) {\n mark_bdry(i, 0); mark_bdry(i, n - 1);\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int c = C[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = C[ni][nj];\n if (c != d) adj_mat[c][d] = adj_mat[d][c] = true;\n }\n }\n }\n }\n vector> newm = C;\n vector> contact_cnt(m + 1, vector(m + 1, 0));\n vector> dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\n auto rebuild_cnt = [&]() {\n contact_cnt.assign(m + 1, vector(m + 1, 0));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n int b = 0; bool is_out = false;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) is_out = true;\n else b = newm[ni][nj];\n if (c == b) continue;\n bool should = is_out || (di > 0 || (di == 0 && dj > 0));\n if (should) {\n int mn = min(c, b), mx = max(c, b);\n contact_cnt[mn][mx]++;\n }\n }\n }\n };\n rebuild_cnt();\n // leaf peeling (same == 1)\n bool changed = true;\n while (changed) {\n changed = false;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n if (c == 0) continue;\n int same = 0;\n bool exposed = false;\n vector neigh;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) {\n exposed = true; continue;\n }\n int b = newm[ni][nj];\n if (b == c) same++;\n else {\n neigh.push_back(b);\n if (b == 0) exposed = true;\n }\n }\n if (same != 1 || !exposed) continue;\n bool bad_exp = false;\n for (int b : neigh) if (b > 0 && !adj_mat[b][0]) { bad_exp = true; break; }\n if (bad_exp) continue;\n map contrib;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n int b = 0; bool is_out = false;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) { is_out = true; b = 0; }\n else b = newm[ni][nj];\n if (c == b) continue;\n bool should = is_out || (di > 0 || (di == 0 && dj > 0));\n if (should) contrib[b]++;\n }\n bool is_last = false;\n for (auto& kv : contrib) {\n int b = kv.first; int cn = kv.second;\n int mn = min(c, b), mx = max(c, b);\n if (contact_cnt[mn][mx] == cn) { is_last = true; break; }\n }\n if (is_last) continue;\n newm[i][j] = 0;\n changed = true;\n for (auto& kv : contrib) {\n int b = kv.first; int cn = kv.second;\n int mn = min(c, b), mx = max(c, b);\n contact_cnt[mn][mx] -= cn;\n }\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int b = newm[ni][nj];\n if (b > 0) {\n int mn = 0, mx = b;\n contact_cnt[mn][mx]++;\n }\n }\n }\n }\n }\n // second pass: safely remove cells with many same neighbors\n for (int sweep = 0; sweep < 3; sweep++) {\n bool did_remove = false;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n if (c == 0) continue;\n int same = 0;\n bool exposed = false;\n vector neigh;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) {\n exposed = true; continue;\n }\n int b = newm[ni][nj];\n if (b == c) same++;\n else {\n neigh.push_back(b);\n if (b == 0) exposed = true;\n }\n }\n if (same < 3 || !exposed) continue;\n bool bad_exp = false;\n for (int b : neigh) if (b > 0 && !adj_mat[b][0]) { bad_exp = true; break; }\n if (bad_exp) continue;\n map contrib;\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n int b = 0; bool is_out = false;\n if (ni < 0 || ni >= n || nj < 0 || nj >= n) { is_out = true; b = 0; }\n else b = newm[ni][nj];\n if (c == b) continue;\n bool should = is_out || (di > 0 || (di == 0 && dj > 0));\n if (should) contrib[b]++;\n }\n bool is_last = false;\n for (auto& kv : contrib) {\n int b = kv.first; int cn = kv.second;\n int mn = min(c, b), mx = max(c, b);\n if (contact_cnt[mn][mx] == cn) { is_last = true; break; }\n }\n if (is_last) continue;\n // tentative removal + connectivity check\n newm[i][j] = 0;\n vector> cells_of_c;\n for (int x = 0; x < n; x++) for (int y = 0; y < n; y++) if (newm[x][y] == c) cells_of_c.emplace_back(x, y);\n bool still_connected = true;\n if (!cells_of_c.empty()) {\n vector> vis(n, vector(n, false));\n queue> q;\n auto [sx, sy] = cells_of_c[0];\n q.push({sx, sy}); vis[sx][sy] = true;\n int cnt = 1;\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (auto [dx, dy] : dirs) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == c) {\n vis[nx][ny] = true; q.push({nx, ny}); cnt++;\n }\n }\n }\n still_connected = (cnt == (int)cells_of_c.size());\n }\n if (!still_connected) {\n newm[i][j] = c;\n continue;\n }\n // accept\n did_remove = true;\n for (auto& kv : contrib) {\n int b = kv.first; int cn = kv.second;\n int mn = min(c, b), mx = max(c, b);\n contact_cnt[mn][mx] -= cn;\n }\n for (auto [di, dj] : dirs) {\n int ni = i + di, nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < n) {\n int b = newm[ni][nj];\n if (b > 0) {\n int mn = 0, mx = b;\n contact_cnt[mn][mx]++;\n }\n }\n }\n }\n if (!did_remove) break;\n }\n auto new_adj = vector>(m + 1, vector(m + 1, false));\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n int c = newm[i][j];\n for (auto [di, dj] : vector>{{0, 1}, {1, 0}}) {\n int ni = i + di, nj = j + dj;\n if (ni < n && nj < n) {\n int d = newm[ni][nj];\n if (c != d) new_adj[c][d] = new_adj[d][c] = true;\n }\n }\n }\n for (int j = 0; j < n; j++) {\n if (newm[0][j] != 0) { int c = newm[0][j]; new_adj[c][0] = new_adj[0][c] = true; }\n if (newm[n - 1][j] != 0) { int c = newm[n - 1][j]; new_adj[c][0] = new_adj[0][c] = true; }\n }\n for (int i = 0; i < n; i++) {\n if (newm[i][0] != 0) { int c = newm[i][0]; new_adj[c][0] = new_adj[0][c] = true; }\n if (newm[i][n - 1] != 0) { int c = newm[i][n - 1]; new_adj[c][0] = new_adj[0][c] = true; }\n }\n bool adj_ok = true;\n for (int c = 0; c <= m; c++) for (int d = 0; d <= m; d++) {\n if (adj_mat[c][d] != new_adj[c][d]) adj_ok = false;\n }\n bool conn_ok = true;\n for (int c = 1; c <= m && conn_ok; c++) {\n vector> pos;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == c) pos.emplace_back(i, j);\n if (pos.empty()) { conn_ok = false; continue; }\n vector> vis(n, vector(n, false));\n queue> q;\n auto [sx, sy] = pos[0];\n q.push({sx, sy}); vis[sx][sy] = true;\n int cnt = 1;\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (auto [dx, dy] : dirs) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == c) {\n vis[nx][ny] = true; q.push({nx, ny}); cnt++;\n }\n }\n }\n if (cnt != (int)pos.size()) conn_ok = false;\n }\n if (conn_ok) {\n vector> zeros;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (newm[i][j] == 0) zeros.emplace_back(i, j);\n if (!zeros.empty()) {\n vector> vis(n, vector(n, false));\n queue> q;\n int cnt = 0;\n for (auto [i2, j2] : zeros) {\n if ((i2 == 0 || i2 == n - 1 || j2 == 0 || j2 == n - 1) && !vis[i2][j2]) {\n vis[i2][j2] = true; q.push({i2, j2}); cnt++;\n }\n }\n while (!q.empty()) {\n auto [x, y] = q.front(); q.pop();\n for (auto [dx, dy] : dirs) {\n int nx = x + dx, ny = y + dy;\n if (nx >= 0 && nx < n && ny >= 0 && ny < n && !vis[nx][ny] && newm[nx][ny] == 0) {\n vis[nx][ny] = true; q.push({nx, ny}); cnt++;\n }\n }\n }\n if (cnt != (int)zeros.size()) conn_ok = false;\n }\n }\n if (!adj_ok || !conn_ok) newm = C;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cout << newm[i][j];\n if (j < n - 1) cout << \" \";\n }\n cout << endl;\n }\n}","ahc025":"#include \nusing namespace std;\n\nint main() {\n int N, D, Q;\n cin >> N >> D >> Q;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n uniform_real_distribution uni(0.0, 1.0);\n vector score(N, 0);\n double target_part = 20.0;\n double avg_size = target_part * (double)N / (2.0 * Q);\n avg_size = max(avg_size, 1.5);\n double p = avg_size / (double)N;\n for (int q = 0; q < Q; q++) {\n vector L, R;\n vector used(N, false);\n for (int i = 0; i < N; i++) {\n double r = uni(rng);\n if (r < p) {\n L.push_back(i);\n used[i] = true;\n } else if (r < 2 * p) {\n R.push_back(i);\n used[i] = true;\n }\n }\n if (L.empty()) {\n for (int t = 0; t < N; t++) {\n int i = rng() % N;\n if (!used[i]) {\n L.push_back(i);\n used[i] = true;\n break;\n }\n }\n }\n if (R.empty()) {\n for (int t = 0; t < N; t++) {\n int i = rng() % N;\n if (!used[i]) {\n R.push_back(i);\n used[i] = true;\n break;\n }\n }\n }\n if (L.empty() || R.empty()) {\n L.clear();\n R.clear();\n used.assign(N, false);\n int a = rng() % N;\n L.push_back(a);\n used[a] = true;\n int b = rng() % N;\n while (used[b]) b = rng() % N;\n R.push_back(b);\n }\n cout << L.size() << \" \" << R.size();\n for (int x : L) cout << \" \" << x;\n for (int x : R) cout << \" \" << x;\n cout << endl;\n string res;\n cin >> res;\n int sgn = 0;\n if (res == \">\") sgn = 1;\n else if (res == \"<\") sgn = -1;\n for (int x : L) score[x] += sgn;\n for (int x : R) score[x] -= sgn;\n }\n long long minw = LLONG_MAX;\n for (auto x : score) minw = min(minw, x);\n for (auto &x : score) x = x - minw + 1LL;\n vector> items;\n for (int i = 0; i < N; i++) {\n items.emplace_back(score[i], i);\n }\n sort(items.rbegin(), items.rend());\n vector group_sums(D, 0);\n vector group_id(N, 0);\n for (auto &pr : items) {\n int id = pr.second;\n int best = 0;\n for (int g = 1; g < D; g++) {\n if (group_sums[g] < group_sums[best]) best = g;\n }\n group_id[id] = best;\n group_sums[best] += pr.first;\n }\n for (int i = 0; i < N; i++) {\n if (i > 0) cout << \" \";\n cout << group_id[i];\n }\n cout << endl;\n return 0;\n}","ahc026":"#include \nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector> st(m);\n for (int i = 0; i < m; i++) {\n st[i].resize(n / m);\n for (int j = 0; j < n / m; j++) {\n cin >> st[i][j];\n }\n }\n vector> ops;\n int cur = 1;\n auto get_top = [&](int s) -> int {\n if (st[s].empty()) return n + 1;\n return st[s].back();\n };\n auto can_extract = [&]() -> bool {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) return true;\n }\n return false;\n };\n auto find_pos = [&](int v) -> pair {\n for (int s = 0; s < m; s++) {\n for (int h = 0; h < (int)st[s].size(); h++) {\n if (st[s][h] == v) return {s, h};\n }\n }\n return {-1, -1};\n };\n while (cur <= n) {\n if (can_extract()) {\n for (int s = 0; s < m; s++) {\n if (!st[s].empty() && st[s].back() == cur) {\n ops.emplace_back(cur, 0);\n st[s].pop_back();\n cur++;\n break;\n }\n }\n continue;\n }\n auto [cs, h] = find_pos(cur);\n assert(h != -1 && h + 1 < (int)st[cs].size());\n int csz = (int)st[cs].size();\n int best_score = -1;\n int best_from = -1;\n int best_start_idx = -1;\n int best_dest = -1;\n for (int stt = h + 1; stt < csz; stt++) {\n int moved_min = n + 1;\n for (int k = stt; k < csz; k++) moved_min = min(moved_min, st[cs][k]);\n for (int dd = 0; dd < m; dd++) {\n if (dd == cs) continue;\n int pl = csz - stt;\n int tlen = 0;\n int exp_val = 0;\n int dp = 0;\n bool cn = true;\n while (cn) {\n int val;\n if (dp < pl) {\n val = st[cs][csz - 1 - dp];\n } else {\n int od = dp - pl;\n int osz = (int)st[dd].size();\n if (od >= osz) val = -999;\n else val = st[dd][osz - 1 - od];\n }\n if (val < 1 || val > n) {\n cn = false;\n continue;\n }\n if (tlen == 0) {\n tlen = 1;\n exp_val = val + 1;\n dp++;\n continue;\n }\n if (val == exp_val) {\n tlen++;\n exp_val++;\n dp++;\n } else {\n cn = false;\n }\n }\n int md = n + 1;\n for (int val : st[dd]) md = min(md, val);\n int ot = get_top(dd);\n int sd = (int)st[dd].size();\n int sc = tlen * 10000 + md * 6 + sd * 2 + ot + pl * 100 + moved_min * 2;\n if (sd == 0) sc += 200000;\n if (sc > best_score) {\n best_score = sc;\n best_from = cs;\n best_start_idx = stt;\n best_dest = dd;\n }\n }\n }\n assert(best_from != -1 && best_start_idx != -1 && best_dest != -1);\n int chosen_v = st[best_from][best_start_idx];\n ops.emplace_back(chosen_v, best_dest + 1);\n auto& frm = st[best_from];\n int frm_sz = (int)frm.size();\n for (int k = best_start_idx; k < frm_sz; k++) {\n st[best_dest].push_back(frm[k]);\n }\n frm.resize(best_start_idx);\n }\n for (auto [v, i] : ops) {\n cout << v << \" \" << i << endl;\n }\n}","ahc027":"#include \nusing namespace std;\n\nusing pii = pair;\n\nint main() {\n int N;\n cin >> N;\n vector h(N-1), v(N);\n for(int i=0;i>h[i];\n for(int i=0;i>v[i];\n vector> d(N,vector(N));\n for(int i=0;i>d[i][j];\n\n vector> target(N,vector(N,1));\n double Q = 0.0;\n for(int i=0;i MAX_VIRTUAL_L) continue;\n double nsc = (nl*nl/2.0)*nQ;\n double del = nsc - curScore;\n if(del < bestDelta){\n bestDelta = del;\n bx = x; by = y;\n bestNewQ = nQ;\n bestNewSc = nsc;\n }\n }\n if(bx == -1 || bestDelta >= 0) break;\n target[bx][by]++;\n Q = bestNewQ;\n curScore = bestNewSc;\n curL++;\n }\n\n vector> remain = target;\n string ans = \"\";\n int cx = 0, cy = 0;\n int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};\n string ds = \"RDLU\";\n\n auto get_neighbors = [&](int x, int y) {\n vector res;\n for(int r=0;r<4;r++){\n int nx = x+dx[r], ny = y+dy[r];\n if(nx>=0 && nx=0 && ny> dist(N,vector(N,-1));\n vector> par(N,vector(N,{-1,-1}));\n queue q;\n q.push({cx,cy});\n dist[cx][cy] = 0;\n while(!q.empty()){\n auto [x,y] = q.front(); q.pop();\n for(auto [nx,ny]:get_neighbors(x,y)){\n if(dist[nx][ny]>=0) continue;\n dist[nx][ny] = dist[x][y]+1;\n par[nx][ny] = {x,y};\n q.push({nx,ny});\n }\n }\n\n int tx=-1,ty=-1;\n int minD = INT_MAX;\n int maxD = -1;\n for(int x=0;x0){\n if(x==cx && y==cy) continue;\n if(dist[x][y]<0) continue;\n if(dist[x][y]maxD)){\n minD = dist[x][y];\n maxD = d[x][y];\n tx = x; ty = y;\n }\n }\n if(tx == -1) break;\n\n vector moves;\n int curx=tx, cury=ty;\n while(curx != cx || cury != cy){\n auto [px,py] = par[curx][cury];\n int dx_ = curx-px, dy_ = cury-py;\n char m;\n if(dx_==0 && dy_==1) m='R';\n else if(dx_==0 && dy_==-1) m='L';\n else if(dx_==1 && dy_==0) m='D';\n else m='U';\n moves.push_back(m);\n curx = px; cury = py;\n }\n reverse(moves.begin(),moves.end());\n for(char m:moves){\n ans += m;\n if(m=='R') cy++;\n else if(m=='L') cy--;\n else if(m=='D') cx++;\n else if(m=='U') cx--;\n if(ans.size() > 100000) goto done;\n }\n remain[tx][ty]--;\n }\n\ndone:\n // return to (0,0)\n {\n vector> dist(N,vector(N,-1));\n vector> par(N,vector(N,{-1,-1}));\n queue q;\n q.push({cx,cy});\n dist[cx][cy] = 0;\n while(!q.empty()){\n auto [x,y] = q.front(); q.pop();\n for(auto [nx,ny]:get_neighbors(x,y)){\n if(dist[nx][ny]>=0) continue;\n dist[nx][ny] = dist[x][y]+1;\n par[nx][ny] = {x,y};\n q.push({nx,ny});\n }\n }\n int tx=0,ty=0;\n vector moves;\n int curx=tx, cury=ty;\n while(curx != cx || cury != cy){\n auto [px,py] = par[curx][cury];\n int dx_ = curx-px, dy_ = cury-py;\n char m;\n if(dx_==0 && dy_==1) m='R';\n else if(dx_==0 && dy_==-1) m='L';\n else if(dx_==1 && dy_==0) m='D';\n else m='U';\n moves.push_back(m);\n curx = px; cury = py;\n }\n reverse(moves.begin(),moves.end());\n for(char m:moves){\n ans += m;\n if(ans.size() > 100000) break;\n if(m=='R') cy++;\n else if(m=='L') cy--;\n else if(m=='D') cx++;\n else if(m=='U') cx--;\n }\n }\n\n cout << ans << endl;\n return 0;\n}","ahc028":"#include \nusing namespace std;\nusing pii = pair;\n\nstruct SolverResult {\n vector actions;\n long long total_cost;\n int covered_count;\n};\n\npair> compute_path(int ci, int cj, const string& need, const vector>& pos) {\n int r = need.size();\n if (r == 0) return {0, {}};\n vector> cands(r);\n for (int k = 0; k < r; k++) cands[k] = pos[need[k] - 'A'];\n vector> dp(r), pre(r);\n int sz0 = cands[0].size();\n dp[0].assign(sz0, INT_MAX / 2);\n pre[0].assign(sz0, -1);\n for (int j = 0; j < sz0; j++) {\n auto [x, y] = cands[0][j];\n dp[0][j] = abs(x - ci) + abs(y - cj);\n }\n for (int k = 1; k < r; k++) {\n int psz = cands[k - 1].size();\n int sz = cands[k].size();\n dp[k].assign(sz, INT_MAX / 2);\n pre[k].assign(sz, -1);\n for (int j = 0; j < sz; j++) {\n auto [x, y] = cands[k][j];\n for (int pj = 0; pj < psz; pj++) {\n if (dp[k - 1][pj] >= INT_MAX / 2) continue;\n auto [px, py] = cands[k - 1][pj];\n int d = abs(x - px) + abs(y - py);\n int tot = dp[k - 1][pj] + d;\n if (tot < dp[k][j]) {\n dp[k][j] = tot;\n pre[k][j] = pj;\n }\n }\n }\n }\n int ls = cands[r - 1].size();\n int md = INT_MAX / 2;\n int bj = 0;\n for (int j = 0; j < ls; j++) {\n if (dp[r - 1][j] < md) {\n md = dp[r - 1][j];\n bj = j;\n }\n }\n vector path(r);\n int currj = bj;\n for (int k = r - 1; k >= 0; k--) {\n path[k] = cands[k][currj];\n if (k >= 1) currj = pre[k][currj];\n }\n return {md, path};\n}\n\nint get_min_dist_sum(int ci, int cj, const string& need, const vector>& pos) {\n int r = need.size();\n if (r == 0) return 0;\n vector> cands(r);\n for (int k = 0; k < r; k++) cands[k] = pos[need[k] - 'A'];\n vector> dp(r);\n int sz0 = cands[0].size();\n dp[0].assign(sz0, INT_MAX / 2);\n for (int j = 0; j < sz0; j++) {\n auto [x, y] = cands[0][j];\n dp[0][j] = abs(x - ci) + abs(y - cj);\n }\n for (int k = 1; k < r; k++) {\n int psz = cands[k - 1].size();\n int sz = cands[k].size();\n dp[k].assign(sz, INT_MAX / 2);\n for (int j = 0; j < sz; j++) {\n auto [x, y] = cands[k][j];\n for (int pj = 0; pj < psz; pj++) {\n if (dp[k - 1][pj] >= INT_MAX / 2) continue;\n auto [px, py] = cands[k - 1][pj];\n int d = abs(x - px) + abs(y - py);\n dp[k][j] = min(dp[k][j], dp[k - 1][pj] + d);\n }\n }\n }\n int md = INT_MAX / 2;\n for (int j = 0; j < (int)dp.back().size(); j++) {\n md = min(md, dp.back()[j]);\n }\n return md;\n}\n\nSolverResult run_solver(int N, int M, int si, int sj, const vector& grid, const vector& ts, int overlap_bonus, int lookahead_thresh) {\n vector> pos(26);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int c = grid[i][j] - 'A';\n pos[c].emplace_back(i, j);\n }\n }\n vector covered(M, false);\n int uncov = M;\n string current_S = \"\";\n int ci = si, cj = sj;\n vector actions;\n long long total_cost = 0;\n while (uncov > 0) {\n int chosen_k = -1;\n vector chosen_path;\n if (uncov > lookahead_thresh) {\n int best_score = INT_MAX;\n for (int k = 0; k < M; k++) {\n if (covered[k]) continue;\n const string& t = ts[k];\n int maxo = 0;\n int maxp = min(4, (int)current_S.size());\n for (int o = maxp; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : current_S.substr(current_S.size() - o, o));\n string pref = t.substr(0, o);\n if (suf == pref) {\n maxo = o;\n break;\n }\n }\n string needed = t.substr(maxo);\n if (needed.empty()) {\n covered[k] = true;\n uncov--;\n continue;\n }\n auto [md, pth] = compute_path(ci, cj, needed, pos);\n int addc = (int)needed.size() + md;\n int score = addc - maxo * overlap_bonus;\n if (score < best_score) {\n best_score = score;\n chosen_k = k;\n chosen_path = pth;\n }\n }\n } else {\n int best_est = INT_MAX;\n for (int k = 0; k < M; k++) {\n if (covered[k]) continue;\n const string& t = ts[k];\n int maxo = 0;\n int maxp = min(4, (int)current_S.size());\n for (int o = maxp; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : current_S.substr(current_S.size() - o, o));\n string pref = t.substr(0, o);\n if (suf == pref) {\n maxo = o;\n break;\n }\n }\n string needed = t.substr(maxo);\n if (needed.empty()) {\n covered[k] = true;\n uncov--;\n continue;\n }\n auto [md, pth] = compute_path(ci, cj, needed, pos);\n int addc = (int)needed.size() + md;\n if (pth.empty()) continue;\n pii last_pos = pth.back();\n int new_ci = last_pos.first, new_cj = last_pos.second;\n string old_last = current_S.size() >= 4 ? current_S.substr(current_S.size() - 4) : current_S;\n string new_last_temp = old_last + needed;\n string new_last = new_last_temp.size() > 4 ? new_last_temp.substr(new_last_temp.size() - 4) : new_last_temp;\n int min_nxt = INT_MAX / 2;\n if (uncov > 1) {\n for (int nk = 0; nk < M; nk++) {\n if (!covered[nk] && nk != k) {\n const string& nt = ts[nk];\n int nmo = 0;\n int npm = min(4, (int)new_last.size());\n for (int o = npm; o >= 0; o--) {\n string suf = (o == 0 ? \"\" : new_last.substr(new_last.size() - o, o));\n if (suf == nt.substr(0, o)) {\n nmo = o;\n break;\n }\n }\n string nneed = nt.substr(nmo);\n if (nneed.empty()) {\n min_nxt = 0;\n break;\n }\n int nmd = get_min_dist_sum(new_ci, new_cj, nneed, pos);\n int nadd = (int)nneed.size() + nmd;\n int nscore = nadd - nmo * overlap_bonus;\n if (nscore < min_nxt) min_nxt = nscore;\n }\n }\n if (min_nxt == INT_MAX / 2) min_nxt = 0;\n } else {\n min_nxt = 0;\n }\n int est = (addc - maxo * overlap_bonus) + min_nxt;\n if (est < best_est) {\n best_est = est;\n chosen_k = k;\n chosen_path = pth;\n }\n }\n }\n if (chosen_k == -1) break;\n for (auto ppos : chosen_path) {\n actions.push_back(ppos);\n auto [x, y] = ppos;\n int dist = abs(x - ci) + abs(y - cj);\n total_cost += dist + 1;\n current_S += grid[x][y];\n ci = x;\n cj = y;\n if (current_S.size() >= 5) {\n string last5 = current_S.substr(current_S.size() - 5, 5);\n for (int kk = 0; kk < M; kk++) {\n if (!covered[kk] && ts[kk] == last5) {\n covered[kk] = true;\n uncov--;\n }\n }\n }\n }\n }\n int final_covered = 0;\n for (bool b : covered) if (b) final_covered++;\n return {actions, total_cost, final_covered};\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n int si, sj;\n cin >> si >> sj;\n vector grid(N);\n for (int i = 0; i < N; i++) cin >> grid[i];\n vector ts(M);\n for (int i = 0; i < M; i++) cin >> ts[i];\n vector bonuses = {1, 2, 3};\n vector thresholds = {40, 60, 100};\n SolverResult best_res;\n long long best_t = LLONG_MAX;\n int best_covered = 0;\n for (int b : bonuses) {\n for (int th : thresholds) {\n SolverResult res = run_solver(N, M, si, sj, grid, ts, b, th);\n if (res.covered_count > best_covered || (res.covered_count == best_covered && res.total_cost < best_t)) {\n best_covered = res.covered_count;\n best_t = res.total_cost;\n best_res = res;\n }\n }\n }\n for (auto [i, j] : best_res.actions) {\n cout << i << \" \" << j << endl;\n }\n return 0;\n}","ahc030":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n double eps;\n cin >> N >> M >> eps;\n for(int k = 0; k < M; k++) {\n int d;\n cin >> d;\n for(int p = 0; p < d; p++) {\n int x, y;\n cin >> x >> y;\n }\n }\n vector> positives;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n cout << \"q 1 \" << i << \" \" << j << endl;\n int v;\n cin >> v;\n if(v > 0) {\n positives.emplace_back(i, j);\n }\n }\n }\n cout << \"a \" << positives.size();\n for(auto [i,j] : positives) {\n cout << \" \" << i << \" \" << j;\n }\n cout << endl;\n int resp;\n cin >> resp;\n return 0;\n}","ahc031":"#include \nusing namespace std;\n\nint main() {\n int W, D, N;\n cin >> W >> D >> N;\n vector> a(D, vector(N));\n for(int d = 0; d < D; d++) {\n for(int k = 0; k < N; k++) {\n cin >> a[d][k];\n }\n }\n vector maxa(N, 0);\n for(int k = 0; k < N; k++) {\n for(int d = 0; d < D; d++) {\n maxa[k] = max(maxa[k], a[d][k]);\n }\n }\n int bestK = 1;\n long long best_est = LLONG_MAX / 2;\n for(int ktry = 1; ktry <= min(N, 30); ktry++) {\n int KK = ktry;\n vector gsize(KK);\n for(int i = 0; i < KK; i++) gsize[i] = N / KK + (i < N % KK ? 1 : 0);\n vector minww(KK, 0);\n int pos = N - 1;\n long long totmin = 0;\n long long horiz_est = 0;\n for(int g = 0; g < KK; g++) {\n int gszz = gsize[g];\n long long sm = 0;\n int mmx = 0;\n for(int j = 0; j < gszz; j++) {\n int mk = maxa[pos--];\n sm += mk;\n mmx = max(mmx, mk);\n }\n long long mw = max((sm + W - 1LL) / W, (mmx + W - 1LL) / W);\n minww[g] = mw;\n totmin += mw;\n horiz_est += mw * gszz;\n }\n if(totmin == 0) continue;\n long long area_c = 0;\n for(int dd = 0; dd < D; dd++) {\n int curpos = N - 1;\n for(int g = 0; g < KK; g++) {\n int gszz = gsize[g];\n long long mww = minww[g] * (long long)W / totmin;\n mww = max(1LL, mww);\n int this_ww = mww;\n int tneed = 0;\n for(int j = 0; j < gszz; j++) {\n int akk = a[dd][curpos--];\n tneed += (akk + this_ww - 1) / this_ww;\n }\n if(tneed > W) {\n area_c += 100LL * (tneed - W) * this_ww;\n }\n }\n }\n long long lcost = (D - 1LL) * 2 * horiz_est;\n long long totest = area_c + lcost;\n if(totest < best_est) {\n best_est = totest;\n bestK = KK;\n }\n }\n // now build with bestK\n int K = bestK;\n vector gsize(K);\n for(int i = 0; i < K; i++) gsize[i] = N / K + (i < N % K ? 1 : 0);\n vector minww(K, 0);\n vector> group_ks(K);\n int pos = N - 1;\n long long totmin = 0;\n for(int g = 0; g < K; g++) {\n int gszz = gsize[g];\n long long sm = 0;\n int mmx = 0;\n for(int j = 0; j < gszz; j++) {\n int mk = maxa[pos];\n sm += mk;\n mmx = max(mmx, mk);\n group_ks[g].push_back(pos);\n pos--;\n }\n long long mw = max((sm + W - 1LL) / W, (mmx + W - 1LL) / W);\n minww[g] = mw;\n totmin += mw;\n }\n vector slab_w(K);\n if(totmin > 0) {\n for(int g = 0; g < K; g++) {\n slab_w[g] = max(1LL, minww[g] * (long long)W / totmin);\n }\n int cw = 0;\n for(int w : slab_w) cw += w;\n int diff = W - cw;\n for(int i = 0; i < abs(diff); i++) {\n int gi = i % K;\n if(diff > 0) {\n slab_w[gi]++;\n } else if(slab_w[gi] > 1) {\n slab_w[gi]--;\n }\n }\n } else {\n int eqw = W / K;\n for(int g = 0; g < K; g++) {\n slab_w[g] = eqw;\n }\n for(int g = 0; g < W % K; g++) slab_w[g]++;\n }\n vector jpos(K + 1, 0);\n for(int g = 0; g < K; g++) {\n jpos[g + 1] = jpos[g] + slab_w[g];\n }\n // now for each day\n for(int d = 0; d < D; d++) {\n vector> rect_per_k(N);\n int rk_base = N - 1;\n for(int g = 0; g < K; g++) {\n int thisw = slab_w[g];\n vector> day_as;\n auto& ks_list = group_ks[g];\n for(int rkk : ks_list) {\n day_as.emplace_back(a[d][rkk], rkk);\n }\n sort(day_as.rbegin(), day_as.rend());\n int ng = day_as.size();\n vector needs(ng);\n int tot_need_h = 0;\n for(int i = 0; i < ng; i++) {\n int aa = day_as[i].first;\n int nh = (aa + thisw - 1) / thisw;\n needs[i] = max(1, nh);\n tot_need_h += needs[i];\n }\n vector used_hs(ng, 0);\n int use_hh;\n if(tot_need_h <= W) {\n use_hh = tot_need_h;\n for(int i = 0; i < ng; i++) used_hs[i] = needs[i];\n } else {\n use_hh = W;\n if(tot_need_h > 0) {\n double rr = (double)W / tot_need_h;\n int su = 0;\n for(int i = 0; i < ng; i++) {\n used_hs[i] = max(1, (int)(needs[i] * rr));\n su += used_hs[i];\n }\n while(su < W) {\n for(int i = 0; i < ng && su < W; i++) {\n used_hs[i]++;\n su++;\n }\n }\n while(su > W) {\n for(int i = 0; i < ng && su > W; i++) {\n if(used_hs[i] > 1) {\n used_hs[i]--;\n su--;\n }\n }\n }\n }\n }\n int cur_i = 0;\n int jbase = jpos[g];\n for(int i = 0; i < ng; i++) {\n int hh = used_hs[i];\n int ok = day_as[i].second;\n if(hh == 0) hh = 1; // safety\n rect_per_k[ok] = {cur_i, jbase, cur_i + hh, jbase + thisw};\n cur_i += hh;\n }\n }\n for(int k = 0; k < N; k++) {\n auto arr = rect_per_k[k];\n cout << arr[0] << \" \" << arr[1] << \" \" << arr[2] << \" \" << arr[3] << endl;\n }\n }\n return 0;\n}","ahc032":"#include \nusing namespace std;\nusing ll = long long;\n\nint main() {\n srand(42);\n int N, M, K;\n cin >> N >> M >> K;\n const ll MOD = 998244353;\n ll init_brd[9][9];\n ll init_sc = 0;\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {\n cin >> init_brd[i][j];\n init_sc += init_brd[i][j];\n }\n ll st[20][3][3];\n for (int m = 0; m < M; m++) for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) {\n cin >> st[m][i][j];\n }\n ll best_sc = init_sc;\n vector> best_ops;\n ll brd[9][9];\n const int TRIALS = 250;\n const int TOP_K = 2;\n const int LOW_AREAS = 5;\n for (int trial = 0; trial < TRIALS; trial++) {\n for (int i = 0; i < 9; i++) for (int j = 0; j < 9; j++) brd[i][j] = init_brd[i][j];\n vector> this_ops;\n vector> best_ops_in_path;\n ll path_best_sc = init_sc;\n ll curr_sc = init_sc;\n for (int step = 0; step < K; step++) {\n vector> cands;\n for (int m = 0; m < M; m++) {\n for (int p = 0; p <= 6; p++) {\n for (int q = 0; q <= 6; q++) {\n ll d = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n ll nr = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n d += nr - brd[p + x][q + y];\n }\n cands.emplace_back(d, m, p, q);\n }\n }\n }\n sort(cands.rbegin(), cands.rend());\n ll max_d = get<0>(cands[0]);\n int chosen_m, chosen_p, chosen_q;\n ll chosen_dval;\n if (max_d > 0) {\n int ntop = min(TOP_K, (int)cands.size());\n int pick = rand() % ntop;\n auto [dval, m, p, q] = cands[pick];\n chosen_dval = dval;\n chosen_m = m;\n chosen_p = p;\n chosen_q = q;\n } else {\n vector> area_sums;\n for (int p = 0; p <= 6; p++) {\n for (int q = 0; q <= 6; q++) {\n ll s9 = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n s9 += brd[p + x][q + y];\n }\n area_sums.emplace_back(s9, p, q);\n }\n }\n sort(area_sums.begin(), area_sums.end());\n int nlow = min(LOW_AREAS, (int)area_sums.size());\n int idx = rand() % nlow;\n auto [_, tp, tq] = area_sums[idx];\n ll best_d_pos = LLONG_MIN / 2;\n int best_m_pos = -1;\n for (int m = 0; m < M; m++) {\n ll d = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n ll nr = (brd[tp + x][tq + y] + st[m][x][y]) % MOD;\n d += nr - brd[tp + x][tq + y];\n }\n if (d > best_d_pos) {\n best_d_pos = d;\n best_m_pos = m;\n }\n }\n chosen_dval = best_d_pos;\n chosen_m = best_m_pos;\n chosen_p = tp;\n chosen_q = tq;\n }\n this_ops.emplace_back(chosen_m, chosen_p, chosen_q);\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n brd[chosen_p + x][chosen_q + y] = (brd[chosen_p + x][chosen_q + y] + st[chosen_m][x][y]) % MOD;\n }\n curr_sc += chosen_dval;\n if (curr_sc > path_best_sc) {\n path_best_sc = curr_sc;\n best_ops_in_path = this_ops;\n }\n }\n if (path_best_sc > best_sc) {\n best_sc = path_best_sc;\n best_ops = best_ops_in_path;\n }\n }\n // post-processing: simulate best and add any remaining positive moves\n for (int i = 0; i < 9; i++) for (int j = 0; j < 9; j++) brd[i][j] = init_brd[i][j];\n ll post_sc = init_sc;\n for (auto [m, p, q] : best_ops) {\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n brd[p + x][q + y] = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n }\n }\n post_sc = 0;\n for (int i = 0; i < 9; i++) for (int j = 0; j < 9; j++) post_sc += brd[i][j];\n bool improved = true;\n while (improved && best_ops.size() < (size_t)K) {\n improved = false;\n vector> cands;\n for (int m = 0; m < M; m++) {\n for (int p = 0; p <= 6; p++) {\n for (int q = 0; q <= 6; q++) {\n ll d = 0;\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n ll nr = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n d += nr - brd[p + x][q + y];\n }\n cands.emplace_back(d, m, p, q);\n }\n }\n }\n sort(cands.rbegin(), cands.rend());\n if (get<0>(cands[0]) > 0) {\n auto [dval, m, p, q] = cands[0];\n best_ops.emplace_back(m, p, q);\n for (int x = 0; x < 3; x++) for (int y = 0; y < 3; y++) {\n brd[p + x][q + y] = (brd[p + x][q + y] + st[m][x][y]) % MOD;\n }\n post_sc += dval;\n improved = true;\n }\n }\n cout << best_ops.size() << endl;\n for (auto [m, p, q] : best_ops) {\n cout << m << \" \" << p << \" \" << q << endl;\n }\n}","ahc033":"#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector> A(N, vector(N));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> A[i][j];\n }\n }\n vector ops(N);\n vector> g(N, vector(N, -1));\n vector crane_r(N), crane_c(N);\n for (int i = 0; i < N; i++) {\n crane_r[i] = i;\n crane_c[i] = 0;\n }\n vector carry(N, false);\n vector carry_what(N, -1);\n vector isact(N, true);\n vector islarge(N, false);\n islarge[0] = true;\n vector inp_idx(N, 0);\n vector next_e(N);\n for (int i = 0; i < N; i++) next_e[i] = i * N;\n int dispat_cnt = 0;\n auto is_done = [&]() { return dispat_cnt == N * N; };\n auto do_receive = [&]() {\n for (int r = 0; r < N; r++) {\n if (inp_idx[r] >= N) continue;\n int c = 0;\n if (g[r][c] != -1) continue;\n bool hold_there = false;\n for (int k = 0; k < N; k++) {\n if (isact[k] && crane_r[k] == r && crane_c[k] == c && carry[k]) {\n hold_there = true;\n break;\n }\n }\n if (!hold_there) {\n int cn = A[r][inp_idx[r]];\n g[r][c] = cn;\n inp_idx[r]++;\n }\n }\n };\n auto do_dispatch = [&]() {\n for (int r = 0; r < N; r++) {\n int c = N - 1;\n if (g[r][c] != -1) {\n int b = g[r][c];\n g[r][c] = -1;\n dispat_cnt++;\n if (b / N == r && next_e[r] == b) {\n next_e[r]++;\n }\n }\n }\n };\n auto move_towards = [&](int cr, int cc, int tr, int tc, bool iscarry) -> char {\n if (cr != tr) {\n if (cr < tr) return 'D';\n return 'U';\n }\n if (cc != tc) {\n if (cc < tc) return 'R';\n return 'L';\n }\n return '.';\n };\n auto find_safe_empty_for = [&](int cont) -> pair {\n int pref = cont / N;\n for (int j = 1; j < N-1; j++) {\n if (g[pref][j] == -1) return {pref, j};\n }\n for (int j = 1; j < N-1; j++) {\n for (int i = 0; i < N; i++) {\n if (g[i][j] == -1) return {i, j};\n }\n }\n for (int j = 0; j < N; j++) if (j != N-1)\n for (int i = 0; i < N; i++) if (g[i][j] == -1) return {i, j};\n return {-1,-1};\n };\n const int MAXT = 10000;\n for (int t = 0; t < MAXT; t++) {\n if (is_done()) break;\n do_receive();\n if (is_done()) break;\n vector action(N, '.');\n for (int k = 1; k < N; k++) {\n if (isact[k] && t == 0) {\n action[k] = 'B';\n }\n }\n if (isact[0]) {\n int held = carry[0] ? carry_what[0] : -1;\n bool acted = false;\n if (held != -1) {\n int tr = held / N;\n if (held == next_e[tr]) {\n int gr = tr, gc = N - 1;\n if (crane_r[0] == gr && crane_c[0] == gc) {\n if (g[gr][gc] == -1) {\n action[0] = 'Q';\n acted = true;\n } else {\n action[0] = '.';\n acted = true;\n }\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], gr, gc, true);\n acted = true;\n }\n }\n }\n if (!acted && !carry[0]) {\n int bestd = INT_MAX;\n int bx = -1, by = -1;\n for (int i = 0; i < N; i++) {\n if (next_e[i] >= (i + 1) * N) continue;\n int nd = next_e[i];\n for (int r = 0; r < N; r++) for (int c = 0; c < N; c++) {\n if (g[r][c] == nd) {\n if (r == i && c == N-1) continue;\n int dist = abs(crane_r[0]-r) + abs(crane_c[0]-c);\n if (dist < bestd) {\n bestd = dist;\n bx = r; by = c;\n }\n }\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) action[0] = 'P';\n else action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n acted = true;\n }\n }\n if (!acted && carry[0]) {\n int hc = carry_what[0];\n auto emp = find_safe_empty_for(hc);\n if (emp.first != -1) {\n int ex = emp.first, ey = emp.second;\n if (crane_r[0] == ex && crane_c[0] == ey) {\n action[0] = 'Q';\n } else {\n action[0] = move_towards(crane_r[0], crane_c[0], ex, ey, true);\n }\n acted = true;\n } else {\n int tr = hc / N;\n int gr = tr, gc = N - 1;\n if (crane_r[0] == gr && crane_c[0] == gc) {\n if (g[gr][gc] == -1) action[0] = 'Q';\n else action[0] = '.';\n } else action[0] = move_towards(crane_r[0], crane_c[0], gr, gc, true);\n acted = true;\n }\n }\n if (!acted) {\n int bestd = INT_MAX;\n int bx = -1, by = -1;\n for (int r = 0; r < N; r++) {\n if (g[r][0] != -1) {\n int d = abs(crane_r[0] - r) + abs(crane_c[0]);\n if (d < bestd) {\n bestd = d;\n bx = r; by = 0;\n }\n }\n }\n if (bestd != INT_MAX) {\n if (crane_r[0] == bx && crane_c[0] == by) action[0] = 'P';\n else action[0] = move_towards(crane_r[0], crane_c[0], bx, by, false);\n acted = true;\n }\n }\n if (!acted) action[0] = '.';\n }\n for (int k = 0; k < N; k++) {\n if (!isact[k]) continue;\n char act = action[k];\n if (act == 'B') {\n if (!carry[k]) isact[k] = false;\n continue;\n }\n if (act == 'P') {\n if (!carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] != -1) {\n carry[k] = true;\n carry_what[k] = g[rr][cc];\n g[rr][cc] = -1;\n }\n }\n } else if (act == 'Q') {\n if (carry[k]) {\n int rr = crane_r[k], cc = crane_c[k];\n if (g[rr][cc] == -1) {\n g[rr][cc] = carry_what[k];\n carry[k] = false;\n carry_what[k] = -1;\n }\n }\n } else if (act != '.') {\n int drr = 0, dcc = 0;\n if (act == 'U') drr = -1;\n else if (act == 'D') drr = 1;\n else if (act == 'L') dcc = -1;\n else if (act == 'R') dcc = 1;\n int nr = crane_r[k] + drr;\n int nc = crane_c[k] + dcc;\n if (nr >= 0 && nr < N && nc >= 0 && nc < N) {\n bool has_cont = g[nr][nc] != -1;\n bool can = true;\n if (carry[k] && !islarge[k] && has_cont) can = false;\n if (can) {\n crane_r[k] = nr;\n crane_c[k] = nc;\n }\n }\n }\n }\n do_dispatch();\n for (int k = 0; k < N; k++) ops[k] += action[k];\n if (is_done()) break;\n }\n int maxlen = 0;\n for (auto& s : ops) maxlen = max(maxlen, (int)s.size());\n for (auto& s : ops) while((int)s.size() < maxlen) s += '.';\n for (auto& s : ops) cout << s << endl;\n}","ahc034":"#include \nusing namespace std;\nusing ll = long long;\n\nll simulate_cost(const vector& ops, const vector>& orig_h) {\n int n = orig_h.size();\n vector> height(n, vector(n));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) height[i][j] = orig_h[i][j];\n }\n int r = 0, c = 0;\n ll ld = 0;\n ll cost = 0;\n for (auto& op : ops) {\n if (op.empty()) continue;\n if (op[0] == '+' || op[0] == '-') {\n ll d = stoll(op.substr(1));\n if (op[0] == '+') {\n height[r][c] -= d;\n ld += d;\n cost += d;\n } else {\n height[r][c] += d;\n ld -= d;\n cost += d;\n }\n if (ld < 0 || d <= 0) return 1LL << 60;\n } else {\n char dir = op[0];\n if (dir == 'U') r--;\n else if (dir == 'D') r++;\n else if (dir == 'L') c--;\n else if (dir == 'R') c++;\n if (r < 0 || r >= n || c < 0 || c >= n) return 1LL << 60;\n cost += 100 + ld;\n }\n }\n if (ld != 0) return 1LL << 60;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (height[i][j] != 0) return 1LL << 60;\n return cost;\n}\n\nint main() {\n srand(42);\n int N;\n cin >> N;\n vector> h(N, vector(N));\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) cin >> h[i][j];\n vector> orig_supply(N, vector(N, 0));\n vector> orig_demand(N, vector(N, 0));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (h[i][j] > 0) orig_supply[i][j] = h[i][j];\n else orig_demand[i][j] = -h[i][j];\n }\n }\n vector> supply_list;\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) if (orig_supply[i][j] > 0) supply_list.emplace_back(i, j);\n sort(supply_list.begin(), supply_list.end(), [&](auto a, auto b){\n return a.first * N + a.second < b.first * N + b.second;\n });\n ll best_cost = 1LL << 60;\n vector best_ops;\n for (int trial = 0; trial < 50; trial++) {\n vector> bias(N, vector(N, 0));\n bool use_raster = false;\n if (trial == 0) {\n // zero bias nearest\n } else if (trial <= 35) {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) bias[i][j] = (rand() % 5) - 2;\n } else {\n use_raster = true;\n }\n auto rem_supply = orig_supply;\n auto rem_demand = orig_demand;\n vector ops;\n int cr = 0, cc = 0;\n ll load = 0;\n auto has_supp = [&]() -> bool {\n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) if (rem_supply[i][j] > 0) return true;\n return false;\n };\n auto find_closest = [&](bool is_supply, int curr_r, int curr_c) -> pair {\n int min_val = INT_MAX;\n int ti = -1, tj = -1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n int d = abs(i - curr_r) + abs(j - curr_c);\n int eff = d * 10 + bias[i][j];\n bool has = is_supply ? (rem_supply[i][j] > 0) : (rem_demand[i][j] > 0);\n if (has && (eff < min_val || (eff == min_val && (i < ti || (i == ti && j < tj))))) {\n min_val = eff;\n ti = i; tj = j;\n }\n }\n }\n return {ti, tj};\n };\n auto find_next_raster_supply = [&](int curr_r, int curr_c) -> pair {\n for (auto& p : supply_list) {\n if (rem_supply[p.first][p.second] > 0) return p;\n }\n return {-1,-1};\n };\n auto do_move = [&](int tr, int tc) {\n while (cr != tr) {\n if (cr < tr) { ops.push_back(\"D\"); cr++; } else { ops.push_back(\"U\"); cr--; }\n }\n while (cc != tc) {\n if (cc < tc) { ops.push_back(\"R\"); cc++; } else { ops.push_back(\"L\"); cc--; }\n }\n };\n bool valid_run = true;\n while ((has_supp() || load > 0) && valid_run) {\n if (ops.size() > 90000) { valid_run = false; break; }\n if (load == 0) {\n if (!has_supp()) break;\n pair tgt;\n if (use_raster) {\n tgt = find_next_raster_supply(cr, cc);\n } else {\n tgt = find_closest(true, cr, cc);\n }\n if (tgt.first == -1) { valid_run = false; break; }\n do_move(tgt.first, tgt.second);\n int d = rem_supply[cr][cc];\n if (d > 0) {\n ops.push_back(\"+\" + to_string(d));\n load += d;\n rem_supply[cr][cc] = 0;\n }\n } else {\n auto tgt = find_closest(false, cr, cc);\n if (tgt.first == -1) { valid_run = false; break; }\n do_move(tgt.first, tgt.second);\n ll d = min(load, (ll)rem_demand[cr][cc]);\n if (d > 0) {\n ops.push_back(\"-\" + to_string((int)d));\n load -= d;\n rem_demand[cr][cc] -= (int)d;\n } else {\n valid_run = false; break;\n }\n }\n }\n if (!valid_run || load != 0) continue;\n ll this_c = simulate_cost(ops, h);\n if (this_c < best_cost) {\n best_cost = this_c;\n best_ops = std::move(ops);\n }\n }\n for (auto& s : best_ops) {\n cout << s << endl;\n }\n return 0;\n}","ahc035":"#include \nusing namespace std;\n\nint main() {\n int N, M, T;\n cin >> N >> M >> T;\n int SEED_CNT = 2 * N * (N - 1);\n vector> seeds(SEED_CNT, vector(M));\n for (int i = 0; i < SEED_CNT; i++) {\n for (int j = 0; j < M; j++) {\n cin >> seeds[i][j];\n }\n }\n srand(12345);\n for (int t = 0; t < T; t++) {\n vector val(SEED_CNT, 0);\n vector maxd(M, 0);\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n val[k] += seeds[k][l];\n if (seeds[k][l] > maxd[l]) maxd[l] = seeds[k][l];\n }\n }\n vector>> car_list(M);\n for (int l = 0; l < M; l++) {\n for (int k = 0; k < SEED_CNT; k++) {\n if (seeds[k][l] == maxd[l]) {\n car_list[l].emplace_back(val[k], k);\n }\n }\n sort(car_list[l].rbegin(), car_list[l].rend());\n }\n set must_s;\n for (int l = 0; l < M; l++) {\n for (int i = 0; i < min(3, (int)car_list[l].size()); i++) {\n must_s.insert(car_list[l][i].second);\n }\n }\n vector must(must_s.begin(), must_s.end());\n vector alls(SEED_CNT);\n iota(alls.begin(), alls.end(), 0);\n sort(alls.begin(), alls.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector in_chosen(SEED_CNT, false);\n vector selected;\n for (int m : must) {\n if (!in_chosen[m]) {\n selected.push_back(m);\n in_chosen[m] = true;\n }\n }\n for (int cand : alls) {\n if (!in_chosen[cand]) {\n selected.push_back(cand);\n in_chosen[cand] = true;\n if ((int)selected.size() == N * N) break;\n }\n }\n while ((int)selected.size() < N * N) {\n for (int k = 0; k < SEED_CNT; k++) {\n if (!in_chosen[k]) {\n selected.push_back(k);\n in_chosen[k] = true;\n break;\n }\n }\n }\n sort(selected.begin(), selected.end(), [&](int a, int b) {\n return val[a] > val[b] || (val[a] == val[b] && a < b);\n });\n vector> comp(36, vector(36, 0));\n for (int i = 0; i < 36; i++) {\n for (int j = 0; j < 36; j++) {\n if (i == j) continue;\n int s1 = selected[i];\n int s2 = selected[j];\n for (int l = 0; l < M; l++) {\n comp[i][j] += max(seeds[s1][l], seeds[s2][l]);\n }\n }\n }\n auto calc = [&](const vector& assignment) -> long long {\n long long tot = 0;\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N - 1; c++) {\n int i1 = assignment[r * N + c];\n int i2 = assignment[r * N + c + 1];\n long long cval = comp[i1][i2];\n tot += cval * cval;\n }\n }\n for (int r = 0; r < N - 1; r++) {\n for (int c = 0; c < N; c++) {\n int i1 = assignment[r * N + c];\n int i2 = assignment[(r + 1) * N + c];\n long long cval = comp[i1][i2];\n tot += cval * cval;\n }\n }\n return tot;\n };\n vector best_asg(36);\n long long best_global = -1;\n for (int run = 0; run < 4; run++) {\n vector asg(36);\n if (run == 0) {\n vector mixed(36);\n int left = 0, right = 35;\n for (int k = 0; k < 36; k++) {\n if (k % 2 == 0) mixed[k] = left++;\n else mixed[k] = right--;\n }\n for (int p = 0; p < 36; p++) asg[p] = mixed[p];\n } else if (run == 1) {\n iota(asg.begin(), asg.end(), 0);\n } else if (run == 2) {\n iota(asg.begin(), asg.end(), 0);\n reverse(asg.begin(), asg.end());\n } else {\n vector mixed2(36);\n int left = 0, right = 35;\n for (int k = 0; k < 36; k++) {\n if (k % 2 == 0) mixed2[k] = right--;\n else mixed2[k] = left++;\n }\n for (int p = 0; p < 36; p++) asg[p] = mixed2[p];\n }\n long long cur_score = calc(asg);\n long long local_best = cur_score;\n vector local_best_asg = asg;\n double Temp = 100000.0;\n int num_iters = 4000;\n for (int it = 0; it < num_iters; it++) {\n int p1 = rand() % 36;\n int p2 = rand() % 36;\n if (p1 == p2) {\n it--;\n continue;\n }\n swap(asg[p1], asg[p2]);\n long long new_score = calc(asg);\n long long d = new_score - cur_score;\n bool accept = (d > 0);\n if (!accept && Temp > 1e-9) {\n double prob = exp(static_cast(d) / Temp);\n if ((rand() / (double)RAND_MAX) < prob) accept = true;\n }\n if (accept) {\n cur_score = new_score;\n if (cur_score > local_best) {\n local_best = cur_score;\n local_best_asg = asg;\n }\n } else {\n swap(asg[p1], asg[p2]);\n }\n Temp *= 0.995;\n }\n if (local_best > best_global) {\n best_global = local_best;\n best_asg = local_best_asg;\n }\n }\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < N; c++) {\n int sidx = best_asg[r * N + c];\n cout << selected[sidx];\n if (c < N - 1) cout << \" \";\n }\n cout << endl;\n }\n cout.flush();\n for (int k = 0; k < SEED_CNT; k++) {\n for (int l = 0; l < M; l++) {\n cin >> seeds[k][l];\n }\n }\n }\n return 0;\n}","ahc038":"#include \nusing namespace std;\n\nconst int MAXN = 31;\nint DELX[4] = {0, 1, 0, -1};\nint DELY[4] = {1, 0, -1, 0};\n\nint main() {\n int N, M, Vv;\n cin >> N >> M >> Vv;\n vector S(N), T(N);\n for (int i = 0; i < N; i++) cin >> S[i];\n for (int i = 0; i < N; i++) cin >> T[i];\n\n bool needs_pick[MAXN][MAXN] = {};\n bool needs_place[MAXN][MAXN] = {};\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (S[i][j] == '1' && T[i][j] == '0') needs_pick[i][j] = true;\n if (S[i][j] == '0' && T[i][j] == '1') needs_place[i][j] = true;\n }\n }\n\n int VP = 5;\n cout << VP << endl;\n for (int i = 0; i < 4; i++) {\n cout << 0 << \" \" << 1 << endl;\n }\n int ix = 0, iy = 0;\n cout << ix << \" \" << iy << endl;\n\n vector operations;\n operations.push_back(\"..RRL.....\");\n operations.push_back(\"...R......\");\n\n int crx = 0, cry = 0;\n int fdir[4] = {0, 1, 2, 3};\n bool held[4] = {false};\n\n while (operations.size() < 100000) {\n bool can_act_now = false;\n for (int fi = 0; fi < 4; fi++) {\n int fx = crx + DELX[fdir[fi]];\n int fy = cry + DELY[fdir[fi]];\n if (fx < 0 || fx >= N || fy < 0 || fy >= N) continue;\n if ((!held[fi] && needs_pick[fx][fy]) || (held[fi] && needs_place[fx][fy])) {\n can_act_now = true;\n }\n }\n\n char mch = '.';\n int nx = crx, ny = cry;\n if (!can_act_now) {\n int best_d = INT_MAX;\n int tx = -1, ty = -1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (needs_pick[i][j]) {\n for (int fi = 0; fi < 4; fi++) {\n if (held[fi]) continue;\n int cx = i - DELX[fdir[fi]];\n int cy = j - DELY[fdir[fi]];\n if (cx >= 0 && cx < N && cy >= 0 && cy < N) {\n int dd = abs(cx - crx) + abs(cy - cry);\n if (dd < best_d) {\n best_d = dd;\n tx = cx; ty = cy;\n }\n }\n }\n }\n if (needs_place[i][j]) {\n for (int fi = 0; fi < 4; fi++) {\n if (!held[fi]) continue;\n int cx = i - DELX[fdir[fi]];\n int cy = j - DELY[fdir[fi]];\n if (cx >= 0 && cx < N && cy >= 0 && cy < N) {\n int dd = abs(cx - crx) + abs(cy - cry);\n if (dd < best_d) {\n best_d = dd;\n tx = cx; ty = cy;\n }\n }\n }\n }\n }\n }\n if (best_d == INT_MAX) {\n // stuck: try rotating a held finger to unlock new directions\n bool rotated = false;\n for (int fi = 0; fi < 4; fi++) {\n if (held[fi]) {\n string rstep(10, '.');\n rstep[fi + 1] = 'R';\n operations.push_back(rstep);\n fdir[fi] = (fdir[fi] + 1) % 4;\n rotated = true;\n break;\n }\n }\n if (!rotated) break;\n continue;\n }\n if (best_d > 0) {\n int dx = tx - crx;\n int dy = ty - cry;\n if (dx != 0) {\n mch = (dx > 0 ? 'D' : 'U');\n nx += (dx > 0 ? 1 : -1);\n } else if (dy != 0) {\n mch = (dy > 0 ? 'R' : 'L');\n ny += (dy > 0 ? 1 : -1);\n }\n }\n }\n\n if (nx < 0 || nx >= N || ny < 0 || ny >= N) {\n nx = crx; ny = cry; mch = '.';\n }\n\n bool wact[4] = {};\n for (int fi = 0; fi < 4; fi++) {\n int fx = nx + DELX[fdir[fi]];\n int fy = ny + DELY[fdir[fi]];\n if (fx < 0 || fx >= N || fy < 0 || fy >= N) continue;\n if (!held[fi] && needs_pick[fx][fy]) wact[fi] = true;\n else if (held[fi] && needs_place[fx][fy]) wact[fi] = true;\n }\n\n string step(10, '.');\n step[0] = mch;\n for (int fi = 0; fi < 4; fi++) {\n if (wact[fi]) step[6 + fi] = 'P';\n }\n operations.push_back(step);\n\n crx = nx;\n cry = ny;\n for (int fi = 0; fi < 4; fi++) {\n if (wact[fi]) {\n int fx = crx + DELX[fdir[fi]];\n int fy = cry + DELY[fdir[fi]];\n if (fx >= 0 && fx < N && fy >= 0 && fy < N) {\n if (!held[fi] && needs_pick[fx][fy]) {\n held[fi] = true;\n needs_pick[fx][fy] = false;\n } else if (held[fi] && needs_place[fx][fy]) {\n held[fi] = false;\n needs_place[fx][fy] = false;\n }\n }\n }\n }\n\n bool still_needed = false;\n for (int i = 0; i < N && !still_needed; i++) {\n for (int j = 0; j < N; j++) {\n if (needs_pick[i][j] || needs_place[i][j]) {\n still_needed = true;\n break;\n }\n }\n }\n if (!still_needed) {\n bool any_held = false;\n for (int i = 0; i < 4; i++) if (held[i]) any_held = true;\n if (!any_held) break;\n }\n }\n\n for (auto& op : operations) {\n cout << op << endl;\n }\n return 0;\n}","ahc039":"#include \nusing namespace std;\n\nstruct Point {\n int x, y, v;\n};\n\nstruct RectCandidate {\n int s, lx, rx, ly, ry;\n};\n\nint main() {\n int N;\n cin >> N;\n vector pts(2 * N);\n for (int i = 0; i < 2 * N; i++) {\n cin >> pts[i].x >> pts[i].y;\n pts[i].v = (i < N ? 1 : -1);\n }\n vector xs, ys;\n for (auto& p : pts) {\n xs.push_back(p.x);\n ys.push_back(p.y);\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n sort(ys.begin(), ys.end());\n ys.erase(unique(ys.begin(), ys.end()), ys.end());\n int kx = xs.size();\n int ky = ys.size();\n long long stride = ky + 1LL;\n vector ps((kx + 1LL) * stride, 0);\n for (auto& p : pts) {\n int rx = lower_bound(xs.begin(), xs.end(), p.x) - xs.begin() + 1;\n int ry = lower_bound(ys.begin(), ys.end(), p.y) - ys.begin() + 1;\n ps[rx * stride + ry] += p.v;\n }\n for (int i = 1; i <= kx; i++) {\n for (int j = 1; j <= ky; j++) {\n ps[i * stride + j] += ps[(i - 1) * stride + j] + ps[i * stride + (j - 1)] - ps[(i - 1) * stride + (j - 1)];\n }\n }\n auto getsum = [&](int x1, int y1, int x2, int y2) -> int {\n if (x1 > x2 || y1 > y2) return 0;\n x1 = max(x1, 0);\n y1 = max(y1, 0);\n x2 = min(x2, kx);\n y2 = min(y2, ky);\n long long v1 = ps[(long long)x2 * stride + y2];\n long long v2 = (x1 >= 1 ? ps[(long long)(x1 - 1) * stride + y2] : 0LL);\n long long v3 = (y1 >= 1 ? ps[(long long)x2 * stride + (y1 - 1)] : 0LL);\n long long v4 = ((x1 >= 1 && y1 >= 1) ? ps[(long long)(x1 - 1) * stride + (y1 - 1)] : 0LL);\n return (int)(v1 - v2 - v3 + v4);\n };\n int best_score = 0;\n int best_lx = 1, best_rx = 1, best_ly = 1, best_ry = 2;\n // mackerel bb\n int m_minx = INT_MAX, m_maxx = INT_MIN, m_miny = INT_MAX, m_maxy = INT_MIN;\n for (int i = 0; i < N; i++) {\n m_minx = min(m_minx, pts[i].x);\n m_maxx = max(m_maxx, pts[i].x);\n m_miny = min(m_miny, pts[i].y);\n m_maxy = max(m_maxy, pts[i].y);\n }\n int lx_m = lower_bound(xs.begin(), xs.end(), m_minx) - xs.begin() + 1;\n int rx_m = lower_bound(xs.begin(), xs.end(), m_maxx) - xs.begin() + 1;\n int ly_m = lower_bound(ys.begin(), ys.end(), m_miny) - ys.begin() + 1;\n int ry_m = lower_bound(ys.begin(), ys.end(), m_maxy) - ys.begin() + 1;\n int bb_s = getsum(lx_m, ly_m, rx_m, ry_m);\n if (bb_s > best_score) {\n best_score = bb_s;\n best_lx = lx_m; best_rx = rx_m;\n best_ly = ly_m; best_ry = ry_m;\n }\n // cluster mackerels for additional starts\n vector macks;\n for (int ii = 0; ii < N; ii++) macks.push_back(pts[ii]);\n sort(macks.begin(), macks.end(), [](const Point& a, const Point& b) {\n return a.x < b.x || (a.x == b.x && a.y < b.y);\n });\n int idx = 0;\n const int CLUSTER_GAP = 10000;\n while (idx < N) {\n int cminx = macks[idx].x, cmaxx = macks[idx].x;\n int cminy = macks[idx].y, cmaxy = macks[idx].y;\n idx++;\n while (idx < N && (macks[idx].x - cmaxx <= CLUSTER_GAP)) {\n cminx = min(cminx, macks[idx].x);\n cmaxx = max(cmaxx, macks[idx].x);\n cminy = min(cminy, macks[idx].y);\n cmaxy = max(cmaxy, macks[idx].y);\n idx++;\n }\n int lx_c = lower_bound(xs.begin(), xs.end(), cminx) - xs.begin() + 1;\n int rx_c = lower_bound(xs.begin(), xs.end(), cmaxx) - xs.begin() + 1;\n int ly_c = lower_bound(ys.begin(), ys.end(), cminy) - ys.begin() + 1;\n int ry_c = lower_bound(ys.begin(), ys.end(), cmaxy) - ys.begin() + 1;\n int cs = getsum(lx_c, ly_c, rx_c, ry_c);\n if (cs > best_score) {\n best_score = cs;\n best_lx = lx_c; best_rx = rx_c;\n best_ly = ly_c; best_ry = ry_c;\n }\n }\n int S = 130;\n vector xcuts;\n int stepx = max(1, kx / S);\n for (int j = 0; j <= kx; j += stepx) xcuts.push_back(j);\n if (xcuts.back() != kx) xcuts.push_back(kx);\n vector ycuts;\n int stepy = max(1, ky / S);\n for (int j = 0; j <= ky; j += stepy) ycuts.push_back(j);\n if (ycuts.back() != ky) ycuts.push_back(ky);\n using T = pair>;\n priority_queue, greater> pq;\n for (size_t pi = 0; pi < xcuts.size(); ++pi) {\n for (size_t qi = pi; qi < xcuts.size(); ++qi) {\n int lx_ = xcuts[pi] + 1;\n int rx_ = xcuts[qi];\n if (lx_ > rx_ || rx_ - lx_ < 0) continue;\n for (size_t pj = 0; pj < ycuts.size(); ++pj) {\n for (size_t qj = pj; qj < ycuts.size(); ++qj) {\n int ly_ = ycuts[pj] + 1;\n int ry_ = ycuts[qj];\n if (ly_ > ry_ || ry_ - ly_ < 1) continue;\n if (rx_ - lx_ < 1) continue;\n int s = getsum(lx_, ly_, rx_, ry_);\n if (s > best_score) {\n best_score = s;\n best_lx = lx_; best_rx = rx_;\n best_ly = ly_; best_ry = ry_;\n }\n if (s > 70) {\n array info = {lx_, rx_, ly_, ry_};\n pq.push({s, info});\n if (pq.size() > 20) pq.pop();\n }\n }\n }\n }\n }\n vector promising;\n while (!pq.empty()) {\n auto [sc, arr] = pq.top(); pq.pop();\n promising.push_back({sc, arr[0], arr[1], arr[2], arr[3]});\n }\n promising.push_back({best_score, best_lx, best_rx, best_ly, best_ry});\n // optimize promising\n for (auto& r : promising) {\n int clx = r.lx, crx = r.rx, cly = r.ly, cry = r.ry;\n int cs = r.s;\n for (int it = 0; it < 5; ++it) {\n bool ch = false;\n for (int d = -60; d <= 60; ++d) {\n int nl = clx + d;\n if (nl < 1 || nl > crx) continue;\n int ns = getsum(nl, cly, crx, cry);\n if (ns > cs) {\n clx = nl; cs = ns; ch = true;\n }\n }\n for (int d = -60; d <= 60; ++d) {\n int nr = crx + d;\n if (nr < clx || nr > kx) continue;\n int ns = getsum(clx, cly, nr, cry);\n if (ns > cs) {\n crx = nr; cs = ns; ch = true;\n }\n }\n for (int d = -60; d <= 60; ++d) {\n int nl = cly + d;\n if (nl < 1 || nl > cry) continue;\n int ns = getsum(clx, nl, crx, cry);\n if (ns > cs) {\n cly = nl; cs = ns; ch = true;\n }\n }\n for (int d = -60; d <= 60; ++d) {\n int nr = cry + d;\n if (nr < cly || nr > ky) continue;\n int ns = getsum(clx, cly, crx, nr);\n if (ns > cs) {\n cry = nr; cs = ns; ch = true;\n }\n }\n if (!ch) break;\n }\n if (cs > best_score) {\n best_score = cs;\n best_lx = clx; best_rx = crx;\n best_ly = cly; best_ry = cry;\n }\n }\n // fine coordinate-wise tuning on final best\n {\n int clx = best_lx, crx = best_rx, cly = best_ly, cry = best_ry;\n int cs = best_score;\n for (int it = 0; it < 3; ++it) {\n for (int d = -80; d <= 80; ++d) {\n int nl = clx + d;\n if (nl < 1 || nl > crx) continue;\n int ns = getsum(nl, cly, crx, cry);\n if (ns > cs) {\n clx = nl; cs = ns;\n }\n }\n for (int d = -80; d <= 80; ++d) {\n int nr = crx + d;\n if (nr < clx || nr > kx) continue;\n int ns = getsum(clx, cly, nr, cry);\n if (ns > cs) {\n crx = nr; cs = ns;\n }\n }\n for (int d = -80; d <= 80; ++d) {\n int nl = cly + d;\n if (nl < 1 || nl > cry) continue;\n int ns = getsum(clx, nl, crx, cry);\n if (ns > cs) {\n cly = nl; cs = ns;\n }\n }\n for (int d = -80; d <= 80; ++d) {\n int nr = cry + d;\n if (nr < cly || nr > ky) continue;\n int ns = getsum(clx, cly, crx, nr);\n if (ns > cs) {\n cry = nr; cs = ns;\n }\n }\n }\n if (cs > best_score) {\n best_score = cs;\n best_lx = clx; best_rx = crx;\n best_ly = cly; best_ry = cry;\n }\n }\n if (best_score < 1) {\n auto p = pts[0];\n int xx = p.x, yy = p.y;\n int pl = max(0, xx - 1), pr = min(100000, xx + 1);\n int pb = max(0, yy - 1), pt = min(100000, yy + 1);\n cout << 4 << endl;\n cout << pl << \" \" << pb << endl;\n cout << pr << \" \" << pb << endl;\n cout << pr << \" \" << pt << endl;\n cout << pl << \" \" << pt << endl;\n return 0;\n }\n int lx = best_lx, rx = best_rx, ly = best_ly, ry = best_ry;\n int minx_ = (lx - 1 >= 0 && lx - 1 < kx ? xs[lx - 1] : 0);\n int maxx_ = (rx - 1 >= 0 && rx - 1 < kx ? xs[rx - 1] : 100000);\n int miny_ = (ly - 1 >= 0 && ly - 1 < ky ? ys[ly - 1] : 0);\n int maxy_ = (ry - 1 >= 0 && ry - 1 < ky ? ys[ry - 1] : 100000);\n int pleft = (lx >= 2 ? xs[lx - 2] + 1 : 0);\n int pright = (rx < kx ? xs[rx] - 1 : 100000);\n int pbot = (ly >= 2 ? ys[ly - 2] + 1 : 0);\n int ptop = (ry < ky ? ys[ry] - 1 : 100000);\n if (pleft >= pright || pbot >= ptop) {\n pleft = minx_ - 5; if (pleft < 0) pleft = 0;\n pright = maxx_ + 5; if (pright > 100000) pright = 100000;\n pbot = miny_ - 5; if (pbot < 0) pbot = 0;\n ptop = maxy_ + 5; if (ptop > 100000) ptop = 100000;\n if (pleft >= pright) {\n pleft = minx_;\n pright = maxx_ + 1; if (pright > 100000) pright = 100000;\n }\n if (pbot >= ptop) {\n pbot = miny_;\n ptop = maxy_ + 1; if (ptop > 100000) ptop = 100000;\n }\n }\n if (pleft == pright) {\n if (pright < 100000) pright++;\n else if (pleft > 0) pleft--;\n }\n if (pbot == ptop) {\n if (ptop < 100000) ptop++;\n else if (pbot > 0) pbot--;\n }\n cout << 4 << endl;\n cout << pleft << \" \" << pbot << endl;\n cout << pright << \" \" << pbot << endl;\n cout << pright << \" \" << ptop << endl;\n cout << pleft << \" \" << ptop << endl;\n return 0;\n}","ahc040":"#include \nusing namespace std;\nusing ll = long long;\n\nstruct RectPos {\n ll x, y, w, h;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N, T;\n ll sigma;\n cin >> N >> T >> sigma;\n vector WW(N), HH(N);\n for(int i = 0; i < N; i++) {\n cin >> WW[i] >> HH[i];\n }\n mt19937 rng(1234LL);\n vector>> cands;\n auto add_special = [&](bool is_row) {\n vector> acts;\n for(int i = 0; i < N; i++) {\n ll a = WW[i], b = HH[i];\n int r = is_row ? (a >= b ? 0 : 1) : (a <= b ? 0 : 1);\n char d = is_row ? 'L' : 'U';\n acts.emplace_back(i, r, d, -1);\n }\n cands.push_back(acts);\n };\n add_special(true); // opt row\n add_special(false); // opt col\n // r=0 row\n {\n vector> acts;\n for(int i = 0; i < N; i++) acts.emplace_back(i, 0, 'L', -1);\n cands.push_back(acts);\n }\n // r=1 row\n {\n vector> acts;\n for(int i = 0; i < N; i++) acts.emplace_back(i, 1, 'L', -1);\n cands.push_back(acts);\n }\n // r=0 col\n {\n vector> acts;\n for(int i = 0; i < N; i++) acts.emplace_back(i, 0, 'U', -1);\n cands.push_back(acts);\n }\n // r=1 col\n {\n vector> acts;\n for(int i = 0; i < N; i++) acts.emplace_back(i, 1, 'U', -1);\n cands.push_back(acts);\n }\n ll best_meas = LLONG_MAX;\n int best_idx = 0;\n const int MAX_VARIANTS = 200;\n for(int t = 0; t < T; t++) {\n vector> current_acts;\n int current_cand_idx = -1;\n if(t < 6) {\n current_acts = cands[t];\n current_cand_idx = t;\n } else if((int)cands.size() < MAX_VARIANTS) {\n rng.seed(1234ULL + (unsigned long long)cands.size() * 123457ULL);\n vector> acts;\n vector pos(N);\n vector active;\n ll cW = 0, cH = 0;\n for(int i = 0; i < N; i++) {\n ll wi = WW[i], hi = HH[i];\n ll best_noisy = LLONG_MAX / 2;\n int br = -1, bbv = -2;\n char bd = ' ';\n ll bpx = -1, bpy = -1;\n for(int r = 0; r < 2; r++) {\n ll cw = r ? hi : wi;\n ll ch = r ? wi : hi;\n int bstart = max(-1, i - 60);\n for(int bb = bstart; bb < i; bb++) {\n int b = bb;\n for(char d : {'U', 'L'}) {\n ll px = 0, py = 0;\n if(d == 'U') {\n px = (b == -1 ? 0 : pos[b].x + pos[b].w);\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n } else {\n py = (b == -1 ? 0 : pos[b].y + pos[b].h);\n ll mr = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(py, re.y) < min(py + ch, re.y + re.h)) {\n mr = max(mr, re.x + re.w);\n }\n }\n px = mr;\n }\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) {\n ol = true;\n break;\n }\n }\n if(ol) continue;\n ll nW = max(cW, px + cw);\n ll nH = max(cH, py + ch);\n ll sc = nW + nH + llabs(nW - nH) / 8;\n bool is_pure = (cands.size() % 5 == 0);\n ll noisy_sc = sc + (is_pure ? 0LL : (rng() % 1200));\n if(noisy_sc < best_noisy) {\n best_noisy = noisy_sc;\n br = r;\n bd = d;\n bbv = b;\n bpx = px;\n bpy = py;\n }\n }\n }\n }\n if(br != -1) {\n ll cw = br ? HH[i] : WW[i];\n ll ch = br ? WW[i] : HH[i];\n pos[i].x = bpx;\n pos[i].y = bpy;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, bpx + cw);\n cH = max(cH, bpy + ch);\n acts.emplace_back(i, br, bd, bbv);\n } else {\n int r = 0; char d = 'U'; int b = -1;\n ll cw = WW[i]; ll ch = HH[i];\n ll px = 0, py = 0;\n ll mb = 0;\n for(int j : active) {\n RectPos &re = pos[j];\n if(max(px, re.x) < min(px + cw, re.x + re.w)) {\n mb = max(mb, re.y + re.h);\n }\n }\n py = mb;\n bool ol = false;\n for(int j : active) {\n RectPos &re = pos[j];\n ll lx = max(px, re.x);\n ll rx = min(px + cw, re.x + re.w);\n ll ty = max(py, re.y);\n ll by = min(py + ch, re.y + re.h);\n if(lx < rx && ty < by) ol = true;\n }\n if(!ol) {\n pos[i].x = px;\n pos[i].y = py;\n pos[i].w = cw;\n pos[i].h = ch;\n active.push_back(i);\n cW = max(cW, px + cw);\n cH = max(cH, py + ch);\n acts.emplace_back(i, r, d, b);\n }\n }\n }\n cands.push_back(acts);\n current_acts = std::move(acts);\n current_cand_idx = (int)cands.size() - 1;\n } else {\n current_cand_idx = best_idx;\n current_acts = cands[best_idx];\n }\n cout << current_acts.size() << '\\n';\n for(auto [p, r, d, b] : current_acts) {\n cout << p << ' ' << r << ' ' << d << ' ' << b << '\\n';\n }\n cout.flush();\n ll Wp, Hp;\n cin >> Wp >> Hp;\n ll meas = Wp + Hp;\n if(meas < best_meas) {\n best_meas = meas;\n best_idx = current_cand_idx;\n }\n }\n return 0;\n}","ahc041":"#include \nusing namespace std;\n\nint main() {\n int N, M, H_;\n cin >> N >> M >> H_;\n int H = H_;\n vector A(N);\n for (auto& a : A) cin >> a;\n vector> g(N);\n for (int i = 0; i < M; i++) {\n int u, v;\n cin >> u >> v;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n vector X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n auto count_unc = [&](int c, const vector& cov) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n int ct = cov[c] ? 0 : 1;\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) ct++;\n }\n }\n }\n }\n return ct;\n };\n auto mark_ball = [&](int c, vector& cov, int& uncc) {\n vector d(N, -1);\n d[c] = 0;\n queue qq;\n qq.push(c);\n if (!cov[c]) {\n cov[c] = true;\n uncc--;\n }\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n if (d[u] == H) continue;\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) {\n qq.push(v);\n if (!cov[v]) {\n cov[v] = true;\n uncc--;\n }\n }\n }\n }\n }\n };\n vector cov(N, false);\n int uncc = N;\n vector S_greedy;\n while (uncc > 0) {\n int best_val = -2000000000, bc = -1;\n for (int c = 0; c < N; c++) {\n int ct = count_unc(c, cov);\n int val = ct * 12 - A[c];\n if (ct > 0 && val > best_val) {\n best_val = val;\n bc = c;\n }\n }\n if (best_val == -2000000000) break;\n S_greedy.push_back(bc);\n mark_ball(bc, cov, uncc);\n }\n auto get_farthest_initial = [&]() -> vector {\n vector cs;\n vector d(N, 1000000);\n while (true) {\n int md = -1, fv = -1;\n for (int i = 0; i < N; i++) {\n if (d[i] > md) {\n md = d[i];\n fv = i;\n }\n }\n if (md <= H) break;\n cs.push_back(fv);\n vector nd(N, 1000000);\n queue q;\n for (int s : cs) {\n nd[s] = 0;\n q.push(s);\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (nd[v] > nd[u] + 1) {\n nd[v] = nd[u] + 1;\n q.push(v);\n }\n }\n }\n d = nd;\n }\n return cs;\n };\n vector S_far = get_farthest_initial();\n auto get_eval = [&](const vector& cs) -> long long {\n if (cs.empty() && N > 0) return -1e18;\n vector d(N, -1);\n queue q;\n for (int s : cs) {\n if (d[s] == -1) {\n d[s] = 0;\n q.push(s);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n if (d[v] <= H) q.push(v);\n }\n }\n }\n long long sm = 0;\n for (int i = 0; i < N; i++) {\n if (d[i] < 0 || d[i] > H) return -1e18;\n sm += 1LL * d[i] * A[i];\n }\n return sm;\n };\n long long sc_greedy = get_eval(S_greedy);\n long long sc_far = get_eval(S_far);\n vector S_init = (sc_far > sc_greedy ? S_far : S_greedy);\n vector> nears(N);\n for (int i = 0; i < N; i++) {\n for (int j = i + 1; j < N; j++) {\n double dist = hypot(X[i] - X[j], Y[i] - Y[j]);\n if (dist <= 180.0) {\n nears[i].push_back(j);\n nears[j].push_back(i);\n }\n }\n }\n int sumA = 0;\n for (int a : A) sumA += a;\n int avgA = sumA / N;\n vector lowA_nodes;\n for (int i = 0; i < N; i++) if (A[i] <= avgA + 8) lowA_nodes.push_back(i);\n auto run_optimization = [&](int seed) -> pair, long long> {\n mt19937 rng_local(seed);\n vector best_S_local = S_init;\n long long best_score_local = get_eval(S_init);\n vector curr_S_local = S_init;\n long long curr_sc_local = best_score_local;\n int n_iters = 12000;\n for (int it = 0; it < n_iters; it++) {\n vector news = curr_S_local;\n int movt = rng_local() % 10;\n bool skipped = true;\n if (movt < 6 && !news.empty()) {\n int idx = rng_local() % news.size();\n int old = news[idx];\n int newc;\n if (rng_local() % 3 == 0 && !lowA_nodes.empty()) {\n newc = lowA_nodes[rng_local() % lowA_nodes.size()];\n } else if (nears[old].empty() || (rng_local() % 5 == 0)) {\n newc = rng_local() % N;\n } else {\n int k = rng_local() % nears[old].size();\n newc = nears[old][k];\n }\n bool isin = false;\n for (int s : news) if (s == newc) {\n isin = true;\n break;\n }\n if (!isin) {\n news[idx] = newc;\n skipped = false;\n }\n } else if (movt < 8 && news.size() >= 2) {\n int idx = rng_local() % news.size();\n news.erase(news.begin() + idx);\n skipped = false;\n } else if (!news.empty() && news.size() < 18) {\n int newc;\n if (!lowA_nodes.empty()) {\n newc = lowA_nodes[rng_local() % lowA_nodes.size()];\n } else {\n newc = rng_local() % N;\n }\n bool isin = false;\n for (int s : news) if (s == newc) isin = true;\n if (!isin) {\n news.push_back(newc);\n skipped = false;\n }\n }\n if (skipped) continue;\n long long nsc = get_eval(news);\n if (nsc > -1e17) {\n double del = (double)(nsc - curr_sc_local);\n double T = 120.0 * pow(0.9999, it);\n if (T < 3.0) T = 3.0;\n bool accept = (del >= 0);\n if (!accept) {\n double prob = exp(del / T);\n if ((double)rng_local() / (double)rng_local.max() < prob) accept = true;\n }\n if (accept) {\n curr_S_local = news;\n curr_sc_local = nsc;\n if (nsc > best_score_local) {\n best_score_local = nsc;\n best_S_local = news;\n }\n }\n }\n }\n bool improved = true;\n int max_passes = 6;\n int pass_cnt = 0;\n while (improved && pass_cnt < max_passes) {\n pass_cnt++;\n improved = false;\n for (size_t i = 0; i < best_S_local.size(); i++) {\n vector tmp = best_S_local;\n tmp.erase(tmp.begin() + i);\n long long sc = get_eval(tmp);\n if (sc > best_score_local) {\n best_score_local = sc;\n best_S_local = tmp;\n improved = true;\n break;\n }\n }\n if (improved) continue;\n for (size_t i = 0; i < best_S_local.size(); i++) {\n int oldc = best_S_local[i];\n vector cands;\n if (!nears[oldc].empty()) {\n cands = nears[oldc];\n } else {\n for (int j = 0; j < 40; j++) cands.push_back(rng_local() % N);\n }\n for (int j = 0; j < 20; j++) cands.push_back(rng_local() % N);\n long long best_del = -1;\n int best_new = oldc;\n for (int nc : cands) {\n bool isin = false;\n for (int s : best_S_local) if (s == nc && nc != oldc) {\n isin = true;\n break;\n }\n if (isin) continue;\n vector tmp = best_S_local;\n tmp[i] = nc;\n long long nsc = get_eval(tmp);\n if (nsc > best_score_local && (nsc - best_score_local > best_del)) {\n best_del = nsc - best_score_local;\n best_new = nc;\n }\n }\n if (best_del > 0) {\n best_S_local[i] = best_new;\n best_score_local += best_del;\n improved = true;\n break;\n }\n }\n }\n return {best_S_local, best_score_local};\n };\n vector, long long>> results;\n results.push_back(run_optimization(42));\n results.push_back(run_optimization(12345));\n results.push_back(run_optimization(67890));\n results.push_back(run_optimization(11111));\n int best_idx = 0;\n for (int i = 1; i < results.size(); i++) {\n if (results[i].second > results[best_idx].second) best_idx = i;\n }\n vector best_S = results[best_idx].first;\n long long cur_sc = get_eval(best_S);\n // final targeted optimization\n {\n bool did_remove = true;\n while (did_remove) {\n did_remove = false;\n for (size_t i = 0; i < best_S.size(); ++i) {\n vector tmp = best_S;\n tmp.erase(tmp.begin() + i);\n long long nsc = get_eval(tmp);\n if (nsc > cur_sc) {\n cur_sc = nsc;\n best_S = tmp;\n did_remove = true;\n break;\n }\n }\n }\n vector d(N, -1);\n queue qq;\n for (int s : best_S) {\n d[s] = 0;\n qq.push(s);\n }\n while (!qq.empty()) {\n int u = qq.front();\n qq.pop();\n for (int v : g[u]) {\n if (d[v] == -1) {\n d[v] = d[u] + 1;\n qq.push(v);\n }\n }\n }\n vector> impacts;\n for (int i = 0; i < N; i++) {\n if (d[i] > 2) impacts.emplace_back((long long)d[i] * A[i], i);\n }\n sort(impacts.rbegin(), impacts.rend());\n int trials = min(40, (int)impacts.size());\n for (size_t ci = 0; ci < best_S.size(); ci++) {\n for (int t = 0; t < trials; t++) {\n int nc = impacts[t].second;\n bool isin = false;\n for (int s : best_S) if (s == nc) {\n isin = true;\n break;\n }\n if (isin) continue;\n vector tmp = best_S;\n tmp[ci] = nc;\n long long nsc = get_eval(tmp);\n if (nsc > cur_sc) {\n cur_sc = nsc;\n best_S = tmp;\n break;\n }\n }\n }\n }\n auto get_par = [&](const vector& cs) {\n vector parent(N, -1);\n vector dist(N, -1);\n queue q;\n for (int c : cs) {\n if (dist[c] == -1) {\n dist[c] = 0;\n parent[c] = -1;\n q.push(c);\n }\n }\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n for (int v : g[u]) {\n if (dist[v] == -1) {\n dist[v] = dist[u] + 1;\n parent[v] = u;\n if (dist[v] <= H) q.push(v);\n }\n }\n }\n return parent;\n };\n vector p = get_par(best_S);\n for (int i = 0; i < N; i++) {\n cout << p[i];\n if (i + 1 < N) cout << \" \";\n else cout << \"\\n\";\n }\n}","ahc042":"#include \nusing namespace std;\n\nint count_free_dirs(int r, int c, const vector& bd, int N) {\n int cnt = 0;\n bool free_u = true;\n for(int i = 0; i < r; i++) if(bd[i][c] == 'o') {free_u = false; break;}\n if(free_u) cnt++;\n bool free_d = true;\n for(int i = r + 1; i < N; i++) if(bd[i][c] == 'o') {free_d = false; break;}\n if(free_d) cnt++;\n bool free_l = true;\n for(int j = 0; j < c; j++) if(bd[r][j] == 'o') {free_l = false; break;}\n if(free_l) cnt++;\n bool free_r = true;\n for(int j = c + 1; j < N; j++) if(bd[r][j] == 'o') {free_r = false; break;}\n if(free_r) cnt++;\n return cnt;\n}\n\nint get_min_dist(int r, int c, const vector& bd, int N) {\n int md = INT_MAX / 2;\n bool fu = true;\n for(int i=0; i& bd, int* ocnt, int N) {\n char removed_c = '.';\n if(d == 'U') {\n removed_c = bd[0][p];\n for(int r = 0; r < N - 1; r++) bd[r][p] = bd[r + 1][p];\n bd[N - 1][p] = '.';\n } else if(d == 'D') {\n removed_c = bd[N - 1][p];\n for(int r = N - 1; r > 0; r--) bd[r][p] = bd[r - 1][p];\n bd[0][p] = '.';\n } else if(d == 'L') {\n removed_c = bd[p][0];\n for(int c = 0; c < N - 1; c++) bd[p][c] = bd[p][c + 1];\n bd[p][N - 1] = '.';\n } else if(d == 'R') {\n removed_c = bd[p][N - 1];\n for(int c = N - 1; c > 0; c--) bd[p][c] = bd[p][c - 1];\n bd[p][0] = '.';\n }\n if(ocnt && removed_c == 'x') (*ocnt)--;\n}\n\nint main() {\n int N;\n cin >> N;\n vector board(N);\n for(auto &s : board) cin >> s;\n vector cur_board = board;\n vector> moves;\n int oni_left = 0;\n for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) if(cur_board[i][j] == 'x') oni_left++;\n auto get_reverse = [](char d) -> char {\n if(d == 'U') return 'D';\n if(d == 'D') return 'U';\n if(d == 'L') return 'R';\n if(d == 'R') return 'L';\n return ' ';\n };\n while(oni_left > 0 && moves.size() < 1600) {\n int old_pot = 0;\n for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) if(cur_board[i][j] == 'x') old_pot += get_min_dist(i, j, cur_board, N);\n double best_score = -1.0;\n char best_d = ' ';\n int best_p = -1;\n int best_k = 0;\n bool best_can_non = false;\n // up\n for(int j = 0; j < N; j++) {\n int mk = N;\n for(int r = 0; r < N; r++) if(cur_board[r][j] == 'o') {mk = r; break;}\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n int removed_pot = 0;\n for(int r = 0; r < k; r++) if(cur_board[r][j] == 'x') {\n nx++;\n removed_pot += get_min_dist(r, j, cur_board, N);\n }\n if(nx == 0) continue;\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < k; t++) apply_shift('U', j, tmp, &dum, N);\n bool can_non = true;\n for(int ii = 0; can_non && ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') {\n if(count_free_dirs(ii, jj, tmp, N) == 0) can_non = false;\n }\n double eff_cost = can_non ? (double)k : 2.0 * k;\n double rat = (double)nx / eff_cost;\n int new_pot;\n if(can_non) {\n new_pot = 0;\n for(int ii = 0; ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') new_pot += get_min_dist(ii, jj, tmp, N);\n } else {\n new_pot = old_pot - removed_pot;\n }\n double delta = old_pot - new_pot;\n double score = rat + delta * 0.015;\n if(score > best_score + 1e-9 || (abs(score - best_score) < 1e-9 && can_non && !best_can_non) || (abs(score - best_score) < 1e-9 && can_non == best_can_non && k < best_k)) {\n best_score = score;\n best_d = 'U';\n best_p = j;\n best_k = k;\n best_can_non = can_non;\n }\n }\n }\n // down\n for(int j = 0; j < N; j++) {\n int mk = 0;\n for(int r = N - 1; r >= 0; r--) {\n if(cur_board[r][j] == 'o') break;\n mk++;\n }\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n int removed_pot = 0;\n for(int r = N - k; r < N; r++) if(cur_board[r][j] == 'x') {\n nx++;\n removed_pot += get_min_dist(r, j, cur_board, N);\n }\n if(nx == 0) continue;\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < k; t++) apply_shift('D', j, tmp, &dum, N);\n bool can_non = true;\n for(int ii = 0; can_non && ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') {\n if(count_free_dirs(ii, jj, tmp, N) == 0) can_non = false;\n }\n double eff_cost = can_non ? (double)k : 2.0 * k;\n double rat = (double)nx / eff_cost;\n int new_pot;\n if(can_non) {\n new_pot = 0;\n for(int ii = 0; ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') new_pot += get_min_dist(ii, jj, tmp, N);\n } else {\n new_pot = old_pot - removed_pot;\n }\n double delta = old_pot - new_pot;\n double score = rat + delta * 0.015;\n if(score > best_score + 1e-9 || (abs(score - best_score) < 1e-9 && can_non && !best_can_non) || (abs(score - best_score) < 1e-9 && can_non == best_can_non && k < best_k)) {\n best_score = score;\n best_d = 'D';\n best_p = j;\n best_k = k;\n best_can_non = can_non;\n }\n }\n }\n // left\n for(int i = 0; i < N; i++) {\n int mk = N;\n for(int c = 0; c < N; c++) if(cur_board[i][c] == 'o') {mk = c; break;}\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n int removed_pot = 0;\n for(int c = 0; c < k; c++) if(cur_board[i][c] == 'x') {\n nx++;\n removed_pot += get_min_dist(i, c, cur_board, N);\n }\n if(nx == 0) continue;\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < k; t++) apply_shift('L', i, tmp, &dum, N);\n bool can_non = true;\n for(int ii = 0; can_non && ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') {\n if(count_free_dirs(ii, jj, tmp, N) == 0) can_non = false;\n }\n double eff_cost = can_non ? (double)k : 2.0 * k;\n double rat = (double)nx / eff_cost;\n int new_pot;\n if(can_non) {\n new_pot = 0;\n for(int ii = 0; ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') new_pot += get_min_dist(ii, jj, tmp, N);\n } else {\n new_pot = old_pot - removed_pot;\n }\n double delta = old_pot - new_pot;\n double score = rat + delta * 0.015;\n if(score > best_score + 1e-9 || (abs(score - best_score) < 1e-9 && can_non && !best_can_non) || (abs(score - best_score) < 1e-9 && can_non == best_can_non && k < best_k)) {\n best_score = score;\n best_d = 'L';\n best_p = i;\n best_k = k;\n best_can_non = can_non;\n }\n }\n }\n // right\n for(int i = 0; i < N; i++) {\n int mk = 0;\n for(int c = N - 1; c >= 0; c--) {\n if(cur_board[i][c] == 'o') break;\n mk++;\n }\n for(int k = 1; k <= mk; k++) {\n int nx = 0;\n int removed_pot = 0;\n for(int c = N - k; c < N; c++) if(cur_board[i][c] == 'x') {\n nx++;\n removed_pot += get_min_dist(i, c, cur_board, N);\n }\n if(nx == 0) continue;\n auto tmp = cur_board;\n int dum = 0;\n for(int t = 0; t < k; t++) apply_shift('R', i, tmp, &dum, N);\n bool can_non = true;\n for(int ii = 0; can_non && ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') {\n if(count_free_dirs(ii, jj, tmp, N) == 0) can_non = false;\n }\n double eff_cost = can_non ? (double)k : 2.0 * k;\n double rat = (double)nx / eff_cost;\n int new_pot;\n if(can_non) {\n new_pot = 0;\n for(int ii = 0; ii < N; ii++) for(int jj = 0; jj < N; jj++) if(tmp[ii][jj] == 'x') new_pot += get_min_dist(ii, jj, tmp, N);\n } else {\n new_pot = old_pot - removed_pot;\n }\n double delta = old_pot - new_pot;\n double score = rat + delta * 0.015;\n if(score > best_score + 1e-9 || (abs(score - best_score) < 1e-9 && can_non && !best_can_non) || (abs(score - best_score) < 1e-9 && can_non == best_can_non && k < best_k)) {\n best_score = score;\n best_d = 'R';\n best_p = i;\n best_k = k;\n best_can_non = can_non;\n }\n }\n }\n if(best_score < 0) break;\n char fwd = best_d;\n char revv = get_reverse(fwd);\n if(best_can_non) {\n for(int t = 0; t < best_k; t++) {\n apply_shift(fwd, best_p, cur_board, &oni_left, N);\n moves.emplace_back(fwd, best_p);\n }\n } else {\n for(int t = 0; t < best_k; t++) {\n apply_shift(fwd, best_p, cur_board, &oni_left, N);\n moves.emplace_back(fwd, best_p);\n }\n for(int t = 0; t < best_k; t++) {\n apply_shift(revv, best_p, cur_board, &oni_left, N);\n moves.emplace_back(revv, best_p);\n }\n }\n }\n for(auto [d, p] : moves) {\n cout << d << \" \" << p << endl;\n }\n return 0;\n}","ahc044":"#include \nusing namespace std;\nusing ll = long long;\n\nvector simulate(const vector& a, const vector& b, int N, ll L) {\n vector cnt(N, 0);\n int cur = 0;\n for (ll w = 0; w < L; w++) {\n cnt[cur]++;\n if (w + 1 == L) break;\n ll t = cnt[cur];\n int nxt = (t % 2 == 1 ? a[cur] : b[cur]);\n cur = nxt;\n }\n return cnt;\n}\n\nll calc_error(const vector& cnt, const vector& T) {\n ll e = 0;\n for (size_t i = 0; i < T.size(); i++) e += abs(cnt[i] - T[i]);\n return e;\n}\n\nint main() {\n int N;\n ll L;\n cin >> N >> L;\n vector T(N);\n for (auto& x : T) cin >> x;\n\n vector> emp(N);\n for (int i = 0; i < N; i++) emp[i] = {T[i], i};\n sort(emp.rbegin(), emp.rend());\n\n vector> candidates;\n for (int k = 1; k <= N; k++) {\n for (int d = 0; d <= k; d++) {\n bool zero_in = false;\n for (int j = 0; j < k; j++) if (emp[j].second == 0) zero_in = true;\n double vis_S = zero_in ? (double)L : (double)L - 1.0;\n double denom = k + d;\n double r = vis_S / denom;\n vector ass(N, 0);\n for (int j = 0; j < k; j++) {\n int id = emp[j].second;\n ll tapp = round((j < d ? 2LL : 1LL) * r);\n ass[id] = tapp;\n }\n if (!zero_in) ass[0] = 1;\n ll e = 0;\n for (int i = 0; i < N; i++) e += abs(ass[i] - T[i]);\n candidates.emplace_back(e, k, d);\n }\n }\n sort(candidates.begin(), candidates.end());\n\n ll best_e = LLONG_MAX;\n vector best_a(N), best_b(N);\n\n size_t max_cand = min(70UL, candidates.size());\n for (size_t ci = 0; ci < max_cand; ci++) {\n auto [_, k, d] = candidates[ci];\n vector is_dou(N, 0), is_in(N, 0);\n for (int j = 0; j < k; j++) {\n is_in[emp[j].second] = 1;\n if (j < d) is_dou[emp[j].second] = 1;\n }\n vector S;\n for (int j = 0; j < k; j++) S.push_back(emp[j].second);\n\n vector> orders = {S};\n auto idord = S; sort(idord.begin(), idord.end()); orders.push_back(idord);\n auto ascd = S; reverse(ascd.begin(), ascd.end()); orders.push_back(ascd);\n\n for (auto cyc : orders) {\n if (k > 0 && cyc.empty()) continue;\n vector cura(N, 0), curb(N, 0);\n int ent = k > 0 ? cyc[0] : 0;\n for (int i = 0; i < N; i++) if (!is_in[i]) cura[i] = curb[i] = ent;\n for (size_t i = 0; i < cyc.size(); i++) {\n int u = cyc[i];\n int nxt = cyc[(i + 1) % cyc.size()];\n if (is_dou[u]) {\n cura[u] = u;\n curb[u] = nxt;\n } else {\n cura[u] = nxt;\n curb[u] = nxt;\n }\n }\n if (k == 0) for (int i = 0; i < N; i++) cura[i] = curb[i] = 0;\n\n auto cnt = simulate(cura, curb, N, L);\n ll e = calc_error(cnt, T);\n if (e < best_e) {\n best_e = e;\n best_a = cura;\n best_b = curb;\n }\n }\n }\n\n mt19937 rng(12345);\n int n_local = 450;\n for (int trial = 0; trial < n_local; trial++) {\n vector cura = best_a, curb = best_b;\n\n if (rng() % 5 == 0) {\n vector used;\n auto cnt = simulate(cura, curb, N, L);\n for (int i = 0; i < N; i++) if (cnt[i] > L / 300) used.push_back(i);\n if (!used.empty()) {\n random_shuffle(used.begin(), used.end(), [&](int) { return rng() % used.size(); });\n for (size_t i = 0; i < used.size(); i++) {\n int u = used[i];\n int nxt = used[(i + 1) % used.size()];\n if (T[u] * 2 > T[0]) {\n cura[u] = u; curb[u] = nxt;\n } else {\n cura[u] = nxt; curb[u] = nxt;\n }\n }\n }\n } else {\n uniform_int_distribution uid(0, N - 1);\n int u = uid(rng);\n if (rng() % 10 == 0 && cura[u] == u) {\n curb[u] = uid(rng);\n } else {\n bool change_a = (rng() % 2 == 0);\n int new_t = uid(rng);\n if (change_a) cura[u] = new_t;\n else curb[u] = new_t;\n }\n }\n\n auto cnt = simulate(cura, curb, N, L);\n ll newe = calc_error(cnt, T);\n if (newe < best_e) {\n best_e = newe;\n best_a = cura;\n best_b = curb;\n }\n }\n\n {\n vector cura = best_a, curb = best_b;\n auto cnt = simulate(cura, curb, N, L);\n ll cur_e = calc_error(cnt, T);\n for (int i = 0; i < N; i++) {\n if (T[i] > T[0] / 2 && cura[i] != i) {\n vector tmp_a = cura, tmp_b = curb;\n tmp_a[i] = i;\n auto tmp_cnt = simulate(tmp_a, tmp_b, N, L);\n ll ne = calc_error(tmp_cnt, T);\n if (ne < cur_e) {\n cur_e = ne;\n cura = tmp_a;\n curb = tmp_b;\n }\n }\n }\n if (cur_e < best_e) {\n best_e = cur_e;\n best_a = cura;\n best_b = curb;\n }\n }\n\n {\n vector cura = best_a, curb = best_b;\n auto cnt = simulate(cura, curb, N, L);\n ll cur_e = calc_error(cnt, T);\n\n vector> bad;\n for (int i = 0; i < N; i++) {\n if (cnt[i] > L / 300) bad.emplace_back(abs(cnt[i] - T[i]), i);\n }\n sort(bad.rbegin(), bad.rend());\n for (int i = 0; i < min(10, (int)bad.size()); i++) {\n int u = bad[i].second;\n if (cura[u] == u || curb[u] == u) continue;\n vector tmp_a = cura, tmp_b = curb;\n tmp_a[u] = tmp_b[u] = (N > 1 ? (u + 1) % N : 0);\n auto tmp_cnt = simulate(tmp_a, tmp_b, N, L);\n ll ne = calc_error(tmp_cnt, T);\n if (ne < cur_e) {\n cur_e = ne;\n cura = tmp_a;\n curb = tmp_b;\n }\n }\n if (cur_e < best_e) {\n best_e = cur_e;\n best_a = cura;\n best_b = curb;\n }\n }\n\n {\n vector cura = best_a, curb = best_b;\n auto cnt = simulate(cura, curb, N, L);\n ll cur_e = calc_error(cnt, T);\n\n vector high, low;\n for (int i = 0; i < N; i++) {\n if (T[i] > 2 * T[0] / 5) high.push_back(i);\n else if (T[i] < T[0] / 5 && cnt[i] < 10) low.push_back(i);\n }\n\n int nboost = min(15, min((int)high.size(), (int)low.size()));\n for (int i = 0; i < nboost; i++) {\n int h = high[i];\n int helper = low[i];\n vector tmp_a = cura, tmp_b = curb;\n tmp_a[h] = helper;\n tmp_b[helper] = h;\n tmp_a[helper] = h;\n auto tmp_cnt = simulate(tmp_a, tmp_b, N, L);\n ll ne = calc_error(tmp_cnt, T);\n if (ne < cur_e) {\n cur_e = ne;\n cura = tmp_a;\n curb = tmp_b;\n }\n }\n if (cur_e < best_e) {\n best_e = cur_e;\n best_a = cura;\n best_b = curb;\n }\n }\n\n for (int i = 0; i < N; i++) {\n cout << best_a[i] << \" \" << best_b[i] << endl;\n }\n}","ahc045":"#include \nusing namespace std;\n\nint main() {\n int N, M, maxQ, L, W;\n cin >> N >> M >> maxQ >> L >> W;\n vector G(M);\n for (auto &x : G) cin >> x;\n vector cx(N), cy(N);\n for (int i = 0; i < N; i++) {\n int lx, rx, ly, ry;\n cin >> lx >> rx >> ly >> ry;\n cx[i] = (lx + rx) / 2.0;\n cy[i] = (ly + ry) / 2.0;\n }\n // Global discovery phase\n int n_global = min(40, maxQ / 5);\n vector> global_edges;\n int global_used = 0;\n if (n_global > 0) {\n vector gseeds;\n vector gmin_d(N, 1e18);\n gseeds.push_back(0);\n gmin_d[0] = -1.0;\n for (int j = 0; j < N; j++) {\n gmin_d[j] = hypot(cx[0] - cx[j], cy[0] - cy[j]);\n }\n for (int i = 1; i < n_global; i++) {\n double bd = -1.0;\n int best = -1;\n for (int j = 0; j < N; j++) {\n if (gmin_d[j] > bd) {\n bd = gmin_d[j];\n best = j;\n }\n }\n gseeds.push_back(best);\n for (int j = 0; j < N; j++) {\n double d = hypot(cx[best] - cx[j], cy[best] - cy[j]);\n if (d < gmin_d[j]) gmin_d[j] = d;\n }\n }\n for (int cen : gseeds) {\n vector> closest;\n for (int j = 0; j < N; j++) if (j != cen) {\n double d = hypot(cx[cen] - cx[j], cy[cen] - cy[j]);\n closest.emplace_back(d, j);\n }\n sort(closest.begin(), closest.end());\n vector sub = {cen};\n int need = L - 1;\n for (int t = 0; t < need && t < (int)closest.size(); t++) {\n sub.push_back(closest[t].second);\n }\n if ((int)sub.size() < 2) continue;\n cout << \"? \" << (int)sub.size();\n for (int c : sub) cout << \" \" << c;\n cout << endl;\n for (int e = 0; e < (int)sub.size() - 1; e++) {\n int a, b;\n cin >> a >> b;\n global_edges.emplace_back(a, b);\n }\n global_used++;\n }\n }\n vector seeds(M);\n vector min_d(N, 1e18);\n seeds[0] = 0;\n for (int j = 0; j < N; j++) {\n min_d[j] = hypot(cx[0] - cx[j], cy[0] - cy[j]);\n }\n min_d[0] = -1.0;\n for (int k = 1; k < M; k++) {\n double best_md = -1.0; int best_j = -1;\n for (int j = 0; j < N; j++) {\n if (min_d[j] > best_md) {\n best_md = min_d[j];\n best_j = j;\n }\n }\n seeds[k] = best_j;\n for (int j = 0; j < N; j++) {\n double d = hypot(cx[best_j] - cx[j], cy[best_j] - cy[j]);\n if (d < min_d[j]) min_d[j] = d;\n }\n }\n vector> clusters(M);\n vector group_id(N, -1);\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n clusters[k].push_back(s);\n group_id[s] = k;\n }\n vector> min_dist_cluster(M, vector(N, 1e18));\n for (int k = 0; k < M; k++) {\n int s = seeds[k];\n for (int j = 0; j < N; j++) {\n min_dist_cluster[k][j] = hypot(cx[s] - cx[j], cy[s] - cy[j]);\n }\n }\n vector clus_size(M, 1);\n vector used(N, false);\n for (int k = 0; k < M; k++) used[seeds[k]] = true;\n for (int toadd = 0; toadd < N - M; toadd++) {\n double bd = 1e18; int bc = -1, bg = -1;\n for (int j = 0; j < N; j++) if (!used[j]) {\n for (int k = 0; k < M; k++) if (clus_size[k] < G[k]) {\n if (min_dist_cluster[k][j] < bd) {\n bd = min_dist_cluster[k][j];\n bc = j; bg = k;\n }\n }\n }\n used[bc] = true;\n clusters[bg].push_back(bc);\n group_id[bc] = bg;\n clus_size[bg]++;\n for (int j = 0; j < N; j++) if (!used[j]) {\n double nd = hypot(cx[bc] - cx[j], cy[bc] - cy[j]);\n if (nd < min_dist_cluster[bg][j]) min_dist_cluster[bg][j] = nd;\n }\n }\n vector q_alloc(M, 0);\n int base = 0;\n for (int k = 0; k < M; k++) {\n if ((int)clusters[k].size() >= 3) {\n q_alloc[k] = 1;\n base++;\n }\n }\n int budget_for_local = maxQ - global_used;\n int remain = max(0, budget_for_local - base);\n long long weight = 0;\n for (int k = 0; k < M; k++) {\n if ((int)clusters[k].size() > L) {\n weight += (long long)clusters[k].size() - 1;\n }\n }\n if (weight > 0 && remain > 0) {\n for (int k = 0; k < M; k++) {\n if ((int)clusters[k].size() > L) {\n long long extra = (long long)remain * ((long long)clusters[k].size() - 1) / weight;\n q_alloc[k] += (int)extra;\n }\n }\n }\n int actual_total = 0;\n for (int v : q_alloc) actual_total += v;\n if (actual_total > maxQ - global_used) {\n int over = actual_total - (maxQ - global_used);\n for (int k = M-1; k >= 0 && over > 0; k--) {\n if ((int)clusters[k].size() > L && q_alloc[k] > 1) {\n int can_reduce = min(q_alloc[k]-1, over);\n q_alloc[k] -= can_reduce;\n over -= can_reduce;\n }\n }\n }\n vector>> queries_per_group(M);\n for (int k = 0; k < M; k++) {\n int gs = (int)clusters[k].size();\n if (gs < 3) continue;\n auto cits = clusters[k];\n sort(cits.begin(), cits.end(), [&](int a, int b) {\n if (abs(cx[a] - cx[b]) > 1e-9) return cx[a] < cx[b];\n if (abs(cy[a] - cy[b]) > 1e-9) return cy[a] < cy[b];\n return a < b;\n });\n clusters[k] = cits;\n if (gs <= L) {\n queries_per_group[k].push_back(cits);\n } else {\n int want = min(q_alloc[k], gs);\n if (want > 0) {\n vector local_seeds;\n vector lmin_d(gs, 1e18);\n int fidx = 0;\n local_seeds.push_back(cits[0]);\n lmin_d[0] = -1.0;\n for (int j = 0; j < gs; j++) {\n int jcity = cits[j];\n int fcity = cits[0];\n lmin_d[j] = hypot(cx[fcity] - cx[jcity], cy[fcity] - cy[jcity]);\n }\n for (int ii = 1; ii < want && ii < gs; ii++) {\n double bd = -1.0; int bi = -1;\n for (int j = 0; j < gs; j++) {\n if (lmin_d[j] > bd) {\n bd = lmin_d[j];\n bi = j;\n }\n }\n local_seeds.push_back(cits[bi]);\n for (int j = 0; j < gs; j++) {\n int jcity = cits[j];\n int newc = cits[bi];\n double d = hypot(cx[newc] - cx[jcity], cy[newc] - cy[jcity]);\n if (d < lmin_d[j]) lmin_d[j] = d;\n }\n }\n for (int cen_city : local_seeds) {\n vector> closest;\n for (int j = 0; j < gs; j++) {\n int other = cits[j];\n if (other == cen_city) continue;\n double d = hypot(cx[cen_city] - cx[other], cy[cen_city] - cy[other]);\n closest.emplace_back(d, other);\n }\n sort(closest.begin(), closest.end());\n vector sub = {cen_city};\n for (int t = 0; t < L - 1 && t < (int)closest.size(); t++) {\n sub.push_back(closest[t].second);\n }\n queries_per_group[k].push_back(sub);\n }\n }\n }\n }\n int total_q = 0;\n for (int k = 0; k < M; k++) total_q += (int)queries_per_group[k].size();\n if (total_q > maxQ - global_used) {\n vector> gq;\n for (int k = 0; k < M; k++) if (!queries_per_group[k].empty()) {\n gq.emplace_back(-(int)queries_per_group[k].size(), k);\n }\n sort(gq.begin(), gq.end());\n int excess = total_q - (maxQ - global_used);\n for (auto &[neg, k] : gq) {\n int keep_min = (int)queries_per_group[k].size() > 1 ? 1 : 0;\n int can_remove = min(excess, (int)queries_per_group[k].size() - keep_min);\n for (int r = 0; r < can_remove; r++) {\n queries_per_group[k].pop_back();\n }\n excess -= can_remove;\n if (excess <= 0) break;\n }\n }\n vector>> mst_edges(M);\n for (int k = 0; k < M; k++) {\n for (auto &sub : queries_per_group[k]) {\n int ls = (int)sub.size();\n cout << \"? \" << ls;\n for (int c : sub) cout << \" \" << c;\n cout << endl;\n for (int e = 0; e < ls - 1; e++) {\n int a, b;\n cin >> a >> b;\n mst_edges[k].emplace_back(a, b);\n }\n }\n }\n for (auto [aa, bb] : global_edges) {\n int ga = group_id[aa], gb = group_id[bb];\n if (ga == gb && ga >= 0) {\n mst_edges[ga].emplace_back(aa, bb);\n }\n }\n cout << \"!\" << endl;\n for (int k = 0; k < M; k++) {\n auto &cits = clusters[k];\n int gs = (int)cits.size();\n for (int i = 0; i < gs; i++) {\n if (i > 0) cout << \" \";\n cout << cits[i];\n }\n cout << endl;\n if (gs == 1) continue;\n if (gs == 2) {\n cout << cits[0] << \" \" << cits[1] << endl;\n continue;\n }\n map,int> freq;\n for (auto [aa,bb] : mst_edges[k]) {\n int u = min(aa,bb), v = max(aa,bb);\n freq[{u,v}]++;\n }\n vector> cands;\n for (auto &p : freq) {\n int u = p.first.first, v = p.first.second;\n cands.emplace_back(-p.second, u, v);\n }\n for (int i = 0; i < gs; i++) {\n for (int j = i + 1; j < gs; j++) {\n int u = cits[i], v = cits[j];\n int mu = min(u,v), mv = max(u,v);\n if (freq.count({mu,mv})) continue;\n double dd = hypot(cx[u] - cx[v], cy[u] - cy[v]);\n cands.emplace_back(1e9 + dd, mu, mv);\n }\n }\n sort(cands.begin(), cands.end());\n vector parent(N);\n for (int i = 0; i < N; i++) parent[i] = i;\n auto find = [&](auto &self, int x) -> int {\n return parent[x] == x ? x : parent[x] = self(self, parent[x]);\n };\n vector> selected;\n for (auto [d, u, v] : cands) {\n int pu = find(find, u), pv = find(find, v);\n if (pu != pv) {\n parent[pu] = pv;\n selected.emplace_back(u, v);\n if ((int)selected.size() == gs - 1) break;\n }\n }\n for (auto [a, b] : selected) {\n cout << a << \" \" << b << endl;\n }\n }\n return 0;\n}","ahc046":"#include \nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector> points(M);\n for (auto& p : points) {\n cin >> p.first >> p.second;\n }\n vector> sequence;\n pair current = points[0];\n int di[4] = {-1, 1, 0, 0};\n int dj[4] = {0, 0, -1, 1};\n char dch[4] = {'U', 'D', 'L', 'R'};\n for (int t = 1; t < M; t++) {\n int gi = points[t].first;\n int gj = points[t].second;\n vector> dist(N, vector(N, -1));\n vector> pre(N, vector(N, -1));\n vector> ac(N, vector(N, ' '));\n vector> dc(N, vector(N, ' '));\n queue> q;\n int si = current.first;\n int sj = current.second;\n dist[si][sj] = 0;\n q.push({si, sj});\n while (!q.empty()) {\n auto [i, j] = q.front();\n q.pop();\n for (int tp = 0; tp < 2; tp++) {\n for (int d = 0; d < 4; d++) {\n int ni, nj;\n if (tp == 0) {\n ni = i + di[d];\n nj = j + dj[d];\n if (ni < 0 || ni >= N || nj < 0 || nj >= N) continue;\n } else {\n int ci = i, cj = j;\n while (true) {\n int ti = ci + di[d];\n int tj = cj + dj[d];\n if (ti < 0 || ti >= N || tj < 0 || tj >= N) break;\n ci = ti;\n cj = tj;\n }\n ni = ci;\n nj = cj;\n }\n if (dist[ni][nj] != -1) continue;\n dist[ni][nj] = dist[i][j] + 1;\n pre[ni][nj] = i * N + j;\n ac[ni][nj] = (tp == 0 ? 'M' : 'S');\n dc[ni][nj] = dch[d];\n q.push({ni, nj});\n }\n }\n }\n vector> this_path;\n int ci = gi, cj = gj;\n while (dist[ci][cj] > 0) {\n this_path.emplace_back(ac[ci][cj], dc[ci][cj]);\n int p = pre[ci][cj];\n ci = p / N;\n cj = p % N;\n }\n reverse(this_path.begin(), this_path.end());\n for (auto& p : this_path) sequence.push_back(p);\n current = {gi, gj};\n }\n for (auto& p : sequence) {\n cout << p.first << \" \" << p.second << endl;\n }\n}"}}}