oj.uz

Submission #367981

# Submission time Handle Problem Language Result Execution time Memory
367981 2021-02-19T06:32:32 Z Return_0 Exhibition (JOI19_ho_t2) C++17
100 / 100
 187 ms 14728 KB 
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e5 + 7;

ll fsz [N], id [N], n, m, ans;
vector <ll> vec;
pll pic [N];

struct seg {
	ll l, r;
	pll mx;
	seg *lt, *rt;
	inline seg (cl &L = 1, cl &R = N - 2) : l(L), r(R) {}

	void build () {
		if (l == r) {
			mx = {pic[l].sc, l};
			return;
		}
		lt = new seg (l, mid);
		rt = new seg (mid + 1, r);
		lt->build();
		rt->build();
		mx = max(lt->mx, rt->mx);
	}

	void upd (cl &pos) {
		if (l == r) {
			mx.fr = -inf;
			return;
		}
		if (pos <= mid) lt->upd(pos);
		else rt->upd(pos);
		mx = max(lt->mx, rt->mx);
	}

	pll ask (cl &ql, cl &qr) {
		if (r < ql || qr < l)   return pll(-inf, -inf);
		if (ql <= l && r <= qr) return mx;
		return max(lt->ask(ql, qr), rt->ask(ql, qr));
	}
} mytree;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	iota(id, id + N, 0);
	cin>> n >> m;
	for (ll i = 1; i <= n; i++)	cin>> pic[i].fr >> pic[i].sc, vec.push_back(pic[i].fr);
	for (ll i = 1; i <= m; i++)	cin>> fsz[i];

	sort(All(vec));
	sort(fsz + 1, fsz + m + 1, greater<ll>());
	sort(pic + 1, pic + n + 1);
	mytree.r = n; mytree.build();
	sort(id + 1, id + n + 1, [&](ll x, ll y) { return pic[x].sc > pic[y].sc; });

	for (ll i = 1, R = 1; i <= m; i++) {
		auto x = mytree.ask(1, upper_bound(All(vec), fsz[i]) - vec.begin());
		// dbg(x);
		if (x.fr == -inf)	continue;
		ans++;
		mytree.upd(x.sc);
		while (R <= n && pic[id[R]].sc > x.fr)	mytree.upd(id[R++]);
	}

	kill(ans);

	return 0;
}
/*
3 4
10 20
5 1
3 5
4
6
10
4

3 2
1 2
1 2
1 2
1
1

4 2
28 1
8 8
6 10
16 9
4
3

8 8
508917604 35617051
501958939 840246141
485338402 32896484
957730250 357542366
904165504 137209882
684085683 775621730
552953629 20004459
125090903 607302990
433255278
979756183
28423637
856448848
276518245
314201319
666094038
149542543

*/

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 748 KB Output is correct
13 Correct 1 ms 748 KB Output is correct
14 Correct 1 ms 748 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 748 KB Output is correct
17 Correct 1 ms 748 KB Output is correct
18 Correct 1 ms 748 KB Output is correct
19 Correct 1 ms 748 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 896 KB Output is correct
23 Correct 1 ms 876 KB Output is correct
24 Correct 2 ms 876 KB Output is correct
25 Correct 2 ms 876 KB Output is correct
26 Correct 2 ms 1004 KB Output is correct
27 Correct 2 ms 876 KB Output is correct
28 Correct 2 ms 876 KB Output is correct
29 Correct 2 ms 876 KB Output is correct
30 Correct 2 ms 876 KB Output is correct
31 Correct 3 ms 876 KB Output is correct
32 Correct 1 ms 876 KB Output is correct
33 Correct 1 ms 768 KB Output is correct
34 Correct 2 ms 876 KB Output is correct
35 Correct 1 ms 748 KB Output is correct
36 Correct 2 ms 876 KB Output is correct
37 Correct 2 ms 876 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 748 KB Output is correct
13 Correct 1 ms 748 KB Output is correct
14 Correct 1 ms 748 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 748 KB Output is correct
17 Correct 1 ms 748 KB Output is correct
18 Correct 1 ms 748 KB Output is correct
19 Correct 1 ms 748 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 896 KB Output is correct
23 Correct 1 ms 876 KB Output is correct
24 Correct 2 ms 876 KB Output is correct
25 Correct 2 ms 876 KB Output is correct
26 Correct 2 ms 1004 KB Output is correct
27 Correct 2 ms 876 KB Output is correct
28 Correct 2 ms 876 KB Output is correct
29 Correct 2 ms 876 KB Output is correct
30 Correct 2 ms 876 KB Output is correct
31 Correct 3 ms 876 KB Output is correct
32 Correct 1 ms 876 KB Output is correct
33 Correct 1 ms 768 KB Output is correct
34 Correct 2 ms 876 KB Output is correct
35 Correct 1 ms 748 KB Output is correct
36 Correct 2 ms 876 KB Output is correct
37 Correct 2 ms 876 KB Output is correct
38 Correct 119 ms 14572 KB Output is correct
39 Correct 109 ms 14572 KB Output is correct
40 Correct 102 ms 14544 KB Output is correct
41 Correct 122 ms 14572 KB Output is correct
42 Correct 74 ms 14572 KB Output is correct
43 Correct 75 ms 14700 KB Output is correct
44 Correct 108 ms 14700 KB Output is correct
45 Correct 185 ms 14700 KB Output is correct
46 Correct 158 ms 14572 KB Output is correct
47 Correct 186 ms 14188 KB Output is correct
48 Correct 142 ms 14316 KB Output is correct
49 Correct 132 ms 10860 KB Output is correct
50 Correct 124 ms 10836 KB Output is correct
51 Correct 83 ms 14700 KB Output is correct
52 Correct 146 ms 14572 KB Output is correct
53 Correct 150 ms 14572 KB Output is correct
54 Correct 88 ms 14668 KB Output is correct
55 Correct 119 ms 14572 KB Output is correct
56 Correct 63 ms 13284 KB Output is correct
57 Correct 20 ms 2028 KB Output is correct
58 Correct 50 ms 13164 KB Output is correct
59 Correct 68 ms 13292 KB Output is correct
60 Correct 25 ms 2156 KB Output is correct
61 Correct 81 ms 6384 KB Output is correct
62 Correct 183 ms 14572 KB Output is correct
63 Correct 187 ms 14572 KB Output is correct
64 Correct 181 ms 14572 KB Output is correct
65 Correct 185 ms 14592 KB Output is correct
66 Correct 182 ms 14572 KB Output is correct
67 Correct 181 ms 14572 KB Output is correct
68 Correct 184 ms 14648 KB Output is correct
69 Correct 184 ms 14572 KB Output is correct
70 Correct 187 ms 14728 KB Output is correct
71 Correct 171 ms 14700 KB Output is correct
72 Correct 163 ms 14572 KB Output is correct
73 Correct 133 ms 14572 KB Output is correct