Submission #706778

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
706778	2023-03-07T17:12:56 Z	epicci23	Exhibition (JOI19_ho_t2)	C++17	100 / 100	66 ms	5588 KB

joi2019_ho_t2

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/
 
 
 
inline int in()
{
  int x;cin >> x;
  return x;
}
 
inline string in2()
{
  string x;cin >> x;
  return x;
}
 

 
 
void solve()
{
  int n=in(),m=in();
  vector<array<int,2>> v(n);
  for(int i=0;i<n;i++) v[i][1]=in(),v[i][0]=in();

  vector<int> q(m);
  for(int i=0;i<m;i++) q[i]=in();
  sort(all(q));
  sort(all(v));
  int l=0,r=min(n,m);

  while(l<r)
  {
    int mi=(l+r+1)/2;
    bool ok=1;
    int p=0;

    for(int i=m-mi;i<m;i++)
    {
      if(p==n) ok=0;
      while(p<n && v[p][1] > q[i]) p++;
      if(p==n) ok=0;
      p++;
    }
    if(ok) l=mi;
    else r=mi-1;
  }
  cout << l << endl;
}
 
int32_t main(){
   
 
     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

joi2019_ho_t2.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	316 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	320 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	0 ms	328 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	316 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	320 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	0 ms	328 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	368 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	332 KB	Output is correct
26	Correct	2 ms	340 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	380 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	212 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	364 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	0 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	316 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	320 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	0 ms	328 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	368 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	332 KB	Output is correct
26	Correct	2 ms	340 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	380 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	212 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	364 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	46 ms	5448 KB	Output is correct
39	Correct	44 ms	5460 KB	Output is correct
40	Correct	42 ms	5464 KB	Output is correct
41	Correct	66 ms	5452 KB	Output is correct
42	Correct	51 ms	5460 KB	Output is correct
43	Correct	46 ms	5464 KB	Output is correct
44	Correct	45 ms	5568 KB	Output is correct
45	Correct	47 ms	5536 KB	Output is correct
46	Correct	49 ms	5588 KB	Output is correct
47	Correct	45 ms	4940 KB	Output is correct
48	Correct	45 ms	4936 KB	Output is correct
49	Correct	43 ms	4480 KB	Output is correct
50	Correct	46 ms	4476 KB	Output is correct
51	Correct	45 ms	5464 KB	Output is correct
52	Correct	44 ms	5452 KB	Output is correct
53	Correct	44 ms	5460 KB	Output is correct
54	Correct	41 ms	5464 KB	Output is correct
55	Correct	53 ms	5576 KB	Output is correct
56	Correct	29 ms	3804 KB	Output is correct
57	Correct	17 ms	2004 KB	Output is correct
58	Correct	29 ms	3796 KB	Output is correct
59	Correct	31 ms	3784 KB	Output is correct
60	Correct	17 ms	2004 KB	Output is correct
61	Correct	29 ms	3160 KB	Output is correct
62	Correct	51 ms	5464 KB	Output is correct
63	Correct	55 ms	5572 KB	Output is correct
64	Correct	52 ms	5468 KB	Output is correct
65	Correct	51 ms	5456 KB	Output is correct
66	Correct	53 ms	5588 KB	Output is correct
67	Correct	50 ms	5448 KB	Output is correct
68	Correct	55 ms	5560 KB	Output is correct
69	Correct	56 ms	5564 KB	Output is correct
70	Correct	48 ms	5568 KB	Output is correct
71	Correct	50 ms	5452 KB	Output is correct
72	Correct	52 ms	5568 KB	Output is correct
73	Correct	50 ms	5456 KB	Output is correct

Submission #706778

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