답안 #953291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953291 2024-03-25T19:27:19 Z waldi 고대 책들 (IOI17_books) C++17
50 / 100
355 ms 66100 KB
#include "books.h"
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) (int((x).size()))
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;

ll minimum_walk(vector<int> perm, int start){
	int n = ssize(perm);
	ll wyn = 0ll;
	REP(i, n) wyn += abs(i-perm[i]);
	
	set<int> ciekawe;
	REP(i, n) if(perm[i] != i) ciekawe.emplace(i);
	
	vector<int> lewo, prawo;
	vector<int> odw(n, -1);
	REP(i, n) if(odw[i] < 0){
		int mini = i, maks = i;
		for(int w = i; odw[w] < 0; w = perm[w]){
			odw[w] = ssize(lewo);
			mini = min(mini, w);
			maks = max(maks, w);
		}
		lewo.emplace_back(mini);
		prawo.emplace_back(maks);
	}
	
	bool cokolwiek = 0;
	int l = start, p = start;
	while(ssize(ciekawe)){
		auto it = ciekawe.lower_bound(l);
		if(it != ciekawe.end() && *it <= p){
			l = min(l, lewo[odw[*it]]);
			p = max(p, prawo[odw[*it]]);
			ciekawe.erase(it);
			continue;
		}
		
		if(cokolwiek){
			if(it != ciekawe.end()) wyn += (*it-p)<<1, p = *it;
			else wyn += (l-*prev(it))<<1, l = *prev(it);
			continue;
		}
		
		if(l <= *ciekawe.begin() || *prev(ciekawe.end()) <= p){
			cokolwiek = 1;
			continue;
		}
		
		bool git = 0;
		int koszt_lewo = 0;
		int nowe_lewo = l;
		int iter = l;
		while(iter > 1){
			if(iter == nowe_lewo) --nowe_lewo, ++koszt_lewo;
			--iter;
			if(iter != perm[iter]){
				nowe_lewo = min(nowe_lewo, lewo[odw[iter]]);
				if(prawo[odw[iter]] > p){git = 1; break;}
			}
		}
		if(!git){
			cokolwiek = 1;
			continue;
		}
		
		git = 0;
		int koszt_prawo = 0;
		int nowe_prawo = p;
		iter = p;
		while(iter < n-1){
			if(iter == nowe_prawo) ++nowe_prawo, ++koszt_prawo;
			++iter;
			if(iter != perm[iter]){
				nowe_prawo = max(nowe_prawo, prawo[odw[iter]]);
				if(lewo[odw[iter]] < l){git = 1; break;}
			}
		}
		if(!git){
			cokolwiek = 1;
			continue;
		}
		
		if(koszt_lewo < koszt_prawo) wyn += koszt_lewo<<1, l = nowe_lewo;
		else wyn += koszt_prawo<<1, p = nowe_prawo;
	}
	return wyn;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 444 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 444 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 440 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 432 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 444 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 440 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 432 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 355 ms 65772 KB Output is correct
31 Correct 349 ms 66100 KB Output is correct
32 Correct 82 ms 27060 KB Output is correct
33 Correct 219 ms 50388 KB Output is correct
34 Correct 216 ms 51120 KB Output is correct
35 Correct 274 ms 59572 KB Output is correct
36 Correct 319 ms 63168 KB Output is correct
37 Correct 352 ms 65996 KB Output is correct
38 Correct 341 ms 65796 KB Output is correct
39 Correct 339 ms 65756 KB Output is correct
40 Correct 330 ms 65876 KB Output is correct
41 Correct 343 ms 65636 KB Output is correct
42 Correct 355 ms 66008 KB Output is correct
43 Correct 228 ms 51056 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Incorrect 1 ms 348 KB 3rd lines differ - on the 1st token, expected: '25052', found: '25058'
15 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 444 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 440 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 432 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 355 ms 65772 KB Output is correct
31 Correct 349 ms 66100 KB Output is correct
32 Correct 82 ms 27060 KB Output is correct
33 Correct 219 ms 50388 KB Output is correct
34 Correct 216 ms 51120 KB Output is correct
35 Correct 274 ms 59572 KB Output is correct
36 Correct 319 ms 63168 KB Output is correct
37 Correct 352 ms 65996 KB Output is correct
38 Correct 341 ms 65796 KB Output is correct
39 Correct 339 ms 65756 KB Output is correct
40 Correct 330 ms 65876 KB Output is correct
41 Correct 343 ms 65636 KB Output is correct
42 Correct 355 ms 66008 KB Output is correct
43 Correct 228 ms 51056 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 500 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Incorrect 1 ms 348 KB 3rd lines differ - on the 1st token, expected: '25052', found: '25058'
58 Halted 0 ms 0 KB -