oj.uz

답안 #912284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912284 2024-01-19T09:34:36 Z vjudge1 Rabbit Carrot (LMIO19_triusis) C++17
14 / 100
 14 ms 496 KB 
// #pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")  
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define sz(x) (int)x.size()
#define bit(a, i) ((a>>i)&1)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int P = 18;
const int K = 800;
const ll INF = 2e18;
const int inf = 1e9;
const int mod = 1e9+7;
const int maxm = 5e2+10;
const int maxn = 2e5+10;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {1, -1, 0, 0};

int n, m;
int a[maxn];
int dp[maxn];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    int ans = n;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        dp[i] = inf;
        for(int j=i-1; j>=max(0, i-1000); j--){
            if((i-j)*1ll*m+a[j] >= a[i]){
                dp[i] = min(dp[j]+i-j-1, dp[i]);
            }
        } ans = min(ans, dp[i]+n-i);
    } cout << ans;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 5 ms 348 KB Output is correct
21 Correct 6 ms 348 KB Output is correct
22 Correct 14 ms 484 KB Output is correct
23 Correct 6 ms 348 KB Output is correct
24 Correct 6 ms 348 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 6 ms 348 KB Output is correct
27 Correct 12 ms 348 KB Output is correct
28 Correct 7 ms 348 KB Output is correct
29 Correct 6 ms 348 KB Output is correct
30 Correct 6 ms 496 KB Output is correct
31 Incorrect 6 ms 344 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 14 ms 484 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 6 ms 348 KB Output is correct
11 Correct 12 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 6 ms 496 KB Output is correct
15 Incorrect 6 ms 344 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 14 ms 484 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 6 ms 348 KB Output is correct
11 Correct 12 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 6 ms 496 KB Output is correct
15 Incorrect 6 ms 344 KB Output isn't correct
16 Halted 0 ms 0 KB -