Submission #1197003

#TimeUsernameProblemLanguageResultExecution timeMemory
1197003mychecksedadSki 2 (JOI24_ski2)C++20
0 / 100
608 ms880380 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+5, M = 1e5+10, K = 52, MX = 30; const ll INF = 1e14; int n; ll k, p[605], dp[605][N][N][2], mn[605]; array<ll, 2> a[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 = 605; 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 <= p[h]; ++i){ for(int l = 0; l <= p[h]; ++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 = 1; 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(p[h] > p[h - 1]){ dp[h][p[h] - 1][1][1] = min(dp[h][p[h] - 1][1][1], dp[h - 1][p[h - 1]][0][0] + (p[h] - 1) * k); } dp[h][p[h]][0][0] = min(dp[h][p[h]][0][0], dp[h - 1][p[h - 1]][0][0] + p[h] * k); } 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; }

Compilation message (stderr)

Main.cpp: In function 'void solve()':
Main.cpp:28:36: warning: iteration 605 invokes undefined behavior [-Waggressive-loop-optimizations]
   28 |   for(int i = 0; i <= m; ++i) p[i] = 0, mn[i] = INF;
      |                               ~~~~~^~~
Main.cpp:28:20: note: within this loop
   28 |   for(int i = 0; i <= m; ++i) p[i] = 0, mn[i] = INF;
      |                  ~~^~~~
Main.cpp:33:55: warning: iteration 604 invokes undefined behavior [-Waggressive-loop-optimizations]
   33 |   for(int i = 1; i <= m; ++i) p[i] += p[i - 1], mn[i] = min(mn[i], mn[i - 1]);
      |                                                 ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:33:20: note: within this loop
   33 |   for(int i = 1; i <= m; ++i) p[i] += p[i - 1], mn[i] = min(mn[i], mn[i - 1]);
      |                  ~~^~~~
Main.cpp:35:28: warning: iteration 605 invokes undefined behavior [-Waggressive-loop-optimizations]
   35 |     for(int i = 0; i <= p[h]; ++i){
      |                         ~~~^
Main.cpp:34:20: note: within this loop
   34 |   for(int h = 0; h <= m; ++h){
      |                  ~~^~~~
Main.cpp:28:36: warning: 'void* __builtin_memset(void*, int, long unsigned int)' writing 4848 bytes into a region of size 4840 overflows the destination [-Wstringop-overflow=]
   28 |   for(int i = 0; i <= m; ++i) p[i] = 0, mn[i] = INF;
      |                               ~~~~~^~~
Main.cpp:18:7: note: destination object 'p' of size 4840
   18 | ll k, p[605], dp[605][N][N][2], mn[605];
      |       ^
#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...