Submission #761033

#	Time	Username	Problem	Language	Result	Execution time	Memory
761033		GrindMachine	Salesman (IOI09_salesman)	C++17	19 / 100	3079 ms	24840 KiB

salesman

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,U,D,s; cin >> n >> U >> D >> s;
    vector<array<ll,3>> a(n+5);
    rep1(i,n) rep(j,3) cin >> a[i][j];

    sort(a.begin()+1, a.begin()+n+1);

    a[0] = {0,s,0};
    a[n+1] = {inf1,s,0};

    vector<ll> dp(n+5,-inf2);
    dp[0] = 0;

    rep1(i,n+1){
        rep(j,i){
            ll x = a[i][1], y = a[j][1];
            ll cost = 0;

            if(y <= x){
                // down
                cost = -abs(x-y) * D;
            }
            else{
                // up
                cost = -abs(x-y) * U;
            }

            cost += a[i][2] + dp[j];
            amax(dp[i],cost);
        }
    }

    ll ans = dp[n+1];
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 19 / 100