oj.uz

답안 #939524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
939524 2024-03-06T12:52:37 Z boris_mihov 치료 계획 (JOI20_treatment) C++17
100 / 100
 929 ms 294860 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
 
typedef long long llong;
const int MAXN = 100000 + 10;
const llong INF = 1e18;
 
int n, m;
struct Interval
{
    int t, l, r, c;
    friend bool operator < (const Interval &a, const Interval &b)
    {
        return a.t < b.t;
    }
};
 
Interval a[MAXN];
std::vector <std::pair <int,llong>> g[MAXN];
std::pair <int,llong> gTree[40 * MAXN][2];
int nodeCounter;
 
struct PersistentSegmentTree
{
    struct Node
    {
        int val;
        int left;
        int right;
        llong edgeValue;
    };
 
    Node tree[MAXN * 20];
    int root;
    int cnt;
 
    void build(int l, int r, int node, int order[])
    {
        if (l == r)
        {
            tree[node].val = order[l];
            tree[node].edgeValue = INF;
            return;
        }
 
        int mid = (l + r) / 2;
        tree[node].left = ++cnt;
        tree[node].right = ++cnt;
        assert(cnt < 20 * MAXN);
        build(l, mid, tree[node].left, order);
        build(mid + 1, r, tree[node].right, order);
        tree[node].val = ++nodeCounter;
        assert(nodeCounter < 40 * MAXN);
        tree[node].edgeValue = 0;
 
        gTree[tree[node].val][0] = {tree[tree[node].left].val, tree[tree[node].left].edgeValue};
        gTree[tree[node].val][1] = {tree[tree[node].right].val, tree[tree[node].right].edgeValue};        
    }
 
    void update(int l, int r, int newNode, int oldNode, int queryPos, int queryVal)
    {
        tree[newNode] = tree[oldNode];
        if (l == r)
        {
            tree[newNode].edgeValue = queryVal;
            return;
        }
 
        int mid = (l + r) / 2;
        if (queryPos <= mid)
        {
            tree[newNode].left = ++cnt;
            assert(cnt < 20 * MAXN);
            update(l, mid, tree[newNode].left, tree[oldNode].left, queryPos, queryVal);
        } else
        {
            tree[newNode].right = ++cnt;
            assert(cnt < 20 * MAXN);
            update(mid + 1, r, tree[newNode].right, tree[oldNode].right, queryPos, queryVal);
        }
 
        tree[newNode].val = ++nodeCounter;
        assert(nodeCounter < 40 * MAXN);
        gTree[tree[newNode].val][0] = {tree[tree[newNode].left].val, tree[tree[newNode].left].edgeValue};
        gTree[tree[newNode].val][1] = {tree[tree[newNode].right].val, tree[tree[newNode].right].edgeValue};
    }
 
    void addEdges(int l, int r, int node, int queryL, int queryR, int from)
    {
        if (queryL <= l && r <= queryR)
        {
            g[from].push_back({tree[node].val, tree[node].edgeValue});
            return;
        }
 
        int mid = (l + r) / 2;
        if (queryL <= mid) addEdges(l, mid, tree[node].left, queryL, queryR, from);
        if (mid + 1 <= queryR) addEdges(mid + 1, r, tree[node].right, queryL, queryR, from);
    }
 
    void build(int order[])
    {
        root = 1;
        cnt = 1;
        build(1, n, root, order);
    }
 
    void update(int pos, int val)
    {
        int newRoot = ++cnt;
        update(1, n, newRoot, root, pos, val);
        root = newRoot;
    }
 
    void addEdges(int l, int r, int from)
    {
        addEdges(1, n, root, l, r, from);
    }
};
 
bool vis[40 * MAXN];
llong dist[40 * MAXN];
PersistentSegmentTree treePlus;
PersistentSegmentTree treeMinus;
std::priority_queue <std::pair <llong,int>> pq;
int plusOrder[MAXN];
int minusOrder[MAXN];
int inPlusOrder[MAXN];
int inMinusOrder[MAXN];
 
