oj.uz

Submission #986688

# Submission time Handle Problem Language Result Execution time Memory
986688 2024-05-21T03:45:58 Z JooDdae Salesman (IOI09_salesman) C++17
100 / 100
 1002 ms 54176 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#define mid ((l+r) >> 1)
 
const int INF = 2e9, N = 5e5+1;
 
int n, u, d, s, mx[500500], t1[2002002], t2[2002002];
vector<array<int, 2>> v[500500];
 
void update(int t[], int id, int x, int node = 1, int l = 1, int r = N) {
    if(id < l || r < id) return;
    if(l == r) {
        t[node] = max(t[node], x);
        return;
    }
    if(id <= mid) update(t, id, x, node*2, l, mid);
    else update(t, id, x, node*2+1, mid+1, r);
    t[node] = max(t[node*2], t[node*2+1]);
}
 
int find(int t[], int nl, int nr, int node = 1, int l = 1, int r = N) {
    if(nr < l || r < nl) return -INF;
    if(nl <= l && r <= nr) return t[node];
  
    int re = -INF;
    if(nl <= mid) re = max(re, find(t, nl, nr, node*2, l, mid));
    if(mid < nr) re = max(re, find(t, nl, nr, node*2+1, mid+1, r));
    return re;
}
 
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> u >> d >> s;
    for(int i=1;i<=n;i++) {
        int t, x, y; cin >> t >> x >> y;
        v[t].push_back({x, y});
    }
 
    fill(t1, t1+4*N+1, -INF), fill(t2, t2+4*N+1, -INF);
    fill(mx, mx+N+1, -INF);
    update(t1, s, s*u), update(t2, s, -s*d);
    for(int t=1;t<=N;t++) if(!v[t].empty()) {
        sort(v[t].begin(), v[t].end());
 
        for(auto [x, y] : v[t]) mx[x] = max(find(t1, 1, x-1) - x*u, x*d + find(t2, x+1, N)) + y;
 
        for(auto [x, y] : v[t]) {
            update(t1, x, x*u+mx[x]);
            update(t2, x, mx[x]-x*d);
        }
 
        for(auto [x, y] : v[t]) {
            auto k = find(t1, 1, x-1) - x*u + y;
            mx[x] = max(mx[x], k), update(t1, x, x*u+k);
        }
        reverse(v[t].begin(), v[t].end());
        for(auto [x, y] : v[t]) {
            auto k = x*d + find(t2, x+1, N) + y;
            mx[x] = max(mx[x], k), update(t2, x, k-x*d);
        }
 
        for(auto [x, y] : v[t]) {
            update(t1, x, x*u+mx[x]);
            update(t2, x, mx[x]-x*d);
        }
    }
 
    int ans = 0;
    for(int i=1;i<=N;i++) ans = max(ans, mx[i] - abs(i-s)*(i<s ? u:d));
    cout << ans << "\n";
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29784 KB Output is correct
2 Correct 18 ms 29620 KB Output is correct
3 Correct 17 ms 29788 KB Output is correct
4 Correct 18 ms 29788 KB Output is correct
5 Correct 22 ms 29820 KB Output is correct
6 Correct 50 ms 30808 KB Output is correct
7 Correct 119 ms 32276 KB Output is correct
8 Correct 190 ms 34640 KB Output is correct
9 Correct 277 ms 36948 KB Output is correct
10 Correct 454 ms 43920 KB Output is correct
11 Correct 563 ms 44564 KB Output is correct
12 Correct 762 ms 48468 KB Output is correct
13 Correct 750 ms 48980 KB Output is correct
14 Correct 931 ms 54176 KB Output is correct
15 Correct 791 ms 53396 KB Output is correct
16 Correct 1002 ms 53400 KB Output is correct
17 Correct 14 ms 29788 KB Output is correct
18 Correct 15 ms 29788 KB Output is correct
19 Correct 16 ms 29784 KB Output is correct
20 Correct 18 ms 29900 KB Output is correct
21 Correct 18 ms 29752 KB Output is correct
22 Correct 22 ms 29788 KB Output is correct
23 Correct 28 ms 29732 KB Output is correct
24 Correct 22 ms 29788 KB Output is correct
25 Correct 159 ms 32092 KB Output is correct
26 Correct 298 ms 34644 KB Output is correct
27 Correct 478 ms 37692 KB Output is correct
28 Correct 555 ms 39240 KB Output is correct
29 Correct 732 ms 41404 KB Output is correct
30 Correct 716 ms 42184 KB Output is correct