답안 #1048488

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1048488	2024-08-08T07:54:06 Z	LittleOrange	고대 책들 (IOI17_books)	C++17	50 / 100	266 ms	103832 KB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct obj{
	ll i,w;
	bool operator<(const obj &o)const{
		return w>o.w;
	}
};
struct BIT{
	ll n;
	vector<ll> a;
	BIT(ll N):n(N),a(N+5,0){}
	void add(ll i, ll v){
		for(;i<=n;i+=i&-i) a[i] += v;
	}
	ll get(ll i){
		ll v = 0;
		for(;i>0;i-=i&-i) v += a[i];
		return v;
	}
};
long long minimum_walk(std::vector<int> p, int s) {
	ll ans = 0;
	ll n = p.size();
	ll gpc = 0;
	vector<ll> gp(n,-1);
	vector<ll> L,R;
	vector<vector<ll>> gps;
	for(ll i = 0;i<n;i++){
		if (gp[i]==-1){
			ll cur = gpc++;
			gps.emplace_back();
			L.push_back(n);
			R.push_back(0);
			ll x = i;
			do{
				L[cur] = min(x,L[cur]);
				R[cur] = max(x,R[cur]);
				gp[x] = cur;
				gps[cur].push_back(x);
				ans += abs(p[x]-x);
				x = p[x];
			} while(x!=i);
		}
	}
	vector<ll> v(n,0);
	for(ll i : L) v[i]++;
	for(ll i : R) v[i]--;
	for(ll i = 1;i<n;i++) v[i] += v[i-1];
	ll rf = n-1;
	while(rf&&p[rf]==rf) rf--;
	for(ll i = 0;i<rf;i++) if(!v[i]) ans += 2;
	ll cL = s, cR = s;
	for(ll i : L) if(i<=s) cL=min(cL,i);
	for(ll i : R) if(i>=s) cR=max(cR,i);
	vector<ll> dis(n,n);
	priority_queue<obj> q;
	q.push({s,0});
	while(!q.empty()){
		auto [i,w] = q.top();q.pop();
		if (dis[i]<=w) continue;
		dis[i] = w;
		q.push({L[gp[i]],w});
		q.push({R[gp[i]],w});
		if(i>0) q.push({i-1,w+1});
		if(i<n-1) q.push({i+1,w+1});
	}
	ans += min(dis[cL],dis[cR])*2;
	return ans;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	0 ms	348 KB	Output is correct
5	Correct	0 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	0 ms	348 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	344 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	1 ms	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	0 ms	348 KB	Output is correct
5	Correct	0 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	0 ms	348 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	344 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	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	0 ms	348 KB	Output is correct
5	Correct	0 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	0 ms	348 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	344 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	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	153 ms	42088 KB	Output is correct
31	Correct	145 ms	42940 KB	Output is correct
32	Correct	171 ms	103832 KB	Output is correct
33	Correct	168 ms	87428 KB	Output is correct
34	Correct	166 ms	88564 KB	Output is correct
35	Correct	174 ms	86172 KB	Output is correct
36	Correct	173 ms	56572 KB	Output is correct
37	Correct	177 ms	44804 KB	Output is correct
38	Correct	198 ms	42732 KB	Output is correct
39	Correct	202 ms	42580 KB	Output is correct
40	Correct	181 ms	40908 KB	Output is correct
41	Correct	153 ms	41852 KB	Output is correct
42	Correct	160 ms	40532 KB	Output is correct
43	Correct	266 ms	90096 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	344 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3312'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	0 ms	348 KB	Output is correct
5	Correct	0 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	0 ms	348 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	344 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	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	153 ms	42088 KB	Output is correct
31	Correct	145 ms	42940 KB	Output is correct
32	Correct	171 ms	103832 KB	Output is correct
33	Correct	168 ms	87428 KB	Output is correct
34	Correct	166 ms	88564 KB	Output is correct
35	Correct	174 ms	86172 KB	Output is correct
36	Correct	173 ms	56572 KB	Output is correct
37	Correct	177 ms	44804 KB	Output is correct
38	Correct	198 ms	42732 KB	Output is correct
39	Correct	202 ms	42580 KB	Output is correct
40	Correct	181 ms	40908 KB	Output is correct
41	Correct	153 ms	41852 KB	Output is correct
42	Correct	160 ms	40532 KB	Output is correct
43	Correct	266 ms	90096 KB	Output is correct
44	Incorrect	1 ms	344 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3312'
45	Halted	0 ms	0 KB	-

답안 #1048488

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