Submission #234295

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
234295	2020-05-23T20:43:46 Z	eggag32	Exhibition (JOI19_ho_t2)	C++17	100 / 100	71 ms	4600 KB

joi2019_ho_t2

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

bool cmp(pi a, pi b){
	if(a.se != b.se) return a.se > b.se;
	return a.fi > b.fi;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	vector<pi> p(n);
	rep(i, n) cin >> p[i].fi >> p[i].se;
	vi c(m);
	rep(i, m) cin >> c[i];
	sort(all(c));
	reverse(all(c));
	sort(all(p), cmp);
	int cur = 0;
	rep(i, m){
		while(p[cur].fi > c[i] && cur < n) cur++;
		if(cur == n || cur < n && p[cur].fi > c[i]){
			cout << i << endl;
			return 0;
		}
		cur++;
	}
	cout << m << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:46:26: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   if(cur == n || cur < n && p[cur].fi > c[i]){

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	256 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	4 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	5 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	5 ms	384 KB	Output is correct
36	Correct	5 ms	384 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Correct	68 ms	4600 KB	Output is correct
39	Correct	62 ms	4448 KB	Output is correct
40	Correct	58 ms	4472 KB	Output is correct
41	Correct	71 ms	4472 KB	Output is correct
42	Correct	68 ms	4472 KB	Output is correct
43	Correct	67 ms	4472 KB	Output is correct
44	Correct	70 ms	4600 KB	Output is correct
45	Correct	68 ms	4344 KB	Output is correct
46	Correct	67 ms	4344 KB	Output is correct
47	Correct	59 ms	3960 KB	Output is correct
48	Correct	58 ms	3964 KB	Output is correct
49	Correct	55 ms	3576 KB	Output is correct
50	Correct	52 ms	3576 KB	Output is correct
51	Correct	69 ms	4476 KB	Output is correct
52	Correct	65 ms	4472 KB	Output is correct
53	Correct	67 ms	4344 KB	Output is correct
54	Correct	62 ms	4472 KB	Output is correct
55	Correct	65 ms	4472 KB	Output is correct
56	Correct	45 ms	3072 KB	Output is correct
57	Correct	27 ms	1664 KB	Output is correct
58	Correct	43 ms	3072 KB	Output is correct
59	Correct	45 ms	3072 KB	Output is correct
60	Correct	28 ms	1664 KB	Output is correct
61	Correct	43 ms	2688 KB	Output is correct
62	Correct	66 ms	4472 KB	Output is correct
63	Correct	67 ms	4472 KB	Output is correct
64	Correct	66 ms	4344 KB	Output is correct
65	Correct	67 ms	4472 KB	Output is correct
66	Correct	65 ms	4472 KB	Output is correct
67	Correct	69 ms	4472 KB	Output is correct
68	Correct	67 ms	4472 KB	Output is correct
69	Correct	68 ms	4472 KB	Output is correct
70	Correct	67 ms	4472 KB	Output is correct
71	Correct	66 ms	4352 KB	Output is correct
72	Correct	66 ms	4600 KB	Output is correct
73	Correct	63 ms	4472 KB	Output is correct

Submission #234295

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
50.0 / 50.0