oj.uz

Submission #568780

# Submission time Handle Problem Language Result Execution time Memory
568780 2022-05-26T07:58:45 Z anurag203 Rabbit Carrot (LMIO19_triusis) C++17
63 / 100
 1000 ms 1888 KB 
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.141592653589793238462
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i, init, n) for (int i = init; i < (int)n; i++)
#define rev(i, n, init) for (int i = (int)n; i >= init; i--)
#define V vector<int>
#define VV vector<V>
#define Vll vector<ll>
#define VVll vector<Vll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define Vpii vector<pii>
#define VVpii vector<Vpii>
#define Vpll vector<pll> 
#define VVpll vector<Vpll>
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // find_by_order, order_of_key

#ifndef Anurag203
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}

template <class T, class vv> void _print(pair <T, vv> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class vv> void _print(map <T, vv> v);
template <class T> void _print(multiset <T> v);
template <class T> void _print(ordered_set <T> v);
template <class T, class vv> void _print(pair <T, vv> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class vv> void _print(map <T, vv> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(ordered_set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
/*----------------------------------------------------------------------------------------------------------------------------------------------------*/
ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
ll powe(ll x,ll y, ll p=mod){ll res = 1; x = x % p;while (y > 0){ if (y & 1) res = (res * x) % p;y = y >> 1; x = (x * x) % p;} return res;}
bool revsort(ll a, ll b) {return a > b;}
ll inverse_modulo(ll a, ll p = mod) {return powe(a, p - 2, p);}
Vll fact; void fill_fact(ll p = mod) {fact.resize(200005, 1); rep(i, 1, 200005) { fact[i] = (fact[i - 1] * i) % p; }}
ll C(ll n,ll r,ll p=mod) {return ((fact[n]*inverse_modulo(fact[n-r]))%mod*inverse_modulo(fact[r]))%mod;}
void google(int t) {cout << "Case #" << t << ": ";}
Vll spf; void sieve(ll n = 200005) {spf.resize(n + 1, 1); ll i, j; for (ll i = 2; i <= n; i++) {if (spf[i] == 1) {spf[i] = i; for (j = i * i; j <= n; j += i){if (spf[j] == 1) spf[j] = i;}}}}
bool is_prime(ll x) {return (spf[x] == x);}
Vpll prime_factors(ll x) {Vpll ans; while (x != 1) {ll a = spf[x], cnt = 0; while (x % a == 0) x /= a, cnt++; ans.pb({a, cnt});}return ans;}
/*----------------------------------------------------------------------------------------------------------------------------------------------------*/

void solve()
{
    int n,m;cin>>n>>m;
    V a(n+1);
    rep(i,1,n+1) cin>>a[i];
    a.pb(0);n++;
    V dp(n+1,1e9);
    dp[0] = 0;
    rep(i,1,n+1)
    {
        rev(j,i-1,0)
        {
            if ((m * i) - a[i] >= (j * m - a[j]))
            {
                dp[i] = min(dp[i], dp[j] + i - j - 1);
            }
        }
    }
    cout << dp[n] << endl;
}
int main() {
#ifndef Anurag203
    freopen("Error.txt", "w", stderr);
#endif
    fastio();
    // freopen("output.in", "r", stdin);
    // freopen("output.out", "w", stdout);

    int tt = 1;
    // cin>>tt;
    rep(ii, 1, tt + 1)
    {
        // google(ii);
        solve();
    }       
    return 0;
}

Compilation message

triusis.cpp: In function 'void sieve(long long int)':
triusis.cpp:66:62: warning: unused variable 'i' [-Wunused-variable]
   66 | Vll spf; void sieve(ll n = 200005) {spf.resize(n + 1, 1); ll i, j; for (ll i = 2; i <= n; i++) {if (spf[i] == 1) {spf[i] = i; for (j = i * i; j <= n; j += i){if (spf[j] == 1) spf[j] = i;}}}}
      |                                                              ^
triusis.cpp: In function 'int main()':
triusis.cpp:93:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |     freopen("Error.txt", "w", stderr);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 28 ms 352 KB Output is correct
21 Correct 43 ms 340 KB Output is correct
22 Correct 45 ms 340 KB Output is correct
23 Correct 46 ms 340 KB Output is correct
24 Correct 47 ms 344 KB Output is correct
25 Correct 50 ms 348 KB Output is correct
26 Correct 48 ms 340 KB Output is correct
27 Correct 48 ms 348 KB Output is correct
28 Correct 44 ms 364 KB Output is correct
29 Correct 45 ms 352 KB Output is correct
30 Correct 47 ms 344 KB Output is correct
31 Correct 28 ms 340 KB Output is correct
32 Correct 44 ms 352 KB Output is correct
33 Correct 44 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 28 ms 352 KB Output is correct
5 Correct 43 ms 340 KB Output is correct
6 Correct 45 ms 340 KB Output is correct
7 Correct 46 ms 340 KB Output is correct
8 Correct 47 ms 344 KB Output is correct
9 Correct 50 ms 348 KB Output is correct
10 Correct 48 ms 340 KB Output is correct
11 Correct 48 ms 348 KB Output is correct
12 Correct 44 ms 364 KB Output is correct
13 Correct 45 ms 352 KB Output is correct
14 Correct 47 ms 344 KB Output is correct
15 Correct 28 ms 340 KB Output is correct
16 Correct 44 ms 352 KB Output is correct
17 Correct 44 ms 348 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 45 ms 340 KB Output is correct
35 Correct 55 ms 340 KB Output is correct
36 Correct 56 ms 340 KB Output is correct
37 Correct 43 ms 348 KB Output is correct
38 Correct 38 ms 344 KB Output is correct
39 Correct 47 ms 340 KB Output is correct
40 Correct 31 ms 340 KB Output is correct
41 Correct 46 ms 348 KB Output is correct
42 Correct 48 ms 340 KB Output is correct
43 Correct 49 ms 340 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 340 KB Output is correct
2 Correct 55 ms 340 KB Output is correct
3 Correct 56 ms 340 KB Output is correct
4 Correct 43 ms 348 KB Output is correct
5 Correct 38 ms 344 KB Output is correct
6 Correct 47 ms 340 KB Output is correct
7 Correct 31 ms 340 KB Output is correct
8 Correct 46 ms 348 KB Output is correct
9 Correct 48 ms 340 KB Output is correct
10 Correct 49 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 28 ms 352 KB Output is correct
15 Correct 43 ms 340 KB Output is correct
16 Correct 45 ms 340 KB Output is correct
17 Correct 46 ms 340 KB Output is correct
18 Correct 47 ms 344 KB Output is correct
19 Correct 50 ms 348 KB Output is correct
20 Correct 48 ms 340 KB Output is correct
21 Correct 48 ms 348 KB Output is correct
22 Correct 44 ms 364 KB Output is correct
23 Correct 45 ms 352 KB Output is correct
24 Correct 47 ms 344 KB Output is correct
25 Correct 28 ms 340 KB Output is correct
26 Correct 44 ms 352 KB Output is correct
27 Correct 44 ms 348 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Execution timed out 1092 ms 1888 KB Time limit exceeded
45 Halted 0 ms 0 KB -