oj.uz

Submission #124104

# Submission time Handle Problem Language Result Execution time Memory
124104 2019-07-02T14:18:24 Z nxteru Dancing Elephants (IOI11_elephants) C++14
100 / 100
 3250 ms 12564 KB 
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 150005
#define B 400
int n,k,bs[MAX_N/B+2],p[MAX_N],pl[MAX_N],l,cnt,ds[MAX_N/B+2][B*2+1],sz[MAX_N/B+2][B*2+1],el[MAX_N/B+2][B*2+1];
void Bini(int x,int *xel,int xbs,int *xds,int *xsz){
	int r=xbs;
	for(int i=xbs-1;i>=0;i--){
		while(r-1>=0&&xel[i]+l<xel[r-1])r--;
		if(r==xbs){
			xds[i]=xel[i]+l;
			xsz[i]=1;
		}else{
			xds[i]=xds[r];
			xsz[i]=xsz[r]+1;
		}
	}
}
void ALLini(bool start){
	if(start)for(int i=0;i<n;i++)pl[i]=p[i];
	else{
		int sx=0;
		for(int i=0;i<=k;i++)for(int j=0;j<bs[i];j++)pl[sx++]=el[i][j];
	}
	bs[0]=0;
	k=0;
	for(int i=0;i<n;i++){
		if(bs[k]>=B){
			k++;
			bs[k]=0;
		}
		el[k][bs[k]]=pl[i];
		bs[k]++;
	}
	for(int i=0;i<=k;i++)Bini(i,el[i],bs[i],ds[i],sz[i]);
}
void init(int N, int L, int X[]){
	n=N,l=L;
	for(int i=0;i<n;i++)p[i]=X[i];
	ALLini(1);
}
int update(int t, int y){
	int a=-1,b=p[t];
	while(a+1<=k&&bs[a+1]==0||(bs[a+1]>=1&&el[a+1][0]<=b))a++;
	if(a==-1)a=0;
	bool sw=false;
	for(int i=0;i<bs[a]-1;i++){
		if(el[a][i]==b)sw=true;
		if(sw)el[a][i]=el[a][i+1];
	}
	bs[a]--;
	Bini(a,el[a],bs[a],ds[a],sz[a]);
	p[t]=y;
	a=-1;
	while(a+1<=k&&bs[a+1]==0||(bs[a+1]>=1&&el[a+1][0]<=y))a++;
	if(a==-1)a=0;
	el[a][bs[a]]=y;
	bs[a]++;
	for(int i=bs[a]-1;i>0;i--)if(el[a][i]<el[a][i-1])swap(el[a][i],el[a][i-1]);
	Bini(a,el[a],bs[a],ds[a],sz[a]);
	int ans=0;
	a=0,b=-1;
	for(;a<=k;a++){
		if(bs[a]==0)continue;
		int c=upper_bound(el[a],el[a]+bs[a],b)-el[a];
		if(c==bs[a])continue;
		ans+=sz[a][c];
		b=ds[a][c];
	}
	cnt++;
	if(cnt>=B){
		cnt=0;
		ALLini(0);
	}
	return ans;
}

Compilation message

elephants.cpp: In function 'int update(int, int)':
elephants.cpp:45:14: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  while(a+1<=k&&bs[a+1]==0||(bs[a+1]>=1&&el[a+1][0]<=b))a++;
        ~~~~~~^~~~~~~~~~~~
elephants.cpp:56:14: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  while(a+1<=k&&bs[a+1]==0||(bs[a+1]>=1&&el[a+1][0]<=y))a++;
        ~~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 275 ms 2348 KB Output is correct
8 Correct 292 ms 2620 KB Output is correct
9 Correct 388 ms 4344 KB Output is correct
10 Correct 365 ms 4100 KB Output is correct
11 Correct 371 ms 4052 KB Output is correct
12 Correct 585 ms 4216 KB Output is correct
13 Correct 368 ms 3832 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 275 ms 2348 KB Output is correct
8 Correct 292 ms 2620 KB Output is correct
9 Correct 388 ms 4344 KB Output is correct
10 Correct 365 ms 4100 KB Output is correct
11 Correct 371 ms 4052 KB Output is correct
12 Correct 585 ms 4216 KB Output is correct
13 Correct 368 ms 3832 KB Output is correct
14 Correct 354 ms 3448 KB Output is correct
15 Correct 458 ms 3576 KB Output is correct
16 Correct 955 ms 4856 KB Output is correct
17 Correct 980 ms 5752 KB Output is correct
18 Correct 1058 ms 5752 KB Output is correct
19 Correct 693 ms 5884 KB Output is correct
20 Correct 977 ms 5752 KB Output is correct
21 Correct 938 ms 5624 KB Output is correct
22 Correct 595 ms 5240 KB Output is correct

Subtask #5
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 275 ms 2348 KB Output is correct
8 Correct 292 ms 2620 KB Output is correct
9 Correct 388 ms 4344 KB Output is correct
10 Correct 365 ms 4100 KB Output is correct
11 Correct 371 ms 4052 KB Output is correct
12 Correct 585 ms 4216 KB Output is correct
13 Correct 368 ms 3832 KB Output is correct
14 Correct 354 ms 3448 KB Output is correct
15 Correct 458 ms 3576 KB Output is correct
16 Correct 955 ms 4856 KB Output is correct
17 Correct 980 ms 5752 KB Output is correct
18 Correct 1058 ms 5752 KB Output is correct
19 Correct 693 ms 5884 KB Output is correct
20 Correct 977 ms 5752 KB Output is correct
21 Correct 938 ms 5624 KB Output is correct
22 Correct 595 ms 5240 KB Output is correct
23 Correct 2658 ms 12472 KB Output is correct
24 Correct 2750 ms 12564 KB Output is correct
25 Correct 2120 ms 12508 KB Output is correct
26 Correct 2316 ms 12536 KB Output is correct
27 Correct 2361 ms 12408 KB Output is correct
28 Correct 1548 ms 5372 KB Output is correct
29 Correct 1463 ms 5344 KB Output is correct
30 Correct 1544 ms 5240 KB Output is correct
31 Correct 1466 ms 5240 KB Output is correct
32 Correct 2279 ms 12024 KB Output is correct
33 Correct 2124 ms 11384 KB Output is correct
34 Correct 2133 ms 12152 KB Output is correct
35 Correct 1945 ms 12532 KB Output is correct
36 Correct 1993 ms 11900 KB Output is correct
37 Correct 2402 ms 12280 KB Output is correct
38 Correct 2267 ms 11120 KB Output is correct
39 Correct 2235 ms 12224 KB Output is correct
40 Correct 2132 ms 11056 KB Output is correct
41 Correct 3216 ms 11996 KB Output is correct
42 Correct 3250 ms 12152 KB Output is correct