oj.uz

Submission #1087699

# Submission time Handle Problem Language Result Execution time Memory
1087699 2024-09-13T06:04:32 Z Seungni Treatment Project (JOI20_treatment) C++17
9 / 100
 107 ms 92752 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<ll, pair<pii, ll>> arr[100005];
vector<pii> graph[100005];
ll seg[200505 * 2];

void update(int pos, ll v) {
    pos += sz;
    seg[pos] = min(seg[pos], v);
    for (; pos > 0; pos >>= 1) seg[pos >> 1] = min(seg[pos], seg[pos ^ 1]);
    return;
}

ll query(int l, int r) {
    r++;
    ll ret = inf;
    for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
        if (l & 1) ret = min(ret, seg[l++]);
        if (r & 1) ret = min(ret, seg[--r]);
    }
    return ret;
}

void Dijkstra(int S, vector<ll> &dist) {
    priority_queue<pii, vector<pii>, greater<>> pq;
    dist[S] = 0;
    pq.push({0, S});
    
    while (pq.size()) {
        pii t = pq.top();
        pq.pop();
        ll now = t.second, v = t.first;
        if (dist[now] < v) continue;
        
        for (auto &[next, cost]: graph[now]) {
            ll ncost = v + cost;
            if (dist[next] > ncost) {
                dist[next] = ncost;
                pq.push({ncost, next});
            }
        }
    }
}

void subtask_1() {
    vector<ll> v;
    v.push_back(0);
    v.push_back(1), v.push_back(N);
    for (int i = 0; i < M; i++) {
        v.push_back(arr[i].second.first.first);
        v.push_back(arr[i].second.first.second);
    }
    
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    
    sz = v.size();
    
    sort(arr, arr + M, [&](pair<ll, pair<pii, ll>> a, pair<ll, pair<pii, ll>> b) {
        return a.second.first.second < b.second.first.second;
    });
    for (int i = 0; i < M; i++) {
        ll L = arr[i].second.first.first, R = arr[i].second.first.second;
        L = lower_bound(v.begin(), v.end(), L) - v.begin();
        R = lower_bound(v.begin(), v.end(), R) - v.begin();
        arr[i].second.first = {L, R};
    }
    
    vector<ll> dp(sz + 5, inf);
    memset(seg, 0x3f, sizeof(seg));
    dp[0] = 0;
    update(0, dp[0]);
    
    for (int i = 0; i < M; i++) {
        ll l = arr[i].second.first.first, r = arr[i].second.first.second, c = arr[i].second.second;
        ll idx = lower_bound(v.begin(), v.end(), v[l] - 1) - v.begin();
        dp[r] = min(dp[r], query(idx, r) + c);
        update(r, dp[r]);
    }
    
    int idx = lower_bound(v.begin(), v.end(), N) - v.begin();
    if (dp[idx] == inf) cout << -1;
    else cout << dp[idx];
    return;
}

void subtask_2() {
    ll ans = inf;
    
    sort(arr, arr + M);
    
    for (int i = 0; i < (1 << M); i++) {
        vector<int> v;
        ll cost = 0;
        for (int j = 0; j < M; j++) {
            if (i & (1 << j)) v.push_back(j), cost += arr[j].second.second;
        }
        
        vector<pair<pii, ll>> now;
        now.push_back({{1, N}, 0});
        
        for (int j: v) {
            vector<pair<pii, ll>> nxt;
            ll T = arr[j].first, L = arr[j].second.first.first, R = arr[j].second.first.second;
            for (auto &[range, t]: now) {
                ll l = range.first, r = range.second;
                l -= T - t, l = max(l, 1LL);
                r += T - t, r = min(r, N);
                if (l < L) nxt.push_back({{l, min(r, L - 1)}, T});
                if (r > R) nxt.push_back({{max(l, R + 1), r}, T});
            }
            swap(nxt, now);
        }
        
        if (now.empty()) ans = min(ans, cost);
    }
    
    if (ans == inf) cout << -1;
    else cout << ans;
    
    return;
}

void subtask_3() {
    int S = M, E = M + 1;
    sort(arr, arr + M);
    for (int i = 0; i < M; i++) {
        ll t1 = arr[i].first, l1 = arr[i].second.first.first, r1 = arr[i].second.first.second, c1 = arr[i].second.second;
        if (l1 == 1) {
            graph[S].push_back({i, c1});
            graph[i].push_back({S, c1});
        }
        if (r1 == N) {
            graph[E].push_back({i, c1});
            graph[i].push_back({E, c1});
        }
        for (int j = i + 1; j < M; j++) {
            ll t2 = arr[j].first, l2 = arr[j].second.first.first, r2 = arr[j].second.first.second, c2 = arr[j].second.second;
            ll diff = t2 - t1;
            ll a = l1 + diff, b = r1 - diff;
            if (a > b) continue;
            if (b > r2) {
                swap(a, l2);
                swap(b, r2);
            }
            if (b + 1 >= l2) {
                graph[i].push_back({j, c2});
                graph[j].push_back({i, c2});
            }
        }
    }
    
    vector<ll> dist(M + 5, inf);
    Dijkstra(S, dist);
    
    if (dist[E] == inf) cout << -1;
    else cout << dist[E];
    
    return;
}

