답안 #463556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
463556 2021-08-11T10:07:59 Z Mounir JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
35 ms 5528 KB
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define all(x) x.begin(), x.end()
#define pb push_back
#define pii pair<int, int>
#define deb first
#define fin second
#define int long long
using namespace std;
 
signed main(){ 
      ios::sync_with_stdio(false);
      cin.tie(nullptr);
      cout.tie(nullptr);
 
      int nVals, K; cin >> nVals >> K;
      string chaine; cin >> chaine;
      int occs[3][nVals + 1];

      for (int i = 0; i < 3; ++i)
            occs[i][0] = 0;
      for (int ind = 0; ind < nVals; ++ind){
            for (int i = 0; i < 3; ++i)
                  occs[i][ind + 1] = occs[i][ind];
            if (chaine[ind] == 'J')
                  occs[0][ind + 1]++;
            else if (chaine[ind] == 'O')
                  occs[1][ind + 1]++;
            else
                  occs[2][ind + 1]++;            
      }

      int mini = nVals + 5;
      for (int deb = 1; deb < nVals; ++deb){
            int cur = deb - 1;
            bool ok = true;

            for (int i = 0; i < 3; ++i){
                  if (occs[i][nVals] - occs[i][cur] < K) ok = false;
                  cur = lower_bound(occs[i], occs[i] + nVals + 1, occs[i][cur] + K) - occs[i];
            }
            
            if (ok) {
                  //cout << deb << " " << cur << endl;
                  chmin(mini, cur - deb + 1);
            }
      }

      if (mini <= nVals)
            cout << mini - 3 * K << endl;
      else
            cout << -1 << endl;
      return 0;
 
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 312 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 312 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 30 ms 5172 KB Output is correct
37 Correct 33 ms 5512 KB Output is correct
38 Correct 32 ms 5464 KB Output is correct
39 Correct 33 ms 5464 KB Output is correct
40 Correct 26 ms 5508 KB Output is correct
41 Correct 32 ms 5464 KB Output is correct
42 Correct 35 ms 5464 KB Output is correct
43 Correct 15 ms 3532 KB Output is correct
44 Correct 18 ms 4312 KB Output is correct
45 Correct 24 ms 5512 KB Output is correct
46 Correct 23 ms 5456 KB Output is correct
47 Correct 24 ms 5464 KB Output is correct
48 Correct 28 ms 5524 KB Output is correct
49 Correct 16 ms 3800 KB Output is correct
50 Correct 24 ms 5524 KB Output is correct
51 Correct 23 ms 5528 KB Output is correct
52 Correct 17 ms 5336 KB Output is correct
53 Correct 18 ms 5528 KB Output is correct
54 Correct 20 ms 5524 KB Output is correct
55 Correct 17 ms 5528 KB Output is correct
56 Correct 16 ms 5528 KB Output is correct