oj.uz

Submission #789126

# Submission time Handle Problem Language Result Execution time Memory
789126 2023-07-21T05:37:44 Z ono_de206 Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 1106 ms 56944 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 91 ms 23372 KB Output is correct
3 Correct 90 ms 25056 KB Output is correct
4 Correct 111 ms 23316 KB Output is correct
5 Correct 75 ms 22772 KB Output is correct
6 Correct 368 ms 47840 KB Output is correct
7 Correct 247 ms 34552 KB Output is correct
8 Correct 123 ms 23044 KB Output is correct
9 Correct 106 ms 22684 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15940 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 6 ms 15944 KB Output is correct
4 Correct 6 ms 15956 KB Output is correct
5 Correct 6 ms 15980 KB Output is correct
6 Correct 6 ms 15984 KB Output is correct
7 Correct 6 ms 15956 KB Output is correct
8 Correct 6 ms 15956 KB Output is correct
9 Correct 6 ms 15984 KB Output is correct
10 Correct 6 ms 15984 KB Output is correct
11 Correct 6 ms 15892 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15932 KB Output is correct
14 Correct 6 ms 15984 KB Output is correct
15 Correct 6 ms 15956 KB Output is correct
16 Correct 5 ms 15956 KB Output is correct
17 Correct 6 ms 15896 KB Output is correct
18 Correct 6 ms 15988 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15940 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 6 ms 15944 KB Output is correct
4 Correct 6 ms 15956 KB Output is correct
5 Correct 6 ms 15980 KB Output is correct
6 Correct 6 ms 15984 KB Output is correct
7 Correct 6 ms 15956 KB Output is correct
8 Correct 6 ms 15956 KB Output is correct
9 Correct 6 ms 15984 KB Output is correct
10 Correct 6 ms 15984 KB Output is correct
11 Correct 6 ms 15892 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15932 KB Output is correct
14 Correct 6 ms 15984 KB Output is correct
15 Correct 6 ms 15956 KB Output is correct
16 Correct 5 ms 15956 KB Output is correct
17 Correct 6 ms 15896 KB Output is correct
18 Correct 6 ms 15988 KB Output is correct
19 Correct 7 ms 15956 KB Output is correct
20 Correct 7 ms 15956 KB Output is correct
21 Correct 7 ms 15992 KB Output is correct
22 Correct 8 ms 15956 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 16000 KB Output is correct
25 Correct 7 ms 15992 KB Output is correct
26 Correct 7 ms 15956 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 91 ms 23372 KB Output is correct
3 Correct 90 ms 25056 KB Output is correct
4 Correct 111 ms 23316 KB Output is correct
5 Correct 75 ms 22772 KB Output is correct
6 Correct 368 ms 47840 KB Output is correct
7 Correct 247 ms 34552 KB Output is correct
8 Correct 123 ms 23044 KB Output is correct
9 Correct 106 ms 22684 KB Output is correct
10 Correct 7 ms 15940 KB Output is correct
11 Correct 7 ms 15956 KB Output is correct
12 Correct 6 ms 15944 KB Output is correct
13 Correct 6 ms 15956 KB Output is correct
14 Correct 6 ms 15980 KB Output is correct
15 Correct 6 ms 15984 KB Output is correct
16 Correct 6 ms 15956 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 6 ms 15984 KB Output is correct
19 Correct 6 ms 15984 KB Output is correct
20 Correct 6 ms 15892 KB Output is correct
21 Correct 6 ms 15956 KB Output is correct
22 Correct 6 ms 15932 KB Output is correct
23 Correct 6 ms 15984 KB Output is correct
24 Correct 6 ms 15956 KB Output is correct
25 Correct 5 ms 15956 KB Output is correct
26 Correct 6 ms 15896 KB Output is correct
27 Correct 6 ms 15988 KB Output is correct
28 Correct 7 ms 15956 KB Output is correct
29 Correct 7 ms 15956 KB Output is correct
30 Correct 7 ms 15992 KB Output is correct
31 Correct 8 ms 15956 KB Output is correct
32 Correct 7 ms 15956 KB Output is correct
33 Correct 7 ms 16000 KB Output is correct
34 Correct 7 ms 15992 KB Output is correct
35 Correct 7 ms 15956 KB Output is correct
36 Correct 584 ms 43068 KB Output is correct
37 Correct 776 ms 50616 KB Output is correct
38 Correct 1106 ms 56832 KB Output is correct
39 Correct 704 ms 45236 KB Output is correct
40 Correct 999 ms 56160 KB Output is correct
41 Correct 744 ms 50932 KB Output is correct
42 Correct 467 ms 51088 KB Output is correct
43 Correct 381 ms 55868 KB Output is correct
44 Correct 372 ms 56944 KB Output is correct
45 Correct 374 ms 52968 KB Output is correct