Submission #725274

---

Source Code Expand

#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
	string::size_type size=x.size();
	return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,k) for(int i=l;i>k;i--)
#define fi first
#define se second
typedef  vector<string> vs;
typedef  vector<int> vi;
double pi(){
	return M_PI;
}
typedef set<int> set_i;
typedef set<string> set_s;
int main(){
	int n,q;
	cin>>n>>q;
	vi a(n,0);
	fu(0,q){
		int l,r,t;
		cin>>l>>r>>t;
		for(int s=l-1;s<r;s++){
			a[s]=t;
		}
	}
	fu(0,n){
		cout<<a[i]<<endl;
	}
}

Submission Info

Judge Result