oj.uz

Submission #1087970

# Submission time Handle Problem Language Result Execution time Memory
1087970 2024-09-13T16:04:34 Z Seungni Treatment Project (JOI20_treatment) C++17
35 / 100
 64 ms 56264 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const ll inf = 0x3f3f3f3f3f3f3f3fLL;

ll N, M, sz;
pair<pii, pii> arr[100005];
pair<pii, int> v[100005];
vector<ll> xpos;
ll dist[400005];
set<pii> seg[400005];

void add(int n, int s, int e, int idx, pii val) {
    if (idx > e || idx < s) return;
    if (s == e) {
        seg[n].insert(val);
        return;
    }
    int m = (s + e) >> 1;
    add(n * 2, s, m, idx, val);
    add(n * 2 + 1, m + 1, e, idx, val);
    seg[n].insert(val);
    return;
}

void del(int n, int s, int e, int idx, pii val) {
    if (idx > e || idx < s) return;
    if (s == e) {
        seg[n].erase(val);
        return;
    }
    int m = (s + e) >> 1;
    del(n * 2, s, m, idx, val);
    del(n * 2 + 1, m + 1, e, idx, val);
    seg[n].erase(val);
    return;
}

void query(int n, int s, int e, int l, int r, ll y, vector<int> &d) {
    if (l > e || r < s) return;
    if (l <= s && e <= r) {
        for (pii i: seg[n]) {
            if (i.first > y) break;
            d.push_back(i.second);
        }
        return;
    }
    int m = (s + e) >> 1;
    query(n * 2, s, m, l, r, y, d);
    query(n * 2 + 1, m + 1, e, l, r, y, d);
    return;
}

void Dijkstra() {
    memset(dist, 0x3f, sizeof(dist));
    priority_queue<pii, vector<pii>, greater<>> pq;

    vector<int> d;

    for (int i = 0; i < M; i++) {
        int idx = v[i].second;
        if (arr[idx].first.second == 1) {
            dist[i] = arr[idx].second.second;
            pq.push({dist[i], i});
            d.push_back(i);
        }
    }

    for (int i: d) {
        ll x = v[i].first.first, y = v[i].first.second, idx = v[i].second;
        int pos = lower_bound(xpos.begin(), xpos.end(), x) - xpos.begin();
        del(1, 0, sz - 1, pos, {y, idx});
    }

    while (pq.size()) {
        pii t = pq.top();
        pq.pop();
        ll now = t.second, val = t.first;
        int idx = v[now].second;
        ll x = arr[idx].second.first - arr[idx].first.first + 1, y = arr[idx].second.first + arr[idx].first.first + 1;

        d.clear();
        int pos = upper_bound(xpos.begin(), xpos.end(), x) - xpos.begin() - 1;

        query(1, 0, sz - 1, 0, pos, y, d);

        for (int i: d) {
            ll x = v[i].first.first, y = v[i].first.second, idx = v[i].second;
            int pos = lower_bound(xpos.begin(), xpos.end(), x) - xpos.begin();
            del(1, 0, sz - 1, pos, {y, idx});
            dist[i] = val + arr[idx].second.second;
            pq.push({dist[i], i});
        }
    }

    return;
}

void solve() {
    cin >> N >> M;
    for (int i = 0; i < M; i++) {
        ll T, L, R, C;
        cin >> T >> L >> R >> C;
        ll x = L - T, y = L + T;
        arr[i] = {{T, L},
                  {R, C}};
        v[i] = {{x, y}, i};
        xpos.push_back(x);
        xpos.push_back(x + 1);
    }

    sz = xpos.size();

    sort(xpos.begin(), xpos.end());
    xpos.erase(unique(xpos.begin(), xpos.end()), xpos.end());

    for (int i = 0; i < M; i++) {
        ll x = v[i].first.first, y = v[i].first.second, idx = v[i].second;
        int pos = lower_bound(xpos.begin(), xpos.end(), x) - xpos.begin();
        add(1, 0, sz - 1, pos, {y, idx});
    }

    Dijkstra();

    ll ans = inf;
    for (int i = 0; i < M; i++) {
        int idx = v[i].second;
        if (arr[idx].second.first == N) ans = min(ans, dist[i]);
    }

    if (ans == inf) cout << -1;
    else cout << ans;

    return;
}

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

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 64 ms 56264 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 22360 KB Output is correct
2 Correct 8 ms 22364 KB Output is correct
3 Correct 9 ms 22280 KB Output is correct
4 Correct 9 ms 22364 KB Output is correct
5 Correct 11 ms 22360 KB Output is correct
6 Correct 9 ms 22364 KB Output is correct
7 Correct 9 ms 22364 KB Output is correct
8 Correct 9 ms 22364 KB Output is correct
9 Correct 10 ms 22396 KB Output is correct
10 Correct 9 ms 22364 KB Output is correct
11 Correct 9 ms 22364 KB Output is correct
12 Correct 9 ms 22256 KB Output is correct
13 Correct 8 ms 22364 KB Output is correct
14 Correct 9 ms 22312 KB Output is correct
15 Correct 10 ms 22364 KB Output is correct
16 Correct 9 ms 22364 KB Output is correct
17 Correct 10 ms 22364 KB Output is correct
18 Correct 9 ms 22364 KB Output is correct
19 Correct 9 ms 22400 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 22360 KB Output is correct
2 Correct 8 ms 22364 KB Output is correct
3 Correct 9 ms 22280 KB Output is correct
4 Correct 9 ms 22364 KB Output is correct
5 Correct 11 ms 22360 KB Output is correct
6 Correct 9 ms 22364 KB Output is correct
7 Correct 9 ms 22364 KB Output is correct
8 Correct 9 ms 22364 KB Output is correct
9 Correct 10 ms 22396 KB Output is correct
10 Correct 9 ms 22364 KB Output is correct
11 Correct 9 ms 22364 KB Output is correct
12 Correct 9 ms 22256 KB Output is correct
13 Correct 8 ms 22364 KB Output is correct
14 Correct 9 ms 22312 KB Output is correct
15 Correct 10 ms 22364 KB Output is correct
16 Correct 9 ms 22364 KB Output is correct
17 Correct 10 ms 22364 KB Output is correct
18 Correct 9 ms 22364 KB Output is correct
19 Correct 9 ms 22400 KB Output is correct
20 Correct 24 ms 27228 KB Output is correct
21 Correct 26 ms 27224 KB Output is correct
22 Correct 28 ms 27228 KB Output is correct
23 Correct 29 ms 27224 KB Output is correct
24 Correct 30 ms 27484 KB Output is correct
25 Correct 29 ms 27228 KB Output is correct
26 Correct 26 ms 27228 KB Output is correct
27 Correct 30 ms 27164 KB Output is correct
28 Correct 33 ms 27472 KB Output is correct
29 Correct 29 ms 27312 KB Output is correct
30 Correct 25 ms 27216 KB Output is correct
31 Correct 21 ms 27408 KB Output is correct
32 Correct 38 ms 27484 KB Output is correct
33 Correct 28 ms 27580 KB Output is correct
34 Correct 26 ms 27216 KB Output is correct
35 Correct 28 ms 27480 KB Output is correct
36 Correct 28 ms 27528 KB Output is correct
37 Correct 25 ms 27216 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Runtime error 64 ms 56264 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -