oj.uz

Submission #41324

# Submission time Handle Problem Language Result Execution time Memory
41324 2018-02-16T01:21:33 Z wzy Trading (IZhO13_trading) C++11
100 / 100
 391 ms 31716 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define F first
#define pb push_back
#define S second
int n , m , carry[300005];
vector<pii> st [300005], ed[300005]; 

multiset<pii> ans;

int main(){
	scanf("%d%d" , &n , &m);
	for(int i = 0 ; i < m ; i++){
		int l ,r , v;
		scanf("%d%d%d" , &l , &r , &v);
		st[l].pb(pii(r, v));
	}
	for(int i = 0 ; i <= n ; i++) carry[i] = 0;
	for(int i = 1 ; i <= n ; i++){
		while(!st[i].empty()){
			ans.insert(pii(i -st[i].back().S  , st[i].back().F));
			ed[st[i].back().F].pb(pii(pii( i - st[i].back().S  , st[i].back().F)));
			st[i].pop_back();
		}
		if(!ans.empty()){
			pii u = *ans.begin();
			carry[i] = max(carry[i] , i - u.F);
		}
		while(ed[i].size()){
			ans.erase(ans.find(ed[i].back()));
			ed[i].pop_back();
		}
	}
	for(int i = 1 ; i <= n; i++) printf("%d " , carry[i]);
}

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:13:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d" , &n , &m);
                         ^
trading.cpp:16:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d" , &l , &r , &v);
                                 ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14328 KB Output is correct
2 Correct 13 ms 14636 KB Output is correct
3 Correct 13 ms 14636 KB Output is correct
4 Correct 14 ms 14636 KB Output is correct
5 Correct 14 ms 14696 KB Output is correct
6 Correct 16 ms 14732 KB Output is correct
7 Correct 182 ms 23696 KB Output is correct
8 Correct 194 ms 24896 KB Output is correct
9 Correct 226 ms 25516 KB Output is correct
10 Correct 255 ms 26732 KB Output is correct
11 Correct 226 ms 26864 KB Output is correct
12 Correct 321 ms 29068 KB Output is correct
13 Correct 291 ms 29068 KB Output is correct
14 Correct 318 ms 29376 KB Output is correct
15 Correct 323 ms 29380 KB Output is correct
16 Correct 352 ms 29380 KB Output is correct
17 Correct 319 ms 29380 KB Output is correct
18 Correct 333 ms 30764 KB Output is correct
19 Correct 362 ms 30764 KB Output is correct
20 Correct 391 ms 31716 KB Output is correct