제출 #731324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
731324		alexdd	Pinball (JOI14_pinball)	C++17	29 / 100	1092 ms	194952 KiB

pinball

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
int n,m;
int a[100005];
int b[100005];
int c[100005];
int d[100005];
map<pair<int,int>,int> dp[100005];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin>>m>>n;
    for(int i=1;i<=m;i++)
    {
        cin>>a[i]>>b[i]>>c[i]>>d[i];
    }
    for(int i=m;i>0;i--)
    {
        pair<int,int> cop;
        dp[i][{a[i],b[i]}] = d[i];
        for(auto it:dp[i+1])
        {
            if(it.second == 0)
                continue;
            cop = it.first;
            if(dp[i][cop] > it.second || dp[i][cop]==0)
                dp[i][cop] = it.second;
            if(cop.first <= c[i] && c[i]<=cop.second && (dp[i][{min(cop.first, a[i]),max(cop.second,b[i])}]==0 || dp[i][{min(cop.first, a[i]),max(cop.second,b[i])}] > it.second + d[i]))
                dp[i][{min(cop.first, a[i]),max(cop.second,b[i])}] = it.second + d[i];
        }
    }
    if(dp[1][{1,n}]==0)
        dp[1][{1,n}]=-1;
    cout<<dp[1][{1,n}];
    return 0;
}

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