oj.uz

답안 #589077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589077 2022-07-04T09:11:48 Z Mazaalai Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 46 ms 98300 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 nums[N];

int dp[N][N];
int n, m, k, q;
string s;
void go () {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> nums[i];
    memset(dp, -1, sizeof(dp));
    for (int i = 0; i <= n; i++) dp[0][i] = 0;
    for (int i = 1; i <= n; i++) 
    for (int j = 0; j <= n; j++) {
        if (dp[i-1][j]+m >= nums[i]) dp[i][j] = nums[i];
        if (j > 0 && dp[i-1][j-1] != -1) dp[i][j] = max(dp[i][j], dp[i-1][j-1]+m);
    }
    int ans = 0;
    while(dp[n][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
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 98252 KB Output is correct
2 Correct 37 ms 98260 KB Output is correct
3 Correct 37 ms 98240 KB Output is correct
4 Incorrect 36 ms 98300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 98252 KB Output is correct
2 Correct 37 ms 98260 KB Output is correct
3 Correct 37 ms 98240 KB Output is correct
4 Incorrect 36 ms 98300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 98252 KB Output is correct
2 Correct 37 ms 98260 KB Output is correct
3 Correct 37 ms 98240 KB Output is correct
4 Incorrect 36 ms 98300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 98252 KB Output is correct
2 Correct 37 ms 98260 KB Output is correct
3 Correct 37 ms 98240 KB Output is correct
4 Incorrect 36 ms 98300 KB Output isn't correct
5 Halted 0 ms 0 KB -