Submission #208924

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
208924	2020-03-12T13:32:16 Z	eriksuenderhauf	JJOOII 2 (JOI20_ho_t2)	C++11	100 / 100	14 ms	3704 KB

ho_t2

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)(x).size()
#define trav(x, a) for (const auto& x: a)
#define pii pair<int,int>
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
char s[N];
int nx[N][3];

int main() {
  int n, k; scanf("%d %d", &n, &k);
  scanf("%s", s);
  for (int i = 0; i < 3; i++)
    nx[n+1][i] = nx[n][i] = n+1;
  deque<int> pq[3];
  for (int i = n-1; ~i; i--) {
    if (s[i] == 'I')
      pq[2].push_front(i);
    if (s[i] == 'O')
      pq[1].push_front(i);
    if (s[i] == 'J')
      pq[0].push_front(i);
    for (int j = 0; j < 3; j++) {
      nx[i][j] = nx[i+1][j];
      while (sz(pq[j]) > k)
        pq[j].pop_back();
      if (sz(pq[j]) == k)
        nx[i][j] = pq[j].back() + 1;
    }
  }
  int ans = 2*N;
  for (int i = 0; i < n; i++) {
    if (nx[nx[nx[i][0]][1]][2] > n)
      continue;
    ans = min(ans, nx[nx[nx[i][0]][1]][2] - i - 3*k);
  }
  if (ans == 2*N)
    ans = -1;
  printf("%d\n", ans);
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:17:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int n, k; scanf("%d %d", &n, &k);
             ~~~~~^~~~~~~~~~~~~~~~~
ho_t2.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", s);
   ~~~~~^~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	4 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	380 KB	Output is correct
7	Correct	4 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	6 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	504 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	380 KB	Output is correct
29	Correct	5 ms	380 KB	Output is correct
30	Correct	5 ms	376 KB	Output is correct
31	Correct	5 ms	376 KB	Output is correct
32	Correct	5 ms	376 KB	Output is correct
33	Correct	5 ms	376 KB	Output is correct
34	Correct	5 ms	376 KB	Output is correct
35	Correct	5 ms	376 KB	Output is correct
36	Correct	14 ms	2680 KB	Output is correct
37	Correct	13 ms	2808 KB	Output is correct
38	Correct	14 ms	2936 KB	Output is correct
39	Correct	14 ms	2936 KB	Output is correct
40	Correct	13 ms	3064 KB	Output is correct
41	Correct	14 ms	2936 KB	Output is correct
42	Correct	13 ms	2940 KB	Output is correct
43	Correct	10 ms	2168 KB	Output is correct
44	Correct	12 ms	2552 KB	Output is correct
45	Correct	13 ms	3192 KB	Output is correct
46	Correct	14 ms	3192 KB	Output is correct
47	Correct	13 ms	3192 KB	Output is correct
48	Correct	14 ms	3192 KB	Output is correct
49	Correct	10 ms	2296 KB	Output is correct
50	Correct	13 ms	3192 KB	Output is correct
51	Correct	13 ms	3192 KB	Output is correct
52	Correct	13 ms	3448 KB	Output is correct
53	Correct	13 ms	3576 KB	Output is correct
54	Correct	12 ms	2808 KB	Output is correct
55	Correct	11 ms	3448 KB	Output is correct
56	Correct	12 ms	3704 KB	Output is correct

Submission #208924

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 12.0 / 12.0

Subtask #3 87.0 / 87.0

Subtask #1
1.0 / 1.0

Subtask #2
12.0 / 12.0

Subtask #3
87.0 / 87.0