#1148998 (C++17) No.5023 Airlines Optimization

• 問題: No.5023 Airlines Optimization
• ユーザー: e869120
• 提出日時: 2026-02-21 22:04:41
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 954 ms / 1,000 ms
• コード長: 7,537 bytes
• コンパイル時間: 2,590 ms
• コンパイル使用メモリ: 152,296 KB
• 実行使用メモリ: 7,848 KB
• スコア: 48,537,792
• 最終ジャッジ日時: 2026-02-25 20:33:34
• 合計ジャッジ時間: 103,613 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
other	AC * 100

ソースコード

#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <chrono>
#include <random>

using namespace std;

int N, M, K;
double R;
vector<int> X, Y, W;
double req_time[50][50];
long long pair_weight[50][50];
bool valid_pair[50][50];

struct Flight {
    int u, v, dep, arr;
    bool operator<(const Flight& o) const {
        return dep > o.dep; // 出発時刻の降順
    }
};

vector<Flight> sq_flights;
int sq_latest[50][50][21];
int ci_latest[50][50][21];
vector<int> city_candidates;

mt19937 rnd(42);

// 時刻文字列をスロット（5分単位）に変換
int time_to_slot(const string& t) {
    int h = stoi(t.substr(0, 2));
    int m = stoi(t.substr(3, 2));
    return (h - 6) * 12 + m / 5;
}

// スロットを時刻文字列に変換
string slot_to_time(int slot) {
    int h = 6 + slot / 12;
    int m = (slot % 12) * 5;
    char buf[10];
    snprintf(buf, sizeof(buf), "%02d:%02d", h, m);
    return string(buf);
}

// 人口に比例してランダムな都市を選ぶ
int get_rand_city() {
    return city_candidates[rnd() % city_candidates.size()];
}

// 各目標に対する最遅出発時刻を計算 (逆順DP)
void calc_latest(const vector<Flight>& flights, int latest[50][50][21]) {
    for (int j = 0; j < N; ++j) {
        for (int t_idx = 0; t_idx < 21; ++t_idx) {
            for (int u = 0; u < N; ++u) {
                latest[u][j][t_idx] = -1;
            }
            latest[j][j][t_idx] = 60 + t_idx * 6;
        }
    }
    for (const auto& f : flights) {
        for (int j = 0; j < N; ++j) {
            for (int t_idx = 0; t_idx < 21; ++t_idx) {
                if (latest[f.v][j][t_idx] >= f.arr) {
                    if (f.dep > latest[f.u][j][t_idx]) {
                        latest[f.u][j][t_idx] = f.dep;
                    }
                }
            }
        }
    }
}

// シーケンスを時間内（180スロット）に収まるよう調整し、余れば追加
void adjust_seq(vector<int>& seq) {
    if (seq.empty()) seq.push_back(get_rand_city());
    int cur_time = 0;
    vector<int> nseq;
    nseq.push_back(seq[0]);
    for (int i = 1; i < seq.size(); ++i) {
        if (nseq.back() == seq[i]) continue;
        int req = req_time[nseq.back()][seq[i]];
        if (cur_time + req <= 180) {
            cur_time += req;
            nseq.push_back(seq[i]);
        } else {
            break;
        }
    }
    while (true) {
        int u = nseq.back();
        int v = get_rand_city();
        while (u == v) v = get_rand_city();
        int req = req_time[u][v];
        if (cur_time + req <= 180) {
            cur_time += req;
            nseq.push_back(v);
        } else {
            break;
        }
    }
    seq = nseq;
}

// シーケンスからフライト一覧を生成
vector<Flight> get_flights(const vector<vector<int>>& seqs) {
    vector<Flight> res;
    for (int k = 0; k < K; ++k) {
        int cur_time = 0;
        for (int i = 0; i + 1 < seqs[k].size(); ++i) {
            int u = seqs[k][i];
            int v = seqs[k][i + 1];
            int req = req_time[u][v];
            res.push_back({u, v, cur_time, cur_time + req});
            cur_time += req;
        }
    }
    sort(res.begin(), res.end());
    return res;
}

// スコア評価関数
long long eval(const vector<Flight>& ci_flights) {
    calc_latest(ci_flights, ci_latest);
    long long v_ci = 0;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            if (!valid_pair[i][j]) continue;
            long long weight = pair_weight[i][j];
            for (int t_idx = 0; t_idx < 21; ++t_idx) {
                if (ci_latest[i][j][t_idx] > sq_latest[i][j][t_idx]) {
                    v_ci += weight;
                }
            }
        }
    }
    return v_ci;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    auto start_time = chrono::high_resolution_clock::now();

    if (!(cin >> N >> R)) return 0;
    X.resize(N); Y.resize(N); W.resize(N);
    for (int i = 0; i < N; ++i) {
        cin >> X[i] >> Y[i] >> W[i];
        int cnt = W[i] / 100000;
        if (cnt <= 0) cnt = 1;
        for (int c = 0; c < cnt; ++c) city_candidates.push_back(i);
    }

    // 距離と所要時間の事前計算
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            double d = hypot(X[i] - X[j], Y[i] - Y[j]);
            double exact_time = d / 800.0 * 60.0 + 40.0;
            req_time[i][j] = ceil(exact_time / 5.0);
            
            valid_pair[i][j] = (d >= 0.25 * R && i != j);
            pair_weight[i][j] = (long long)W[i] * W[j];
        }
    }

    cin >> M;
    for (int i = 0; i < M; ++i) {
        int u, v; string s, t;
        cin >> u >> s >> v >> t;
        --u; --v;
        sq_flights.push_back({u, v, time_to_slot(s), time_to_slot(t)});
    }
    sort(sq_flights.begin(), sq_flights.end());
    calc_latest(sq_flights, sq_latest);

    cin >> K;

    vector<vector<int>> best_seqs(K);
    for (int k = 0; k < K; ++k) adjust_seq(best_seqs[k]);
    long long best_score = eval(get_flights(best_seqs));

    vector<vector<int>> cur_seqs = best_seqs;
    long long cur_score = best_score;

    // 焼きなまし法
    double T0 = 1e12; 
    double T1 = 1e8;
    int iter = 0;
    double limit = 0.95; // 2.8秒制限

    while (true) {
        if ((iter & 63) == 0) {
            double elapsed = chrono::duration<double>(chrono::high_resolution_clock::now() - start_time).count();
            if (elapsed > limit) break;
            
            double temp = T0 * pow(T1 / T0, elapsed / limit);
            
            int k = rnd() % K;
            vector<int> old_seq = cur_seqs[k];
            
            int type = rnd() % 3;
            if (type == 0 && cur_seqs[k].size() > 1) { // Replace
                int idx = 1 + rnd() % (cur_seqs[k].size() - 1);
                cur_seqs[k][idx] = get_rand_city();
            } else if (type == 1) { // Insert
                int idx = rnd() % (cur_seqs[k].size() + 1);
                cur_seqs[k].insert(cur_seqs[k].begin() + idx, get_rand_city());
            } else if (type == 2 && cur_seqs[k].size() > 2) { // Delete
                int idx = rnd() % cur_seqs[k].size();
                cur_seqs[k].erase(cur_seqs[k].begin() + idx);
            }
            
            adjust_seq(cur_seqs[k]);
            long long new_score = eval(get_flights(cur_seqs));
            
            if (new_score >= cur_score || exp((new_score - cur_score) / temp) > (double)(rnd() % 10000) / 10000.0) {
                cur_score = new_score;
                if (cur_score > best_score) {
                    best_score = cur_score;
                    best_seqs = cur_seqs;
                }
            } else {
                cur_seqs[k] = old_seq; // 戻す
            }
        }
        iter++;
    }

    // 最適解の出力
    for (int k = 0; k < K; ++k) {
        int cur_time = 0;
        vector<Flight> f_list;
        for (int i = 0; i + 1 < best_seqs[k].size(); ++i) {
            int u = best_seqs[k][i];
            int v = best_seqs[k][i + 1];
            int req = req_time[u][v];
            f_list.push_back({u, v, cur_time, cur_time + req});
            cur_time += req;
        }
        cout << f_list.size() << "\n";
        for (const auto& f : f_list) {
            cout << f.u + 1 << " " << slot_to_time(f.dep) << " " 
                 << f.v + 1 << " " << slot_to_time(f.arr) << "\n";
        }
    }

    return 0;
}