Submission #914628

#	Time	Username	Problem	Language	Result	Execution time	Memory
914628		bachhoangxuan	도장 모으기 (JOI14_stamps)	C++17	100 / 100	62 ms	71204 KiB

stamps

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=3005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int n,T,dp[maxn][maxn],U[maxn],V[maxn],D[maxn],E[maxn];

void solve(){
    cin >> n >> T;
    for(int i=1;i<=n;i++) cin >> U[i] >> V[i] >> D[i] >> E[i];
    for(int i=1;i<=n;i++) dp[0][i]=inf;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=n;j++){
            dp[i][j]=inf;
            int val=U[i]+V[i];
            if(j) val=min(val,D[i]+E[i]);
            dp[i][j]=min(dp[i][j],dp[i-1][j]+2*T*j+val);
        }
        int Min=inf;
        for(int j=n;j>=0;j--){
            if(Min!=inf) dp[i][j]=min(dp[i][j],Min-j*(U[i]+E[i]));
            Min=min(Min,dp[i-1][j]+j*(U[i]+E[i])+2*T*j);
        }
        Min=inf;
        for(int j=0;j<=n;j++){
            if(Min!=inf) dp[i][j]=min(dp[i][j],Min+j*(D[i]+V[i]));
            Min=min(Min,dp[i-1][j]-j*(D[i]+V[i])+2*T*j);
        }
    }
    cout << dp[n][0]+(n+1)*T << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 75 / 75
• Subtask 3: 15 / 15