| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 955820 | vjudge1 | Pinball (JOI14_pinball) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<tuple<long long,long long,long long,long long> > v;
long long n,m;
bool visited[1002][605][605];
long long dp[10002][605][605];
map<long long,long long> prevod;
bool gotovo=false;
long long p=1;
long long f(long long poz,long long l,long long r)
{
//cout<< "poz = "<<poz<<" l="<<l<<" r="<<r<<endl;
if (poz==-1)
{
if (l==1 && r==prevod[n])
{
gotovo=true;
return 0;
}
return 1000000000000000;
}
if (visited[poz][l][r]) return dp[poz][l][r];
long long op1=f(poz-1,l,r);
long long op2=1000000000000000;
long long a=get<0>(v[poz]),b=get<1>(v[poz]),c=get<2>(v[poz]);
if (c>=l && c<=r) op2=f(poz-1,min(a,l),max(b,r))+get<3>(v[poz]);
long long odg=min(op1,op2);
visited[poz][l][r]=true;
dp[poz][l][r]=odg;
return odg;
}
int main()
{
cin>>m>>n;
vector<long long> pocetni;
for (long long i=0;i<m;i++)
{
long long a,b,c,d;
cin>>a>>b>>c>>d;
pocetni.push_back(a);
pocetni.push_back(b);
pocetni.push_back(c);
v.push_back({a,b,c,d});
}
sort(pocetni.begin(),pocetni.end());
for (long long i=0;i<pocetni.size();i++)
{
long long x=pocetni[i];
if (prevod[x]==0)
{
prevod[x]=p;
p++;
}
}
if (prevod[n]==0) prevod[n]=p;
for (long long i=0;i<v.size();i++)
{
get<0>(v[i])=prevod[get<0>(v[i])];
get<1>(v[i])=prevod[get<1>(v[i])];
get<2>(v[i])=prevod[get<2>(v[i])];
}
long long odg=1000000000000000;
for (long long i=m-1;i>=0;i--)
odg = min(odg,get<3>(v[i])+f(i-1,get<0>(v[i]),get<1>(v[i])));
if (gotovo==false || pocetni[0]!=1) odg=-1;
cout<<odg<<endl;
return 0;
}