oj.uz

Submission #769596

# Submission time Handle Problem Language Result Execution time Memory
769596 2023-06-29T20:27:30 Z raysh07 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 22 ms 3328 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

int get(vector <int> &a, int i, int k){
    int ind = upper_bound(a.begin(), a.end(), i) - a.begin();
    ind += k - 1;
    
    if (ind >= a.size()) return -1;
   // cout << "RETURNING " << ind << "\n";
    return a[ind];
}

void Solve() 
{
    int n, k; cin >> n >> k;
    vector <int> a[3];
    string s; cin >> s;
    
    for (int i = 1; i <= n; i++){
        if (s[i - 1] == 'J') a[0].push_back(i);
        else if (s[i - 1] == 'O') a[1].push_back(i);
        else a[2].push_back(i);
    }
    
    int ans = INF;
    for (int i = 0; i < n; i++){
        //we will leave [1, i] and start from i + 1 
       // cout << "DOING " << i << "\n";
        int g = get(a[0], i, k); //get position of ending if we start at > x 
        if (g != -1) g = get(a[1], g, k);
        if (g != -1) g = get(a[2], g, k);
        
        if (g != -1) ans = min(ans, g - i - 3 * k);
    }
    if (ans == INF) cout << -1 << "\n";
    else cout << ans << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Compilation message

ho_t2.cpp: In function 'long long int get(std::vector<long long int>&, long long int, long long int)':
ho_t2.cpp:14:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     if (ind >= a.size()) return -1;
      |         ~~~~^~~~~~~~~~~

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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 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 0 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 0 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 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 0 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 0 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 18 ms 2116 KB Output is correct
37 Correct 22 ms 2892 KB Output is correct
38 Correct 20 ms 2840 KB Output is correct
39 Correct 19 ms 2972 KB Output is correct
40 Correct 17 ms 3032 KB Output is correct
41 Correct 18 ms 3000 KB Output is correct
42 Correct 20 ms 2892 KB Output is correct
43 Correct 10 ms 1832 KB Output is correct
44 Correct 13 ms 2108 KB Output is correct
45 Correct 17 ms 3128 KB Output is correct
46 Correct 16 ms 2960 KB Output is correct
47 Correct 16 ms 3008 KB Output is correct
48 Correct 16 ms 2992 KB Output is correct
49 Correct 10 ms 1868 KB Output is correct
50 Correct 16 ms 2992 KB Output is correct
51 Correct 16 ms 2996 KB Output is correct
52 Correct 11 ms 2368 KB Output is correct
53 Correct 11 ms 2936 KB Output is correct
54 Correct 9 ms 3288 KB Output is correct
55 Correct 9 ms 3280 KB Output is correct
56 Correct 7 ms 3328 KB Output is correct