void solve()
{
    std::sort(a + 1, a + 1 + n);
    std::iota(plusOrder + 1, plusOrder + 1 + n, 1);
    std::iota(minusOrder + 1, minusOrder + 1 + n, 1);
    std::sort(plusOrder + 1, plusOrder + 1 + n, [&](int x, int y)
    {
        return a[x].l + a[x].t < a[y].l + a[y].t;
    });
 
    std::sort(minusOrder + 1, minusOrder + 1 + n, [&](int x, int y)
    {
        return a[x].l - a[x].t < a[y].l - a[y].t;
    });
 
    for (int i = 1 ; i <= n ; ++i)
    {
        inPlusOrder[plusOrder[i]] = i;
        inMinusOrder[minusOrder[i]] = i;
    }
 
    nodeCounter = n;
    treePlus.build(plusOrder);
    for (int i = n ; i >= 1 ; --i)
    {
        int l = 0, r = n + 1, mid;
        while (l < r - 1)
        {
            mid = (l + r) / 2;
            if (a[plusOrder[mid]].l + a[plusOrder[mid]].t <= a[i].r + a[i].t + 1) l = mid;
            else r = mid;
        }
 
        if (l != 0)
        {
            treePlus.addEdges(1, l, i);
        }
 
        treePlus.update(inPlusOrder[i], a[i].c);
    }
 
    treeMinus.build(minusOrder);
    for (int i = 1 ; i <= n ; ++i)
    {
        int l = 0, r = n + 1, mid;
        while (l < r - 1)
        {
            mid = (l + r) / 2;
            if (a[minusOrder[mid]].l - a[minusOrder[mid]].t <= a[i].r - a[i].t + 1) l = mid;
            else r = mid;
        }
 
        if (l != 0)
        {
            treeMinus.addEdges(1, l, i);
        }
 
        treeMinus.update(inMinusOrder[i], a[i].c);
    }
 
    llong ans = INF;
    assert(nodeCounter < 40 * MAXN);
    std::fill(dist + 1, dist + 1 + nodeCounter, INF);
    for (int i = 1 ; i <= n ; ++i)
    {
        if (a[i].l == 1)
        {
            dist[i] = a[i].c;
            pq.push({-dist[i], i});
        }
    }
 
    while (pq.size())
    {
        auto [currDist, node] = pq.top();
        pq.pop();
 
        if (node <= n && a[node].r == m)
        {
            ans = dist[node];
            break;
        }
 
        if (vis[node])
        {
            continue;
        }
 
        vis[node] = true;
        if (node <= n)
        {
            for (const auto &[u, w] : g[node])
            {
                if (dist[u] > dist[node] + w)
                {
                    dist[u] = dist[node] + w;
                    pq.push({-dist[u], u});
                }
            }
        } else
        {
            for (const auto &[u, w] : gTree[node])
            {
                if (dist[u] > dist[node] + w)
                {
                    dist[u] = dist[node] + w;
                    pq.push({-dist[u], u});
                }
            }
        }
    }
 
    if (ans == INF) std::cout << -1 << '\n';
    else std::cout << ans << '\n';
}
 
void input()
{
    std::cin >> m >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i].t >> a[i].l >> a[i].r >> a[i].c;
    }   
}
 
void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}
 
int main()
{
    fastIOI();
    input();
    solve();
 
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 677 ms 285484 KB Output is correct
2 Correct 457 ms 285264 KB Output is correct
3 Correct 731 ms 271532 KB Output is correct
4 Correct 755 ms 271044 KB Output is correct
5 Correct 678 ms 284000 KB Output is correct
6 Correct 604 ms 285288 KB Output is correct
7 Correct 436 ms 284520 KB Output is correct
8 Correct 321 ms 281920 KB Output is correct
9 Correct 315 ms 282708 KB Output is correct
10 Correct 288 ms 282080 KB Output is correct
11 Correct 348 ms 269936 KB Output is correct
12 Correct 394 ms 271000 KB Output is correct
13 Correct 858 ms 287268 KB Output is correct
14 Correct 841 ms 287288 KB Output is correct
15 Correct 826 ms 285172 KB Output is correct
16 Correct 835 ms 285296 KB Output is correct
17 Correct 827 ms 285320 KB Output is correct
18 Correct 361 ms 270288 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Correct 2 ms 12724 KB Output is correct
6 Correct 2 ms 12788 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12652 KB Output is correct
14 Correct 2 ms 12632 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12632 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Correct 2 ms 12724 KB Output is correct
6 Correct 2 ms 12788 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12652 KB Output is correct
14 Correct 2 ms 12632 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12632 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 15 ms 22108 KB Output is correct
21 Correct 15 ms 22264 KB Output is correct
22 Correct 14 ms 22360 KB Output is correct
23 Correct 11 ms 22364 KB Output is correct
24 Correct 13 ms 22620 KB Output is correct
25 Correct 19 ms 22364 KB Output is correct
26 Correct 15 ms 22364 KB Output is correct
27 Correct 13 ms 22364 KB Output is correct
28 Correct 14 ms 22620 KB Output is correct
29 Correct 17 ms 22364 KB Output is correct
30 Correct 10 ms 22364 KB Output is correct
31 Correct 10 ms 22364 KB Output is correct
32 Correct 14 ms 22620 KB Output is correct
33 Correct 15 ms 22876 KB Output is correct
34 Correct 20 ms 22364 KB Output is correct
35 Correct 12 ms 22652 KB Output is correct
36 Correct 11 ms 22364 KB Output is correct
37 Correct 21 ms 22576 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 677 ms 285484 KB Output is correct
2 Correct 457 ms 285264 KB Output is correct
3 Correct 731 ms 271532 KB Output is correct
4 Correct 755 ms 271044 KB Output is correct
5 Correct 678 ms 284000 KB Output is correct
6 Correct 604 ms 285288 KB Output is correct
7 Correct 436 ms 284520 KB Output is correct
8 Correct 321 ms 281920 KB Output is correct
9 Correct 315 ms 282708 KB Output is correct
10 Correct 288 ms 282080 KB Output is correct
11 Correct 348 ms 269936 KB Output is correct
12 Correct 394 ms 271000 KB Output is correct
13 Correct 858 ms 287268 KB Output is correct
14 Correct 841 ms 287288 KB Output is correct
15 Correct 826 ms 285172 KB Output is correct
16 Correct 835 ms 285296 KB Output is correct
17 Correct 827 ms 285320 KB Output is correct
18 Correct 361 ms 270288 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12632 KB Output is correct
22 Correct 2 ms 12632 KB Output is correct
23 Correct 2 ms 12724 KB Output is correct
24 Correct 2 ms 12788 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 3 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12652 KB Output is correct
32 Correct 2 ms 12632 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12632 KB Output is correct
35 Correct 2 ms 12636 KB Output is correct
36 Correct 3 ms 12636 KB Output is correct
37 Correct 2 ms 12636 KB Output is correct
38 Correct 15 ms 22108 KB Output is correct
39 Correct 15 ms 22264 KB Output is correct
40 Correct 14 ms 22360 KB Output is correct
41 Correct 11 ms 22364 KB Output is correct
42 Correct 13 ms 22620 KB Output is correct
43 Correct 19 ms 22364 KB Output is correct
44 Correct 15 ms 22364 KB Output is correct
45 Correct 13 ms 22364 KB Output is correct
46 Correct 14 ms 22620 KB Output is correct
47 Correct 17 ms 22364 KB Output is correct
48 Correct 10 ms 22364 KB Output is correct
49 Correct 10 ms 22364 KB Output is correct
50 Correct 14 ms 22620 KB Output is correct
51 Correct 15 ms 22876 KB Output is correct
52 Correct 20 ms 22364 KB Output is correct
53 Correct 12 ms 22652 KB Output is correct
54 Correct 11 ms 22364 KB Output is correct
55 Correct 21 ms 22576 KB Output is correct
56 Correct 445 ms 278220 KB Output is correct
57 Correct 427 ms 276428 KB Output is correct
58 Correct 412 ms 286376 KB Output is correct
59 Correct 407 ms 286068 KB Output is correct
60 Correct 375 ms 287096 KB Output is correct
61 Correct 426 ms 286292 KB Output is correct
62 Correct 460 ms 278200 KB Output is correct
63 Correct 248 ms 289872 KB Output is correct
64 Correct 259 ms 290028 KB Output is correct
65 Correct 654 ms 285528 KB Output is correct
66 Correct 327 ms 286804 KB Output is correct
67 Correct 750 ms 287620 KB Output is correct
68 Correct 580 ms 287056 KB Output is correct
69 Correct 539 ms 286756 KB Output is correct
70 Correct 838 ms 287836 KB Output is correct
71 Correct 677 ms 286912 KB Output is correct
72 Correct 547 ms 287312 KB Output is correct
73 Correct 827 ms 287864 KB Output is correct
74 Correct 321 ms 284504 KB Output is correct
75 Correct 300 ms 284500 KB Output is correct
76 Correct 429 ms 287548 KB Output is correct
77 Correct 403 ms 294860 KB Output is correct
78 Correct 929 ms 289160 KB Output is correct
79 Correct 807 ms 287604 KB Output is correct
80 Correct 925 ms 287312 KB Output is correct
81 Correct 345 ms 285012 KB Output is correct
82 Correct 881 ms 287312 KB Output is correct
83 Correct 872 ms 287308 KB Output is correct
84 Correct 792 ms 287332 KB Output is correct
85 Correct 488 ms 287136 KB Output is correct
86 Correct 482 ms 287568 KB Output is correct
87 Correct 522 ms 287272 KB Output is correct
88 Correct 463 ms 287056 KB Output is correct
89 Correct 500 ms 286864 KB Output is correct
90 Correct 435 ms 289476 KB Output is correct
91 Correct 340 ms 284700 KB Output is correct
92 Correct 560 ms 287316 KB Output is correct
93 Correct 714 ms 287540 KB Output is correct
94 Correct 717 ms 288336 KB Output is correct
95 Correct 568 ms 287568 KB Output is correct
96 Correct 369 ms 288452 KB Output is correct
97 Correct 509 ms 293064 KB Output is correct
98 Correct 520 ms 293312 KB Output is correct
99 Correct 452 ms 293068 KB Output is correct
100 Correct 372 ms 283808 KB Output is correct
101 Correct 805 ms 293584 KB Output is correct
102 Correct 428 ms 287820 KB Output is correct
103 Correct 599 ms 287656 KB Output is correct