結果
問題 | No.5020 Averaging |
ユーザー | hirakuuuu |
提出日時 | 2024-02-25 15:09:58 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 993 ms / 1,000 ms |
コード長 | 3,850 bytes |
コンパイル時間 | 3,175 ms |
コンパイル使用メモリ | 266,668 KB |
実行使用メモリ | 6,676 KB |
スコア | 37,640,399 |
最終ジャッジ日時 | 2024-02-25 15:10:54 |
合計ジャッジ時間 | 55,609 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge10 |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 992 ms
6,676 KB |
testcase_01 | AC | 992 ms
6,676 KB |
testcase_02 | AC | 991 ms
6,676 KB |
testcase_03 | AC | 990 ms
6,676 KB |
testcase_04 | AC | 991 ms
6,676 KB |
testcase_05 | AC | 992 ms
6,676 KB |
testcase_06 | AC | 991 ms
6,676 KB |
testcase_07 | AC | 991 ms
6,676 KB |
testcase_08 | AC | 991 ms
6,676 KB |
testcase_09 | AC | 991 ms
6,676 KB |
testcase_10 | AC | 991 ms
6,676 KB |
testcase_11 | AC | 991 ms
6,676 KB |
testcase_12 | AC | 992 ms
6,676 KB |
testcase_13 | AC | 990 ms
6,676 KB |
testcase_14 | AC | 991 ms
6,676 KB |
testcase_15 | AC | 991 ms
6,676 KB |
testcase_16 | AC | 991 ms
6,676 KB |
testcase_17 | AC | 991 ms
6,676 KB |
testcase_18 | AC | 991 ms
6,676 KB |
testcase_19 | AC | 991 ms
6,676 KB |
testcase_20 | AC | 991 ms
6,676 KB |
testcase_21 | AC | 991 ms
6,676 KB |
testcase_22 | AC | 990 ms
6,676 KB |
testcase_23 | AC | 991 ms
6,676 KB |
testcase_24 | AC | 991 ms
6,676 KB |
testcase_25 | AC | 991 ms
6,676 KB |
testcase_26 | AC | 991 ms
6,676 KB |
testcase_27 | AC | 991 ms
6,676 KB |
testcase_28 | AC | 991 ms
6,676 KB |
testcase_29 | AC | 991 ms
6,676 KB |
testcase_30 | AC | 991 ms
6,676 KB |
testcase_31 | AC | 992 ms
6,676 KB |
testcase_32 | AC | 991 ms
6,676 KB |
testcase_33 | AC | 991 ms
6,676 KB |
testcase_34 | AC | 990 ms
6,676 KB |
testcase_35 | AC | 991 ms
6,676 KB |
testcase_36 | AC | 991 ms
6,676 KB |
testcase_37 | AC | 991 ms
6,676 KB |
testcase_38 | AC | 991 ms
6,676 KB |
testcase_39 | AC | 991 ms
6,676 KB |
testcase_40 | AC | 991 ms
6,676 KB |
testcase_41 | AC | 991 ms
6,676 KB |
testcase_42 | AC | 990 ms
6,676 KB |
testcase_43 | AC | 991 ms
6,676 KB |
testcase_44 | AC | 993 ms
6,676 KB |
testcase_45 | AC | 991 ms
6,676 KB |
testcase_46 | AC | 991 ms
6,676 KB |
testcase_47 | AC | 991 ms
6,676 KB |
testcase_48 | AC | 991 ms
6,676 KB |
testcase_49 | AC | 991 ms
6,676 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, a, n) for(int i = a; i < n; i++) #define rrep(i, a, n) for(int i = a; i >= n; i--) #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> constexpr ll MOD = 1000000007; constexpr int IINF = 1001001001; constexpr ll INF = 1LL<<60; template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;} template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;} // 問題 // https://yukicoder.me/problems/no/5020 const int TIME_LIMIT = 990; const double start_temp = 10, end_temp = 5; int main(){ auto start_time = chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count(); int n; cin >> n; vector<tuple<ll, ll, ll>> card(n), init(n); rep(i, 0, n){ ll a, b; cin >> a >> b; card[i] = {a, b, i}; init[i] = {a, b, i}; } sort(card.begin(), card.end()); vector<pair<ll, ll>> ope; rep(_, 0, 2){ rep(__, 0, 25){ // 1~25回目は表、26~50回目は裏が最大, 最小となるカードについて操作を行う auto [a, c, i] = card[0]; auto [b, d, j] = card[n-1]; card[0] = {(a+b)/2, (c+d)/2, i}; card[n-1] = {(a+b)/2, (c+d)/2, j}; ope.push_back({i, j}); sort(card.begin(), card.end()); } rep(i, 0, n){ auto [a, c, j] = card[i]; card[i] = {c, a, j}; } } // 1番のカード auto get_card1 = [&](vector<tuple<ll, ll, ll>> card_) -> pair<ll, ll> { rep(i, 0, n){ auto [a, c, j] = card_[i]; if(!j){ return {a, c}; } } return {0, 0}; }; // スコア auto score = [&](pair<ll, ll> card_) -> ll { ll base = 5e17; return (ll)(2e6-1e5*log10(max(abs(card_.first-base), abs(card_.second-base))+1)); }; // 操作 auto simulation = [&](vector<pair<ll, ll>> ope_) -> ll { vector<tuple<ll, ll, ll>> card_ = init; for(auto [u, v]: ope_){ auto [a, c, i] = card_[u]; auto [b, d, j] = card_[v]; card_[u] = {(a+b)/2, (c+d)/2, i}; card_[v] = {(a+b)/2, (c+d)/2, j}; } return score(get_card1(card_)); }; ll best_score = simulation(ope); // 山登り int cnt = 0; while(true){ auto now_time = chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count(); if(now_time-start_time >= TIME_LIMIT) break; vector<pair<ll, ll>> new_ope = ope; if(cnt&1){ int num = rand()%(ope.size()); int u = rand()%n, v = rand()%n; while(u == v) v = rand()%n; new_ope[num] = {u, v}; ll new_score = simulation(new_ope); if(best_score < new_score){ swap(ope, new_ope); swap(best_score, new_score); } }else{ int u = rand()%(ope.size()), v = rand()%(ope.size()); while(u == v) v = rand()%(ope.size()); swap(new_ope[u], new_ope[v]); ll new_score = simulation(new_ope); // 温度関数 double temp = start_temp+(end_temp-start_temp)*((double)(now_time-start_time))/TIME_LIMIT; // 遷移確率関数(最大化の場合) double prob = exp((double)(new_score-best_score)/temp); // 確率probで遷移する if (prob > (rand()%IINF)/(double)IINF) { swap(ope, new_ope); swap(best_score, new_score); } } cnt++; } //cout << simulation(ope) << endl; // 出力 cout << ope.size() << endl; for(auto [u, v]: ope){ cout << u+1 << ' ' << v+1 << endl; } return 0; }