제출 #955777

#제출 시각아이디문제언어결과실행 시간메모리
955777vjudge1Pinball (JOI14_pinball)C++17
11 / 100
13 ms25180 KiB
#include <bits/stdc++.h> using namespace std; vector<tuple<long long,long long,long long,long long> > v; long long n,m; bool visited[205][605][605]; long long dp[205][605][605]; bool gotovo=false; 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==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; for (long long i=0;i<m;i++) { long long a,b,c,d; cin>>a>>b>>c>>d; v.push_back({a,b,c,d}); } 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) odg=-1; cout<<odg<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...