Submission #369289

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
369289	2021-02-21T06:59:02 Z	AriaH	Exhibition (JOI19_ho_t2)	C++11	100 / 100	80 ms	5740 KB

joi2019_ho_t2

/** Im the best because i work as hard as i possibly can **/
 
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
 
typedef long long                   ll;
typedef long double                 ld;
typedef pair<int,int>               pii;
typedef pair<ll,ll>                 pll;
#define all(x)                      (x).begin(),(x).end()
#define F                           first
#define S                           second
#define Mp                          make_pair
#define fast_io                     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io                     freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);
#define endl                        "\n"
 
const int N = 1e6 + 10;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ll inf = 8e18;
const int LOG = 22;
 
ll pw(ll a , ll b, ll M)  { return (!b ? 1 : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M : pw(a * a % M, b / 2, M))); }
 
ll n, m, tot, B[N];
 
pll A[N];
 
bool cmp(pll a, pll b)
{
	if(a.S == b.S) return a.F < b.F;
	return a.S < b.S;
}
 
int main()
{
	scanf("%lld%lld", &n, &m);
	for(int i = 1; i <= n; i ++)
	{
		scanf("%lld%lld", &A[i].F, &A[i].S);
	}
	for(int i = 1; i <= m; i ++) scanf("%lld", &B[i]);
	sort(A + 1, A + n + 1, cmp);
	sort(B + 1, B + m + 1);
	///for(int i = 1; i <= m; i ++) printf("%d ", B[i]);
	///printf("\n");
	int j = m;
	for(int i = n; i >= 1; i --)
	{
	    if(j > 0 && B[j] >= A[i].F) tot ++, j --;
	}
	printf("%lld\n", tot);
	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |  scanf("%lld%lld", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |   scanf("%lld%lld", &A[i].F, &A[i].S);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:44:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   44 |  for(int i = 1; i <= m; i ++) scanf("%lld", &B[i]);
      |                               ~~~~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	37 ms	376 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	67 ms	5612 KB	Output is correct
39	Correct	65 ms	5740 KB	Output is correct
40	Correct	56 ms	5612 KB	Output is correct
41	Correct	65 ms	5740 KB	Output is correct
42	Correct	69 ms	5612 KB	Output is correct
43	Correct	71 ms	5612 KB	Output is correct
44	Correct	64 ms	5740 KB	Output is correct
45	Correct	64 ms	5612 KB	Output is correct
46	Correct	72 ms	5612 KB	Output is correct
47	Correct	70 ms	5100 KB	Output is correct
48	Correct	56 ms	5100 KB	Output is correct
49	Correct	60 ms	4588 KB	Output is correct
50	Correct	51 ms	4588 KB	Output is correct
51	Correct	66 ms	5740 KB	Output is correct
52	Correct	80 ms	5612 KB	Output is correct
53	Correct	64 ms	5612 KB	Output is correct
54	Correct	61 ms	5740 KB	Output is correct
55	Correct	67 ms	5612 KB	Output is correct
56	Correct	45 ms	4096 KB	Output is correct
57	Correct	29 ms	2156 KB	Output is correct
58	Correct	39 ms	3840 KB	Output is correct
59	Correct	41 ms	3820 KB	Output is correct
60	Correct	24 ms	2176 KB	Output is correct
61	Correct	38 ms	3308 KB	Output is correct
62	Correct	74 ms	5612 KB	Output is correct
63	Correct	64 ms	5632 KB	Output is correct
64	Correct	65 ms	5612 KB	Output is correct
65	Correct	66 ms	5612 KB	Output is correct
66	Correct	64 ms	5612 KB	Output is correct
67	Correct	66 ms	5588 KB	Output is correct
68	Correct	64 ms	5612 KB	Output is correct
69	Correct	73 ms	5612 KB	Output is correct
70	Correct	66 ms	5612 KB	Output is correct
71	Correct	65 ms	5740 KB	Output is correct
72	Correct	65 ms	5612 KB	Output is correct
73	Correct	61 ms	5556 KB	Output is correct

Submission #369289

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