oj.uz

답안 #371097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
371097 2021-02-25T20:07:04 Z doowey 고대 책들 (IOI17_books) C++14
50 / 100
 2000 ms 97132 KB 
#include <bits/stdc++.h>
#include "books.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

int n;
const int N = (int)1e6 + 10;
int lef[N], rig[N];
bool vis[N];
bool has[N];

int tl, tr;

map<pii, int> state;
int ash[1005][1005];


void extend(int &li, int &ri){
    int ni = min(lef[li],lef[ri]);
    int nj = max(rig[li],rig[ri]);
    while(li > ni || ri < nj){
        if(li > ni){
            li--;
            ni = min(ni, lef[li]);
            nj = max(nj, rig[li]);
        }
        else{
            ri++;
            ni = min(ni, lef[ri]);
            nj = max(nj, rig[ri]);
        }
    }
}

int solve(int li, int ri){
    if(li < tl || ri > tr) return (int)1e9 + 9;
    if(state.count(mp(li, ri))) return state[mp(li, ri)];
    extend(li, ri);
    if(li == tl && ri == tr) return 0;
    return state[mp(li,ri)]=min(solve(li-1,ri), solve(li,ri+1)) + 2;
}

long long minimum_walk(vector<int> p, int s) {
	n = p.size();
	int id;
	int low, high;
	ll sol = 0;
    tl = tr = s;
	for(int i = 0 ; i < n; i ++ ){
        sol += abs(p[i] - i);
        if(!vis[i]){
            vector<int> cyc;
            id = i;
            while(!vis[id]){
                vis[id]=true;
                cyc.push_back(id);
                id=p[id];
            }
            low = n-1;
            high = 0;
            for(auto x : cyc){
                low = min(low, x);
                high = max(high, x);
            }
            for(auto x : cyc){
                lef[x] = low;
                rig[x] = high;
            }
        }
        if(p[i] != i){
            tl = min(tl, i);
            tr = max(tr, i);
        }
	}

	return sol + solve(s, s);
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 212 ms 20184 KB Output is correct
31 Correct 217 ms 19064 KB Output is correct
32 Correct 158 ms 17004 KB Output is correct
33 Correct 363 ms 97132 KB Output is correct
34 Correct 357 ms 97132 KB Output is correct
35 Correct 323 ms 73964 KB Output is correct
36 Correct 200 ms 33772 KB Output is correct
37 Correct 145 ms 17772 KB Output is correct
38 Correct 138 ms 17260 KB Output is correct
39 Correct 146 ms 17004 KB Output is correct
40 Correct 159 ms 17268 KB Output is correct
41 Correct 170 ms 17928 KB Output is correct
42 Correct 156 ms 17960 KB Output is correct
43 Correct 168 ms 17004 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 7020 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 22 ms 2796 KB Output is correct
4 Correct 85 ms 6528 KB Output is correct
5 Correct 78 ms 6636 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 22 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Execution timed out 2083 ms 364 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 212 ms 20184 KB Output is correct
31 Correct 217 ms 19064 KB Output is correct
32 Correct 158 ms 17004 KB Output is correct
33 Correct 363 ms 97132 KB Output is correct
34 Correct 357 ms 97132 KB Output is correct
35 Correct 323 ms 73964 KB Output is correct
36 Correct 200 ms 33772 KB Output is correct
37 Correct 145 ms 17772 KB Output is correct
38 Correct 138 ms 17260 KB Output is correct
39 Correct 146 ms 17004 KB Output is correct
40 Correct 159 ms 17268 KB Output is correct
41 Correct 170 ms 17928 KB Output is correct
42 Correct 156 ms 17960 KB Output is correct
43 Correct 168 ms 17004 KB Output is correct
44 Correct 77 ms 7020 KB Output is correct
45 Correct 2 ms 364 KB Output is correct
46 Correct 22 ms 2796 KB Output is correct
47 Correct 85 ms 6528 KB Output is correct
48 Correct 78 ms 6636 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 22 ms 364 KB Output is correct
52 Correct 2 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Execution timed out 2083 ms 364 KB Time limit exceeded
55 Halted 0 ms 0 KB -