답안 #705746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705746 2023-03-05T05:37:45 Z myrcella Exhibition (JOI19_ho_t2) C++17
100 / 100
63 ms 4484 KB
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 1e5+10;

int n,m;
pii pict[maxn];
int frame[maxn];

bool check(int cnt) {
	int cur = m-cnt;
	int p=0;
	while (cur<m) {
		while (p<n and pict[p].se>frame[cur]) p++;
		if (p==n) return false;
		cur++;
		p++;
	}
	return true;
}

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	rep(i,0,n) cin>>pict[i].se>>pict[i].fi;
	sort(pict,pict+n);
	rep(i,0,m) cin>>frame[i];
	sort(frame,frame+m);
	int l = 0,r = min(n,m);
	while (l<r) {
		int mid=l+r+1>>1;
		if (check(mid)) l = mid;
		else r = mid-1;
	}
	cout<<l;
	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:52:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |   int mid=l+r+1>>1;
      |           ~~~^~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 372 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 368 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 372 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 368 KB Output is correct
38 Correct 45 ms 4336 KB Output is correct
39 Correct 44 ms 4280 KB Output is correct
40 Correct 40 ms 4376 KB Output is correct
41 Correct 46 ms 4360 KB Output is correct
42 Correct 43 ms 4372 KB Output is correct
43 Correct 44 ms 4368 KB Output is correct
44 Correct 45 ms 4400 KB Output is correct
45 Correct 44 ms 4244 KB Output is correct
46 Correct 42 ms 4348 KB Output is correct
47 Correct 43 ms 3848 KB Output is correct
48 Correct 42 ms 3896 KB Output is correct
49 Correct 38 ms 3596 KB Output is correct
50 Correct 40 ms 3584 KB Output is correct
51 Correct 43 ms 4356 KB Output is correct
52 Correct 43 ms 4388 KB Output is correct
53 Correct 44 ms 4328 KB Output is correct
54 Correct 44 ms 4352 KB Output is correct
55 Correct 44 ms 4268 KB Output is correct
56 Correct 27 ms 2892 KB Output is correct
57 Correct 20 ms 1672 KB Output is correct
58 Correct 26 ms 2892 KB Output is correct
59 Correct 29 ms 3004 KB Output is correct
60 Correct 20 ms 1620 KB Output is correct
61 Correct 35 ms 2508 KB Output is correct
62 Correct 53 ms 4272 KB Output is correct
63 Correct 48 ms 4300 KB Output is correct
64 Correct 50 ms 4260 KB Output is correct
65 Correct 49 ms 4332 KB Output is correct
66 Correct 49 ms 4284 KB Output is correct
67 Correct 48 ms 4264 KB Output is correct
68 Correct 54 ms 4484 KB Output is correct
69 Correct 55 ms 4368 KB Output is correct
70 Correct 63 ms 4360 KB Output is correct
71 Correct 49 ms 4460 KB Output is correct
72 Correct 48 ms 4348 KB Output is correct
73 Correct 47 ms 4296 KB Output is correct