oj.uz

Submission #709890

# Submission time Handle Problem Language Result Execution time Memory
709890 2023-03-14T18:38:09 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 644 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 = 170;
const int MAXN = 3e4 + 5;

vector<pair<int, int> > d;

int dist[MAXN][B];
vector<array<short, 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)
*/

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:43:42: warning: narrowing conversion of 'd.std::vector<std::pair<int, int> >::operator[](((std::vector<std::pair<int, int> >::size_type)i)).std::pair<int, int>::first' from 'int' to 'short int' [-Wnarrowing]
   43 |         g[d[i].first][0].push_back({d[i].first, d[i].second, 0});
skyscraper.cpp:43:54: warning: narrowing conversion of 'd.std::vector<std::pair<int, int> >::operator[](((std::vector<std::pair<int, int> >::size_type)i)).std::pair<int, int>::second' from 'int' to 'short int' [-Wnarrowing]
   43 |         g[d[i].first][0].push_back({d[i].first, d[i].second, 0});
skyscraper.cpp:51:38: warning: narrowing conversion of '(i - j)' from 'int' to 'short int' [-Wnarrowing]
   51 |                 g[i][j].push_back({i - j, 0, 1});
      |                                    ~~^~~
skyscraper.cpp:52:38: warning: narrowing conversion of '(i - j)' from 'int' to 'short int' [-Wnarrowing]
   52 |                 g[i][j].push_back({i - j, j, 1});
      |                                    ~~^~~
skyscraper.cpp:52:43: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   52 |                 g[i][j].push_back({i - j, j, 1});
      |                                           ^
skyscraper.cpp:56:38: warning: narrowing conversion of '(i + j)' from 'int' to 'short int' [-Wnarrowing]
   56 |                 g[i][j].push_back({i + j, 0, 1});
      |                                    ~~^~~
skyscraper.cpp:57:38: warning: narrowing conversion of '(i + j)' from 'int' to 'short int' [-Wnarrowing]
   57 |                 g[i][j].push_back({i + j, j, 1});
      |                                    ~~^~~
skyscraper.cpp:57:43: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   57 |                 g[i][j].push_back({i + j, j, 1});
      |                                           ^
skyscraper.cpp:65:41: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   65 |             g[d[i].first][0].push_back({j, 0, k});
      |                                         ^
skyscraper.cpp:65:47: warning: narrowing conversion of 'k' from 'int' to 'short int' [-Wnarrowing]
   65 |             g[d[i].first][0].push_back({j, 0, k});
      |                                               ^
skyscraper.cpp:69:41: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   69 |             g[d[i].first][0].push_back({j, 0, k});
      |                                         ^
skyscraper.cpp:69:47: warning: narrowing conversion of 'k' from 'int' to 'short int' [-Wnarrowing]
   69 |             g[d[i].first][0].push_back({j, 0, k});
      |                                               ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 119996 KB Output is correct
