oj.uz

Submission #939366

# Submission time Handle Problem Language Result Execution time Memory
939366 2024-03-06T10:02:50 Z Baizho Rabbit Carrot (LMIO19_triusis) C++14
35 / 100
 59 ms 99180 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt,avx2")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 2e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int n, m, a[N], dp[5005][5005], suf[5005];

void Baizho() {
	cin>>n>>m;	
	for(int i = 0; i <= 5001; i ++) dp[0][i] = suf[i] = n + 1;
	dp[0][0] = 0;
	suf[0] = 0;
	for(int i = 1; i <= n; i ++) {
		cin>>a[i];
		for(int j = 0; j <= 5000; j ++) {
			dp[i][j] = suf[max(0, j - m)] + (j != a[i]);
		}
		suf[5000] = dp[i][5000];
		for(int j = 4999; j >= 0; j --) suf[j] = min(suf[j + 1], dp[i][j]);
	}
	cout<<suf[0];
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

triusis.cpp: In function 'void Freopen(std::string)':
triusis.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 48 ms 81864 KB Output is correct
21 Correct 56 ms 98900 KB Output is correct
22 Correct 59 ms 98944 KB Output is correct
23 Correct 52 ms 98892 KB Output is correct
24 Correct 53 ms 98896 KB Output is correct
25 Correct 52 ms 98896 KB Output is correct
26 Correct 56 ms 98896 KB Output is correct
27 Correct 52 ms 98896 KB Output is correct
28 Correct 57 ms 98896 KB Output is correct
29 Correct 56 ms 99180 KB Output is correct
30 Correct 54 ms 98956 KB Output is correct
31 Correct 55 ms 98908 KB Output is correct
32 Correct 53 ms 99104 KB Output is correct
33 Correct 53 ms 98984 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 48 ms 81864 KB Output is correct
5 Correct 56 ms 98900 KB Output is correct
6 Correct 59 ms 98944 KB Output is correct
7 Correct 52 ms 98892 KB Output is correct
8 Correct 53 ms 98896 KB Output is correct
9 Correct 52 ms 98896 KB Output is correct
10 Correct 56 ms 98896 KB Output is correct
11 Correct 52 ms 98896 KB Output is correct
12 Correct 57 ms 98896 KB Output is correct
13 Correct 56 ms 99180 KB Output is correct
14 Correct 54 ms 98956 KB Output is correct
15 Correct 55 ms 98908 KB Output is correct
16 Correct 53 ms 99104 KB Output is correct
17 Correct 53 ms 98984 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 1 ms 4696 KB Output is correct
23 Correct 1 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 1 ms 4700 KB Output is correct
30 Correct 1 ms 4700 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 55 ms 99180 KB Output is correct
35 Incorrect 54 ms 99144 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 99180 KB Output is correct
2 Incorrect 54 ms 99144 KB Output isn't correct
3 Halted 0 ms 0 KB -