oj.uz

Submission #798972

# Submission time Handle Problem Language Result Execution time Memory
798972 2023-07-31T08:15:19 Z arush_agu JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 33 ms 7244 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-9;

void solve() {
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;

  auto cid = [](char c) {
    if (c == 'J')
      return 0;
    if (c == 'O')
      return 1;
    return 2;
  };

  while (!s.empty() && s.back() != 'I')
    s.pop_back();
  reverse(all(s));
  while (!s.empty() && s.back() != 'J')
    s.pop_back();
  reverse(all(s));

  n = s.size();

  vvl pr(3, vl(n + 1));

  for (int i = 1; i <= n; i++) {
    int v = cid(s[i - 1]);
    pr[v][i]++;
    for (int j = 0; j < 3; j++)
      pr[j][i] += pr[j][i - 1];
  }

  ll ans = INF;
  for (int i = 1; i <= n; i++) {
    ll l = 1, r = i, lefO = -1;
    while (l <= r) {
      int m = (l + r) / 2;
      if (pr[1][i] - pr[1][m - 1] >= k)
        lefO = m, l = m + 1;
      else
        r = m - 1;
    }
    if (lefO == -1)
      continue;
    l = 1, r = lefO - 1;
    ll lefJ = -1;
    while (l <= r) {
      int m = (l + r) / 2;
      if (pr[0][lefO - 1] - pr[0][m - 1] >= k)
        lefJ = m, l = m + 1;
      else
        r = m - 1;
    }
    if (lefJ == -1)
      continue;
    l = i + 1, r = n;
    ll rigI = -1;
    while (l <= r) {
      int m = (l + r) / 2;
      if (pr[2][m] - pr[2][i] >= k)
        rigI = m, r = m - 1;
      else
        l = m + 1;
    }
    if (rigI == -1)
      continue;
    ans = min(ans, rigI - lefJ + 1 - 3 * k);
  }
  cout << (ans >= INF ? -1 : ans) << '\n';
}

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

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:167:11: warning: unused variable 'start' [-Wunused-variable]
  167 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 320 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 320 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 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 340 KB Output is correct
29 Correct 1 ms 320 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 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 1 ms 340 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 320 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 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 340 KB Output is correct
29 Correct 1 ms 320 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 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 1 ms 340 KB Output is correct
36 Correct 25 ms 6624 KB Output is correct
37 Correct 27 ms 7000 KB Output is correct
38 Correct 26 ms 7008 KB Output is correct
39 Correct 29 ms 7008 KB Output is correct
40 Correct 22 ms 7008 KB Output is correct
41 Correct 27 ms 6996 KB Output is correct
42 Correct 33 ms 7244 KB Output is correct
43 Correct 11 ms 4564 KB Output is correct
44 Correct 15 ms 5492 KB Output is correct
45 Correct 19 ms 7108 KB Output is correct
46 Correct 19 ms 7104 KB Output is correct
47 Correct 19 ms 6988 KB Output is correct
48 Correct 19 ms 6996 KB Output is correct
49 Correct 12 ms 4832 KB Output is correct
50 Correct 19 ms 7008 KB Output is correct
51 Correct 19 ms 7008 KB Output is correct
52 Correct 10 ms 6756 KB Output is correct
53 Correct 11 ms 7008 KB Output is correct
54 Correct 24 ms 7008 KB Output is correct
55 Correct 17 ms 7008 KB Output is correct
56 Correct 14 ms 7020 KB Output is correct