답안 #780429

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780429	2023-07-12T08:58:28 Z	vjudge1	고대 책들 (IOI17_books)	C++17	50 / 100	905 ms	52564 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);
      }
      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 < n && p[l] == l) l++;
  while(r > 0 && p[r] == r) r--;
  if(r < l) return 0;
  int dist[2] = {n + 5, n + 5};
  int ptr = s;
  if(l <= s && r <= s) {
      dist[0] = 0;
      while(reqs[ptr] != 0 && p[ptr] == ptr) ptr++, dist[0]++;
      ptr = s;
      dist[1] = 0;
      while(reqs[ptr - 1] != 0 && p[ptr] == ptr) ptr--, dist[1]++;
    
  }
  else {
    if(s != 0) return l;
    dist[0] = dist[1] = min(abs(l - s), abs(r - s));
  }
  r--;
  

  ll mn = min(dist[0], dist[1]);
  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	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 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	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 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	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 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	0 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	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 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	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 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	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 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	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 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	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 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	905 ms	52564 KB	Output is correct
31	Correct	631 ms	34072 KB	Output is correct
32	Correct	109 ms	15848 KB	Output is correct
33	Correct	117 ms	15848 KB	Output is correct
34	Correct	128 ms	15848 KB	Output is correct
35	Correct	116 ms	15852 KB	Output is correct
36	Correct	131 ms	15952 KB	Output is correct
37	Correct	156 ms	15976 KB	Output is correct
38	Correct	174 ms	16164 KB	Output is correct
39	Correct	176 ms	16204 KB	Output is correct
40	Correct	245 ms	17732 KB	Output is correct
41	Correct	661 ms	31696 KB	Output is correct
42	Correct	424 ms	23268 KB	Output is correct
43	Correct	117 ms	15984 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '0'
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	0 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	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 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	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 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	905 ms	52564 KB	Output is correct
31	Correct	631 ms	34072 KB	Output is correct
32	Correct	109 ms	15848 KB	Output is correct
33	Correct	117 ms	15848 KB	Output is correct
34	Correct	128 ms	15848 KB	Output is correct
35	Correct	116 ms	15852 KB	Output is correct
36	Correct	131 ms	15952 KB	Output is correct
37	Correct	156 ms	15976 KB	Output is correct
38	Correct	174 ms	16164 KB	Output is correct
39	Correct	176 ms	16204 KB	Output is correct
40	Correct	245 ms	17732 KB	Output is correct
41	Correct	661 ms	31696 KB	Output is correct
42	Correct	424 ms	23268 KB	Output is correct
43	Correct	117 ms	15984 KB	Output is correct
44	Incorrect	1 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '0'
45	Halted	0 ms	0 KB	-

답안 #780429

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