oj.uz

Submission #446701

# Submission time Handle Problem Language Result Execution time Memory
446701 2021-07-23T06:51:19 Z JerryLiu06 Salesman (IOI09_salesman) C++17
100 / 100
 333 ms 11972 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 5e5 + 10;
const ll INF = 1e18;

int N, U, D, S; vector<array<int, 3>> A; int down[MX], up[MX], bst[MX];

void updUp(int ind, int val) { while (ind < MX) { ckmax(up[ind], val); ind += (ind & -ind); } }
int querUp(int ind) { int res = -MOD; while (ind > 0) { ckmax(res, up[ind]); ind -= (ind & -ind); } return res; }

void updDown(int ind, int val) { while (ind > 0) { ckmax(down[ind], val); ind -= (ind & -ind); } }
int querDown(int ind) { int res = -MOD; while (ind < MX) { ckmax(res, down[ind]); ind += (ind & -ind); } return res; }

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    
    cin >> N >> U >> D >> S; A.rsz(N); F0R(i, N) cin >> A[i][0] >> A[i][1] >> A[i][2];
    
    F0R(i, MX) down[i] = -MOD, up[i] = -MOD; sor(A); updDown(S, -S * D); updUp(S, S * U);
    
    for (int L = 0; L < N; ) {
        int R = L; while (R < N && A[R][0] == A[L][0]) R++;
        
        FOR(i, L, R) {
            bst[i] = -MOD; 
            
            ckmax(bst[i], querDown(A[i][1]) + A[i][1] * D);
            ckmax(bst[i], querUp(A[i][1]) - A[i][1] * U); 
        }
        int prefMax = -MOD; int pref = 0;

        FOR(i, L, R) {
            ckmax(prefMax, bst[i] + A[i][1] * U - pref);

            pref += A[i][2];

            updDown(A[i][1], prefMax + pref - A[i][1] * U - A[i][1] * D);

            updUp(A[i][1], prefMax + pref - A[i][1] * U + A[i][1] * U);
        }
        int suffMax = -MOD; int suff = 0;

        ROF(i, L, R) {
            ckmax(suffMax, bst[i] - A[i][1] * D - suff);

            suff += A[i][2];

            updDown(A[i][1], suffMax + suff + A[i][1] * D - A[i][1] * D);

            updUp(A[i][1], suffMax + suff + A[i][1] * D + A[i][1] * U);
        }
        L = R;
    }
    cout << max(querDown(S) + S * D, querUp(S) - S * U);
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 3 ms 4172 KB Output is correct
4 Correct 3 ms 4172 KB Output is correct
5 Correct 5 ms 4204 KB Output is correct
6 Correct 14 ms 4556 KB Output is correct
7 Correct 34 ms 5008 KB Output is correct
8 Correct 80 ms 5716 KB Output is correct
9 Correct 98 ms 6560 KB Output is correct
10 Correct 162 ms 8840 KB Output is correct
11 Correct 198 ms 8964 KB Output is correct
12 Correct 250 ms 10508 KB Output is correct
13 Correct 241 ms 10372 KB Output is correct
14 Correct 325 ms 11972 KB Output is correct
15 Correct 283 ms 11960 KB Output is correct
16 Correct 305 ms 11952 KB Output is correct
17 Correct 3 ms 4172 KB Output is correct
18 Correct 3 ms 4172 KB Output is correct
19 Correct 4 ms 4244 KB Output is correct
20 Correct 4 ms 4236 KB Output is correct
21 Correct 4 ms 4172 KB Output is correct
22 Correct 5 ms 4300 KB Output is correct
23 Correct 5 ms 4300 KB Output is correct
24 Correct 5 ms 4300 KB Output is correct
25 Correct 65 ms 5740 KB Output is correct
26 Correct 154 ms 7268 KB Output is correct
27 Correct 205 ms 9668 KB Output is correct
28 Correct 223 ms 9680 KB Output is correct
29 Correct 303 ms 11972 KB Output is correct
30 Correct 333 ms 11944 KB Output is correct