oj.uz

Submission #422813

# Submission time Handle Problem Language Result Execution time Memory
422813 2021-06-10T12:43:42 Z 2fat2code Ancient Books (IOI17_books) C++17
50 / 100
 205 ms 69940 KB 
#include "books.h"
#include<bits/stdc++.h>
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
using namespace std;

const int nmax = 1000005;

long long n, ans = 0, viz[nmax], comp = 0, cost;
vector<pair<long long,long long>>ranges;
vector<long long>nod[nmax];

long long minimum_walk(vector<int> p, int s) {
	n = (int)p.size();
	for(int i=0;i<n;i++){
        ans += abs(p[i] - i);
	}
	for(int i=0;i<n;i++){
        if(!viz[i]){
            int maxi = i, mini = i;
            comp++;
            viz[i] = comp;
            int curr = p[i];
            while(curr != i){
                viz[curr] = comp;
                maxi = max(maxi, curr);
                mini = min(mini, curr);
                curr = p[curr];
            }
            ranges.push_back({mini, maxi});
        }
	}
    while(ranges.size() && ranges.back().fr == ranges.back().sc && ranges.back().sc > s){
        ranges.pop_back();
    }
    reverse(all(ranges));
    while(ranges.size() && ranges.back().fr == ranges.back().sc && ranges.back().sc < s){
        ranges.pop_back();
    }
	sort(all(ranges));
	deque<pair<int,int>>Q;
	for(auto it : ranges){
        Q.push_back(it);
	}
	queue<pair<long long, long long>>rn;
	while(Q.size()){
        cost += 2;
        rn.push(Q.front());
        Q.pop_front();
        while(rn.size()){
            auto it = rn.front();
            rn.pop();
            while(Q.size() && Q.front().fr <= it.sc){
                rn.push(Q.front());
                Q.pop_front();
            }
        }
	}
	cost -= 2LL;
	return ans + cost;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct
2 Correct 15 ms 23756 KB Output is correct
3 Correct 17 ms 23756 KB Output is correct
4 Correct 17 ms 23756 KB Output is correct
5 Correct 15 ms 23752 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Correct 16 ms 23780 KB Output is correct
8 Correct 15 ms 23756 KB Output is correct
9 Correct 16 ms 23764 KB Output is correct
10 Correct 16 ms 23756 KB Output is correct
11 Correct 15 ms 23716 KB Output is correct
12 Correct 16 ms 23676 KB Output is correct
13 Correct 15 ms 23784 KB Output is correct
14 Correct 16 ms 23788 KB Output is correct
15 Correct 16 ms 23756 KB Output is correct
16 Correct 15 ms 23756 KB Output is correct
17 Correct 16 ms 23792 KB Output is correct
18 Correct 16 ms 23792 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct
2 Correct 15 ms 23756 KB Output is correct
3 Correct 17 ms 23756 KB Output is correct
4 Correct 17 ms 23756 KB Output is correct
5 Correct 15 ms 23752 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Correct 16 ms 23780 KB Output is correct
8 Correct 15 ms 23756 KB Output is correct
9 Correct 16 ms 23764 KB Output is correct
10 Correct 16 ms 23756 KB Output is correct
11 Correct 15 ms 23716 KB Output is correct
12 Correct 16 ms 23676 KB Output is correct
13 Correct 15 ms 23784 KB Output is correct
14 Correct 16 ms 23788 KB Output is correct
15 Correct 16 ms 23756 KB Output is correct
16 Correct 15 ms 23756 KB Output is correct
17 Correct 16 ms 23792 KB Output is correct
18 Correct 16 ms 23792 KB Output is correct
19 Correct 16 ms 23680 KB Output is correct
20 Correct 16 ms 23768 KB Output is correct
21 Correct 17 ms 23784 KB Output is correct
22 Correct 16 ms 23816 KB Output is correct
23 Correct 16 ms 23756 KB Output is correct
24 Correct 16 ms 23776 KB Output is correct
25 Correct 16 ms 23756 KB Output is correct
26 Correct 16 ms 23756 KB Output is correct
27 Correct 15 ms 23788 KB Output is correct
28 Correct 16 ms 23788 KB Output is correct
29 Correct 15 ms 23756 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct
2 Correct 15 ms 23756 KB Output is correct
3 Correct 17 ms 23756 KB Output is correct
4 Correct 17 ms 23756 KB Output is correct
5 Correct 15 ms 23752 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Correct 16 ms 23780 KB Output is correct
8 Correct 15 ms 23756 KB Output is correct
9 Correct 16 ms 23764 KB Output is correct
10 Correct 16 ms 23756 KB Output is correct
11 Correct 15 ms 23716 KB Output is correct
12 Correct 16 ms 23676 KB Output is correct
13 Correct 15 ms 23784 KB Output is correct
14 Correct 16 ms 23788 KB Output is correct
15 Correct 16 ms 23756 KB Output is correct
16 Correct 15 ms 23756 KB Output is correct
17 Correct 16 ms 23792 KB Output is correct
18 Correct 16 ms 23792 KB Output is correct
19 Correct 16 ms 23680 KB Output is correct
20 Correct 16 ms 23768 KB Output is correct
21 Correct 17 ms 23784 KB Output is correct
22 Correct 16 ms 23816 KB Output is correct
23 Correct 16 ms 23756 KB Output is correct
24 Correct 16 ms 23776 KB Output is correct
25 Correct 16 ms 23756 KB Output is correct
26 Correct 16 ms 23756 KB Output is correct
27 Correct 15 ms 23788 KB Output is correct
28 Correct 16 ms 23788 KB Output is correct
29 Correct 15 ms 23756 KB Output is correct
30 Correct 201 ms 46104 KB Output is correct
31 Correct 200 ms 46152 KB Output is correct
32 Correct 164 ms 61912 KB Output is correct
33 Correct 196 ms 62712 KB Output is correct
34 Correct 205 ms 62692 KB Output is correct
35 Correct 188 ms 62348 KB Output is correct
36 Correct 165 ms 52272 KB Output is correct
37 Correct 150 ms 47120 KB Output is correct
38 Correct 149 ms 46368 KB Output is correct
39 Correct 158 ms 46356 KB Output is correct
40 Correct 178 ms 46108 KB Output is correct
41 Correct 180 ms 46104 KB Output is correct
42 Correct 176 ms 46108 KB Output is correct
43 Correct 202 ms 69940 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23804 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct
2 Correct 15 ms 23756 KB Output is correct
3 Correct 17 ms 23756 KB Output is correct
4 Correct 17 ms 23756 KB Output is correct
5 Correct 15 ms 23752 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Correct 16 ms 23780 KB Output is correct
8 Correct 15 ms 23756 KB Output is correct
9 Correct 16 ms 23764 KB Output is correct
10 Correct 16 ms 23756 KB Output is correct
11 Correct 15 ms 23716 KB Output is correct
12 Correct 16 ms 23676 KB Output is correct
13 Correct 15 ms 23784 KB Output is correct
14 Correct 16 ms 23788 KB Output is correct
15 Correct 16 ms 23756 KB Output is correct
16 Correct 15 ms 23756 KB Output is correct
17 Correct 16 ms 23792 KB Output is correct
18 Correct 16 ms 23792 KB Output is correct
19 Correct 16 ms 23680 KB Output is correct
20 Correct 16 ms 23768 KB Output is correct
21 Correct 17 ms 23784 KB Output is correct
22 Correct 16 ms 23816 KB Output is correct
23 Correct 16 ms 23756 KB Output is correct
24 Correct 16 ms 23776 KB Output is correct
25 Correct 16 ms 23756 KB Output is correct
26 Correct 16 ms 23756 KB Output is correct
27 Correct 15 ms 23788 KB Output is correct
28 Correct 16 ms 23788 KB Output is correct
29 Correct 15 ms 23756 KB Output is correct
30 Correct 201 ms 46104 KB Output is correct
31 Correct 200 ms 46152 KB Output is correct
32 Correct 164 ms 61912 KB Output is correct
33 Correct 196 ms 62712 KB Output is correct
34 Correct 205 ms 62692 KB Output is correct
35 Correct 188 ms 62348 KB Output is correct
36 Correct 165 ms 52272 KB Output is correct
37 Correct 150 ms 47120 KB Output is correct
38 Correct 149 ms 46368 KB Output is correct
39 Correct 158 ms 46356 KB Output is correct
40 Correct 178 ms 46108 KB Output is correct
41 Correct 180 ms 46104 KB Output is correct
42 Correct 176 ms 46108 KB Output is correct
43 Correct 202 ms 69940 KB Output is correct
44 Incorrect 15 ms 23804 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -