oj.uz

Submission #927708

# Submission time Handle Problem Language Result Execution time Memory
927708 2024-02-15T09:13:03 Z koukirocks Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 384 ms 56912 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
 
using namespace std;
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=5e5+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
 
int n;
pii res[MAX]; // power,pos
 
int main() {
	speed;
	cin>>n;
	for (int i=0;i<n;i++) {
		cin>>res[i].second>>res[i].first;
	}
	sort(res,res+n);
	set<pii> rh,lh;
	rh.insert({res[n-1].second,res[n-1].first});
	lh.insert({res[n-1].second,res[n-1].first});
	int ans=1;
	for (int i=n-2;i>=0;i--) {
//		cout<<"dsgdgfsgfg\n"<<flush;
		auto it=rh.lower_bound(make_pair(res[i].second,0));
		if (it!=rh.end()) {
			auto [pos,pwr]=*it;
			if (pos-res[i].second<=pwr-res[i].first) continue;
		}
		it=lh.upper_bound(make_pair(res[i].second,0));
		if (it!=lh.begin()) {
			auto [pos,pwr]=*prev(it);
			if (res[i].second-pos<=pwr-res[i].first) continue;
		}
//		cout<<"dsgdgfsgfg\n"<<flush;
		ans++;
		it=rh.insert({res[i].second,res[i].first}).first;
		while (it!=rh.begin()) {
			it--;
			auto [pos,pwr]=*it;
			if (res[i].second-pos<=res[i].first-pwr) {
				it=rh.erase(it);
			} else break;
		}
		it=lh.insert({res[i].second,res[i].first}).first;
		it++;
//		cout<<"dsgdgfsgfg\n"<<flush;
		while (it!=lh.end()) {
			auto [pos,pwr]=*it;
//			cout<<pos<<" "<<pwr<<"\n"<<flush;
			if (pos-res[i].second<=res[i].first-pwr) {
				it=lh.erase(it);
				it--;
			} else break;
		}
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 79 ms 13636 KB Output is correct
3 Correct 82 ms 13292 KB Output is correct
4 Correct 113 ms 13284 KB Output is correct
5 Correct 52 ms 9296 KB Output is correct
6 Correct 384 ms 56356 KB Output is correct
7 Correct 255 ms 34360 KB Output is correct
8 Correct 123 ms 14440 KB Output is correct
9 Correct 89 ms 14064 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 79 ms 13636 KB Output is correct
3 Correct 82 ms 13292 KB Output is correct
4 Correct 113 ms 13284 KB Output is correct
5 Correct 52 ms 9296 KB Output is correct
6 Correct 384 ms 56356 KB Output is correct
7 Correct 255 ms 34360 KB Output is correct
8 Correct 123 ms 14440 KB Output is correct
9 Correct 89 ms 14064 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 92 ms 9300 KB Output is correct
37 Correct 146 ms 11900 KB Output is correct
38 Correct 140 ms 13908 KB Output is correct
39 Correct 129 ms 10964 KB Output is correct
40 Correct 154 ms 13908 KB Output is correct
41 Correct 138 ms 13908 KB Output is correct
42 Correct 122 ms 13904 KB Output is correct
43 Correct 234 ms 24844 KB Output is correct
44 Correct 124 ms 14056 KB Output is correct
45 Correct 350 ms 56912 KB Output is correct