Submission #401772

#TimeUsernameProblemLanguageResultExecution timeMemory
401772lukameladzePinball (JOI14_pinball)C++14
11 / 100
1095 ms247028 KiB
# include <bits/stdc++.h> #define f first #define s second #define pb push_back using namespace std; const int N=3e5+5; long long dp[N],dp1[N],n,m,a[N],b[N],c[N],d[N],ans; map <long long,long long> tree; void update(long long node, long long le, long long ri ,long long idx, long long val) { if (le>idx || ri<idx) return; if (le==ri) { tree[node]=min(tree[node],val); return ; } int mid=(le+ri)/2; update(2*node, le ,mid, idx, val); update(2*node+1, mid+1, ri, idx, val); tree[node]=min(tree[2*node],tree[2*node+1]); } long long getans(long long node, long long le, long long ri ,long long start, long long end) { if (le>end || ri<start) return 1e17; if (le>=start && ri<=end) { return tree[node]; } int mid=(le+ri)/2; return min(getans(2*node, le ,mid, start, end),getans(2*node+1, mid+1, ri, start,end)); } int main() { cin>>m>>n; for (int i=1; i<=m; i++) { cin>>a[i]>>b[i]>>c[i]>>d[i]; } for (int i=1; i<=4*n; i++) { tree[i]=1e17; } for (int i=1; i<=m; i++) { if (a[i]==1) { dp[i]=d[i]; update(1,1,n,c[i],dp[i]); continue; } dp[i]=getans(1,1,n,a[i],b[i])+d[i]; update(1,1,n,c[i],dp[i]); //cout<<dp[5]<<endl; } for (int i=1; i<=4*n; i++) { tree[i]=1e17; } for (int i=1; i<=m; i++) { if (b[i]==n) { dp1[i]=d[i]; update(1,1,n,c[i],dp1[i]); continue; } dp1[i]=getans(1,1,n,a[i],b[i])+d[i]; update(1,1,n,c[i],dp1[i]); } ans=1e17; for (int i=1; i<=m; i++) { // cout<<dp[i]<<" "<<dp1[i]<<" "<<dp1[i]-d[i]<<" "<<d[i]<<" "<<dp[i]+dp1[i]-d[i]<<endl; ans=min(ans, dp[i]+dp1[i]-d[i]); } if (ans==1e17) cout<<-1<<endl;else cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...