oj.uz

Submission #100839

# Submission time Handle Problem Language Result Execution time Memory
100839 2019-03-14T20:15:17 Z ikura355 Exhibition (JOI19_ho_t2) C++14
100 / 100
 91 ms 4572 KB 
#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 1e5 + 5;
const int inf = 2e9;

int n,m;
pii a[maxn];
int b[maxn];

bool solve(int x) {
	//printf("solve %d\n",x);
	int pos = m - x + 1;
	for(int i=1;i<=n;i++) {
		if(a[i].X<=b[pos]) pos++;
		//printf("\t%d %d pos = %d\n",a[i].X,a[i].Y,pos);
		if(pos == m+1) return 1;
	}
	return 0;
}

int main() {
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d%d",&a[i].X,&a[i].Y);
	for(int i=1;i<=m;i++) scanf("%d",&b[i]);
	sort(&a[1],&a[n+1],[&](pii x, pii y){return x.Y!=y.Y ? x.Y<y.Y : x.X<y.X;});
	sort(&b[1],&b[m+1]);
	int l = 1, r = m, mid, ans = 0;
	while(l<=r) {
		mid = (l+r)/2;
		if(solve(mid)) {
			ans = mid;
			l = mid+1;
		}
		else r = mid-1;
	}
	printf("%d",ans);
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t2.cpp:29:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%d%d",&a[i].X,&a[i].Y);
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:30:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=m;i++) scanf("%d",&b[i]);
                        ~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 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 3 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 256 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 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 3 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 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 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 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 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 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 3 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 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 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 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 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 65 ms 4340 KB Output is correct
39 Correct 83 ms 4472 KB Output is correct
40 Correct 65 ms 4400 KB Output is correct
41 Correct 65 ms 4472 KB Output is correct
42 Correct 65 ms 4444 KB Output is correct
43 Correct 63 ms 4344 KB Output is correct
44 Correct 64 ms 4344 KB Output is correct
45 Correct 66 ms 4344 KB Output is correct
46 Correct 62 ms 4344 KB Output is correct
47 Correct 61 ms 3960 KB Output is correct
48 Correct 60 ms 3960 KB Output is correct
49 Correct 58 ms 3692 KB Output is correct
50 Correct 52 ms 3676 KB Output is correct
51 Correct 66 ms 4368 KB Output is correct
52 Correct 64 ms 4344 KB Output is correct
53 Correct 66 ms 4344 KB Output is correct
54 Correct 50 ms 4344 KB Output is correct
55 Correct 60 ms 4472 KB Output is correct
56 Correct 43 ms 3064 KB Output is correct
57 Correct 34 ms 1656 KB Output is correct
58 Correct 42 ms 3064 KB Output is correct
59 Correct 42 ms 3192 KB Output is correct
60 Correct 29 ms 1664 KB Output is correct
61 Correct 42 ms 2680 KB Output is correct
62 Correct 91 ms 4344 KB Output is correct
63 Correct 76 ms 4444 KB Output is correct
64 Correct 76 ms 4472 KB Output is correct
65 Correct 89 ms 4444 KB Output is correct
66 Correct 69 ms 4456 KB Output is correct
67 Correct 68 ms 4472 KB Output is correct
68 Correct 70 ms 4344 KB Output is correct
69 Correct 68 ms 4352 KB Output is correct
70 Correct 69 ms 4572 KB Output is correct
71 Correct 68 ms 4344 KB Output is correct
72 Correct 81 ms 4472 KB Output is correct
73 Correct 73 ms 4344 KB Output is correct