Submission

Score: 100

User: Nagornz

Problemset: ผลึกเวลา (Crystal)

Language: cpp

Time: 0.935 second

Submitted On: 2025-05-24 19:49:15

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

const int mod = 1e9 + 7;
const int inf = 1e18;
const int N = 1e5 + 5;
const int U = 1e3 + 5;

int u, k, n, ans, dp[N];
map <int, int> com;
set <int> ins;
tiii a[N]; // t, w, p

struct {
    int fw[N];
    void update(int idx, int val){
        while (idx < N) {
            fw[idx] = max(fw[idx], val);
            idx += idx & -idx;
        }
    }
    int query(int idx){
        int ans = 0;
        while (idx > 0) {
            ans = max(ans, fw[idx]);
            idx -= idx & -idx;
        }
        return ans;
    }
} fenwick[U];

int32_t main(){
    iShowSpeed;
    cin >> u >> k >> n;
    for (int i = 1; i <= n; i++) {
        auto &[t, w, p] = a[i];
        cin >> p >> w >> t;
        ins.emplace(p);
    }
    vector <int> temp(all(ins));
    for (int i = 0; i < temp.size(); i++) {
        com[temp[i]] = i + 1;
    }
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) {
        auto [t, w, pp] = a[i];
        int p = com[pp];
        dp[i] = fenwick[w].query(p - 1) + 1;
        // cout << i << ": " << dp[i] << ", ";
        dp[i] = max(dp[i], fenwick[U - 1].query(p - 1) + 1 - k);
        // cout << dp[i] << "\n";
        fenwick[U - 1].update(p, dp[i]);
        fenwick[w].update(p, dp[i]);
        ans = max(ans, dp[i]);
    }
    cout << ans;
}