Submission #1147848

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147848		ByeWorld	Pinball (JOI14_pinball)	C++20	0 / 100	0 ms	324 KiB

pinball

#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<pii,int> ipii;
typedef pair<pii,pii> ipiii;
const int MAXN = 5010;
const int SQRT = 300;
const int MAXA = 50;
const int LOG = 20;
const int INF = 1e18+10;
const ld EPS = 1e-12;
const int MOD = 1e9+7;
int sum(int a, int b){ return (a+b)%MOD; }
void chsum(int &a, int b){ a = (a+b)%MOD; }
void chmn(int &a, int b){ a = min(a, b); }
void chmx(int &a, int b){ a = max(a, b); }

int n, m, le[MAXN], ri[MAXN], c[MAXN], w[MAXN];
int dp[MAXN][MAXN];

signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    vector <int> cc; cc.pb(-1);
    cin>>n>>m;
    for(int i=1; i<=n; i++){
        cin>>le[i]>>ri[i]>>c[i]>>w[i];
        cc.pb(le[i]); cc.pb(ri[i]); cc.pb(c[i]);
    }
    sort(cc.begin(), cc.end());
    cc.resize(unique(cc.begin(), cc.end()) - cc.begin());
    for(int i=1; i<=n; i++){
        le[i] = lower_bound(cc.begin(), cc.end(), le[i]) - cc.begin();
        ri[i] = lower_bound(cc.begin(), cc.end(), ri[i]) - cc.begin();
        c[i] = lower_bound(cc.begin(), cc.end(), c[i]) - cc.begin();
    }
    m = cc.size()-1;
    for(int i=1; i<=m; i++)
        for(int j=1; j<=m; j++) dp[i][j] = INF;
    dp[1][m] = 0;

    for(int i=1; i<=n; i++){
        for(int r=c[i]; r<=m; r++)
            chmn(dp[c[i]][r], dp[le[i]][r] + w[i]);
        for(int l=1; l<=c[i]; l++)
            chmn(dp[l][c[i]], dp[l][ri[i]] + w[i]);
        chmn(dp[c[i]][c[i]], dp[le[i]][ri[i]] + w[i]);
        // cout << dp[2][5] << ' ' << i<< " p\n";
    }
    int mn = INF;
    for(int i=1; i<=m; i++)
        chmn(mn, dp[i][i]);
    cout << (mn==INF ? -1 : mn) << '\n';
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 49