제출 #82837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
82837		ngot23	Go (COCI18_go)	C++11	40 / 100	38 ms	1316 KiB

go

#include<bits/stdc++.h>
#define rep(i, a, b) for(int i=(a) ; i<=(b) ; ++i)
#define Task ""
using namespace std;
const int inf=1000000000;
struct data {
    int p, val, t;
    bool operator < (const data &X) const {
        return t<X.t;
    }
} e[105];
int dp[105][2005], n, m, k, maxt;

void MAX(int &a, int b) {
    a=max(a, b);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(Task".inp", "r", stdin);
    //freopen(Task".out", "w", stdout);
    cin >> n >> k >> m;
    rep(i, 1, m) {
        int pos, val, t;
        cin >> pos >> val >> t;
        e[i]={pos, val, t};
    }
    sort(e+1, e+m+1);
    maxt=e[m].t;
    rep(i, 1, m)
        rep(j, 0, maxt) dp[i][j]=-inf;
    e[0]={k, 0, 0};
    rep(i, 1, m)
        rep(t, 0, maxt)
            rep(j, 0, i-1) {
                int dis=abs(e[i].p-e[j].p);
                if(t<dis||dp[j][t-dis]==-inf) continue;
                int add;
                if(t>=e[i].t) add=0;
                else add=e[i].val;
                MAX(dp[i][t], dp[j][t-dis]+add);
            }
    int ans=0;
    rep(i, 0, m)
        rep(j, 0, maxt)
            MAX(ans, dp[i][j]);
    cout << ans;
    return 0;
}

• Subtask 1: 40 / 100