# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1010529 | tarpent | Trading (IZhO13_trading) | C++14 | 2052 ms | 5204 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;
const int maxn = 3e5+7;
int n,m,k,a,b,c;
int val[maxn];
int main(){
cin>>n>>m;
for(int i = 0; i<m; i++){
cin>>a>>b>>c;
for(int j = a-1; j<b; j++){
val[j]=max(val[j],c);
c++;
}
}
for(int i = 0; i<n; i++){
cout<<val[i]<<' ';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |