Submission #562535

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
562535	2022-05-14T14:35:02 Z	dattranxxx	JJOOII 2 (JOI20_ho_t2)	C++11	100 / 100	30 ms	2676 KB

ho_t2

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void file() {
	const string FILE_NAME = "FILE_NAME";
	freopen((FILE_NAME + ".inp").c_str(), "r", stdin);
	freopen((FILE_NAME + ".out").c_str(), "w", stdout);
}
const int N = 2e5 + 5;
int a[N], J[N], O[N], I[N];
int n, K;
int check(int l, int r) {
	/* 
	doan (l, r] thoa man <=> ton tai i, j, k thoa man
	l < i < j < r
	J[i] >= K + J[l]
	O[j] >= K + O[i]
	I[r] >= K + I[j]
	*/
	if (r - l < K * 3) return 0;
	int i = lower_bound(J + l + 1, J + n, K + J[l]) - J;
	if (i >= r) return 0;
	int j = lower_bound(O + i + 1, O + n, K + O[i]) - O;
	if (j >= r) return 0;
	return I[r] >= K + I[j];
}
int main() {
	cin.tie(0)->sync_with_stdio(0); cout.tie(0);
	cin >> n >> K;
	char c;
	for (int i = 1; i <= n; ++i) 
		cin >> c,
		J[i] = J[i-1] + (c == 'J'),
		O[i] = O[i-1] + (c == 'O'),
		I[i] = I[i-1] + (c == 'I');
	
	int res = -1;
	for (int l = 0, r = 1; l < n; ++l) {
		// (l, r]
		while (r <= n && !check(l, r)) r++;
		if (r == n + 1) break;
		res = res == -1 ? r - l - K * 3 : min(res, r - l - K * 3);
	}
	cout << res;
	return 0;
}

Compilation message

ho_t2.cpp: In function 'void file()':
ho_t2.cpp:6:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |  freopen((FILE_NAME + ".inp").c_str(), "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t2.cpp:7:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |  freopen((FILE_NAME + ".out").c_str(), "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 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	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 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	0 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 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	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 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	0 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 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	340 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	360 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	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct

Subtask #3
87.0 / 87.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 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	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 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	0 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 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	340 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	360 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	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	29 ms	2388 KB	Output is correct
37	Correct	28 ms	2676 KB	Output is correct
38	Correct	28 ms	2656 KB	Output is correct
39	Correct	29 ms	2644 KB	Output is correct
40	Correct	16 ms	2644 KB	Output is correct
41	Correct	25 ms	2644 KB	Output is correct
42	Correct	30 ms	2652 KB	Output is correct
43	Correct	6 ms	1748 KB	Output is correct
44	Correct	8 ms	2132 KB	Output is correct
45	Correct	11 ms	2676 KB	Output is correct
46	Correct	11 ms	2644 KB	Output is correct
47	Correct	10 ms	2644 KB	Output is correct
48	Correct	10 ms	2644 KB	Output is correct
49	Correct	7 ms	1892 KB	Output is correct
50	Correct	10 ms	2672 KB	Output is correct
51	Correct	10 ms	2644 KB	Output is correct
52	Correct	5 ms	2516 KB	Output is correct
53	Correct	6 ms	2644 KB	Output is correct
54	Correct	19 ms	2644 KB	Output is correct
55	Correct	10 ms	2644 KB	Output is correct
56	Correct	5 ms	2644 KB	Output is correct

Submission #562535

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 12.0 / 12.0

Subtask #3 87.0 / 87.0

Subtask #1
1.0 / 1.0

Subtask #2
12.0 / 12.0

Subtask #3
87.0 / 87.0