oj.uz

답안 #1021873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021873 2024-07-13T06:41:04 Z PurpleCrayon Tower (JOI24_tower) C++17
25 / 100
 202 ms 27656 KB 
#include <bits/stdc++.h>
using namespace std;

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 3e5+10, MOD = 1e9+7;
const ll INF = 1e18+10;

int n, q;
ll d, a, b;
pair<ll, ll> dead[N];
set<pair<ll, ll>> can;

bool is_dead(ll x) {
    int i = upper_bound(dead, dead + n, make_pair(x, INF)) - dead;
    return 0 <= i && i < n && dead[i].first <= x && x <= dead[i].second;
}

bool qry_can(ll x) {
    auto it = can.upper_bound(make_pair(x, INF));
    if (it != can.begin()) {
        --it;
        if (it->first <= x && x <= it->second)
            return true;
    }

    return false;
}

void solve() {
    cin >> n >> q;
    cin >> d >> a >> b;
    for (int i = 0; i < n; i++) {
        ll l, r; cin >> l >> r;
        dead[i] = {l, r};
    }

    vector<pair<ll, ll>> alive;
    ll prv = -1;
    for (int i = 0; i < n; i++) {
        alive.emplace_back(prv + 1, dead[i].first - 1);
        prv = dead[i].second;
    }
    alive.emplace_back(prv + 1, INF);;

    can.insert(alive[0]);
    for (int i = 1; i < sz(alive); i++) {
        auto [l, r] = alive[i];
        if (qry_can(l - d)) {
            can.insert(alive[i]);
        } else {
            auto it = can.lower_bound(make_pair(l - d, -INF));
            if (it != can.end() && it->first + d <= r) {
                can.insert({it->first + d, r});
            }
        }
    }

    while (q--) {
        ll x; cin >> x;
        cout << (qry_can(x) ? x : -1) << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2536 KB Output is correct
2 Correct 21 ms 2640 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 183 ms 26564 KB Output is correct
5 Correct 200 ms 26484 KB Output is correct
6 Correct 183 ms 26812 KB Output is correct
7 Correct 180 ms 26816 KB Output is correct
8 Correct 196 ms 27188 KB Output is correct
9 Correct 198 ms 27512 KB Output is correct
10 Correct 198 ms 26868 KB Output is correct
11 Correct 186 ms 26864 KB Output is correct
12 Correct 201 ms 27584 KB Output is correct
13 Correct 202 ms 27656 KB Output is correct
14 Correct 125 ms 16828 KB Output is correct
15 Correct 92 ms 15304 KB Output is correct
16 Correct 96 ms 15204 KB Output is correct
17 Correct 197 ms 26300 KB Output is correct
18 Correct 182 ms 25536 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -