# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084488 | shishankrawat93774 | Wall (IOI14_wall) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define ll long long
int main(){
int n, q; cin>>n>>q;
vector<int> arr(n, 0);
for(int i = 0; i<q; i++){
int t; cin>>t;
if(t == 1){
int l, r, h; cin>>l>>r>>h;
while(l<=r) {arr[l] = max(arr[l], h); l++;}
}else{
int l, r, h; cin>>l>>r>>h;
while(l<=r) {arr[l] = min(arr[l], h); l++;}
}
}
for(int i = 0; i<n; i++){
cout<<arr[i]<<"\n";
}
return 0;
}