Submission #953093

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
953093	2024-03-25T13:22:20 Z	waldi	Ancient Books (IOI17_books)	C++17	50 / 100	1329 ms	142488 KB

books

#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<set<int>> cykle;
	vector<int> lewo, prawo;
	vector<int> odw(n, -1);
	REP(i, n) if(odw[i] < 0){
		int mini = i, maks = i;
		set<int> s;
		for(int w = i; odw[w] < 0; w = perm[w]){
			odw[w] = ssize(cykle);
			s.emplace(w);
			mini = min(mini, w);
			maks = max(maks, w);
		}
		cykle.emplace_back(s);
		lewo.emplace_back(mini);
		prawo.emplace_back(maks);
	}
	
	//~ REP(i, n) printf("%d ", odw[i]);
	//~ printf("\n");
	//~ for(vector<int> t : cykle){
		//~ for(int i : t) printf("%d ", i);
		//~ printf("\n");
	//~ }
	
	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){
			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;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 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	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 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	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 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	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 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	1329 ms	132424 KB	Output is correct
31	Correct	1078 ms	113492 KB	Output is correct
32	Correct	193 ms	114656 KB	Output is correct
33	Correct	318 ms	124572 KB	Output is correct
34	Correct	322 ms	124648 KB	Output is correct
35	Correct	374 ms	142488 KB	Output is correct
36	Correct	436 ms	115508 KB	Output is correct
37	Correct	471 ms	108108 KB	Output is correct
38	Correct	490 ms	106384 KB	Output is correct
39	Correct	491 ms	106404 KB	Output is correct
40	Correct	551 ms	106324 KB	Output is correct
41	Correct	879 ms	108464 KB	Output is correct
42	Correct	624 ms	106324 KB	Output is correct
43	Correct	310 ms	126176 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 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	432 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 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	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 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	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 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	1329 ms	132424 KB	Output is correct
31	Correct	1078 ms	113492 KB	Output is correct
32	Correct	193 ms	114656 KB	Output is correct
33	Correct	318 ms	124572 KB	Output is correct
34	Correct	322 ms	124648 KB	Output is correct
35	Correct	374 ms	142488 KB	Output is correct
36	Correct	436 ms	115508 KB	Output is correct
37	Correct	471 ms	108108 KB	Output is correct
38	Correct	490 ms	106384 KB	Output is correct
39	Correct	491 ms	106404 KB	Output is correct
40	Correct	551 ms	106324 KB	Output is correct
41	Correct	879 ms	108464 KB	Output is correct
42	Correct	624 ms	106324 KB	Output is correct
43	Correct	310 ms	126176 KB	Output is correct
44	Correct	1 ms	348 KB	Output is correct
45	Correct	1 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	432 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct
51	Correct	1 ms	344 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	1 ms	344 KB	Output is correct
54	Correct	1 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	-

Submission #953093

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