oj.uz

Submission #30826

# Submission time Handle Problem Language Result Execution time Memory
30826 2017-07-27T09:53:04 Z Kerim Trading (IZhO13_trading) C++14
100 / 100
 586 ms 31292 KB 
#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

trading.cpp: In function 'int main()':
trading.cpp:28:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&q);
                     ^
trading.cpp:31:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&l,&r,&k);
                           ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17256 KB Output is correct
2 Correct 0 ms 17256 KB Output is correct
3 Correct 0 ms 17256 KB Output is correct
4 Correct 0 ms 17256 KB Output is correct
5 Correct 9 ms 17388 KB Output is correct
6 Correct 3 ms 17388 KB Output is correct
7 Correct 229 ms 25104 KB Output is correct
8 Correct 243 ms 25472 KB Output is correct
9 Correct 319 ms 25692 KB Output is correct
10 Correct 363 ms 26612 KB Output is correct
11 Correct 356 ms 26536 KB Output is correct
12 Correct 383 ms 28248 KB Output is correct
13 Correct 339 ms 27148 KB Output is correct
14 Correct 356 ms 28424 KB Output is correct
15 Correct 453 ms 28496 KB Output is correct
16 Correct 459 ms 28624 KB Output is correct
17 Correct 486 ms 29096 KB Output is correct
18 Correct 379 ms 31292 KB Output is correct
19 Correct 416 ms 28984 KB Output is correct
20 Correct 586 ms 31056 KB Output is correct