結果

問題 No.5020 Averaging
ユーザー ぴぃいいいい
提出日時 2024-02-25 16:17:50
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 903 ms / 1,000 ms
コード長 5,208 bytes
コンパイル時間 6,554 ms
コンパイル使用メモリ 320,876 KB
実行使用メモリ 6,548 KB
スコア 27,752,656
最終ジャッジ日時 2024-02-25 16:19:08
合計ジャッジ時間 54,732 ms
ジャッジサーバーID
（参考情報） 		judge10 / judge11
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define print(var) std::cout<<#var<<"="<<(var)<<std::endl
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vmi vector<mint>
#define vvmi vector<vmi>
#define vvvmi vector<vvmi>
#define vs vector<string>
#define pii pair<int,int>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define bit(x,i)(((x)>>(i))&1)
#define inf (1<<30)
#define INF (1ll<<60)
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
template<class T, class F> T nibutan(T ok, T ng, const F &f){while(abs(ok-ng)>1){T mid = (ok+ng)/2;(f(mid)?ok:ng) = mid;}return ok;}
template<class T> vector<T> digit(T x){vector<T> res; while(x>0){res.push_back(x%10); x/=10;} return res;}
#ifdef LOCAL
#include "../../cpp-dump/dump.hpp"
#else
#define cpp_dump
#endif
static uint32_t xor128(void){
    static uint32_t x=123456789,y=362436069,z=521288629,w=88675123;
    uint32_t t;
    t=(x^(x<<11));x=y;y=z;z=w; return( w=(w^(w>>19))^(t^(t>>8)) );
}
int randrange(int a){return (uint64_t(xor128()) * a >> 32); }
double randDouble(double a,double b){return a+(b-a)*xor128()/(double)ULONG_MAX;}
inline double get_time() {
    using namespace std::chrono;
    return duration_cast<milliseconds>(system_clock::now().time_since_epoch()).count();
}
double start_time = get_time();
struct IO{
    int n;
    vll a,b;
    IO(){}
    void input(){
        cin >> n;
        a.resize(n);
        b.resize(n);
        for(int i=0;i<n;i++){
            cin >> a[i] >> b[i];
        }
    }
};
struct State{
    int n;
    unordered_set<int> used;
    vi seq;
    State(IO& io) : n(io.n){
        used.insert(0);
    }
    void add(int i, int j, const IO& io){
        if(i > seq.size()){
            cerr << "error : " << i << " is out of range" << endl;
            return;
        }
        if(used.find(j) != used.end()){
            cerr << "error : " << j << " is already used" << endl;
            return;
        }
        if(i == seq.size()) seq.push_back(j);
        else seq.insert(seq.begin()+i, j);
        used.insert(j);
    }
    void swap(int i, int j, const IO& io){
        if(i>=seq.size()){
            cerr << "seq size is " << seq.size() << " but i is " << i << endl;
            return;
        }
        if(used.find(j) != used.end()){
            cerr << "error : " << j << " is already used" << endl;
            return;
        }
        used.erase(seq[i]);
        seq[i] = j;
        used.insert(j);
    }
    void del(int i, const IO& io){
        if(i>=seq.size()){
            cerr << "seq size is " << seq.size() << " but i is " << i << endl;
            return;
        }
        used.erase(seq[i]);
        seq.erase(seq.begin()+i);
    }
    
    void update(const IO& io){
            int coin = randrange(10);
            if(seq.size()==0 || (coin < 3 && seq.size() < n-1)){
                int i = randrange(seq.size()+1);
                int j;
                do{
                    j = randrange(n-1)+1;
                }while(used.find(j) != used.end());
                
                add(i,j,io);
            }
            else if(coin < 6 && seq.size() > 0){
                int i = randrange(seq.size());
                del(i,io);
            }
            else{
                int i,j;
                i = randrange(seq.size());
                do{
                    j = randrange(n-1)+1;
                }while(used.find(j) != used.end());
                swap(i,j,io);
            }
        }
    
    double get_score(const IO& io){
        ll a = io.a[0];
        ll b = io.b[0];
        for(int i=0;i<seq.size();i++){
            a = (a + io.a[seq[i]])/2;
            b = (b + io.b[seq[i]])/2;
        }
        double diff_a = a-5e17;
        double diff_b = b-5e17;
        return diff_a*diff_a + diff_b*diff_b;
    }
    void get_card(const IO & io){
        ll a = io.a[0];
        ll b = io.b[0];
        for(int i=0;i<seq.size();i++){
            a = (a + io.a[seq[i]])/2;
            b = (b + io.b[seq[i]])/2;
            cerr << "turn " << i << endl;
            cerr << a << " " << b << endl;
        }
        cerr << a << " " << b << endl;
    }
};
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    IO io;
    io.input();
    State now_state(io);
    double now_score = now_state.get_score(io);
    while(get_time() - start_time < 900){
        State state = now_state;
        state.update(io);
        if(chmin(now_score, state.get_score(io))){
            swap(now_state, state);
            #ifdef LOCAL
            cerr << now_score << endl;
            #endif
        }
    }
    
    vi ans = now_state.seq;
    cout << ans.size() << endl;
    for(auto e:ans){
        cout << 1 << " " << e+1 << endl;
    }
    #ifdef LOCAL
    now_state.get_card(io);
    #endif
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0