結果

問題 No.2330 Eat Slime
ユーザー jupiro
提出日時 2023-05-28 15:54:58
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,079 bytes
コンパイル時間 2,465 ms
コンパイル使用メモリ 210,424 KB
最終ジャッジ日時 2025-02-13 14:30:10
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 2 WA * 4 TLE * 3 MLE * 21
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using ll = long long;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());

template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}

template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

const int inf = (int)1e9 + 7;
const long long INF = 1LL << 62;

template <int mod> struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if ((x += p.x) >= mod)
            x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if ((x += mod - p.x) >= mod)
            x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }

    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            std::swap(a -= t * b, b);
            std::swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while (n > 0) {
            if (n & 1)
                ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend std::ostream &operator<<(std::ostream &os, const ModInt &p) { return os << p.x; }

    friend std::istream &operator>>(std::istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

constexpr int mod = (int)1e9 + 7;
using mint = ModInt<mod>;

void solve() {
    ll n, m, X;
    cin >> n >> m >> X;
    std::vector<int> C(n);
    std::vector<std::vector<int>> c_pos(5);
    for (int i = 0; i < n; i++) {
        cin >> C[i];
        C[i] -= 1;
        c_pos[C[i]].emplace_back(i);
    }
    std::vector<int> A(m), B(m), Y(m);
    for (int i = 0; i < m; i++) {
        cin >> A[i] >> B[i] >> Y[i];
        A[i] -= 1;
        B[i] -= 1;
    }
    std::vector<ll> fin(n);
    std::vector<std::map<ll, ll>> c;
    for (int t = 0; t < 5; t++) {
        c.clear();
        c.resize(n);
        for (int i = 0; i < m; i++) {
            if (t != B[i])
                continue;
            auto itr = std::lower_bound(c_pos[B[i]].begin(), c_pos[B[i]].end(), A[i]);
            if (itr == c_pos[B[i]].end())
                continue;
            c[*itr - A[i]][*itr] += Y[i];
        }
        for (int i = 0; i < n; i++) {
            for (const auto [id, val] : c[i]) {
                if (id + 1 < (int)c_pos[t].size()) {
                    const int diff = c_pos[t][id + 1] - c_pos[t][id];
                    c[i + diff][id + 1] += val;
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (const auto [id, val] : c[i]) {
                fin[i] += val;
            }
        }
    }
    ll res = 0;
    for (int i = 0; i < n; i++) {
        chmax(res, fin[i] + X * i);
    }
    cout << res << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int I_love_KKT89 = 1;
    // cin >> I_love_KKT89;
    for (int Case = 1; Case <= I_love_KKT89; ++Case) {
        // cout << "Case #" << Case << ": ";
        solve();
    }
    return 0;
}
0