답안 #780329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780329	2023-07-12T08:18:40 Z	vjudge1	고대 책들 (IOI17_books)	C++17	50 / 100	1083 ms	59320 KB

books

#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 1e6 + 5;

int n;

long long minimum_walk(std::vector<int> p, int s) {
  n = sz(p);
  vector<int> col(n, 0);
  vector<int> reqs(n + 2, 0);
  int flag = 0;
  
  multiset<int> lhf;
  
  ll sum = 0;
  
  for(int i = 0; i < n; i++) {
    if(col[i] == 0) {
      flag++;
      int x = i, cnt = 0;
      set<int> vals;
      while(col[x] != flag) {
        col[x] = flag;
        sum += abs(x - p[x]);
        x = p[x];
        cnt++;
        vals.emplace(x);
      }
      if(cnt == 1) {
        flag--;
        col[i] = 0;
      }
      else {
        int L = *vals.begin();
        int R = *vals.rbegin();
        reqs[L]++;
        reqs[R]--;
      }
    }
  }
  for(int i = 1; i <= n; i++)
    reqs[i] += reqs[i - 1];
  int l = 0, r = n - 1;
  while(l < s && p[l] == l) l++;
  while(r > s && p[r] == r) r--;
  r--;

  ll mn = 0;
  for(int i = l; i <= r; i++) mn += reqs[i] == 0;
  return sum + mn * 2;
}

/**
      Anul asta se da centroid.
-- Surse oficiale
*/

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	296 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	1 ms	300 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	296 KB	Output is correct
9	Correct	1 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	296 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	296 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	1 ms	300 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	296 KB	Output is correct
9	Correct	1 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	296 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	296 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	296 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	296 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	1 ms	300 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	296 KB	Output is correct
9	Correct	1 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	296 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	296 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	296 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1083 ms	59320 KB	Output is correct
31	Correct	807 ms	40804 KB	Output is correct
32	Correct	110 ms	22700 KB	Output is correct
33	Correct	121 ms	22648 KB	Output is correct
34	Correct	120 ms	22696 KB	Output is correct
35	Correct	122 ms	22696 KB	Output is correct
36	Correct	135 ms	22700 KB	Output is correct
37	Correct	176 ms	22976 KB	Output is correct
38	Correct	186 ms	22908 KB	Output is correct
39	Correct	195 ms	22892 KB	Output is correct
40	Correct	243 ms	24420 KB	Output is correct
41	Correct	571 ms	38372 KB	Output is correct
42	Correct	452 ms	30096 KB	Output is correct
43	Correct	127 ms	22640 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	212 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	1 ms	212 KB	Output is correct
2	Correct	1 ms	296 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	1 ms	300 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	296 KB	Output is correct
9	Correct	1 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	296 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	296 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	296 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1083 ms	59320 KB	Output is correct
31	Correct	807 ms	40804 KB	Output is correct
32	Correct	110 ms	22700 KB	Output is correct
33	Correct	121 ms	22648 KB	Output is correct
34	Correct	120 ms	22696 KB	Output is correct
35	Correct	122 ms	22696 KB	Output is correct
36	Correct	135 ms	22700 KB	Output is correct
37	Correct	176 ms	22976 KB	Output is correct
38	Correct	186 ms	22908 KB	Output is correct
39	Correct	195 ms	22892 KB	Output is correct
40	Correct	243 ms	24420 KB	Output is correct
41	Correct	571 ms	38372 KB	Output is correct
42	Correct	452 ms	30096 KB	Output is correct
43	Correct	127 ms	22640 KB	Output is correct
44	Incorrect	0 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #780329

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0