제출 #789126

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
789126		ono_de206	Advertisement 2 (JOI23_ho_t2)	C++14	100 / 100	1106 ms	56944 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 5e5 + 10, inf = 2e9 + 10;
int x[mxn], e[mxn];

struct segTree {
	int d[mxn * 4], n;
	segTree(int _n) {
		n = _n;
	}

	void init(int l, int r, int i) {
		d[i] = inf;
		if(l == r) return;
		int m = (l + r) / 2;
		init(l, m, i * 2);
		init(m + 1, r, i * 2 + 1);
	}

	void init() {
		init(1, n, 1);
	}

	int get(int l, int r, int i, int x, int y) {
		if(l >= x && r <= y) return d[i];
		int m = (l + r) / 2;
		if(y <= m) return get(l, m, i * 2, x, y);
		if(x > m) return get(m + 1, r, i * 2 + 1, x, y);
		return min(get(l, m, i * 2, x, y), get(m + 1, r, i * 2 + 1, x, y));
	}

	int get(int l, int r) {
		return get(1, n, 1, l, r);
	}

	void update(int l, int r, int i, int x, int val) {
		if(l == r) {
			mnn(d[i], val);
			return;
		}
		int m = (l + r) / 2;
		if(x <= m) update(l, m, i * 2, x, val);
		else update(m + 1, r, i * 2 + 1, x, val);
		d[i] = min(d[i * 2], d[i * 2 + 1]);
	}

	void update(int x, int val) {
		update(1, n, 1, x, val);
	}
};

void go() {
	int n;
	cin >> n;
	vector<pair<int, int>> v;
	for(int i = 1; i <= n; i++) {
		int x, e;
		cin >> x >> e;
		v.eb(x, e);
	}
	sort(all(v), [&](pair<int, int> a, pair<int, int> b) {
		if(a.ss == b.ss) return a.ff < b.ff;
		return a.ss > b.ss;
	});
	v.erase(unique(all(v)), v.end());
	n = v.size();
	map<int, int> mp;
	for(int i = 1; i <= n; i++) {
		x[i] = v[i - 1].ff;
		e[i] = v[i - 1].ss;
		mp[x[i]];
	}
	int t = 0, ans = 0;
	for(auto &it : mp) {
		it.ss = ++t;
	}

	segTree st1(t), st2(t);
	st1.init();
	st2.init();

	for(int i = 1; i <= n; i++) {
		ans++;
		int id = mp[x[i]];
		if(st1.get(1, id) <= -x[i] - e[i] || st2.get(id, t) <= x[i] - e[i]) ans--;
		st1.update(id, -x[i] - e[i]);
		st2.update(id, x[i] - e[i]);
	}
	cout << ans << '\n';
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23
• Subtask 3: 36 / 36
• Subtask 4: 31 / 31