void solve() {
    cin >> N >> M;
    
    int sub_task1 = 1, sub_task2 = (M <= 16), sub_task3 = (M <= 5000);
    
    for (int i = 0; i < M; i++) {
        ll T, L, R, C;
        cin >> T >> L >> R >> C;
        if (T != 1) sub_task1 = 0;
        arr[i] = {T, {{L, R}, C}};
    }
    
    if (sub_task1) {
        subtask_1();
        return;
    }
    
    if (sub_task2) {
        subtask_2();
        return;
    }
    
    if (sub_task3) {
        subtask_3();
        return;
    }
    
    return;
}

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

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 12228 KB Output is correct
2 Correct 59 ms 12240 KB Output is correct
3 Correct 62 ms 10952 KB Output is correct
4 Correct 59 ms 10952 KB Output is correct
5 Correct 37 ms 10712 KB Output is correct
6 Correct 40 ms 10700 KB Output is correct
7 Correct 43 ms 10652 KB Output is correct
8 Correct 38 ms 10700 KB Output is correct
9 Correct 40 ms 10696 KB Output is correct
10 Correct 44 ms 10692 KB Output is correct
11 Correct 78 ms 11764 KB Output is correct
12 Correct 78 ms 11724 KB Output is correct
13 Correct 81 ms 12228 KB Output is correct
14 Correct 73 ms 12248 KB Output is correct
15 Correct 76 ms 12228 KB Output is correct
16 Correct 67 ms 12264 KB Output is correct
17 Correct 65 ms 12244 KB Output is correct
18 Correct 75 ms 11724 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 24 ms 2816 KB Output is correct
3 Correct 23 ms 2648 KB Output is correct
4 Correct 50 ms 2652 KB Output is correct
5 Correct 43 ms 2652 KB Output is correct
6 Correct 22 ms 2652 KB Output is correct
7 Correct 34 ms 2820 KB Output is correct
8 Correct 45 ms 2648 KB Output is correct
9 Correct 29 ms 2652 KB Output is correct
10 Correct 43 ms 2648 KB Output is correct
11 Correct 54 ms 2652 KB Output is correct
12 Correct 33 ms 2648 KB Output is correct
13 Correct 25 ms 2648 KB Output is correct
14 Correct 23 ms 2652 KB Output is correct
15 Correct 25 ms 2652 KB Output is correct
16 Correct 33 ms 2652 KB Output is correct
17 Correct 41 ms 2652 KB Output is correct
18 Correct 23 ms 2652 KB Output is correct
19 Correct 38 ms 2648 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 24 ms 2816 KB Output is correct
3 Correct 23 ms 2648 KB Output is correct
4 Correct 50 ms 2652 KB Output is correct
5 Correct 43 ms 2652 KB Output is correct
6 Correct 22 ms 2652 KB Output is correct
7 Correct 34 ms 2820 KB Output is correct
8 Correct 45 ms 2648 KB Output is correct
9 Correct 29 ms 2652 KB Output is correct
10 Correct 43 ms 2648 KB Output is correct
11 Correct 54 ms 2652 KB Output is correct
12 Correct 33 ms 2648 KB Output is correct
13 Correct 25 ms 2648 KB Output is correct
14 Correct 23 ms 2652 KB Output is correct
15 Correct 25 ms 2652 KB Output is correct
16 Correct 33 ms 2652 KB Output is correct
17 Correct 41 ms 2652 KB Output is correct
18 Correct 23 ms 2652 KB Output is correct
19 Correct 38 ms 2648 KB Output is correct
20 Incorrect 107 ms 92752 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 12228 KB Output is correct
2 Correct 59 ms 12240 KB Output is correct
3 Correct 62 ms 10952 KB Output is correct
4 Correct 59 ms 10952 KB Output is correct
5 Correct 37 ms 10712 KB Output is correct
6 Correct 40 ms 10700 KB Output is correct
7 Correct 43 ms 10652 KB Output is correct
8 Correct 38 ms 10700 KB Output is correct
9 Correct 40 ms 10696 KB Output is correct
10 Correct 44 ms 10692 KB Output is correct
11 Correct 78 ms 11764 KB Output is correct
12 Correct 78 ms 11724 KB Output is correct
13 Correct 81 ms 12228 KB Output is correct
14 Correct 73 ms 12248 KB Output is correct
15 Correct 76 ms 12228 KB Output is correct
16 Correct 67 ms 12264 KB Output is correct
17 Correct 65 ms 12244 KB Output is correct
18 Correct 75 ms 11724 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Correct 24 ms 2816 KB Output is correct
21 Correct 23 ms 2648 KB Output is correct
22 Correct 50 ms 2652 KB Output is correct
23 Correct 43 ms 2652 KB Output is correct
24 Correct 22 ms 2652 KB Output is correct
25 Correct 34 ms 2820 KB Output is correct
26 Correct 45 ms 2648 KB Output is correct
27 Correct 29 ms 2652 KB Output is correct
28 Correct 43 ms 2648 KB Output is correct
29 Correct 54 ms 2652 KB Output is correct
30 Correct 33 ms 2648 KB Output is correct
31 Correct 25 ms 2648 KB Output is correct
32 Correct 23 ms 2652 KB Output is correct
33 Correct 25 ms 2652 KB Output is correct
34 Correct 33 ms 2652 KB Output is correct
35 Correct 41 ms 2652 KB Output is correct
36 Correct 23 ms 2652 KB Output is correct
37 Correct 38 ms 2648 KB Output is correct
38 Incorrect 107 ms 92752 KB Output isn't correct
39 Halted 0 ms 0 KB -