oj.uz

Submission #709881

# Submission time Handle Problem Language Result Execution time Memory
709881 2023-03-14T18:32:55 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 564 ms 262144 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;

const int INF = 1e9;
const int B = 75;
const int MAXN = 3e4 + 5;

vector<pair<int, int> > d;

int dist[MAXN][B];
vector<array<int, 3> > g[MAXN][B];

signed main()
{
    //ifstream cin("input.txt");
    //ofstream cout("output.txt");
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    d.resize(m);
    vector<int> big;
    for (int i = 0; i < m; i++)
    {
        cin >> d[i].first >> d[i].second;
        if (d[i].second >= B)
        {
            big.push_back(i);
        }
    }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < B; j++)
            dist[i][j] = INF;
    for (int i = 0; i < m; i++)
    {
        if (d[i].second >= B) continue;
        g[d[i].first][0].push_back({d[i].first, d[i].second, 0});
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 1; j < B; j++)
        {
            if (i - j >= 0)
            {
                g[i][j].push_back({i - j, 0, 1});
                g[i][j].push_back({i - j, j, 1});
            }
            if (i + j < n)
            {
                g[i][j].push_back({i + j, 0, 1});
                g[i][j].push_back({i + j, j, 1});
            }
        }
    }
    for (auto& i : big)
    {
        for (int j = d[i].first, k = 0; j < n; j += d[i].second, k++)
        {
            g[d[i].first][0].push_back({j, 0, k});
        }
        for (int j = d[i].first, k = 0; j >= 0; j -= d[i].second,  k++)
        {
            g[d[i].first][0].push_back({j, 0, k});
        }
    }
    set<array<int, 3> > st;
    st.insert({0, d[0].first, 0});
    dist[d[0].first][0] = 0;
    while (!st.empty())
    {
        auto [dst, pos, pw] = *st.begin();
        st.erase(st.begin());
        if (dst > dist[pos][pw]) continue;
        for (auto& [psu, pwu, w] : g[pos][pw])
        {
            if (dist[psu][pwu] > dst + w)
            {
                st.erase({dist[psu][pwu], psu, pwu});
                dist[psu][pwu] = dst + w;
                st.insert({dist[psu][pwu], psu, pwu});
            }
        }
    }
    int mn = INF;
    for (int i = 0; i < B; i++)
        mn = min(mn, dist[d[1].first][i]);
    if (mn == INF)
        cout << -1;
    else
        cout << mn;
    return 0;
}
/*
small
(i, j) -1> (i - j, 0), (i + j, 0)
(i, 0) -0> (i, j)
(i, j) -1> (i - j, j), (i + j, j)
large
(i, 0) -1> (i + j, 0)
(i, 0) -1> (i - j, 0)
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 53076 KB Output is correct
2 Correct 25 ms 53176 KB Output is correct
3 Correct 32 ms 53136 KB Output is correct
4 Correct 30 ms 53120 KB Output is correct
5 Correct 28 ms 53172 KB Output is correct
6 Correct 26 ms 53064 KB Output is correct
7 Correct 36 ms 53244 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 53160 KB Output is correct
2 Correct 29 ms 53128 KB Output is correct
3 Correct 27 ms 53076 KB Output is correct
4 Correct 31 ms 53176 KB Output is correct
5 Correct 27 ms 53172 KB Output is correct
6 Correct 33 ms 53068 KB Output is correct
7 Correct 36 ms 53068 KB Output is correct
8 Correct 32 ms 53156 KB Output is correct
9 Correct 27 ms 53244 KB Output is correct
10 Correct 27 ms 53508 KB Output is correct
11 Correct 32 ms 53608 KB Output is correct
12 Correct 29 ms 53512 KB Output is correct
13 Correct 30 ms 53460 KB Output is correct
14 Correct 36 ms 53680 KB Output is correct
15 Correct 34 ms 53640 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 53120 KB Output is correct
2 Correct 26 ms 53076 KB Output is correct
3 Correct 26 ms 53168 KB Output is correct
4 Correct 25 ms 53100 KB Output is correct
5 Correct 29 ms 53116 KB Output is correct
6 Correct 32 ms 53068 KB Output is correct
7 Correct 39 ms 53076 KB Output is correct
8 Correct 34 ms 53152 KB Output is correct
9 Correct 32 ms 53256 KB Output is correct
10 Correct 30 ms 53396 KB Output is correct
11 Correct 37 ms 53640 KB Output is correct
12 Correct 34 ms 53444 KB Output is correct
13 Correct 30 ms 53532 KB Output is correct
14 Correct 31 ms 53664 KB Output is correct
15 Correct 29 ms 53620 KB Output is correct
16 Correct 32 ms 53920 KB Output is correct
17 Correct 67 ms 56852 KB Output is correct
18 Correct 62 ms 61616 KB Output is correct
19 Correct 44 ms 62904 KB Output is correct
20 Correct 52 ms 62932 KB Output is correct
21 Correct 34 ms 54996 KB Output is correct
22 Correct 49 ms 61732 KB Output is correct
23 Correct 42 ms 60872 KB Output is correct
24 Correct 69 ms 62572 KB Output is correct
25 Correct 59 ms 62896 KB Output is correct
26 Correct 50 ms 62852 KB Output is correct
27 Correct 46 ms 62852 KB Output is correct
28 Correct 62 ms 63052 KB Output is correct
29 Correct 76 ms 62920 KB Output is correct
30 Correct 102 ms 62820 KB Output is correct
31 Correct 72 ms 62892 KB Output is correct
32 Correct 75 ms 63000 KB Output is correct
33 Correct 87 ms 63032 KB Output is correct
34 Correct 95 ms 62988 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 53068 KB Output is correct
2 Correct 43 ms 53108 KB Output is correct
3 Correct 33 ms 53084 KB Output is correct
4 Correct 25 ms 53164 KB Output is correct
5 Correct 27 ms 53072 KB Output is correct
6 Correct 27 ms 53088 KB Output is correct
7 Correct 26 ms 53148 KB Output is correct
8 Correct 28 ms 53152 KB Output is correct
9 Correct 39 ms 53260 KB Output is correct
10 Correct 28 ms 53460 KB Output is correct
11 Correct 42 ms 53600 KB Output is correct
12 Correct 35 ms 53532 KB Output is correct
13 Correct 28 ms 53484 KB Output is correct
14 Correct 31 ms 53672 KB Output is correct
15 Correct 31 ms 53664 KB Output is correct
16 Correct 31 ms 53964 KB Output is correct
17 Correct 49 ms 56836 KB Output is correct
18 Correct 50 ms 61636 KB Output is correct
19 Correct 50 ms 62888 KB Output is correct
20 Correct 52 ms 62936 KB Output is correct
21 Correct 34 ms 54880 KB Output is correct
22 Correct 45 ms 61748 KB Output is correct
23 Correct 45 ms 60848 KB Output is correct
24 Correct 50 ms 62540 KB Output is correct
25 Correct 51 ms 62924 KB Output is correct
26 Correct 52 ms 62904 KB Output is correct
27 Correct 55 ms 62900 KB Output is correct
28 Correct 50 ms 63056 KB Output is correct
29 Correct 66 ms 62796 KB Output is correct
30 Correct 50 ms 62860 KB Output is correct
31 Correct 54 ms 62896 KB Output is correct
32 Correct 51 ms 62784 KB Output is correct
33 Correct 78 ms 63036 KB Output is correct
34 Correct 80 ms 63032 KB Output is correct
35 Correct 65 ms 62396 KB Output is correct
36 Correct 42 ms 58656 KB Output is correct
37 Correct 85 ms 65360 KB Output is correct
38 Correct 81 ms 65908 KB Output is correct
39 Correct 90 ms 66040 KB Output is correct
40 Correct 81 ms 65940 KB Output is correct
41 Correct 90 ms 66064 KB Output is correct
42 Correct 55 ms 63660 KB Output is correct
43 Correct 53 ms 63608 KB Output is correct
44 Correct 61 ms 63616 KB Output is correct
45 Correct 112 ms 69584 KB Output is correct
46 Correct 97 ms 69704 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 53080 KB Output is correct
2 Correct 25 ms 53068 KB Output is correct
3 Correct 27 ms 53088 KB Output is correct
4 Correct 25 ms 53076 KB Output is correct
5 Correct 34 ms 53076 KB Output is correct
6 Correct 25 ms 53096 KB Output is correct
7 Correct 26 ms 53140 KB Output is correct
8 Correct 31 ms 53288 KB Output is correct
9 Correct 27 ms 53248 KB Output is correct
10 Correct 33 ms 53404 KB Output is correct
11 Correct 37 ms 53580 KB Output is correct
12 Correct 34 ms 53540 KB Output is correct
13 Correct 26 ms 53440 KB Output is correct
14 Correct 30 ms 53588 KB Output is correct
15 Correct 29 ms 53564 KB Output is correct
16 Correct 30 ms 53988 KB Output is correct
17 Correct 43 ms 56792 KB Output is correct
18 Correct 48 ms 61656 KB Output is correct
19 Correct 47 ms 62820 KB Output is correct
20 Correct 66 ms 62876 KB Output is correct
21 Correct 33 ms 54996 KB Output is correct
22 Correct 64 ms 61780 KB Output is correct
23 Correct 52 ms 60960 KB Output is correct
24 Correct 61 ms 62452 KB Output is correct
25 Correct 56 ms 62936 KB Output is correct
26 Correct 58 ms 62940 KB Output is correct
27 Correct 55 ms 62864 KB Output is correct
28 Correct 56 ms 62948 KB Output is correct
29 Correct 74 ms 62836 KB Output is correct
30 Correct 58 ms 62820 KB Output is correct
31 Correct 72 ms 62900 KB Output is correct
32 Correct 65 ms 62888 KB Output is correct
33 Correct 104 ms 63032 KB Output is correct
34 Correct 88 ms 63020 KB Output is correct
35 Correct 72 ms 62340 KB Output is correct
36 Correct 53 ms 58700 KB Output is correct
37 Correct 109 ms 65196 KB Output is correct
38 Correct 110 ms 66016 KB Output is correct
39 Correct 92 ms 65948 KB Output is correct
40 Correct 94 ms 65976 KB Output is correct
41 Correct 90 ms 65964 KB Output is correct
42 Correct 55 ms 63628 KB Output is correct
43 Correct 61 ms 63636 KB Output is correct
44 Correct 60 ms 63680 KB Output is correct
45 Correct 115 ms 69684 KB Output is correct
46 Correct 105 ms 69704 KB Output is correct
47 Correct 361 ms 122932 KB Output is correct
48 Correct 336 ms 170512 KB Output is correct
49 Correct 329 ms 180736 KB Output is correct
50 Correct 365 ms 192604 KB Output is correct
51 Correct 446 ms 205968 KB Output is correct
52 Correct 502 ms 206144 KB Output is correct
53 Correct 375 ms 202416 KB Output is correct
54 Correct 337 ms 200796 KB Output is correct
55 Correct 363 ms 200768 KB Output is correct
56 Correct 392 ms 202184 KB Output is correct
57 Correct 564 ms 200956 KB Output is correct
58 Correct 354 ms 201412 KB Output is correct
59 Correct 386 ms 201524 KB Output is correct
60 Correct 410 ms 202424 KB Output is correct
61 Correct 387 ms 202044 KB Output is correct
62 Correct 430 ms 206500 KB Output is correct
63 Correct 503 ms 236372 KB Output is correct
64 Correct 534 ms 249488 KB Output is correct
65 Correct 528 ms 258260 KB Output is correct
66 Runtime error 392 ms 262144 KB Execution killed with signal 9
67 Halted 0 ms 0 KB -