oj.uz

Submission #5399

# Submission time Handle Problem Language Result Execution time Memory
5399 2014-04-30T10:02:54 Z gs12117 Trading (IZhO13_trading) C++
100 / 100
 168 ms 7532 KB 
#include<stdio.h>
#include<algorithm>
int n,m;
struct trader{
	int l,r,p;
	bool operator<(const trader&v)const{
		return p>v.p;
	}
};
trader tset[300100];
int ans[300100];
int uft[300100];
int uftf(int x){
	if(x==uft[x])return x;
	return uft[x]=uftf(uft[x]);
}
int main(){
	int i,j;
	scanf("%d%d",&n,&m);
	for(i=0;i<m;i++){
		scanf("%d%d%d",&tset[i].l,&tset[i].r,&tset[i].p);
		tset[i].l--;
		tset[i].p-=tset[i].l;
	}
	std::sort(tset,tset+m);
	for(i=0;i<=n;i++){
		uft[i]=i;
	}
	for(i=0;i<m;i++){
		for(j=uftf(tset[i].l);j<tset[i].r;j=uftf(j)){
			ans[j]=tset[i].p+j;
			uft[j]=uftf(j+1);
		}
	}
	for(i=0;i<n;i++){
		printf("%d ",ans[i]);
	}
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6948 KB Output is correct
2 Correct 0 ms 6948 KB Output is correct
3 Correct 0 ms 6948 KB Output is correct
4 Correct 0 ms 6948 KB Output is correct
5 Correct 0 ms 6948 KB Output is correct
6 Correct 0 ms 6948 KB Output is correct
7 Correct 92 ms 6948 KB Output is correct
8 Correct 96 ms 6948 KB Output is correct
9 Correct 96 ms 7212 KB Output is correct
10 Correct 100 ms 6948 KB Output is correct
11 Correct 112 ms 7016 KB Output is correct
12 Correct 132 ms 7320 KB Output is correct
13 Correct 132 ms 6948 KB Output is correct
14 Correct 136 ms 7088 KB Output is correct
15 Correct 144 ms 7484 KB Output is correct
16 Correct 156 ms 6948 KB Output is correct
17 Correct 140 ms 7100 KB Output is correct
18 Correct 164 ms 7532 KB Output is correct
19 Correct 156 ms 6948 KB Output is correct
20 Correct 168 ms 7224 KB Output is correct