Submission #927689

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
927689	2024-02-15T08:45:32 Z	koukirocks	Advertisement 2 (JOI23_ho_t2)	C++17	59 / 100	2000 ms	6748 KB

Main

#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--) {
		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;
		}
		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);
			}
		}
		it=lh.insert({res[i].second,res[i].first}).first;
		while (it!=prev(lh.end())) {
			it++;
			auto [pos,pwr]=*it;
			if (pos-res[i].second<=res[i].first-pwr) {
				it=lh.erase(it);
			}
		}
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	2064 ms	6748 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

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	468 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	0 ms	468 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	544 KB	Output is correct
9	Correct	1 ms	348 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	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	468 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	0 ms	468 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	544 KB	Output is correct
9	Correct	1 ms	348 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	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	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 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

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	2064 ms	6748 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-