Submission #233947

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
233947	2020-05-22T13:03:39 Z	crossing0ver	Dancing Elephants (IOI11_elephants)	C++17	100 / 100	5124 ms	8316 KB

elephants

#include <bits/stdc++.h>
#include "elephants.h"
using namespace std;
const int K = 400, MXN = 1.5E5 + 5;
int P[150000], inbox[150000] , L,B, n,Q,sorted[150000]; 
struct BLOCK{
	int sz;
	int arr[K*2 + 10] , last[K*2 + 10], cost[K*2 + 10];
	
	void del(int x) {
		for (int i = 0; i < sz; i++)
			if (arr[i] == x) {
				x = i; break;
			}
		for (; x < sz;x++)
			swap(arr[x],arr[x+1]);
		sz--;
	}
	void insert (int x) {
		arr[sz] = x;
		int pos = sz;
		for ( ; pos > 0 && P[x] <  P[ arr[pos - 1] ]; pos--)
				swap(arr[pos],arr[pos - 1]);
		sz++;
	}
	void slv() {
		int ptr = sz - 1;
		for (int i = sz - 1; i >= 0; i--) {
			while (ptr > 0 && P[arr[i]] + L < P[arr[ptr - 1]]) ptr--;
			if (P[arr[i]] + L>= P[arr[sz - 1]]) 
					cost[i] = 1, last[i] = arr[i];
			else cost[i] = 1 + cost[ptr], last[i] = last[ptr];
		}
	}
	
	int get (int val) {
		if (sz == 0 ) return -1;
		int l = 0, r = sz - 1;
		while ( l != r) {
			int m = (l + r)/2;
			if (P[arr[m]] > val) r = m;
			else l = m + 1;
		}
		if (P[arr[r]] <= val) return -1;
		return r;
	} 
} box[MXN/K + 10];             
					  
void build() {
	if (Q % K != 0) return;
	if (Q == 0) {
		for (int i = 0; i < n; i++)
		sorted[i] = i;
	}
	else {
		int cnt = 0;
		for (int i = 0; i <= B; i++) {
			 for (int j = 0; j < box[i].sz; j++)
			 	sorted[cnt++] = box[i].arr[j];
		}		
	}
	
	for (int i = 0 ; i <= B; i++) 
	box[i].sz = 0;
	int blc = -1;
	for (int i = 0; i < n; i++) {
		if (i % K == 0){
			blc++;
			box[blc].sz = 0;
		}
		box[blc].insert(sorted[i]);
		inbox[sorted[i]] = blc;
	}
	B = blc;
	for (int i= 0; i <= B; i++)	box[i].slv();
}                  


void init(int N, int L1, int X[]) {
  n = N; L = L1;
  for (int i = 0; i < n; i++) P[i] = X[i];
  build();
}

int update(int i, int y) {
	Q++;
	box[inbox[i]].del(i);
	box[inbox[i]].slv();
	P[i] = y;
	for (int j = 0; j <= B; j++) {
		if (((box[j].sz) && P[box[j].arr[box[j].sz - 1]] >= y) || j == B) {
			box[j].insert(i);
			inbox[i] = j;
			box[j].slv();
			break;
		}
	}
	build();
	int val = INT_MIN,ans = 0;
	for (int i = 0; i <= B; i++) {
		int pos = box[i].get(val + L);
		if (pos == -1) continue;
		ans+= box[i].cost[pos];
		val = P[box[i].last[pos]];
	}    
	return ans;       
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	6 ms	384 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	6 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct

Subtask #3
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	6 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	491 ms	1656 KB	Output is correct
8	Correct	515 ms	1792 KB	Output is correct
9	Correct	458 ms	3196 KB	Output is correct
10	Correct	450 ms	3192 KB	Output is correct
11	Correct	480 ms	3196 KB	Output is correct
12	Correct	751 ms	3192 KB	Output is correct
13	Correct	433 ms	3064 KB	Output is correct

Subtask #4
47.0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	6 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	491 ms	1656 KB	Output is correct
8	Correct	515 ms	1792 KB	Output is correct
9	Correct	458 ms	3196 KB	Output is correct
10	Correct	450 ms	3192 KB	Output is correct
11	Correct	480 ms	3196 KB	Output is correct
12	Correct	751 ms	3192 KB	Output is correct
13	Correct	433 ms	3064 KB	Output is correct
14	Correct	414 ms	2168 KB	Output is correct
15	Correct	775 ms	2296 KB	Output is correct
16	Correct	1290 ms	3308 KB	Output is correct
17	Correct	1372 ms	4344 KB	Output is correct
18	Correct	1441 ms	4216 KB	Output is correct
19	Correct	791 ms	4088 KB	Output is correct
20	Correct	1320 ms	4344 KB	Output is correct
21	Correct	1278 ms	4216 KB	Output is correct
22	Correct	763 ms	4216 KB	Output is correct

Subtask #5
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	6 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	491 ms	1656 KB	Output is correct
8	Correct	515 ms	1792 KB	Output is correct
9	Correct	458 ms	3196 KB	Output is correct
10	Correct	450 ms	3192 KB	Output is correct
11	Correct	480 ms	3196 KB	Output is correct
12	Correct	751 ms	3192 KB	Output is correct
13	Correct	433 ms	3064 KB	Output is correct
14	Correct	414 ms	2168 KB	Output is correct
15	Correct	775 ms	2296 KB	Output is correct
16	Correct	1290 ms	3308 KB	Output is correct
17	Correct	1372 ms	4344 KB	Output is correct
18	Correct	1441 ms	4216 KB	Output is correct
19	Correct	791 ms	4088 KB	Output is correct
20	Correct	1320 ms	4344 KB	Output is correct
21	Correct	1278 ms	4216 KB	Output is correct
22	Correct	763 ms	4216 KB	Output is correct
23	Correct	3724 ms	8192 KB	Output is correct
24	Correct	3924 ms	8192 KB	Output is correct
25	Correct	2977 ms	8196 KB	Output is correct
26	Correct	3922 ms	8312 KB	Output is correct
27	Correct	3894 ms	8312 KB	Output is correct
28	Correct	1712 ms	2552 KB	Output is correct
29	Correct	1638 ms	2552 KB	Output is correct
30	Correct	1703 ms	2552 KB	Output is correct
31	Correct	1662 ms	2552 KB	Output is correct
32	Correct	3572 ms	8312 KB	Output is correct
33	Correct	2928 ms	8312 KB	Output is correct
34	Correct	3106 ms	8312 KB	Output is correct
35	Correct	2853 ms	8196 KB	Output is correct
36	Correct	3218 ms	8312 KB	Output is correct
37	Correct	3962 ms	8312 KB	Output is correct
38	Correct	3133 ms	8312 KB	Output is correct
39	Correct	2975 ms	8192 KB	Output is correct
40	Correct	3566 ms	8200 KB	Output is correct
41	Correct	4989 ms	8316 KB	Output is correct
42	Correct	5124 ms	8192 KB	Output is correct

Submission #233947

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 24.0 / 24.0

Subtask #4 47.0 / 47.0

Subtask #5 3.0 / 3.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
24.0 / 24.0

Subtask #4
47.0 / 47.0

Subtask #5
3.0 / 3.0