2 Correct 56 ms 119988 KB Output is correct
3 Correct 59 ms 120100 KB Output is correct
4 Correct 56 ms 120080 KB Output is correct
5 Correct 56 ms 120108 KB Output is correct
6 Correct 57 ms 119992 KB Output is correct
7 Correct 58 ms 120092 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 120040 KB Output is correct
2 Correct 56 ms 120012 KB Output is correct
3 Correct 56 ms 120096 KB Output is correct
4 Correct 55 ms 120104 KB Output is correct
5 Correct 57 ms 120004 KB Output is correct
6 Correct 57 ms 120096 KB Output is correct
7 Correct 57 ms 120012 KB Output is correct
8 Correct 57 ms 120072 KB Output is correct
9 Correct 56 ms 120160 KB Output is correct
10 Correct 58 ms 120396 KB Output is correct
11 Correct 59 ms 120448 KB Output is correct
12 Correct 57 ms 120356 KB Output is correct
13 Correct 57 ms 120436 KB Output is correct
14 Correct 58 ms 120472 KB Output is correct
15 Correct 61 ms 120552 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 120036 KB Output is correct
2 Correct 61 ms 120012 KB Output is correct
3 Correct 55 ms 120072 KB Output is correct
4 Correct 54 ms 120100 KB Output is correct
5 Correct 56 ms 120032 KB Output is correct
6 Correct 58 ms 120024 KB Output is correct
7 Correct 59 ms 120012 KB Output is correct
8 Correct 56 ms 120036 KB Output is correct
9 Correct 55 ms 120220 KB Output is correct
10 Correct 60 ms 120396 KB Output is correct
11 Correct 59 ms 120484 KB Output is correct
12 Correct 70 ms 120332 KB Output is correct
13 Correct 66 ms 120432 KB Output is correct
14 Correct 57 ms 120560 KB Output is correct
15 Correct 56 ms 120520 KB Output is correct
16 Correct 58 ms 121036 KB Output is correct
17 Correct 74 ms 124628 KB Output is correct
18 Correct 91 ms 130452 KB Output is correct
19 Correct 95 ms 132024 KB Output is correct
20 Correct 91 ms 132096 KB Output is correct
21 Correct 62 ms 122444 KB Output is correct
22 Correct 87 ms 130748 KB Output is correct
23 Correct 90 ms 129656 KB Output is correct
24 Correct 99 ms 131472 KB Output is correct
25 Correct 97 ms 132056 KB Output is correct
26 Correct 92 ms 131984 KB Output is correct
27 Correct 119 ms 132000 KB Output is correct
28 Correct 98 ms 132084 KB Output is correct
29 Correct 113 ms 132080 KB Output is correct
30 Correct 96 ms 132052 KB Output is correct
31 Correct 100 ms 131956 KB Output is correct
32 Correct 96 ms 132052 KB Output is correct
33 Correct 119 ms 132160 KB Output is correct
34 Correct 120 ms 132100 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 120020 KB Output is correct
2 Correct 62 ms 120012 KB Output is correct
3 Correct 55 ms 120012 KB Output is correct
4 Correct 67 ms 120076 KB Output is correct
5 Correct 55 ms 120012 KB Output is correct
6 Correct 55 ms 119980 KB Output is correct
7 Correct 54 ms 120060 KB Output is correct
8 Correct 56 ms 120224 KB Output is correct
9 Correct 55 ms 120220 KB Output is correct
10 Correct 56 ms 120328 KB Output is correct
11 Correct 57 ms 120448 KB Output is correct
12 Correct 56 ms 120396 KB Output is correct
13 Correct 56 ms 120508 KB Output is correct
14 Correct 58 ms 120524 KB Output is correct
15 Correct 57 ms 120520 KB Output is correct
16 Correct 59 ms 121164 KB Output is correct
17 Correct 76 ms 124580 KB Output is correct
18 Correct 86 ms 130536 KB Output is correct
19 Correct 90 ms 132000 KB Output is correct
20 Correct 100 ms 132076 KB Output is correct
21 Correct 65 ms 122492 KB Output is correct
22 Correct 92 ms 130708 KB Output is correct
23 Correct 91 ms 129588 KB Output is correct
24 Correct 99 ms 131556 KB Output is correct
25 Correct 96 ms 132204 KB Output is correct
26 Correct 96 ms 132172 KB Output is correct
27 Correct 94 ms 131960 KB Output is correct
28 Correct 96 ms 132128 KB Output is correct
29 Correct 109 ms 132044 KB Output is correct
30 Correct 103 ms 131940 KB Output is correct
31 Correct 106 ms 131988 KB Output is correct
32 Correct 98 ms 131976 KB Output is correct
33 Correct 121 ms 132184 KB Output is correct
34 Correct 135 ms 132176 KB Output is correct
35 Correct 136 ms 129968 KB Output is correct
36 Correct 95 ms 126840 KB Output is correct
37 Correct 137 ms 133164 KB Output is correct
38 Correct 201 ms 133660 KB Output is correct
39 Correct 151 ms 133736 KB Output is correct
40 Correct 145 ms 133708 KB Output is correct
41 Correct 138 ms 133648 KB Output is correct
42 Correct 99 ms 132492 KB Output is correct
43 Correct 111 ms 132528 KB Output is correct
44 Correct 105 ms 132608 KB Output is correct
45 Correct 194 ms 134728 KB Output is correct
46 Correct 212 ms 134772 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 120080 KB Output is correct
2 Correct 62 ms 120124 KB Output is correct
3 Correct 66 ms 120044 KB Output is correct
4 Correct 62 ms 120004 KB Output is correct
5 Correct 63 ms 120052 KB Output is correct
6 Correct 64 ms 120092 KB Output is correct
7 Correct 64 ms 120096 KB Output is correct
8 Correct 69 ms 120152 KB Output is correct
9 Correct 62 ms 120096 KB Output is correct
10 Correct 66 ms 120360 KB Output is correct
11 Correct 73 ms 120500 KB Output is correct
12 Correct 68 ms 120404 KB Output is correct
13 Correct 70 ms 120452 KB Output is correct
14 Correct 75 ms 120524 KB Output is correct
15 Correct 65 ms 120560 KB Output is correct
16 Correct 66 ms 121160 KB Output is correct
17 Correct 83 ms 124580 KB Output is correct
18 Correct 98 ms 130560 KB Output is correct
19 Correct 105 ms 132044 KB Output is correct
20 Correct 107 ms 132100 KB Output is correct
21 Correct 71 ms 122376 KB Output is correct
22 Correct 92 ms 130640 KB Output is correct
23 Correct 90 ms 129616 KB Output is correct
24 Correct 110 ms 131516 KB Output is correct
25 Correct 107 ms 132000 KB Output is correct
26 Correct 107 ms 132060 KB Output is correct
27 Correct 118 ms 132008 KB Output is correct
28 Correct 108 ms 132016 KB Output is correct
29 Correct 129 ms 132080 KB Output is correct
30 Correct 119 ms 131988 KB Output is correct
31 Correct 117 ms 132124 KB Output is correct
32 Correct 112 ms 132068 KB Output is correct
33 Correct 139 ms 132184 KB Output is correct
34 Correct 135 ms 132076 KB Output is correct
35 Correct 167 ms 129936 KB Output is correct
36 Correct 105 ms 126812 KB Output is correct
37 Correct 204 ms 133136 KB Output is correct
38 Correct 189 ms 133688 KB Output is correct
39 Correct 179 ms 133680 KB Output is correct
40 Correct 182 ms 133648 KB Output is correct
41 Correct 148 ms 133736 KB Output is correct
42 Correct 109 ms 132464 KB Output is correct
43 Correct 108 ms 132348 KB Output is correct
44 Correct 107 ms 132392 KB Output is correct
45 Correct 202 ms 134676 KB Output is correct
46 Correct 197 ms 134644 KB Output is correct
47 Correct 644 ms 197740 KB Output is correct
48 Correct 602 ms 259868 KB Output is correct
49 Runtime error 491 ms 262144 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -