제출 #1196995

#제출 시각아이디문제언어결과실행 시간메모리
1196995mychecksedadSki 2 (JOI24_ski2)C++20
0 / 100
2104 ms194296 KiB
/* Author : Mychecksdead */ #include<bits/stdc++.h> using namespace std; #define ll long long int #define MOD (1000000000+7) #define MOD1 (998244353) #define pb push_back #define all(x) x.begin(), x.end() #define en cout << '\n' #define ff first #define ss second #define pii pair<int,int> #define vi vector<int> const int N = 300+100, M = 1e5+10, K = 52, MX = 30; const ll INF = 1e18; int n; ll k, p[N], dp[N][N][N][2], mn[N]; array<ll, 2> a[N], b[N]; void solve(){ cin >> n >> k; for(int i = 1; i <= n; ++i){ cin >> a[i][0] >> a[i][1]; ++a[i][0]; } ll ans = INF; int m = 100; for(int i = 0; i <= m; ++i) p[i] = 0, mn[i] = INF; for(int i = 1; i <= n; ++i){ p[a[i][0]]++; mn[a[i][0]] = min(mn[a[i][0]], a[i][1]); } for(int i = 1; i <= m; ++i) p[i] += p[i - 1], mn[i] = min(mn[i], mn[i - 1]); for(int h = 0; h <= m; ++h){ for(int i = 0; i <= n; ++i){ for(int l = 0; l <= n; ++l) dp[h][i][l][0] = dp[h][i][l][1] = INF; } } sort(a+1, a+1+n); dp[0][0][0][0] = 0; for(int h = 1; h <= a[n][0] + n; ++h){ // for(int j = 0; j <= p[h - 1]; ++j){ // int sz = j + p[h] - p[h - 1]; // for(int mx = sz; mx <= n; ++mx){ // dp[h][0][mx] = min(dp[h][0][mx], dp[h - 1][j][mx]); // } // } for(int j = 0; j <= p[h - 1]; ++j){ for(int i = 0; i <= p[h] - p[h - 1] + j; ++i){ int sz = p[h] - p[h - 1] + j - i; for(int mx = 0; mx <= p[h]; ++mx){ dp[h][i][max(mx, sz)][1] = min(dp[h][i][max(mx, sz)][1], dp[h - 1][j][mx][1] + max(0ll, (sz - mx) * mn[h - 1]) + i * k); if(sz == 1 && mx == 0 && j == p[h - 1]){ // if(h == 1){ // cout << j << ' ' << i << ' ' << dp[h-1][j][mx][0] << "wtf\n"; // } dp[h][i][max(mx, sz)][1] = min(dp[h][i][max(mx, sz)][1], dp[h - 1][j][mx][0] + i * k); } if(sz == 0 && mx == 0 && i == p[h] && j == p[h - 1]){ dp[h][i][max(mx, sz)][0] = min(dp[h][i][max(mx, sz)][0], dp[h - 1][j][mx][0] + i * k); } } } } // for(int j = 0; j <= n; ++j){ // for(int mx = 0; mx <= n; ++mx){ // cout << h << ' ' << j << ' ' << mx << ' ' << dp[h][j][mx][0] << ' ' << dp[h][j][mx][1] << '\n'; // } // en; // } // en; } // for(int i = 1; i <= n; ++i){ // cout << b[i][0] << ' ' << b[i][1] << '\n'; // } for(int h = a[n][0]; h <= a[n][0] + n; ++h){ for(int mx = 1; mx <= n; ++mx) ans = min(ans, dp[h][0][mx][1]); } cout << ans; } int main(){ cin.tie(0); ios::sync_with_stdio(0); int tt = 1, aa; // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); while(tt--){ solve(); en; } cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n"; 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...