oj.uz

Submission #707357

# Submission time Handle Problem Language Result Execution time Memory
707357 2023-03-08T21:03:05 Z Stickfish Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 71476 KB 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <bitset>
using namespace std;

const int MAXN = 30100;
const int SQN = 50;
const int INF = 1e9 + 177013;
pair<int, int> dogs[MAXN];
vector<int> jlen[MAXN];

struct modmin {
    void resize(int n) {
        sz = n;
        for (int i = 0; i < n; ++i)
            active.insert(i);
        pivots = {{-INF, 10}, {INF, 10}};
    }

    void insert_pivot(int x, int vl) {
        auto it = active.lower_bound(x);
        pivots.insert({x, vl});
        if (it != active.end())
            best.insert({get_value(*it), *it});
        if (it != active.begin())
            best.insert({get_value(*prev(it)), *prev(it)});
    }

    void deactivate(int x) {
        int vl = get_value(x);
        auto it = active.find(x);
        if (best.find({vl, x}) != best.end()) {
            best.erase({vl, x});
            if (next(it) != active.end())
                best.insert({get_value(*next(it)), *next(it)});
            if (it != active.begin())
                best.insert({get_value(*prev(it)), *prev(it)});
        }
        active.erase(it);
    }

    pair<int, int> get_min() {
        while (best.size()) {
            auto [yvl, y] = *best.begin();
            if (active.find(y) == active.end()) {
                best.erase(best.begin());
            } else {
                break;
            }
        }
        if (best.empty())
            return {INF, INF};
        return *best.begin();
    }
 private:
     int sz;
     set<pair<int, int>> pivots;
     set<int> active;
     set<pair<int, int>> best;

     int get_value(int x) {
         auto it = pivots.lower_bound({x, -1});
         return min(get_transit(it, x), get_transit(prev(it), x));
     }

     int get_transit(set<pair<int, int>>::iterator it, int x) {
         return abs(x - it->first) + it->second;
     }
};

bitset<MAXN> used;
int dist_long[MAXN];
modmin dist_short[SQN][SQN];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        cin >> dogs[i].first >> dogs[i].second;
        jlen[dogs[i].first].push_back(dogs[i].second);
    }
    int s = dogs[0].first;
    int t = dogs[1].first;
    for (int i = 0; i < n; ++i)
        dist_long[i] = INF;
    dist_long[s] = 0;
    for (int d = 1; d < SQN; ++d) {
        for (int md = 0; md < n && md < d; ++md) {
            dist_short[d][md].resize((n - md - 1) / d + 1);
        }
    }
    set<pair<int, int>> rdist_short;
    set<pair<int, int>> rdist_long;
    rdist_long.insert({0, s});
    int T = n;
    while (T--) {
        pair<int, int> opt = {INF, INF};
        if (rdist_long.size())
            opt = *rdist_long.begin();
        if (rdist_short.size())
            opt = min(opt, *rdist_short.begin());
        auto [dist, v] = opt;
        if (dist >= INF)
            break;
        rdist_long.erase({dist_long[v], v});
        dist_long[v] = dist;
        if (used[v]) {
            cout << "ERROR" << endl;
            return 1;
        }
        used[v] = 1;
        for (int d = 1; d < SQN; ++d) {
            int md = v % d;
            pair<int, int> cval = dist_short[d][md].get_min();
            cval.second = md + d * cval.second;
            rdist_short.erase(cval);

            dist_short[d][md].deactivate(v / d);

            pair<int, int> ncval = dist_short[d][md].get_min();
            ncval.second = md + d * ncval.second;
            rdist_short.insert(ncval);
        }
        sort(jlen[v].begin(), jlen[v].end());
        jlen[v].resize(unique(jlen[v].begin(), jlen[v].end()) - jlen[v].begin());
        for (auto p : jlen[v]) {
            if (p >= SQN) {
                for (int k = 1; p * k <= v; ++k) {
                    if (used[v - p * k])
                        continue;
                    rdist_long.erase({dist_long[v - p * k], v - p * k});
                    dist_long[v - p * k] = min(dist_long[v - p * k], dist + k);
                    rdist_long.insert({dist_long[v - p * k], v - p * k});
                }
                for (int k = 1; v + p * k < n; ++k) {
                    if (used[v + p * k])
                        continue;
                    rdist_long.erase({dist_long[v + p * k], v + p * k});
                    dist_long[v + p * k] = min(dist_long[v + p * k], dist + k);
                    rdist_long.insert({dist_long[v + p * k], v + p * k});
                }
            } else {
                int md = v % p;
                pair<int, int> cval = dist_short[p][md].get_min();
                cval.second = md + p * cval.second;
                rdist_short.erase(cval);

                dist_short[p][md].insert_pivot(v / p, dist);

                pair<int, int> ncval = dist_short[p][md].get_min();
                ncval.second = md + p * ncval.second;
                rdist_short.insert(ncval);
            }
        }
                //cout << "HIE" << endl;
    }
    if (dist_long[t] >= INF)
        cout << "-1\n";
    else
        cout << dist_long[t] << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 2 ms 1620 KB Output is correct
