Submission #52177

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
52177	2018-06-24T13:59:23 Z	김세빈(#1331)	Ancient Books (IOI17_books)	C++11	50 / 100	526 ms	151492 KB

books

#include "books.h"

#include <bits/stdc++.h>

using namespace std;

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

vector <int> V[1010101];
vector <pii> P;
int T[3030303];
int L[1010101], R[1010101];
int chk[1010101], K[1010101];
int n,cnt,sz;
ll ans;

int abs(int x)
{
	return x > 0? x : -x;
}

int find_min(int l,int r)
{
	l += sz, r += sz;
	int ret = 0;
	
	for(;l<r;){
		if((l & 1) && L[ret] > L[T[l]]) ret = T[l];
		if((~r & 1) && L[ret] > L[T[r]]) ret = T[r];
		l = ++l >> 1;
		r = --r >> 1;
	}
	if(l == r && L[ret] > L[T[l]]) ret = T[l];
	
	return ret;
}

void insert(int p,int v)
{
	p += sz;
	T[p] = v;
	
	for(p>>=1;p;p>>=1){
		if(L[T[p<<1]] < L[T[p<<1|1]]) T[p] = T[p<<1];
		else T[p] = T[p<<1|1];
	}
}
 
bool comp(int a,int b)
{
	return L[a] < L[b];
}

ll minimum_walk(vector <int> p, int s)
{
	int i,t,m,k,f;
	
	n = p.size();
	
	for(sz=1;sz<n;sz<<=1);
	
	for(i=0;i<n;i++) if(!chk[i] && i != p[i]){
		cnt ++;
		chk[i] = cnt;
		V[cnt].push_back(i);
		L[cnt] = R[cnt] = i;
		K[cnt] = cnt;
		
		ans += abs(i - p[i]);
		
		for(int j=p[i];j!=i;j=p[j]){
			chk[j] = cnt;
			V[cnt].push_back(j);
			R[cnt] = max(R[cnt], j);
			
			ans += abs(j - p[j]);
		}
	}
	
	L[0] = n+1;
	
	sort(K+1, K+cnt+1, comp);
	
	for(i=1;i<=cnt;i++){
		t = K[i];
		f = find_min(L[t], R[t]);
		
		if(f){
			for(int j: V[t]){
				V[f].push_back(j);
				R[f] = max(R[f], j);
				chk[j] = f;
				insert(j, f);
			}
			V[t].clear();
		}
		else{
			for(int j: V[t]){
				insert(j, t);
			}
		}
	}
	
	for(i=1;i<=cnt;i++){
		t = K[i];
		if(V[t].empty()) continue;
		f = find_min(L[t], R[t]);
		
		if(L[f] < L[t]){
			for(int j: V[t]){
				V[f].push_back(j);
				R[f] = max(R[f], j);
				chk[j] = f;
				insert(j, f);
			}
			V[t].clear();
		}
	}
	
	for(i=1;i<=cnt;i++){
		if(!V[i].empty()){
			P.push_back(pii(L[i], R[i]));
		}
	}
	
	sort(P.begin(), P.end());
	
	m = n+1;
	
	for(i=t=0;i<P.size();i++){
		if(P[i].second < t) continue;
		ans += 2 * (P[i].first - t);
		t = max(t, P[i].second);
		
		if(P[i].first <= s && s <= P[i].second) m = min(m, P[i].first);
	}
	
	k = m>n? 0 : n+1;
	
	for(i=0;i<n;i++){
		if(p[i] != i && L[chk[i]] == m) k = min(k, abs(s-i));
	}
	
	return ans + k * 2;
}

Compilation message

books.cpp: In function 'int find_min(int, int)':
books.cpp:31:5: warning: operation on 'l' may be undefined [-Wsequence-point]
   l = ++l >> 1;
   ~~^~~~~~~~~~
books.cpp:32:5: warning: operation on 'r' may be undefined [-Wsequence-point]
   r = --r >> 1;
   ~~^~~~~~~~~~
books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:131:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=t=0;i<P.size();i++){
            ~^~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	24056 KB	Output is correct
2	Correct	22 ms	24172 KB	Output is correct
3	Correct	22 ms	24240 KB	Output is correct
4	Correct	22 ms	24316 KB	Output is correct
5	Correct	22 ms	24316 KB	Output is correct
6	Correct	23 ms	24316 KB	Output is correct
7	Correct	23 ms	24316 KB	Output is correct
8	Correct	23 ms	24352 KB	Output is correct
9	Correct	22 ms	24352 KB	Output is correct
10	Correct	27 ms	24352 KB	Output is correct
11	Correct	25 ms	24352 KB	Output is correct
12	Correct	22 ms	24352 KB	Output is correct
13	Correct	22 ms	24352 KB	Output is correct
14	Correct	23 ms	24408 KB	Output is correct
15	Correct	22 ms	24408 KB	Output is correct
16	Correct	23 ms	24408 KB	Output is correct
17	Correct	30 ms	24424 KB	Output is correct
18	Correct	22 ms	24424 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	24056 KB	Output is correct
2	Correct	22 ms	24172 KB	Output is correct
3	Correct	22 ms	24240 KB	Output is correct
4	Correct	22 ms	24316 KB	Output is correct
5	Correct	22 ms	24316 KB	Output is correct
6	Correct	23 ms	24316 KB	Output is correct
7	Correct	23 ms	24316 KB	Output is correct
8	Correct	23 ms	24352 KB	Output is correct
9	Correct	22 ms	24352 KB	Output is correct
10	Correct	27 ms	24352 KB	Output is correct
11	Correct	25 ms	24352 KB	Output is correct
12	Correct	22 ms	24352 KB	Output is correct
13	Correct	22 ms	24352 KB	Output is correct
14	Correct	23 ms	24408 KB	Output is correct
15	Correct	22 ms	24408 KB	Output is correct
16	Correct	23 ms	24408 KB	Output is correct
17	Correct	30 ms	24424 KB	Output is correct
18	Correct	22 ms	24424 KB	Output is correct
19	Correct	22 ms	24424 KB	Output is correct
20	Correct	25 ms	24424 KB	Output is correct
21	Correct	24 ms	24456 KB	Output is correct
22	Correct	25 ms	24504 KB	Output is correct
23	Correct	28 ms	24504 KB	Output is correct
24	Correct	25 ms	24504 KB	Output is correct
25	Correct	23 ms	24504 KB	Output is correct
26	Correct	23 ms	24504 KB	Output is correct
27	Correct	23 ms	24504 KB	Output is correct
28	Correct	26 ms	24504 KB	Output is correct
29	Correct	30 ms	24504 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	24056 KB	Output is correct
2	Correct	22 ms	24172 KB	Output is correct
3	Correct	22 ms	24240 KB	Output is correct
4	Correct	22 ms	24316 KB	Output is correct
5	Correct	22 ms	24316 KB	Output is correct
6	Correct	23 ms	24316 KB	Output is correct
7	Correct	23 ms	24316 KB	Output is correct
8	Correct	23 ms	24352 KB	Output is correct
9	Correct	22 ms	24352 KB	Output is correct
10	Correct	27 ms	24352 KB	Output is correct
11	Correct	25 ms	24352 KB	Output is correct
12	Correct	22 ms	24352 KB	Output is correct
13	Correct	22 ms	24352 KB	Output is correct
14	Correct	23 ms	24408 KB	Output is correct
15	Correct	22 ms	24408 KB	Output is correct
16	Correct	23 ms	24408 KB	Output is correct
17	Correct	30 ms	24424 KB	Output is correct
18	Correct	22 ms	24424 KB	Output is correct
19	Correct	22 ms	24424 KB	Output is correct
20	Correct	25 ms	24424 KB	Output is correct
21	Correct	24 ms	24456 KB	Output is correct
22	Correct	25 ms	24504 KB	Output is correct
23	Correct	28 ms	24504 KB	Output is correct
24	Correct	25 ms	24504 KB	Output is correct
25	Correct	23 ms	24504 KB	Output is correct
26	Correct	23 ms	24504 KB	Output is correct
27	Correct	23 ms	24504 KB	Output is correct
28	Correct	26 ms	24504 KB	Output is correct
29	Correct	30 ms	24504 KB	Output is correct
30	Correct	526 ms	56692 KB	Output is correct
31	Correct	460 ms	65084 KB	Output is correct
32	Correct	194 ms	65084 KB	Output is correct
33	Correct	275 ms	82208 KB	Output is correct
34	Correct	311 ms	88736 KB	Output is correct
35	Correct	308 ms	97404 KB	Output is correct
36	Correct	317 ms	104328 KB	Output is correct
37	Correct	313 ms	107496 KB	Output is correct
38	Correct	264 ms	113440 KB	Output is correct
39	Correct	328 ms	120008 KB	Output is correct
40	Correct	341 ms	125768 KB	Output is correct
41	Correct	377 ms	131160 KB	Output is correct
42	Correct	349 ms	138964 KB	Output is correct
43	Correct	395 ms	151492 KB	Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	24056 KB	Output is correct
2	Correct	22 ms	24172 KB	Output is correct
3	Correct	22 ms	24240 KB	Output is correct
4	Correct	22 ms	24316 KB	Output is correct
5	Correct	22 ms	24316 KB	Output is correct
6	Correct	23 ms	24316 KB	Output is correct
7	Correct	23 ms	24316 KB	Output is correct
8	Correct	23 ms	24352 KB	Output is correct
9	Correct	22 ms	24352 KB	Output is correct
10	Correct	27 ms	24352 KB	Output is correct
11	Correct	25 ms	24352 KB	Output is correct
12	Correct	22 ms	24352 KB	Output is correct
13	Correct	22 ms	24352 KB	Output is correct
14	Correct	23 ms	24408 KB	Output is correct
15	Correct	22 ms	24408 KB	Output is correct
16	Correct	23 ms	24408 KB	Output is correct
17	Correct	30 ms	24424 KB	Output is correct
18	Correct	22 ms	24424 KB	Output is correct
19	Correct	22 ms	24424 KB	Output is correct
20	Correct	25 ms	24424 KB	Output is correct
21	Correct	24 ms	24456 KB	Output is correct
22	Correct	25 ms	24504 KB	Output is correct
23	Correct	28 ms	24504 KB	Output is correct
24	Correct	25 ms	24504 KB	Output is correct
25	Correct	23 ms	24504 KB	Output is correct
26	Correct	23 ms	24504 KB	Output is correct
27	Correct	23 ms	24504 KB	Output is correct
28	Correct	26 ms	24504 KB	Output is correct
29	Correct	30 ms	24504 KB	Output is correct
30	Correct	526 ms	56692 KB	Output is correct
31	Correct	460 ms	65084 KB	Output is correct
32	Correct	194 ms	65084 KB	Output is correct
33	Correct	275 ms	82208 KB	Output is correct
34	Correct	311 ms	88736 KB	Output is correct
35	Correct	308 ms	97404 KB	Output is correct
36	Correct	317 ms	104328 KB	Output is correct
37	Correct	313 ms	107496 KB	Output is correct
38	Correct	264 ms	113440 KB	Output is correct
39	Correct	328 ms	120008 KB	Output is correct
40	Correct	341 ms	125768 KB	Output is correct
41	Correct	377 ms	131160 KB	Output is correct
42	Correct	349 ms	138964 KB	Output is correct
43	Correct	395 ms	151492 KB	Output is correct
44	Incorrect	23 ms	151492 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3590'
45	Halted	0 ms	0 KB	-

Submission #52177

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