oj.uz

Submission #6847

# Submission time Handle Problem Language Result Execution time Memory
6847 2014-07-08T07:22:36 Z gs12117 역사적 조사 (JOI14_historical) C++
40 / 100
 4000 ms 7436 KB 
#include<stdio.h>
#include<algorithm>
#define BSIZ 300
int n,q;
int x[100100];
struct sn{
	int loc,val;
	bool operator<(const sn&r)const{
		return val<r.val;
	}
};
sn st[100100];
int a[100100];
int cpr[100100];
int qry[100100][2];
long long int ans[100100];
long long int sv[100100];
int cprn;
long long int it[1<<18];
void push(int loc,long long int val){
	loc+=1<<17;
	it[loc]=val;
	loc/=2;
	while(loc!=0){
		if(it[loc*2]>it[loc*2+1]){
			it[loc]=it[loc*2];
		}
		else{
			it[loc]=it[loc*2+1];
		}
		loc/=2;
	}
}
long long int calc(){
	return it[1];
}
int main(){
	int i,j,k,p,bf,df;
	scanf("%d%d",&n,&q);
	for(i=0;i<n;i++){
		scanf("%d",&x[i]);
		st[i].val=x[i];
		st[i].loc=i;
	}
	std::sort(st,st+n);
	for(i=0;i<n;i++){
		a[st[i].loc]=cprn;
		if(i==n-1||st[i].val!=st[i+1].val){
			cpr[cprn]=st[i].val;
			cprn++;
		}
	}
	for(i=0;i<q;i++){
		scanf("%d%d",&qry[i][0],&qry[i][1]);
		qry[i][0]--;
		qry[i][1]--;
		st[i].loc=i;
		st[i].val=qry[i][1];
	}
	std::sort(st,st+q);
	for(i=0;i<=(n-1)/BSIZ;i++){
		bf=i*BSIZ;
		df=i*BSIZ;
		for(j=0;j<q;j++){
			p=st[j].loc;
			if(qry[p][0]/BSIZ==i){
				for(k=bf;k<=qry[p][1];k++){
					sv[a[k]]+=cpr[a[k]];
					push(a[k],sv[a[k]]);
				}
				bf=qry[p][1]+1;
				if(df<qry[p][0]){
					for(k=df;k<qry[p][0];k++){
						sv[a[k]]-=cpr[a[k]];
						push(a[k],sv[a[k]]);
					}
				}
				else{
					for(k=qry[p][0];k<df;k++){
						sv[a[k]]+=cpr[a[k]];
						push(a[k],sv[a[k]]);
					}
				}
				df=qry[p][0];
				ans[p]=calc();
			}
		}
		for(k=0;k<cprn;k++){
			if(sv[k]==0)continue;
			sv[k]=0;
			push(k,0);
		}
	}
	for(i=0;i<q;i++){
		printf("%lld\n",ans[i]);
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 7436 KB Output is correct
2 Correct 0 ms 7436 KB Output is correct
3 Correct 0 ms 7436 KB Output is correct
4 Correct 0 ms 7436 KB Output is correct
5 Correct 0 ms 7436 KB Output is correct
6 Correct 0 ms 7436 KB Output is correct
7 Correct 0 ms 7436 KB Output is correct
8 Correct 0 ms 7436 KB Output is correct
9 Correct 0 ms 7436 KB Output is correct
10 Correct 0 ms 7436 KB Output is correct
11 Correct 0 ms 7436 KB Output is correct
12 Correct 0 ms 7436 KB Output is correct
13 Correct 0 ms 7436 KB Output is correct
14 Correct 0 ms 7436 KB Output is correct
15 Correct 0 ms 7436 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 7436 KB Output is correct
2 Correct 0 ms 7436 KB Output is correct
3 Correct 4 ms 7436 KB Output is correct
4 Correct 12 ms 7436 KB Output is correct
5 Correct 24 ms 7436 KB Output is correct
6 Correct 44 ms 7436 KB Output is correct
7 Correct 44 ms 7436 KB Output is correct
8 Correct 40 ms 7436 KB Output is correct
9 Correct 36 ms 7436 KB Output is correct
10 Correct 56 ms 7436 KB Output is correct
11 Correct 56 ms 7436 KB Output is correct
12 Correct 56 ms 7436 KB Output is correct
13 Correct 56 ms 7436 KB Output is correct
14 Correct 52 ms 7436 KB Output is correct
15 Correct 52 ms 7436 KB Output is correct
16 Correct 40 ms 7436 KB Output is correct
17 Correct 36 ms 7436 KB Output is correct
18 Correct 52 ms 7436 KB Output is correct
19 Correct 56 ms 7436 KB Output is correct
20 Correct 56 ms 7436 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 7436 KB Output is correct
2 Correct 0 ms 7436 KB Output is correct
3 Correct 0 ms 7436 KB Output is correct
4 Correct 0 ms 7436 KB Output is correct
5 Correct 0 ms 7436 KB Output is correct
6 Correct 0 ms 7436 KB Output is correct
7 Correct 4 ms 7436 KB Output is correct
8 Correct 4 ms 7436 KB Output is correct
9 Correct 20 ms 7436 KB Output is correct
10 Correct 20 ms 7436 KB Output is correct
11 Correct 220 ms 7436 KB Output is correct
12 Correct 72 ms 7436 KB Output is correct
13 Correct 116 ms 7436 KB Output is correct
14 Correct 196 ms 7436 KB Output is correct
15 Correct 324 ms 7436 KB Output is correct
16 Correct 1596 ms 7436 KB Output is correct
17 Correct 540 ms 7436 KB Output is correct
18 Correct 624 ms 7436 KB Output is correct
19 Correct 1132 ms 7436 KB Output is correct
20 Correct 1024 ms 7436 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 7436 KB Output is correct
2 Correct 264 ms 7436 KB Output is correct
3 Correct 572 ms 7436 KB Output is correct
4 Correct 968 ms 7436 KB Output is correct
5 Correct 1344 ms 7436 KB Output is correct
6 Correct 1560 ms 7436 KB Output is correct
7 Correct 1496 ms 7436 KB Output is correct
8 Correct 1512 ms 7436 KB Output is correct
9 Correct 1628 ms 7436 KB Output is correct
10 Correct 1776 ms 7436 KB Output is correct
11 Correct 2020 ms 7436 KB Output is correct
12 Correct 2612 ms 7436 KB Output is correct
13 Correct 3644 ms 7436 KB Output is correct
14 Execution timed out 4000 ms 7436 KB Program timed out
15 Halted 0 ms 0 KB -