oj.uz

Submission #562533

# Submission time Handle Problem Language Result Execution time Memory
562533 2022-05-14T14:31:48 Z dattranxxx JJOOII 2 (JOI20_ho_t2) C++11
0 / 100
 1 ms 324 KB 
#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[l]) - 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
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 324 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 324 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 324 KB Output isn't correct
3 Halted 0 ms 0 KB -