oj.uz

Submission #589102

# Submission time Handle Problem Language Result Execution time Memory
589102 2022-07-04T09:23:59 Z Mazaalai Rabbit Carrot (LMIO19_triusis) C++17
63 / 100
 27 ms 580 KB 
#include <bits/stdc++.h>
// #pragma GCC optimize("O3, unroll-loops")
// #pragma GCC target("avx2")
// #define int long long
using namespace std;

#define _upgrade                  \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define LINE "---------------------\n"
#define ALL(A) A.begin(), A.end()
#define LLA(A) A.rbegin(), A.rend()
#define Q queue
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define lb lower_bound 
#define ub upper_bound 
#define sz(x) (int)x.size()

using ll = long long;
using db = double;
using ld = long double;
using uint = unsigned;
// PQ going up <int, VI, greater<int> >
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using PII = pair<int, int>;
using VPI = vector<PII>;
using VVPI = vector<VPI>;
using PLL = pair<ll, ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void eraseDups(VI& a) {
    a.erase(unique(a.begin(), a.end()), a.end());
}
int strToInt(string&a) {
    stringstream x(a);
    int b;
    x >> b;
    return b;
}
int bitCnt(int a) {
    bitset <64> b(a);
    return b.count();
}
int bitCnt(string a) {
    bitset <64> b(a);
    return b.count();
}

int gcd(int a, int b) {
   if (b == 0) return a;
   return gcd(b, a % b);
}
/*

|                    _                                                     
|  __   _           | |                                                    
| |   \| | ___  ___ | |_                                                   
| | |\ | |/ _ \/ __/| __|                                                  
| | | \  |  __/\__ \| |_                                                   
| |_|  \_|\___ /___/ \__|                                                  
|                                                      _         _   _     
|                                                     (_)       | | | |    
|  _ __  _ __ ___   __ _ _ __ __ _ _ __ ___  _ __ ___  _ ___ ___| |_| |_   
| | '_ \| '__/ _ \ / _` | '__/ _` | '_ ` _ \| '_ ` _ \| / __/ __| __| __|  
| | |_) | | | (_) | (_| | | | (_| | | | | | | | | | | | \__ \__ \ |_| |_   
| | .__/|_|  \___/ \__, |_|  \__,_|_| |_| |_|_| |_| |_|_|___/___/\__|\__|  
| | |               __/ |                                                  
| |_|              |___/                   _                               
|                                  _      (_)                              
|  _ __ ___   __ _ ____ __ _  __ _| | __ _ _                               
| | '_ ` _ \ / _` |_   / _` |/ _` | |/ _` | |                              
| | | | | | | (_|  /  / (_| | (_| | | (_| | |                              
| |_| |_| |_|\__,_|____\__,_|\__,_|_|\__,_|_|                              
*/

const db PI = acos(-1.0); //M_PI;
const ll INFF = 4e18;
const int INF = 1.07e9;
const int MOD = 1e9 + 7;
const int MOD1 = 998244353; //7*19*2^23 +1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};




const int N = 5e3 + 5;
const int M = 2e5 + 5;

int dp[N];
int n, m, k, q;
string s;
void go () {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int num; cin >> num;
        for (int j = i; j >= 0; j--) {
            if (dp[j]+m >= num && dp[j] >= 0) dp[j] = num;
            else dp[j] = -1;
            if (j > 0 && dp[j-1] >= 0) dp[j] = max(dp[j], dp[j-1]+m);
        }
        // for (int j = 0; j <= n; j++) cout << dp[j] << " \n"[j==n];
    }
    int ans = 0;
    while(dp[ans] == -1) ans++;
    cout << ans << '\n';
}



signed main () {

#ifndef ONLINE_JUDGE
    // freopen("0.in", "r", stdin);
    // freopen("0.out", "w", stdout);
#endif
    _upgrade
    int T = 1;
    while(T--) go();
    return (0-0); //<3
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    
*/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 0 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 0 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 324 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 1 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 0 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 0 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 0 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 13 ms 344 KB Output is correct
21 Correct 16 ms 344 KB Output is correct
22 Correct 16 ms 340 KB Output is correct
23 Correct 15 ms 336 KB Output is correct
24 Correct 14 ms 340 KB Output is correct
25 Correct 14 ms 340 KB Output is correct
26 Correct 14 ms 348 KB Output is correct
27 Correct 14 ms 340 KB Output is correct
28 Correct 15 ms 360 KB Output is correct
29 Correct 15 ms 352 KB Output is correct
30 Correct 15 ms 364 KB Output is correct
31 Correct 18 ms 360 KB Output is correct
32 Correct 16 ms 372 KB Output is correct
33 Correct 20 ms 340 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 13 ms 344 KB Output is correct
5 Correct 16 ms 344 KB Output is correct
6 Correct 16 ms 340 KB Output is correct
7 Correct 15 ms 336 KB Output is correct
8 Correct 14 ms 340 KB Output is correct
9 Correct 14 ms 340 KB Output is correct
10 Correct 14 ms 348 KB Output is correct
11 Correct 14 ms 340 KB Output is correct
12 Correct 15 ms 360 KB Output is correct
13 Correct 15 ms 352 KB Output is correct
14 Correct 15 ms 364 KB Output is correct
15 Correct 18 ms 360 KB Output is correct
16 Correct 16 ms 372 KB Output is correct
17 Correct 20 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 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 0 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 0 ms 212 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 328 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 324 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 16 ms 340 KB Output is correct
35 Correct 19 ms 340 KB Output is correct
36 Correct 15 ms 392 KB Output is correct
37 Correct 16 ms 336 KB Output is correct
38 Correct 18 ms 384 KB Output is correct
39 Correct 15 ms 388 KB Output is correct
40 Correct 14 ms 340 KB Output is correct
41 Correct 13 ms 340 KB Output is correct
42 Correct 14 ms 344 KB Output is correct
43 Correct 14 ms 340 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 340 KB Output is correct
2 Correct 19 ms 340 KB Output is correct
3 Correct 15 ms 392 KB Output is correct
4 Correct 16 ms 336 KB Output is correct
5 Correct 18 ms 384 KB Output is correct
6 Correct 15 ms 388 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 13 ms 340 KB Output is correct
9 Correct 14 ms 344 KB Output is correct
10 Correct 14 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 13 ms 344 KB Output is correct
15 Correct 16 ms 344 KB Output is correct
16 Correct 16 ms 340 KB Output is correct
17 Correct 15 ms 336 KB Output is correct
18 Correct 14 ms 340 KB Output is correct
19 Correct 14 ms 340 KB Output is correct
20 Correct 14 ms 348 KB Output is correct
21 Correct 14 ms 340 KB Output is correct
22 Correct 15 ms 360 KB Output is correct
23 Correct 15 ms 352 KB Output is correct
24 Correct 15 ms 364 KB Output is correct
25 Correct 18 ms 360 KB Output is correct
26 Correct 16 ms 372 KB Output is correct
27 Correct 20 ms 340 KB Output is correct
28 Correct 1 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 0 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 0 ms 212 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 328 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 324 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Runtime error 27 ms 580 KB Execution killed with signal 11
45 Halted 0 ms 0 KB -