10 Correct 3 ms 1748 KB Output is correct
11 Correct 4 ms 1748 KB Output is correct
12 Correct 4 ms 1784 KB Output is correct
13 Correct 3 ms 1748 KB Output is correct
14 Correct 4 ms 1748 KB Output is correct
15 Correct 4 ms 1748 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 1620 KB Output is correct
10 Correct 4 ms 1768 KB Output is correct
11 Correct 4 ms 1748 KB Output is correct
12 Correct 3 ms 1748 KB Output is correct
13 Correct 3 ms 1748 KB Output is correct
14 Correct 3 ms 1748 KB Output is correct
15 Correct 3 ms 1748 KB Output is correct
16 Correct 3 ms 2004 KB Output is correct
17 Correct 24 ms 3232 KB Output is correct
18 Correct 9 ms 5460 KB Output is correct
19 Correct 11 ms 6100 KB Output is correct
20 Correct 49 ms 6200 KB Output is correct
21 Correct 3 ms 2388 KB Output is correct
22 Correct 10 ms 5640 KB Output is correct
23 Correct 38 ms 5204 KB Output is correct
24 Correct 53 ms 5936 KB Output is correct
25 Correct 50 ms 6100 KB Output is correct
26 Correct 46 ms 6100 KB Output is correct
27 Correct 47 ms 6056 KB Output is correct
28 Correct 49 ms 6196 KB Output is correct
29 Correct 49 ms 6168 KB Output is correct
30 Correct 47 ms 6100 KB Output is correct
31 Correct 62 ms 6132 KB Output is correct
32 Correct 49 ms 6100 KB Output is correct
33 Correct 52 ms 6228 KB Output is correct
34 Correct 52 ms 6228 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 1620 KB Output is correct
10 Correct 3 ms 1772 KB Output is correct
11 Correct 4 ms 1748 KB Output is correct
12 Correct 3 ms 1748 KB Output is correct
13 Correct 3 ms 1748 KB Output is correct
14 Correct 3 ms 1748 KB Output is correct
15 Correct 3 ms 1748 KB Output is correct
16 Correct 2 ms 2004 KB Output is correct
17 Correct 19 ms 3284 KB Output is correct
18 Correct 9 ms 5520 KB Output is correct
19 Correct 10 ms 6096 KB Output is correct
20 Correct 49 ms 6192 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 9 ms 5572 KB Output is correct
23 Correct 37 ms 5204 KB Output is correct
24 Correct 48 ms 5844 KB Output is correct
25 Correct 54 ms 6220 KB Output is correct
26 Correct 46 ms 6144 KB Output is correct
27 Correct 46 ms 6144 KB Output is correct
28 Correct 53 ms 6196 KB Output is correct
29 Correct 51 ms 6100 KB Output is correct
30 Correct 48 ms 6080 KB Output is correct
31 Correct 47 ms 6100 KB Output is correct
32 Correct 51 ms 6100 KB Output is correct
33 Correct 53 ms 6272 KB Output is correct
34 Correct 72 ms 6268 KB Output is correct
35 Correct 48 ms 5204 KB Output is correct
36 Correct 28 ms 4008 KB Output is correct
37 Correct 72 ms 6224 KB Output is correct
38 Correct 74 ms 6484 KB Output is correct
39 Correct 76 ms 6568 KB Output is correct
40 Correct 74 ms 6568 KB Output is correct
41 Correct 76 ms 6484 KB Output is correct
42 Correct 51 ms 6484 KB Output is correct
43 Correct 50 ms 6420 KB Output is correct
44 Correct 51 ms 6528 KB Output is correct
45 Correct 133 ms 6664 KB Output is correct
46 Correct 136 ms 6648 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 1620 KB Output is correct
10 Correct 3 ms 1760 KB Output is correct
11 Correct 4 ms 1748 KB Output is correct
12 Correct 3 ms 1748 KB Output is correct
13 Correct 3 ms 1748 KB Output is correct
14 Correct 3 ms 1748 KB Output is correct
15 Correct 5 ms 1748 KB Output is correct
16 Correct 2 ms 2004 KB Output is correct
17 Correct 19 ms 3276 KB Output is correct
18 Correct 9 ms 5584 KB Output is correct
19 Correct 11 ms 6136 KB Output is correct
20 Correct 60 ms 6200 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 9 ms 5588 KB Output is correct
23 Correct 39 ms 5184 KB Output is correct
24 Correct 51 ms 5844 KB Output is correct
25 Correct 49 ms 6136 KB Output is correct
26 Correct 47 ms 6144 KB Output is correct
27 Correct 55 ms 6100 KB Output is correct
28 Correct 49 ms 6100 KB Output is correct
29 Correct 49 ms 6100 KB Output is correct
30 Correct 47 ms 6124 KB Output is correct
31 Correct 53 ms 6140 KB Output is correct
32 Correct 50 ms 6160 KB Output is correct
33 Correct 53 ms 6280 KB Output is correct
34 Correct 61 ms 6268 KB Output is correct
35 Correct 49 ms 5204 KB Output is correct
36 Correct 34 ms 4052 KB Output is correct
37 Correct 75 ms 6228 KB Output is correct
38 Correct 75 ms 6480 KB Output is correct
39 Correct 75 ms 6484 KB Output is correct
40 Correct 72 ms 6572 KB Output is correct
41 Correct 72 ms 6528 KB Output is correct
42 Correct 50 ms 6484 KB Output is correct
43 Correct 54 ms 6484 KB Output is correct
44 Correct 54 ms 6484 KB Output is correct
45 Correct 134 ms 6648 KB Output is correct
46 Correct 134 ms 6652 KB Output is correct
47 Correct 598 ms 30500 KB Output is correct
48 Correct 128 ms 55660 KB Output is correct
49 Correct 139 ms 60628 KB Output is correct
50 Correct 150 ms 66304 KB Output is correct
51 Execution timed out 1081 ms 71476 KB Time limit exceeded
52 Halted 0 ms 0 KB -