oj.uz

답안 #4811

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
4811 2014-01-04T11:33:40 Z cki86201 거래 (IZhO13_trading) C++
100 / 100
 196 ms 5184 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;

const int N_ = 1<<19;

int T[1<<20];

void update(int a,int b,int w)
{
	a+=N_, b+=N_;
	while(a<=b){
		if(a&1)T[a] = max(T[a],w);
		if((b&1)==0)T[b] = max(T[b],w);
		a = (a+1)>>1;
		b = (b-1)>>1;
	}
}

int read(int x)
{
	int ret = -1e7;
	x+=N_;
	while(x){
		ret = max(ret,T[x]);
		x>>=1;
	}
	return ret;
}

int main(){
	int n,m,i;
	scanf("%d%d",&n,&m);
	for(i=0;i<1<<20;i++)T[i]=-1e7;
	for(i=1;i<=n;i++)update(i,i,-i);
	for(i=0;i<m;i++){
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		update(x,y,z-x);
	}
	for(i=1;i<=n;i++){
		printf("%d ",read(i)+i);
	}
	return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5184 KB Output is correct
2 Correct 0 ms 5184 KB Output is correct
3 Correct 0 ms 5184 KB Output is correct
4 Correct 0 ms 5184 KB Output is correct
5 Correct 0 ms 5184 KB Output is correct
6 Correct 0 ms 5184 KB Output is correct
7 Correct 92 ms 5184 KB Output is correct
8 Correct 112 ms 5184 KB Output is correct
9 Correct 120 ms 5184 KB Output is correct
10 Correct 124 ms 5184 KB Output is correct
11 Correct 124 ms 5184 KB Output is correct
12 Correct 140 ms 5184 KB Output is correct
13 Correct 152 ms 5184 KB Output is correct
14 Correct 144 ms 5184 KB Output is correct
15 Correct 148 ms 5184 KB Output is correct
16 Correct 168 ms 5184 KB Output is correct
17 Correct 180 ms 5184 KB Output is correct
18 Correct 168 ms 5184 KB Output is correct
19 Correct 176 ms 5184 KB Output is correct
20 Correct 196 ms 5184 KB Output is correct