oj.uz

답안 #563128

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
563128 2022-05-16T10:41:10 Z armashka Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define nano chrono::steady_clock::now().time_since_epoch().count()
#define uid uniform_int_distribution<int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 2e5 + 10;
const int M = 2e3 + 5;
const ll inf = 1e15;
const ll mod = 1e9 + 7;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll random(ll l, ll r) { mt19937 rnd(nano); uid dist(l, r); return dist(rnd); }
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

ll n, m, b[N], dp[N], t[N * 4];
pll a[N];

ll get(ll l, ll r, ll v = 1, ll tl = 1, ll tr = n) {
    if (r < tl || tr < l) return 0;
    if (l <= tl && tr <= r) return t[v];
    ll tm = (tl + tr) / 2;
    return max(get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm + 1, tr));
}

void upd(ll pos, ll val, ll v = 1, ll tl = 1, ll tr = n) {
    if (tl == tr) {
        t[v] = max(t[v], val);
        return;
    }
    ll tm = (tl + tr) / 2;
    if (pos <= tm) upd(pos, val, v + v, tl, tm);
    else upd(pos, val, v + v + 1, tm + 1, tr);
    t[v] = max(t[v + v], t[v + v + 1]);
}

bool check(ll k) {
    for (int i = 1; i <= n; ++ i) dp[i] = 0;
    for (int i = 1; i <= n * 4; ++ i) t[i] = 0;
    for (int i = 1; i <= n; ++ i) {
        ll res = get(1, a[i].sd);
        if (m - k + res + 1 <= m && b[m - k + res + 1] >= a[i].ft) {
            dp[i] = res + 1;
            upd(a[i].sd, dp[i]); 
        }
    }    
    ll ans = 0;
    for (int i = 1; i <= n; ++ i) ans = max(ans, dp[i]);
    return (ans == k);
}

const void solve(/*Armashka*/) {
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i) cin >> a[i].ft >> a[i].sd;
    for (int i = 1; i <= m; ++ i) cin >> b[i];

    vector <ll> v;
    for (int i = 1; i <= n; ++ i) v.pb(a[i].sd);
    sort(all(v));
    v.erase(unique(all(v)), v.end());
    for (int i = 1; i <= n; ++ i) {
        a[i].sd = lower_bound(all(v), a[i].sd) - v.begin() + 1;
    }
    
    sort(a + 1, a + n + 1);
    sort(b + 1, b + m + 1);
    
    ll l = 1, r = m, ans = 0;
    while (l <= r) {
        ll mid = (l + r) / 2;
        if (check(mid)) l = mid + 1, ans = mid;
        else r = mid - 1;
    }
    cout << ans;
}

signed main() {
    srand(time(NULL));
    fast;
    // file("");
    int tt = 1;

    // cin >> tt;
    for (int i = 1; i <= tt; ++ i) {
        solve();
    }        
}
// Andetemin sen uwin de, men uwin de, yerten bolsyn dep
// Qara kunder artta, wekara joq alda

Compilation message

joi2019_ho_t2.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -