oj.uz

Submission #342286

# Submission time Handle Problem Language Result Execution time Memory
342286 2021-01-01T17:46:13 Z dristiron3 Rabbit Carrot (LMIO19_triusis) C++17
63 / 100
 1000 ms 5484 KB 
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define ff first
#define ss second
#define pb push_back
#define db pop_back
#define mp make_pair
#define mt make_tuple
#define g(a, b) get<a>(b)
#define INF (ll)1e18 + 100
#define vl vector<ll>
#define vi vector<int>
#define vll vector<pair<ll, ll>>
#define vii vector<pair<int, int>>
#define all(v) v.begin(), v.end()
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
#define INT_SIZE 32
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
 
#define o_set tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define o_setpll tree<pair<ll,ll>, null_type, less<pair<ll,ll>>, rb_tree_tag, tree_order_statistics_node_update>
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set
ll powM(ll x, ll y, ll m)
{
	if (x == 0) {
		return 1;
	}
	ll ans = 1, r = 1;
	if(x >= m){
		x = x%m;
	}
	while (r > 0 && r <= y) {
		if (r & y) {
			ans *= x;
			if(ans >= m){
				ans = ans%m;
			}

		}
		r <<= 1;
		x *= x;
		if(x >= m){
			x = x%m;
		}
	}
	return ans;
}

ll modI(ll a, ll m)
{
	ll m0 = m, y = 0, x = 1;
	if (m == 1)
		return 0;
	while (a > 1) {
		ll q = a / m;
		ll t = m;
		m = a % m;
		a = t;
		t = y;
		y = x - q * y;
		x = t;
	}
	if (x < 0)
		x += m0;
	return x;
}
ll extended(ll a, ll b, ll &x, ll &y)
{
	if (a == 0) {
		x = 0;
		y = 1;
		return b;
	}
	ll x1, y1;
	ll d = extended(b % a, a, x1, y1);
	x = y1 - (b / a) * x1;
	y = x1;
	return d;
}
ll lcm(ll x, ll y) {
	ll gc = __gcd(x, y);
	x /= gc;
	if ((ll)(8e18) / y <= x) {
		return 8e18;
	}
	return (x * y);
}
ll power(ll x, ll y){
	if(y < 0){
		return 0;
	}
	ll ans = 1;
	REP(i,1,y+1){
		ans *= x;
	}
	return ans;
}
void setIO(string name = "") { // name is nonempty for USACO file I/O
    // alternatively, cin.tie(0)->sync_with_stdio(0);
    if (name.size()) {
        freopen((name+".in").c_str(), "r", stdin); // see Input & Output
        freopen((name+".out").c_str(), "w", stdout);
    }
}
void solve(){
	ll n, m;
	cin>>n>>m;
	vl v(n);
	REP(i,0,n){
		cin>>v[i];
	}
	vl dp(n+1,-1);
	vl ndp(n+1,-1);
	dp[0] = 0;
	REP(i,0,n){
		ndp.assign(n+1,-1);
		for(ll j=0; j<n; j++){
			if(dp[j] < 0){continue;}
			if(v[i] <= dp[j]+m){
				ndp[j] = max(ndp[j],v[i]);
			}
			ndp[j+1] = max(dp[j]+m,ndp[j+1]);
		}
		REP(j,0,n+1){
			dp[j] = ndp[j];
		}
	}
	REP(i,0,n+1){
		if(dp[i] >= 0){
			cout<<i; return;
		}
	}
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
// #ifndef ONLINE_JUDGE
	// setIO("hello");
// #endif
	ll ntc;
    // cin >> ntc;
    ntc = 1;
    REP(tc, 1, ntc + 1)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
	// cout<<"\nkela\n";
}

Compilation message

triusis.cpp: In function 'void setIO(std::string)':
triusis.cpp:122:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  122 |         freopen((name+".in").c_str(), "r", stdin); // see Input & Output
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp:123:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  123 |         freopen((name+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 35 ms 492 KB Output is correct
5 Correct 54 ms 512 KB Output is correct
6 Correct 39 ms 492 KB Output is correct
7 Correct 54 ms 492 KB Output is correct
8 Correct 54 ms 492 KB Output is correct
9 Correct 52 ms 492 KB Output is correct
10 Correct 64 ms 492 KB Output is correct
11 Correct 49 ms 492 KB Output is correct
12 Correct 53 ms 492 KB Output is correct
13 Correct 54 ms 492 KB Output is correct
14 Correct 51 ms 492 KB Output is correct
15 Correct 51 ms 492 KB Output is correct
16 Correct 51 ms 492 KB Output is correct
17 Correct 51 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 620 KB Output is correct
2 Correct 40 ms 492 KB Output is correct
3 Correct 41 ms 620 KB Output is correct
4 Correct 54 ms 620 KB Output is correct
5 Correct 46 ms 492 KB Output is correct
6 Correct 54 ms 492 KB Output is correct
7 Correct 51 ms 492 KB Output is correct
8 Correct 45 ms 492 KB Output is correct
9 Correct 51 ms 492 KB Output is correct
10 Correct 50 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 35 ms 492 KB Output is correct
15 Correct 54 ms 512 KB Output is correct
16 Correct 39 ms 492 KB Output is correct
17 Correct 54 ms 492 KB Output is correct
18 Correct 54 ms 492 KB Output is correct
19 Correct 52 ms 492 KB Output is correct
20 Correct 64 ms 492 KB Output is correct
21 Correct 49 ms 492 KB Output is correct
22 Correct 53 ms 492 KB Output is correct
23 Correct 54 ms 492 KB Output is correct
24 Correct 51 ms 492 KB Output is correct
25 Correct 51 ms 492 KB Output is correct
26 Correct 51 ms 492 KB Output is correct
27 Correct 51 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 620 KB Output is correct
2 Correct 40 ms 492 KB Output is correct
3 Correct 41 ms 620 KB Output is correct
4 Correct 54 ms 620 KB Output is correct
5 Correct 46 ms 492 KB Output is correct
6 Correct 54 ms 492 KB Output is correct
7 Correct 51 ms 492 KB Output is correct
8 Correct 45 ms 492 KB Output is correct
9 Correct 51 ms 492 KB Output is correct
10 Correct 50 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 35 ms 492 KB Output is correct
15 Correct 54 ms 512 KB Output is correct
16 Correct 39 ms 492 KB Output is correct
17 Correct 54 ms 492 KB Output is correct
18 Correct 54 ms 492 KB Output is correct
19 Correct 52 ms 492 KB Output is correct
20 Correct 64 ms 492 KB Output is correct
21 Correct 49 ms 492 KB Output is correct
22 Correct 53 ms 492 KB Output is correct
23 Correct 54 ms 492 KB Output is correct
24 Correct 51 ms 492 KB Output is correct
25 Correct 51 ms 492 KB Output is correct
26 Correct 51 ms 492 KB Output is correct
27 Correct 51 ms 492 KB Output is correct
28 Execution timed out 1098 ms 5484 KB Time limit exceeded
29 Halted 0 ms 0 KB -