oj.uz

Submission #836556

# Submission time Handle Problem Language Result Execution time Memory
836556 2023-08-24T12:54:58 Z green_gold_dog JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 47 ms 5692 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, k;
        cin >> n >> k;
        string s;
        cin >> s;
        vector<ll> pj(1, 0), po(1, 0), pi(1, 0);
        for (auto i : s) {
                pj.push_back(pj.back() + (i == 'J'));
                po.push_back(po.back() + (i == 'O'));
                pi.push_back(pi.back() + (i == 'I'));
        }
        ll ans = INF32;
        for (ll i = 0; i < n; i++) {
                ll now = i;
                if (pj.back() - pj[now] < k) {
                        break;
                }
                ll l = now, r = n;
                while (r - l > 1) {
                        ll mid = (l + r) / 2;
                        if (pj[mid] - pj[now] >= k) {
                                r = mid;
                        } else {
                                l = mid;
                        }
                }
                now = r;
                if (po.back() - po[now] < k) {
                        break;
                }
                l = now;
                r = n;
                while (r - l > 1) {
                        ll mid = (l + r) / 2;
                        if (po[mid] - po[now] >= k) {
                                r = mid;
                        } else {
                                l = mid;
                        }
                }
                now = r;
                if (pi.back() - pi[now] < k) {
                        break;
                }
                l = now;
                r = n;
                while (r - l > 1) {
                        ll mid = (l + r) / 2;
                        if (pi[mid] - pi[now] >= k) {
                                r = mid;
                        } else {
                                l = mid;
                        }
                }
                now = r;
                assign_min(ans, now - i - k * 3);
        }
        cout << (ans == INF32 ? -1 : ans) << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:112:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
ho_t2.cpp:113:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 332 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 332 KB Output is correct
14 Correct 1 ms 212 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 332 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 332 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 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 464 KB Output is correct
20 Correct 1 ms 460 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 464 KB Output is correct
27 Correct 0 ms 460 KB Output is correct
28 Correct 0 ms 460 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 456 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 332 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 332 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 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 464 KB Output is correct
20 Correct 1 ms 460 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 464 KB Output is correct
27 Correct 0 ms 460 KB Output is correct
28 Correct 0 ms 460 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 456 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 43 ms 5244 KB Output is correct
37 Correct 47 ms 5576 KB Output is correct
38 Correct 45 ms 5684 KB Output is correct
39 Correct 39 ms 5648 KB Output is correct
40 Correct 13 ms 5672 KB Output is correct
41 Correct 31 ms 5684 KB Output is correct
42 Correct 45 ms 5688 KB Output is correct
43 Correct 3 ms 3800 KB Output is correct
44 Correct 4 ms 4928 KB Output is correct
45 Correct 5 ms 5692 KB Output is correct
46 Correct 5 ms 5688 KB Output is correct
47 Correct 5 ms 5684 KB Output is correct
48 Correct 4 ms 5684 KB Output is correct
49 Correct 4 ms 4928 KB Output is correct
50 Correct 5 ms 5672 KB Output is correct
51 Correct 5 ms 5684 KB Output is correct
52 Correct 5 ms 5432 KB Output is correct
53 Correct 5 ms 5684 KB Output is correct
54 Correct 20 ms 5688 KB Output is correct
55 Correct 10 ms 5684 KB Output is correct
56 Correct 5 ms 5684 KB Output is correct