제출 #1134894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1134894		ByeWorld	Salesman (IOI09_salesman)	C++20	0 / 100	3096 ms	16644 KiB

salesman

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
typedef pair<int,pii> ipii;
typedef pair<pii,pii> ipiii;
const int MAXN = 5e5+30;
const int SQRT = 610;
const int MAXA = 5e3+10;
const int MOD = 1e6+7;
const int INF = 1e9+10;
const int LOG = 21;
const ld EPS = 1e-12;
void chmx(int &a, int b){ a = max(a,b); }

int n, u, d, s;
vector <ipii> vec;
int dp[MAXN];

signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> u >> d >> s;
    for(int i=1; i<=s-1; i++) dp[i] = -(s-i)*u;
    for(int i=s+1; i<=MAXA; i++) dp[i] = -(i-s)*d;

    for(int i=1; i<=n; i++){
        int d,id,w; cin>>d>>id>>w;
        vec.pb({d, {id,w}});
    }
    sort(vec.begin(), vec.end());

    for(int i=0; i<vec.size(); i++){
        int j = i;
        vector <pii> te;
        while(i<vec.size() && vec[i].fi == vec[j].fi) 
            te.pb({dp[vec[i].se.fi]+vec[i].se.se, vec[i].se.fi}), i++;

        for(auto [nw, idx] : te){
            for(int i=1; i<=idx; i++) chmx(dp[i], nw-(idx-i)*u);
            for(int i=idx+1; i<=MAXA; i++) chmx(dp[i], nw-(i-idx)*d);
        }
    }
    
    cout << dp[s] << '\n';
}   

• Subtask 1: 0 / 100