oj.uz

Submission #364740

# Submission time Handle Problem Language Result Execution time Memory
364740 2021-02-09T20:58:47 Z farhan132 Exhibition (JOI19_ho_t2) C++17
100 / 100
 878 ms 9452 KB 
/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vi;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

ll n , m;
ii p[maxn];
ll c[maxn];

bool check(ll x){
    ll cur = 1;
    set < pair < ll , pair < ll , ll > > > s;
    ll last = 0;
    for(ll i = m-x+1; i <= m; i++){
        while(cur <= n && p[cur].ff <= c[i]) s.in({ p[cur].ss , { cur , p[cur].ff } }), cur++;
        while(s.size() && (*s.begin()).ff < last) s.erase(*s.begin());
        if(!s.size()) return 0;
        auto [val , P] = *s.begin();
        s.erase(*s.begin());
        last = val;
    }
    return 1;
}

void solve(){
    
    cin >> n >> m;

    for(ll i = 1; i <= n; i++) cin >> p[i].ff >> p[i].ss;
    sort(p+1, p+n+1);
    for(ll i = 1; i <= m; i++) cin >> c[i];
    sort(c+1, c+m+1);
    ll lo = 0, hg = m , ans = 0;
    while(lo <= hg){
        ll mid = (lo + hg )/2;
        if(check(mid)) lo = mid + 1 , ans = mid;
        else hg = mid-1;
    }
    cout << ans;

    return;
    
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
     //   freopen("cbarn2.in", "r", stdin);
     //   freopen("cbarn2.out", "w", stdout);
     ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //cout << fixed << setprecision(10);
   // work(maxn);
    //  mem(b,0);
    ll T;
    T=1;
    //cin >> T; 
    //scanf("%lld",&T);
   // ll CT = 0;
    //work();
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        //printf("Case %lld: ",++CT);
        solve();
    }
 
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 508 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 364 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 508 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 364 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 2 ms 492 KB Output is correct
21 Correct 4 ms 492 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 4 ms 492 KB Output is correct
25 Correct 3 ms 492 KB Output is correct
26 Correct 3 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 2 ms 492 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 3 ms 492 KB Output is correct
37 Correct 3 ms 492 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 508 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 364 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 2 ms 492 KB Output is correct
21 Correct 4 ms 492 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 4 ms 492 KB Output is correct
25 Correct 3 ms 492 KB Output is correct
26 Correct 3 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 2 ms 492 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 3 ms 492 KB Output is correct
37 Correct 3 ms 492 KB Output is correct
38 Correct 318 ms 6252 KB Output is correct
39 Correct 315 ms 6380 KB Output is correct
40 Correct 429 ms 7020 KB Output is correct
41 Correct 321 ms 6388 KB Output is correct
42 Correct 53 ms 3128 KB Output is correct
43 Correct 51 ms 3052 KB Output is correct
44 Correct 367 ms 6252 KB Output is correct
45 Correct 878 ms 8500 KB Output is correct
46 Correct 703 ms 8556 KB Output is correct
47 Correct 764 ms 7624 KB Output is correct
48 Correct 636 ms 7696 KB Output is correct
49 Correct 515 ms 6396 KB Output is correct
50 Correct 483 ms 6380 KB Output is correct
51 Correct 54 ms 3052 KB Output is correct
52 Correct 51 ms 3052 KB Output is correct
53 Correct 51 ms 3052 KB Output is correct
54 Correct 559 ms 9452 KB Output is correct
55 Correct 309 ms 6380 KB Output is correct
56 Correct 48 ms 5484 KB Output is correct
57 Correct 20 ms 1516 KB Output is correct
58 Correct 152 ms 8556 KB Output is correct
59 Correct 596 ms 8684 KB Output is correct
60 Correct 21 ms 1516 KB Output is correct
61 Correct 211 ms 3820 KB Output is correct
62 Correct 550 ms 6252 KB Output is correct
63 Correct 548 ms 6380 KB Output is correct
64 Correct 586 ms 6252 KB Output is correct
65 Correct 556 ms 6380 KB Output is correct
66 Correct 570 ms 6380 KB Output is correct
67 Correct 593 ms 6336 KB Output is correct
68 Correct 579 ms 6276 KB Output is correct
69 Correct 574 ms 6344 KB Output is correct
70 Correct 551 ms 6396 KB Output is correct
71 Correct 556 ms 6380 KB Output is correct
72 Correct 531 ms 6252 KB Output is correct
73 Correct 485 ms 6508 KB Output is correct