oj.uz

답안 #566551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566551 2022-05-22T11:50:01 Z lorenzoferrari 고대 책들 (IOI17_books) C++17
50 / 100
 142 ms 31652 KB 
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
using LL = long long;

#ifdef LORENZO
const int N = 1000;
#else
const int N = 1e6 + 42;
#endif

int t[2*N];

void upd(int l, int r) {
  for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
    if (l & 1) t[l++] = 1;
    if (r & 1) t[--r] = 1;
  }
}
int qry(int p) {
  int ans = 0;
  for (p += N; p > 0; p >>= 1) {
    ans = max(ans, t[p]);
  }
  return ans == 0;
}

LL minimum_walk(vector<int> p, int s) {
  int n = p.size();
  LL ans = 0;
  for (int i = 0; i < n; ++i) {
    ans += abs(i - p[i]);
  }
  int rl = s+1;
  int rr = s;
  vector<int> cyc(n, -1);
  vector<array<int, 2>> ext;
  for (int i = 0, c = 0; i < n; ++i) {
    if (cyc[i] != -1) continue;
    int ii = i, l = i, r = i;
    do {
      cyc[ii] = c;
      ii = p[ii];
      l = min(l, ii);
      r = max(r, ii);
    } while (i != ii);
    ++c;
    ext.push_back({l, r});
    if (l != r) {
      upd(l+1, r+1);
      rl = min(rl, r+1);
      rr = max(rr, l);
    }
  }
  for (int i = rl; i <= rr; ++i) {
    ans += 2 * qry(i);
  }
  return ans;
}

Subtask #1
12.0 / 12.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 268 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
10.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 268 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct

Subtask #3
28.0 / 28.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 268 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 141 ms 16344 KB Output is correct
31 Correct 142 ms 16296 KB Output is correct
32 Correct 106 ms 24460 KB Output is correct
33 Correct 128 ms 30124 KB Output is correct
34 Correct 130 ms 30116 KB Output is correct
35 Correct 128 ms 31652 KB Output is correct
36 Correct 125 ms 26008 KB Output is correct
37 Correct 117 ms 24552 KB Output is correct
38 Correct 119 ms 23304 KB Output is correct
39 Correct 122 ms 22852 KB Output is correct
40 Correct 126 ms 19108 KB Output is correct
41 Correct 129 ms 16784 KB Output is correct
42 Correct 125 ms 17080 KB Output is correct
43 Correct 136 ms 30104 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

Subtask #5
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 268 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 141 ms 16344 KB Output is correct
31 Correct 142 ms 16296 KB Output is correct
32 Correct 106 ms 24460 KB Output is correct
33 Correct 128 ms 30124 KB Output is correct
34 Correct 130 ms 30116 KB Output is correct
35 Correct 128 ms 31652 KB Output is correct
36 Correct 125 ms 26008 KB Output is correct
37 Correct 117 ms 24552 KB Output is correct
38 Correct 119 ms 23304 KB Output is correct
39 Correct 122 ms 22852 KB Output is correct
40 Correct 126 ms 19108 KB Output is correct
41 Correct 129 ms 16784 KB Output is correct
42 Correct 125 ms 17080 KB Output is correct
43 Correct 136 ms 30104 KB Output is correct
44 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -