oj.uz

답안 #202879

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202879 2020-02-18T14:49:38 Z EntityIT JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 110 ms 3204 KB 
#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) ( (int)(x).size() )
using LL = long long;

template<class T>
inline bool asMn(T &a, const T &b) { return a > b ? a = b, true : false; }
template<class T>
inline bool asMx(T &a, const T &b) { return a < b ? a = b, true : false; }

const int inf = 1e9;
mt19937 rng( (uint32_t)chrono::steady_clock::now().time_since_epoch().count() );

map<char, int> label{ { 'J', 0 }, { 'O', 1 }, { 'I', 2 } };

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);

  #ifdef FourLeafClover
  freopen("input", "r", stdin);
  #endif // FourLeafCLover

  int n, k; string s; cin >> n >> k >> s;

  vector<array<int, 3> > pref(n + 1);
  for (int i = 0; i < n; ++i) {
    pref[i + 1] = pref[i];
    ++pref[i + 1][ label[ s[i] ] ];
  }
  auto get = [&](int be, int en, char c) { return pref[en][ label[c] ] - pref[be][ label[c] ]; };

  auto findPos = [&](int i, char c) {
    int l = i, r = n;
    while (l < r) {
      int mid = (l + r) >> 1;
      if (get(i, mid + 1, c) >= k) r = mid;
      else l = mid + 1;
    }
    return l;
  };

  int ans = inf;
  for (int i = 0; i < n; ++i) {
    int j = findPos(findPos(findPos(i, 'J'), 'O'), 'I');
    if (j < n) asMn(ans, j - i + 1 - 3 * k);
  }

  cout << (ans == inf ? -1 : ans) << '\n';

  return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 6 ms 372 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 7 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 6 ms 372 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 7 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 89 ms 2820 KB Output is correct
37 Correct 99 ms 3064 KB Output is correct
38 Correct 100 ms 2980 KB Output is correct
39 Correct 99 ms 3076 KB Output is correct
40 Correct 72 ms 2948 KB Output is correct
41 Correct 86 ms 3076 KB Output is correct
42 Correct 110 ms 2948 KB Output is correct
43 Correct 40 ms 2040 KB Output is correct
44 Correct 50 ms 2436 KB Output is correct
45 Correct 64 ms 3076 KB Output is correct
46 Correct 62 ms 2948 KB Output is correct
47 Correct 63 ms 2948 KB Output is correct
48 Correct 64 ms 2948 KB Output is correct
49 Correct 43 ms 2180 KB Output is correct
50 Correct 68 ms 3204 KB Output is correct
51 Correct 63 ms 3076 KB Output is correct
52 Correct 36 ms 2948 KB Output is correct
53 Correct 39 ms 2948 KB Output is correct
54 Correct 56 ms 2948 KB Output is correct
55 Correct 42 ms 2948 KB Output is correct
56 Correct 34 ms 2948 KB Output is correct