oj.uz

Submission #915930

# Submission time Handle Problem Language Result Execution time Memory
915930 2024-01-24T22:51:53 Z HorizonWest JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 43 ms 12000 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cerr << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n, m; cin >> n >> m; 
    string s, ref = "JOI"; cin >> s;
    vector <vector<int>> v(n + 1, vector <int> (ref.size(), 0));
    vector <int> c(257, -1);
    for(int i = 0; i < ref.size(); i++)
        c[ref[i]] = i;

    for(int i = 1; i <= n; i++)
    {
        v[i][c[s[i-1]]]++; 
        for(int j = 0; j < ref.size(); j++)
            v[i][j] += v[i-1][j]; 
    } 

    int ans = Inf; 

    for(int i = 1; i <= n; i++) if(s[i-1] == 'J')
    {
        int l = i - 1; 
        
        for(int j = 0; j < ref.size(); j++)
        {
            int x = c[ref[j]]; 

            if(v[n][x] - v[l][x] < m)
            { 
                l = Inf; 
                break;
            }

            int a = l, b = n+1;  

            while(abs(a - b) != 1)
            {
                int mid = (a + b) / 2; 

                if(v[mid][x] - v[l][x] >= m)
                    b = mid; 
                else 
                    a = mid; 
            } 

            l = b;
        } 

        ans = min(ans, (l - i + 1) - (3 * m)); 
    }

    cout << (ans > n ? -1 : ans) << endl; 
}

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

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Compilation message

ho_t2.cpp: In function 'void solve()':
ho_t2.cpp:40:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i = 0; i < ref.size(); i++)
      |                    ~~^~~~~~~~~~~~
ho_t2.cpp:46:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for(int j = 0; j < ref.size(); j++)
      |                        ~~^~~~~~~~~~~~
ho_t2.cpp:56:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for(int j = 0; j < ref.size(); j++)
      |                        ~~^~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 392 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 0 ms 456 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 392 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 0 ms 456 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 30 ms 10980 KB Output is correct
37 Correct 32 ms 11820 KB Output is correct
38 Correct 33 ms 11752 KB Output is correct
39 Correct 38 ms 11496 KB Output is correct
40 Correct 34 ms 12000 KB Output is correct
41 Correct 38 ms 11752 KB Output is correct
42 Correct 43 ms 11800 KB Output is correct
43 Correct 13 ms 7512 KB Output is correct
44 Correct 17 ms 9448 KB Output is correct
45 Correct 27 ms 11944 KB Output is correct
46 Correct 23 ms 11748 KB Output is correct
47 Correct 23 ms 11748 KB Output is correct
48 Correct 21 ms 11752 KB Output is correct
49 Correct 13 ms 8024 KB Output is correct
50 Correct 19 ms 11752 KB Output is correct
51 Correct 20 ms 11752 KB Output is correct
52 Correct 13 ms 11240 KB Output is correct
53 Correct 12 ms 11752 KB Output is correct
54 Correct 35 ms 11752 KB Output is correct
55 Correct 19 ms 11748 KB Output is correct
56 Correct 11 ms 11748 KB Output is correct