# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874379 | mgl_diamond | JJOOII 2 (JOI20_ho_t2) | C++17 | 7 ms | 1632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define file "input"
template<class T> bool minimize(T &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> bool maximize(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
void setIO() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(file".inp", "r")) {
freopen(file".inp", "r", stdin);
freopen(file".out", "w", stdout);
}
}
int n, k;
char ch;
vector<int> pos[3];
int main() {
setIO();
cin >> n >> k;
foru(i, 0, n-1) {
cin >> ch;
if (ch == 'J') pos[0].push_back(i);
else if (ch == 'O') pos[1].push_back(i);
else pos[2].push_back(i);
}
if (sz(pos[0]) < k || sz(pos[1]) < k || sz(pos[1]) < k) {
cout << -1;
return 0;
}
int x = -1, y = 0, z = sz(pos[2]), ans = n+1;
while (z-1 >= 0 && pos[2][z-1] > pos[1][k-1])
--z;
foru(y, 0, sz(pos[1])-k) {
while (x+1 < sz(pos[0]) && pos[0][x+1] < pos[1][y])
++x;
while (z < sz(pos[2]) && pos[2][z] < pos[1][y+k-1])
++z;
if (x-k+1 >= 0 && z+k-1 < sz(pos[2])) {
int ff = (pos[0][x] - pos[0][x-k+1] + 1 - k);
int ss = (pos[1][y+k-1] - pos[1][y] + 1 - k);
int th = (pos[2][z+k-1] - pos[2][z] + 1 - k);
minimize(ans, ff + ss + th + pos[1][y] - pos[0][x] - 1 + pos[2][z] - pos[1][y+k-1] - 1);
}
}
if (ans == n+1) cout << -1;
else cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |