oj.uz

Submission #97442

# Submission time Handle Problem Language Result Execution time Memory
97442 2019-02-16T05:56:26 Z polyfish Exhibition (JOI19_ho_t2) C++14
100 / 100
 83 ms 1656 KB 
//Pantyhose(black) + glasses = infinity

#include <bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) {cerr << #A << " = "; for (int _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; for (int _=0; _<n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define FILE_NAME "data"

const int MAX_N = 100002;

struct picture {
	int sz, val;
};

int n, m, fr[MAX_N];
picture pic[MAX_N];

void readInput() {
	cin >> n >> m;

	for (int i=1; i<=n; ++i)
		cin >> pic[i].sz >> pic[i].val;

	for (int i=1; i<=m; ++i)
		cin >> fr[i];
}

bool check(int cnt) {
	int cur = m - cnt;

	for (int i=1; i<=n; ++i) {
		if (cur<m && pic[i].sz<=fr[cur+1])
			++cur;
	}

	return cur==m;
}

void solve() {
	sort(pic+1, pic+n+1, [](picture p1, picture p2) {
		if (p1.val!=p2.val)
			return p1.val < p2.val;
		return p1.sz < p2.sz;
	});
	// for (int i=1; i<=n; ++i)
	// 	cerr << pic[i].val << ' ';
	// cerr << '\n';

	sort(fr+1, fr+m+1);
	// PR(fr, m);

	int l = 0, r = m;

	for (int mid=(l+r)/2; mid!=l && r!=mid; mid=(l+r)/2) {
		if (check(mid))
			l = mid;
		else
			r = mid;
	}

	for (int i=r; i>=l; --i) {
		if (check(i)) {
			cout << i;
			return;
		}
	}
}

int main() {
	#ifdef GLASSES_GIRL
		freopen(FILE_NAME".in", "r", stdin);
		freopen(FILE_NAME".out", "w", stdout);
	#endif
	ios::sync_with_stdio(0); cin.tie(0);
	readInput();
	solve();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 3 ms 356 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 256 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 4 ms 384 KB Output is correct
38 Correct 69 ms 1528 KB Output is correct
39 Correct 72 ms 1656 KB Output is correct
40 Correct 66 ms 1528 KB Output is correct
41 Correct 70 ms 1628 KB Output is correct
42 Correct 72 ms 1528 KB Output is correct
43 Correct 69 ms 1528 KB Output is correct
44 Correct 75 ms 1528 KB Output is correct
45 Correct 63 ms 1528 KB Output is correct
46 Correct 56 ms 1528 KB Output is correct
47 Correct 75 ms 1444 KB Output is correct
48 Correct 58 ms 1400 KB Output is correct
49 Correct 55 ms 1280 KB Output is correct
50 Correct 53 ms 1272 KB Output is correct
51 Correct 75 ms 1656 KB Output is correct
52 Correct 67 ms 1580 KB Output is correct
53 Correct 75 ms 1528 KB Output is correct
54 Correct 62 ms 1528 KB Output is correct
55 Correct 83 ms 1480 KB Output is correct
56 Correct 53 ms 1272 KB Output is correct
57 Correct 24 ms 724 KB Output is correct
58 Correct 45 ms 1144 KB Output is correct
59 Correct 57 ms 1144 KB Output is correct
60 Correct 22 ms 768 KB Output is correct
61 Correct 36 ms 1016 KB Output is correct
62 Correct 58 ms 1528 KB Output is correct
63 Correct 70 ms 1656 KB Output is correct
64 Correct 59 ms 1528 KB Output is correct
65 Correct 69 ms 1476 KB Output is correct
66 Correct 61 ms 1528 KB Output is correct
67 Correct 65 ms 1528 KB Output is correct
68 Correct 57 ms 1528 KB Output is correct
69 Correct 79 ms 1484 KB Output is correct
70 Correct 61 ms 1528 KB Output is correct
71 Correct 62 ms 1528 KB Output is correct
72 Correct 62 ms 1528 KB Output is correct
73 Correct 58 ms 1528 KB Output is correct