oj.uz

답안 #467078

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467078 2021-08-21T16:07:22 Z MVP_Harry The short shank; Redemption (BOI21_prison) C++17
0 / 100
 69 ms 8680 KB 
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define per(i, m, n) for (int i = m; i >= n; i--)
#define sz(v) (int) v.size()
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const int maxn = 2e6 + 5;

int N, D, T;
int t[maxn], a[maxn];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> N >> D >> T;
	rep(i, 1, N) cin >> t[i];
	a[1] = t[1];
	rep(i, 2, N) a[i] = min(t[i], a[i - 1] + 1);
	int ptr = 1, ans = 0;
	vector<int> num;
	while (ptr <= N) {
		if (t[ptr] <= T) {
			ptr++;
			continue;
		}
		int j = ptr + 1, cnt = ((a[ptr] > T) ? 1 : 0);
		while (j <= N && t[j] > T) {
			if (a[j] > T) cnt++;
			j++;
		}
		if (ptr == 1) ans += j - ptr - cnt;
		else num.push_back(j - ptr - cnt);
		ptr = j;
	}
	sort(all(num), greater<int>());
	rep(i, 0, min(D - 1, sz(num) - 1)) ans += num[i];
	rep(i, 1, N) if (a[i] > T) ans++;
	cout << N - ans << endl;
	return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 1 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 69 ms 5172 KB Output is correct
3 Correct 68 ms 5148 KB Output is correct
4 Correct 60 ms 5148 KB Output is correct
5 Correct 50 ms 5188 KB Output is correct
6 Incorrect 62 ms 8680 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 1 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 13 ms 1412 KB Output is correct
3 Correct 11 ms 1492 KB Output is correct
4 Correct 9 ms 1344 KB Output is correct
5 Correct 11 ms 1216 KB Output is correct
6 Correct 11 ms 1272 KB Output is correct
7 Incorrect 10 ms 1400 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 1 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 1 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -