結果

問題 No.5021 Addition Pyramid
ユーザー e869120
提出日時 2025-02-22 22:10:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 721 ms / 2,000 ms
コード長 4,820 bytes
コンパイル時間 1,341 ms
コンパイル使用メモリ 88,680 KB
実行使用メモリ 6,820 KB
スコア 382,532,296
最終ジャッジ日時 2025-02-25 19:31:22
合計ジャッジ時間 39,360 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int MAX = 100000000;
unsigned int seed = 869120;

// ===========================================================================================================
// === Basic Part
// ===========================================================================================================
unsigned int Rand() {
    seed ^= seed << 13;
    seed ^= seed >> 17;
    seed ^= seed << 5;
    return seed;
}

double GetTime() {
    return 1.0 * clock() / CLOCKS_PER_SEC;
}

int get_error(int a, int b) {
    return min(abs(a - b), MAX - abs(a - b));
}

int score_function(int N, vector<vector<int>> A, vector<int> C) {
    vector<vector<int>> B(N, vector<int>(N, 0));
    for (int i = 0; i < N; i++) B[N - 1][i] = C[i];
    for (int i = N - 2; i >= 0; i--) {
        for (int j = 0; j <= i; j++) B[i][j] = (B[i + 1][j] + B[i + 1][j + 1]) % 100000000;
    }
    int max_error = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= i; j++) max_error = max(max_error, min(abs(A[i][j] - B[i][j]), 100000000 - abs(A[i][j] - B[i][j])));
    }
    return 50000000 - max_error;
}


// ===========================================================================================================
// === DFS Function
// ===========================================================================================================
vector<int> dfs(int N, int row, int border, double start_time, vector<vector<int>>& A, vector<vector<int>>& C) {
    if (GetTime() - start_time > 0.7) return vector<int>{-2};
    if (row == N) return C[N - 1];

    // Get Initial Answer
    vector<int> prev_row = C[row - 1];
    vector<int> curr_row = C[row];
    vector<int> worst;
    curr_row[0] = 0;
    for (int i = 1; i <= row; i++) curr_row[i] = (prev_row[i - 1] - curr_row[i - 1] + MAX) % MAX;

    // Get Worst Position
    for (int i = 0; i <= row; i++) {
        int opposite = (A[row][i] + MAX / 2) % MAX;
        if (i % 2 == 0) worst.push_back((opposite - curr_row[i] + MAX) % MAX);
        if (i % 2 == 1) worst.push_back((curr_row[i] - opposite + MAX) % MAX);
    }
    sort(worst.begin(), worst.end());

    // Is there any good position?
    vector<int> good_pos;
    for (int i = 0; i < worst.size(); i++) {
        int a1 = worst[i];
        int a2 = (i == worst.size() - 1 ? MAX + worst[0] : worst[i + 1]);
        if (a2 - a1 >= 2 * border) good_pos.push_back(i);
    }
    if (good_pos.size() == 0) {
        return vector<int>{-1};
    }

    // Pick Good Position Randomly
    vector<int> posi;
    for (int loops = 1; loops <= 35; loops++) {
        int idx = good_pos[Rand() % good_pos.size()];
        int a1 = worst[idx] + border;
        int a2 = (idx == worst.size() - 1 ? MAX + worst[0] : worst[idx + 1]) - border;
        posi.push_back((Rand() % (a2 - a1 + 1) + a1) % MAX);
    }

    // Recursion
    for (int val : posi) {
        C[row][0] = val;
        for (int i = 1; i <= row; i++) C[row][i] = (C[row - 1][i - 1] - C[row][i - 1] + MAX) % MAX;
        vector<int> ans = dfs(N, row + 1, border, start_time, A, C);
        if (ans != vector<int>{-1}) return ans;
    }

    // Failed
    return vector<int>{-1};
}


// ===========================================================================================================
// === Solve Function
// ===========================================================================================================
vector<int> solver(int N, vector<vector<int>> A) {
    double start_time = GetTime();
    int best_score = -1;
    vector<int> best_ans;

    // DFS Search Start
    for (int border = 3000000; border <= 10000000; border += 200000) {
        vector<vector<int>> C(N, vector<int>(N, 0));
        C[0][0] = A[0][0];
        vector<int> ret = dfs(N, 1, border, start_time, A, C);
        if (ret == vector<int>{-2}) break;
        if (ret.size() == N) {
            int cand_score = score_function(N, A, ret);
            if (best_score < cand_score) {
                best_score = cand_score;
                best_ans = ret;
            }
        }
    }

    // Return
    // cerr << best_score << endl;
    return best_ans;
}


// ===========================================================================================================
// === Main Function
// ===========================================================================================================
int main() {
    // Step 1. Input
    int N; cin >> N;
    vector<vector<int>> A(N, vector<int>(N, 0));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= i; j++) cin >> A[i][j];
    }

    // Step 2. Solve
    vector<int> Answer = solver(N, A);
    for (int i = 0; i < N; i++) {
        if (i >= 1) cout << " ";
        cout << Answer[i];
    }
    cout << endl;
    return 0;
}
0