oj.uz

Submission #959470

# Submission time Handle Problem Language Result Execution time Memory
959470 2024-04-08T09:15:02 Z OIaspirant2307 JJOOII 2 (JOI20_ho_t2) C++17
1 / 100
 2000 ms 500 KB 
#include <iostream>
using namespace std;
#define int long long

int n, k;
string s;
const int inf = 1e10;

int get(int i, int j)
{
    int cnt[3] = {0, 0, 0};
    int ans = 0;
    for (int x = i; x <= j; x++)
    {
        if (cnt[0] < k && s[x] == 'J')
        {
            cnt[0]++;
        }
        else if (cnt[0] == k && cnt[1] < k && s[x] == 'O')
        {
            cnt[1]++;
        }
        else if (cnt[1] == k && cnt[2] < k && s[x] == 'I')
        {
            cnt[2]++;
        }
        else
        {
            ans++;
        }
    }
    if (cnt[0] == k && cnt[1] == k && cnt[2] == k)
    {
        return ans;
    }
    return -1;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> k >> s;
    int sub = 3 * k;
    int m = inf;
    for (int i = 0; i < n; i++)
    {
        for (int j = (i + sub) - 1; j < n; j++)
        {
            int ans = get(i, j);
            if (ans == -1)
            {
                continue;
            }
            m = min(ans, m);
        }
    }
    cout << (m == inf ? -1 : m) << '\n';
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Execution timed out 2017 ms 500 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Execution timed out 2017 ms 500 KB Time limit exceeded
16 Halted 0 ms 0 KB -