結果
問題 | No.5020 Averaging |
ユーザー |
|
提出日時 | 2024-02-25 14:12:59 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 411 ms / 1,000 ms |
コード長 | 3,607 bytes |
コンパイル時間 | 2,291 ms |
コンパイル使用メモリ | 216,728 KB |
実行使用メモリ | 6,676 KB |
スコア | 32,634,228 |
最終ジャッジ日時 | 2024-02-25 14:13:29 |
合計ジャッジ時間 | 14,864 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 50 |
ソースコード
#include <bits/stdc++.h>// clang-format offusing namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;#define debug1(a) { cerr<<#a<<":"<<a<<endl; }#define debug2(a,b) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<endl; }#define debug3(a,b,c) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<" "<<#c<<":"<<c<<endl; }#define debug4(a,b,c,d) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<" "<<#c<<":"<<c<<" "<<#d<<":"<<d<<endl; }struct card_t { ll a; ll b; };bool operator==(const card_t &lhs, const card_t &rhs) { return (lhs.a == rhs.a && lhs.b == rhs.b); }bool operator!=(const card_t &lhs, const card_t &rhs) { return !(lhs == rhs); }bool operator<(const card_t &lhs, const card_t &rhs) {if (lhs.a != rhs.a){return lhs.a<rhs.a;}return lhs.b<rhs.b;}card_t avg(card_t x, card_t y){return card_t{(x.a+y.a)/2,(x.b+y.b)/2};}std::ostream &operator<<(std::ostream &os, card_t &pt) {string s;s = "(" + to_string(ll(pt.a)) + ", " + to_string(ll(pt.b)) + ")";return os << s;};// clang-format onconst int OPLIMIT = 50;const int N = 45;const ll F17 = 500000000000000000;card_t INIT_AB[N];double evaluate(card_t x) {double da = abs(x.a - F17);double db = abs(x.b - F17);return max(da, db) * 100 + min(da, db);}void rec(vector<int> &ops, vector<bool> &used, pair<double, vector<int>> &best_result, card_t used_total, card_t used_zero, int maxops, vector<card_t> &now_cards) {if (ops.size() >= 1) {auto new_zero = avg(used_total, used_zero);double e = evaluate(new_zero);if (e < best_result.first) {best_result = {e, ops};}}if (ops.size() >= maxops) {return;}for (int j = 0; j < N; j++) {if (j == 0) continue;if (used[j]) continue;used[j] = true;ops.push_back(j);card_t nxt_used_total = (used_total.a <= 0) ? now_cards[j] : avg(now_cards[j], used_total);rec(ops, used, best_result, nxt_used_total, used_zero, maxops, now_cards);ops.pop_back();used[j] = false;}}void do_op(int i, int j, vector<card_t> &now_cards, vector<pair<int, int>> &result) {card_t avg_ = avg(now_cards[i], now_cards[j]);now_cards[i] = avg_;now_cards[j] = avg_;result.push_back({i, j});}void output(vector<pair<int, int>> &result) {cout << result.size() << endl;for (auto p : result) {cout << p.first + 1 << " " << p.second + 1 << endl;}}void solve() {vector<card_t> now_cards(N);for (int i = 0; i < N; i++) {now_cards[i] = INIT_AB[i];}vector<pair<int, int>> result;while (result.size() <= OPLIMIT) {card_t init_0 = now_cards[0];vector<int> ops;vector<bool> used(N);pair<double, vector<int>> best_result = {evaluate(now_cards[0]) * 0.999, {}};int maxop = min(4, OPLIMIT - 1 - int(result.size()));rec(ops, used, best_result, {0, 0}, init_0, maxop, now_cards);if (best_result.second.size()) {for (int j = 0; j < int(best_result.second.size()) - 1; j++) {do_op(best_result.second[j], best_result.second[j + 1], now_cards, result);}do_op(best_result.second.back(), 0, now_cards, result);debug2(best_result.first, now_cards[0]);} else {break;}}output(result);}int main() {int n;cin >> n;for (int i = 0; i < n; i++) {ll a, b;cin >> a >> b;INIT_AB[i] = card_t{a, b};}solve();return 0;}