Submission #719166

---

Source Code Expand

 #include <string>
 #include <vector>
 #include <algorithm>
 #include <numeric>
 #include <set>
 #include <map>
 #include <queue>
 #include <iostream>
 #include <sstream>
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <cctype>
 #include <cassert>
 #include <limits>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll; typedef map<int, int> mii;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }


int kyori(int a,int b){

  return   (a-b)*(a-b);
}

int main() {
  int n,q;
  cin >> n >> q;
  int a[n];
  rep(i,n) {
    a[i]=0;
  }
  int l,r,t;
  rep(i,q){
    cin >> l >> r >> t;
    rer(j,l-1, r-1) {
      a[j] = t;
    }
  }
  rep(i,n) {
    cout << a[i] << endl;
  }
return 0;
}

Submission Info

Judge Result