# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30826 | Kerim | Trading (IZhO13_trading) | C++14 | 586 ms | 31292 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"
#define MAXN 300009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
multiset<int>s;
int ans[MAXN];
vector<int>add[MAXN],rem[MAXN];
int main(){
//~ #ifndef ONLINE_JUDGE
//~ freopen("file.in", "r", stdin);
//~ #endif
int n,q;
scanf("%d%d",&n,&q);
while(q--){
int l,r,k;
scanf("%d%d%d",&l,&r,&k);
add[l].pb(k-l);
rem[r].pb(k-l);
}
for(int i=1;i<=n;i++){
tr(it,add[i])
s.insert(*it);
if(s.empty())
printf("0 ");
else
printf("%d ",i+*s.rbegin());
tr(it,rem[i])
s.erase(s.find(*it));
}puts("");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |