oj.uz

답안 #639924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639924 2022-09-12T17:28:49 Z ghostwriter JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 31 ms 3188 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
const int oo = 1e9;
const int N = 2e5 + 1;
int n, k, d[N][3], rs = oo;
str s;
#define getid(x) (x == 'J'? 0 : x == 'O'? 1 : 2)
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> k;
    cin >> s;
    s = "#" + s + "#";
    FOR(i, 1, n) {
    	FOR(j, 0, 2) d[i][j] = d[i - 1][j];
    	++d[i][getid(s[i])];
    }
    FOR(i, 1, n) {
    	int l = 1, r = i, ans = -1, total = 0;
    	WHILE(l <= r) {
    		int mid = l + (r - l) / 2;
    		if (d[i][2] - d[mid - 1][2] >= k) {
    			ans = mid;
    			l = mid + 1;
    		}
    		else r = mid - 1;
    	}
    	if (ans == -1) continue;
    	// debug(i, ans);
    	total += i - ans + 1 - k;
    	int pos = ans - 1;
    	l = 1;
    	r = pos;
    	ans = -1;
    	WHILE(l <= r) {
    		int mid = l + (r - l) / 2;
    		if (d[pos][1] - d[mid - 1][1] >= k) {
    			ans = mid;
    			l = mid + 1;
    		}
    		else r = mid - 1;
    	}
    	if (ans == -1) continue;
    	// debug(pos, ans);
    	total += pos - ans + 1 - k;
    	pos = ans - 1;
    	l = 1;
    	r = pos;
    	ans = -1;
    	WHILE(l <= r) {
    		int mid = l + (r - l) / 2;
    		if (d[pos][0] - d[mid - 1][0] >= k) {
    			ans = mid;
    			l = mid + 1;
    		}
    		else r = mid - 1;
    	}
    	if (ans == -1) continue;
    	// debug(pos, ans);
    	total += pos - ans + 1 - k;
    	rs = min(rs, total);
    }
    cout << (rs < oo? rs : -1);
    return 0;
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
ho_t2.cpp:48:5: note: in expansion of macro 'FOR'
   48 |     FOR(i, 1, n) {
      |     ^~~
ho_t2.cpp:24:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
ho_t2.cpp:49:6: note: in expansion of macro 'FOR'
   49 |      FOR(j, 0, 2) d[i][j] = d[i - 1][j];
      |      ^~~
ho_t2.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
ho_t2.cpp:52:5: note: in expansion of macro 'FOR'
   52 |     FOR(i, 1, n) {
      |     ^~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 328 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 328 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 340 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 328 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 30 ms 2932 KB Output is correct
37 Correct 28 ms 3160 KB Output is correct
38 Correct 28 ms 3160 KB Output is correct
39 Correct 28 ms 3160 KB Output is correct
40 Correct 20 ms 3160 KB Output is correct
41 Correct 25 ms 3188 KB Output is correct
42 Correct 31 ms 3144 KB Output is correct
43 Correct 14 ms 2152 KB Output is correct
44 Correct 15 ms 2480 KB Output is correct
45 Correct 19 ms 3160 KB Output is correct
46 Correct 17 ms 3160 KB Output is correct
47 Correct 20 ms 3160 KB Output is correct
48 Correct 18 ms 3140 KB Output is correct
49 Correct 12 ms 2268 KB Output is correct
50 Correct 18 ms 3160 KB Output is correct
51 Correct 20 ms 3156 KB Output is correct
52 Correct 12 ms 3048 KB Output is correct
53 Correct 10 ms 3160 KB Output is correct
54 Correct 14 ms 3184 KB Output is correct
55 Correct 9 ms 3160 KB Output is correct
56 Correct 8 ms 3160 KB Output is correct