結果

問題 No.5016 Worst Mayor
コンテスト
ユーザー MMRZ
提出日時 2023-04-29 14:28:50
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,057 bytes
コンパイル時間 2,886 ms
コンパイル使用メモリ 214,544 KB
実行使用メモリ 24,276 KB
スコア 0
平均クエリ数 400.00
最終ジャッジ日時 2023-04-29 14:29:06
合計ジャッジ時間 15,702 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other WA * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

# include "bits/stdc++.h"
using namespace std;
using LL = long long;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define rep(i,upupu)         for(int i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

const double TIME_LIMIT = 15000.0;

struct KYOPRO_city_status {
    int coops = 1;
    LL money = 1000000;
} kcs;

struct plan {
    uint8_t order;
    uint8_t x, y, z, w;
};

const int n = 3000, t = 400, w = 14;
int a[n], b[n], c[n], d[n];

struct KYOPRO_dist {
    int normal_cnt = 0, highway_cnt = 0;

    bool operator<( const KYOPRO_dist& right ) const {
        return double(normal_cnt) + 0.223 * highway_cnt < double(right.normal_cnt) + 0.223 * right.highway_cnt;
    }
};

vector<plan> solve(){
    vector<plan> ans(t);
    rep(i, 20)ans[i].order = 2;
    for(int i = 20;i < 45;i++)ans[i].order = 3;

    vector<vector<KYOPRO_dist>> dist(w * w, vector<KYOPRO_dist>(w * w));
    rep(i, w * w)rep(j, w * w){
        dist[i][j].normal_cnt = (abs(i % w - j % w) + abs(i / w + j / w));
    }

    int day = 45;
    {
        ans[day].order = 1;

        int max_c = 0, max_type = -1, mi = -1, mj = -1;

        { // tate
            rep(i, 13)rep(j, 14){
                auto tmp_dist = dist;

                int s = i * w + j;
                int t = (i + 1) * w + j;

                tmp_dist[s][t] = tmp_dist[t][s] = min(tmp_dist[s][t], KYOPRO_dist{tmp_dist[s][t].normal_cnt - 1, tmp_dist[s][t].highway_cnt + 1});

                for(int k : {s, t}){
                    rep(r, w * w)rep(c, w * w){
                        tmp_dist[r][c] = min(tmp_dist[r][c], KYOPRO_dist{tmp_dist[r][k].normal_cnt + tmp_dist[k][c].normal_cnt, tmp_dist[r][k].highway_cnt + tmp_dist[k][c].highway_cnt});
                    }
                }

                int cnt_c = 0;

                rep(x, n){
                    cnt_c += tmp_dist[a[i] * w + b[i]][c[i] * w + d[i]].highway_cnt;
                }

                if(max_c < cnt_c){
                    max_c = cnt_c;
                    max_type = 0;
                    mi = i, mj = j;
                }
            }
        }

        { // yoko
            rep(i, 14)rep(j, 13){
                auto tmp_dist = dist;

                int s = i * w + j;
                int t = i * w + j + 1;

                tmp_dist[s][t] = tmp_dist[t][s] = min(tmp_dist[s][t], KYOPRO_dist{tmp_dist[s][t].normal_cnt - 1, tmp_dist[s][t].highway_cnt + 1});

                for(int k : {s, t}){
                    rep(r, w * w)rep(c, w * w){
                        tmp_dist[r][c] = min(tmp_dist[r][c], KYOPRO_dist{tmp_dist[r][k].normal_cnt + tmp_dist[k][c].normal_cnt, tmp_dist[r][k].highway_cnt + tmp_dist[k][c].highway_cnt});
                    }
                }

                int cnt_c = 0;

                rep(x, n){
                    cnt_c += tmp_dist[a[i] * w + b[i]][c[i] * w + d[i]].highway_cnt;
                }

                if(max_c < cnt_c){
                    max_c = cnt_c;
                    max_type = 1;
                    mi = i, mj = j;
                }
            }
        }

        ans[day].x = mi, ans[day].y = mj;
        ans[day].z = mi + (max_type == 0), ans[day].w = mj + (max_type == 1);

    }

    for(int i = 46;i < t;i++)ans[i].order = 3;

    return ans;
}

void input(){
    int _n, _t; cin >> _n >> _t;
    rep(i, n){
        cin >> a[i] >> b[i] >> c[i] >> d[i];
        a[i]--, b[i]--, c[i]--, d[i]--;
    }
    return;
}

void output(vector<plan> ans){
    
    LL buf;

    rep(i, t){

        if(i)cin >> buf;

        if(ans[i].order != 1){
            cout << ans[i].order << endl;
            cout.flush();
        }else{
            cout << "1 " << ans[i].x + 1 << " " << ans[i].y + 1 << " " << ans[i].z + 1 << " " << ans[i].w + 1 << endl;
            cout.flush();
        }
    }
}

int main(){
    input();
    auto f = solve();
    output(f);
}
0