Submission #787130

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
787130	2023-07-18T20:57:22 Z	andecaandeci	Exhibition (JOI19_ho_t2)	C++17	100 / 100	58 ms	4428 KB

joi2019_ho_t2

/* Quick Note :
 * Jangan Mikir Lama - lama, sampahin dulu aja kalo OI
 * Always Try to reset
*/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ld PI = 4*atan((ld)1);
const ll mod = 1e9 + 7;
const ll inf = 922337203685477;
const ll nax = 1e5 + 5;

ll n, m;
pair<ll,ll> a[nax];
ll frame[nax];

bool cmp(pair<ll,ll> xx, pair<ll,ll> yy){
  if(xx.ss == yy.ss) return xx.ff < yy.ff;
  return xx.ss < yy.ss;
}

ll cek(ll val){
  ll idx = m - val + 1;
  for(ll i = 1; i <= n; i++){
    if(idx > m){
      break;
    }
    else{
      if(a[i].ff <= frame[idx]){
        idx++;
      }
    }
  }
  return idx > m;
}

int main(){ 
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    //freopen("test.in", "r", stdin);
    //freopen("test.out", "w", stdout);
    
    cin >> n >> m;
    for(ll i = 1; i <= n; i++){
    cin >> a[i].ff >> a[i].ss;
  }
  for(ll i = 1; i <= m; i++) cin >> frame[i];
  sort(frame + 1, frame + 1 + m);
  
  sort(a + 1, a + 1 + n, cmp);
  
  ll l = 0, r = m, ret = 0;
  while(l <= r){
    ll mid = (l + r) / 2;
    if(cek(mid)){
      ret = mid;
      l = mid + 1;
    }
    else r = mid - 1;
  }
  cout << ret << '\n';
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	260 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 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	0 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	332 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	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	260 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 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	0 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	332 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	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	332 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	340 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	2 ms	340 KB	Output is correct
28	Correct	1 ms	340 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	344 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	332 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	260 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 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	0 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	332 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	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	332 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	340 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	2 ms	340 KB	Output is correct
28	Correct	1 ms	340 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	344 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	332 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	41 ms	4312 KB	Output is correct
39	Correct	50 ms	4320 KB	Output is correct
40	Correct	36 ms	4280 KB	Output is correct
41	Correct	54 ms	4300 KB	Output is correct
42	Correct	51 ms	4428 KB	Output is correct
43	Correct	50 ms	4312 KB	Output is correct
44	Correct	47 ms	4320 KB	Output is correct
45	Correct	41 ms	4300 KB	Output is correct
46	Correct	40 ms	4264 KB	Output is correct
47	Correct	38 ms	4000 KB	Output is correct
48	Correct	35 ms	4092 KB	Output is correct
49	Correct	44 ms	3788 KB	Output is correct
50	Correct	35 ms	3808 KB	Output is correct
51	Correct	50 ms	4320 KB	Output is correct
52	Correct	52 ms	4284 KB	Output is correct
53	Correct	42 ms	4268 KB	Output is correct
54	Correct	37 ms	4196 KB	Output is correct
55	Correct	42 ms	4300 KB	Output is correct
56	Correct	25 ms	3536 KB	Output is correct
57	Correct	14 ms	2004 KB	Output is correct
58	Correct	24 ms	3484 KB	Output is correct
59	Correct	26 ms	3588 KB	Output is correct
60	Correct	14 ms	2004 KB	Output is correct
61	Correct	24 ms	3272 KB	Output is correct
62	Correct	58 ms	4300 KB	Output is correct
63	Correct	58 ms	4240 KB	Output is correct
64	Correct	47 ms	4208 KB	Output is correct
65	Correct	48 ms	4244 KB	Output is correct
66	Correct	46 ms	4316 KB	Output is correct
67	Correct	44 ms	4260 KB	Output is correct
68	Correct	57 ms	4224 KB	Output is correct
69	Correct	44 ms	4256 KB	Output is correct
70	Correct	57 ms	4280 KB	Output is correct
71	Correct	44 ms	4280 KB	Output is correct
72	Correct	41 ms	4312 KB	Output is correct
73	Correct	42 ms	4308 KB	Output is correct

Submission #787130

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