답안 #598852

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598852	2022-07-19T06:30:02 Z	piOOE	Rope (JOI17_rope)	C++17	45 / 100	2500 ms	1492 KB

rope

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 100003, M = 10;

int a[N], ans[M];
int pref[N], suf[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  memset(ans, 0x3f, sizeof(ans));
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    --a[i];
  }
  for (int c1 = 0; c1 < m; ++c1) {
    for (int c2 = 0; c2 < m; ++c2) {
      int c[2] = {c1, c2};

      pref[1] = min(c[0] != a[1], c[1] != a[1]);
      for (int i = 2; i <= n; ++i) {
        pref[i] = min((c[0] != a[i - 1]) + (c[0] != a[i]), (c[1] != a[i - 1]) + (c[1] != a[i])) + pref[i - 2];
      }

      suf[n] = min(c[0] != a[n], c[1] != a[n]);
      for (int i = n - 1; i > 0; --i) {
        suf[i] = min((c[0] != a[i + 1]) + (c[0] != a[i]), (c[1] != a[i + 1]) + (c[1] != a[i])) + suf[i + 2];
      }

      for (int i = 1; i <= n - 1; ++i) {
        int now = (i > 1 ? a[i - 1] != c[0] : 0) + (i > 1 ? pref[i - 2] : 0) + (i + 2 <= n ? a[i + 2] != c[1] : 0) + suf[i + 3] +
                  (a[i] != c[0]) + (a[i + 1] != c[1]);
        ans[c1] = min(ans[c1], now);
        ans[c2] = min(ans[c2], now);
      }
    }
  }
  for (int i = 0; i < m; ++i) {
    cout << ans[i] << "\n";
  }
  return 0;
}

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 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	0 ms	212 KB	Output is correct
11	Correct	1 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	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 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	0 ms	212 KB	Output is correct
11	Correct	1 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	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	86 ms	1472 KB	Output is correct
28	Correct	18 ms	1364 KB	Output is correct
29	Correct	70 ms	1492 KB	Output is correct
30	Correct	30 ms	1412 KB	Output is correct
31	Correct	84 ms	1472 KB	Output is correct
32	Correct	19 ms	1492 KB	Output is correct
33	Correct	74 ms	1476 KB	Output is correct
34	Correct	28 ms	1492 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 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	0 ms	212 KB	Output is correct
11	Correct	1 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	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	86 ms	1472 KB	Output is correct
28	Correct	18 ms	1364 KB	Output is correct
29	Correct	70 ms	1492 KB	Output is correct
30	Correct	30 ms	1412 KB	Output is correct
31	Correct	84 ms	1472 KB	Output is correct
32	Correct	19 ms	1492 KB	Output is correct
33	Correct	74 ms	1476 KB	Output is correct
34	Correct	28 ms	1492 KB	Output is correct
35	Execution timed out	2577 ms	1428 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 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	0 ms	212 KB	Output is correct
11	Correct	1 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	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	86 ms	1472 KB	Output is correct
28	Correct	18 ms	1364 KB	Output is correct
29	Correct	70 ms	1492 KB	Output is correct
30	Correct	30 ms	1412 KB	Output is correct
31	Correct	84 ms	1472 KB	Output is correct
32	Correct	19 ms	1492 KB	Output is correct
33	Correct	74 ms	1476 KB	Output is correct
34	Correct	28 ms	1492 KB	Output is correct
35	Execution timed out	2577 ms	1428 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 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	0 ms	212 KB	Output is correct
11	Correct	1 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	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	86 ms	1472 KB	Output is correct
28	Correct	18 ms	1364 KB	Output is correct
29	Correct	70 ms	1492 KB	Output is correct
30	Correct	30 ms	1412 KB	Output is correct
31	Correct	84 ms	1472 KB	Output is correct
32	Correct	19 ms	1492 KB	Output is correct
33	Correct	74 ms	1476 KB	Output is correct
34	Correct	28 ms	1492 KB	Output is correct
35	Execution timed out	2577 ms	1428 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

답안 #598852

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 30.0 / 30.0

Subtask #3 0 / 10.0

Subtask #4 0 / 25.0

Subtask #5 0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
30.0 / 30.0

Subtask #3
0 / 10.0

Subtask #4
0 / 25.0

Subtask #5
0 / 20.0