oj.uz

Submission #709908

# Submission time Handle Problem Language Result Execution time Memory
709908 2023-03-14T19:09:47 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 247308 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 = 280;
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;
        if (pw > 0)
        {
            vector<array<short, 3> > to;
            if (pos - pw >= 0)
            {
                if (dist[pos - pw][pw] > dst + 1)
                {
                    st.erase({dist[pos - pw][pw], pos - pw, pw});
                    dist[pos - pw][pw] = dst + 1;
                    st.insert({dist[pos - pw][pw], pos - pw, pw});
                }
                if (dist[pos - pw][0] > dst + 1)
                {
                    st.erase({dist[pos - pw][0], pos - pw, 0});
                    dist[pos - pw][0] = dst + 1;
                    st.insert({dist[pos - pw][0], pos - pw, 0});
                }
            }
            if (pos + pw < n)
            {
                if (dist[pos + pw][pw] > dst + 1)
                {
                    st.erase({dist[pos + pw][pw], pos + pw, pw});
                    dist[pos + pw][pw] = dst + 1;
                    st.insert({dist[pos + pw][pw], pos + pw, pw});
                }
                if (dist[pos + pw][0] > dst + 1)
                {
                    st.erase({dist[pos + pw][0], pos + pw, 0});
                    dist[pos + pw][0] = dst + 1;
                    st.insert({dist[pos + pw][0], pos + pw, 0});
                }
            }
        }
        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: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 91 ms 197604 KB Output is correct
2 Correct 98 ms 197508 KB Output is correct
3 Correct 87 ms 197556 KB Output is correct
4 Correct 87 ms 197588 KB Output is correct
5 Correct 89 ms 197592 KB Output is correct
6 Correct 92 ms 197592 KB Output is correct
7 Correct 90 ms 197580 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 197608 KB Output is correct
2 Correct 90 ms 197484 KB Output is correct
3 Correct 88 ms 197692 KB Output is correct
4 Correct 88 ms 197552 KB Output is correct
5 Correct 87 ms 197528 KB Output is correct
6 Correct 91 ms 197580 KB Output is correct
7 Correct 87 ms 197608 KB Output is correct
8 Correct 87 ms 197556 KB Output is correct
9 Correct 87 ms 197676 KB Output is correct
10 Correct 88 ms 197724 KB Output is correct
11 Correct 90 ms 197824 KB Output is correct
12 Correct 90 ms 197732 KB Output is correct
13 Correct 91 ms 197720 KB Output is correct
14 Correct 91 ms 197872 KB Output is correct
15 Correct 91 ms 197840 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 197536 KB Output is correct
2 Correct 89 ms 197624 KB Output is correct
3 Correct 90 ms 197500 KB Output is correct
4 Correct 92 ms 197580 KB Output is correct
5 Correct 87 ms 197580 KB Output is correct
6 Correct 91 ms 197520 KB Output is correct
7 Correct 92 ms 197604 KB Output is correct
8 Correct 89 ms 197644 KB Output is correct
9 Correct 89 ms 197580 KB Output is correct
10 Correct 92 ms 197728 KB Output is correct
11 Correct 87 ms 197784 KB Output is correct
12 Correct 90 ms 197724 KB Output is correct
13 Correct 89 ms 197712 KB Output is correct
14 Correct 90 ms 197764 KB Output is correct
15 Correct 92 ms 197880 KB Output is correct
16 Correct 89 ms 197776 KB Output is correct
17 Correct 92 ms 198480 KB Output is correct
18 Correct 93 ms 199528 KB Output is correct
19 Correct 97 ms 199780 KB Output is correct
20 Correct 104 ms 199824 KB Output is correct
21 Correct 90 ms 197964 KB Output is correct
22 Correct 91 ms 199584 KB Output is correct
23 Correct 93 ms 199344 KB Output is correct
24 Correct 91 ms 199756 KB Output is correct
25 Correct 92 ms 199812 KB Output is correct
26 Correct 91 ms 199816 KB Output is correct
27 Correct 92 ms 199756 KB Output is correct
28 Correct 95 ms 199872 KB Output is correct
29 Correct 103 ms 199784 KB Output is correct
30 Correct 96 ms 199876 KB Output is correct
31 Correct 100 ms 199848 KB Output is correct
32 Correct 95 ms 199752 KB Output is correct
33 Correct 112 ms 199896 KB Output is correct
34 Correct 114 ms 199992 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 197612 KB Output is correct
2 Correct 93 ms 197532 KB Output is correct
3 Correct 90 ms 197540 KB Output is correct
4 Correct 91 ms 197580 KB Output is correct
5 Correct 93 ms 197572 KB Output is correct
6 Correct 94 ms 197588 KB Output is correct
7 Correct 91 ms 197528 KB Output is correct
8 Correct 93 ms 197580 KB Output is correct
9 Correct 111 ms 197604 KB Output is correct
10 Correct 95 ms 197708 KB Output is correct
11 Correct 90 ms 197792 KB Output is correct
12 Correct 89 ms 197680 KB Output is correct
13 Correct 109 ms 197748 KB Output is correct
14 Correct 96 ms 197868 KB Output is correct
15 Correct 91 ms 197816 KB Output is correct
16 Correct 89 ms 197752 KB Output is correct
17 Correct 98 ms 198568 KB Output is correct
18 Correct 106 ms 199508 KB Output is correct
19 Correct 92 ms 199768 KB Output is correct
20 Correct 109 ms 199832 KB Output is correct
21 Correct 92 ms 198056 KB Output is correct
22 Correct 91 ms 199548 KB Output is correct
23 Correct 127 ms 199368 KB Output is correct
24 Correct 98 ms 199684 KB Output is correct
25 Correct 95 ms 199764 KB Output is correct
26 Correct 95 ms 199756 KB Output is correct
27 Correct 96 ms 199772 KB Output is correct
28 Correct 95 ms 199884 KB Output is correct
29 Correct 110 ms 199780 KB Output is correct
30 Correct 93 ms 199812 KB Output is correct
31 Correct 96 ms 199852 KB Output is correct
32 Correct 96 ms 199788 KB Output is correct
33 Correct 112 ms 199884 KB Output is correct
34 Correct 125 ms 200012 KB Output is correct
35 Correct 114 ms 200404 KB Output is correct
36 Correct 96 ms 198996 KB Output is correct
37 Correct 159 ms 201108 KB Output is correct
38 Correct 152 ms 201316 KB Output is correct
39 Correct 160 ms 201400 KB Output is correct
40 Correct 131 ms 201404 KB Output is correct
41 Correct 133 ms 201380 KB Output is correct
42 Correct 111 ms 200316 KB Output is correct
43 Correct 109 ms 200328 KB Output is correct
44 Correct 119 ms 200384 KB Output is correct
45 Correct 228 ms 202212 KB Output is correct
46 Correct 235 ms 202208 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 197492 KB Output is correct
2 Correct 108 ms 197600 KB Output is correct
3 Correct 101 ms 197496 KB Output is correct
4 Correct 98 ms 197736 KB Output is correct
5 Correct 102 ms 197596 KB Output is correct
6 Correct 98 ms 197620 KB Output is correct
7 Correct 96 ms 197556 KB Output is correct
8 Correct 96 ms 197628 KB Output is correct
9 Correct 108 ms 197636 KB Output is correct
10 Correct 101 ms 197708 KB Output is correct
11 Correct 105 ms 197792 KB Output is correct
12 Correct 100 ms 197760 KB Output is correct
13 Correct 99 ms 197640 KB Output is correct
14 Correct 112 ms 197864 KB Output is correct
15 Correct 106 ms 197828 KB Output is correct
16 Correct 107 ms 197904 KB Output is correct
17 Correct 109 ms 198528 KB Output is correct
18 Correct 110 ms 199504 KB Output is correct
19 Correct 110 ms 199908 KB Output is correct
20 Correct 114 ms 199840 KB Output is correct
21 Correct 101 ms 198156 KB Output is correct
22 Correct 103 ms 199552 KB Output is correct
23 Correct 106 ms 199308 KB Output is correct
24 Correct 104 ms 199880 KB Output is correct
25 Correct 103 ms 199980 KB Output is correct
26 Correct 130 ms 199732 KB Output is correct
27 Correct 106 ms 199756 KB Output is correct
28 Correct 102 ms 199868 KB Output is correct
29 Correct 122 ms 199860 KB Output is correct
30 Correct 110 ms 199832 KB Output is correct
31 Correct 125 ms 199816 KB Output is correct
32 Correct 111 ms 199784 KB Output is correct
33 Correct 125 ms 199880 KB Output is correct
34 Correct 128 ms 199960 KB Output is correct
35 Correct 125 ms 200308 KB Output is correct
36 Correct 108 ms 198988 KB Output is correct
37 Correct 144 ms 201096 KB Output is correct
38 Correct 145 ms 201404 KB Output is correct
39 Correct 138 ms 201384 KB Output is correct
40 Correct 148 ms 201420 KB Output is correct
41 Correct 164 ms 201408 KB Output is correct
42 Correct 104 ms 200356 KB Output is correct
43 Correct 116 ms 200352 KB Output is correct
44 Correct 113 ms 200288 KB Output is correct
45 Correct 242 ms 202204 KB Output is correct
46 Correct 264 ms 202192 KB Output is correct
47 Correct 304 ms 214740 KB Output is correct
48 Correct 128 ms 224416 KB Output is correct
49 Correct 117 ms 226724 KB Output is correct
50 Correct 124 ms 229096 KB Output is correct
51 Correct 209 ms 233156 KB Output is correct
52 Correct 212 ms 233236 KB Output is correct
53 Correct 141 ms 231460 KB Output is correct
54 Correct 119 ms 230404 KB Output is correct
55 Correct 120 ms 230476 KB Output is correct
56 Correct 136 ms 231640 KB Output is correct
57 Correct 239 ms 230620 KB Output is correct
58 Correct 128 ms 231040 KB Output is correct
59 Correct 132 ms 231040 KB Output is correct
60 Correct 141 ms 231044 KB Output is correct
61 Correct 129 ms 231036 KB Output is correct
62 Correct 195 ms 233092 KB Output is correct
63 Correct 395 ms 246924 KB Output is correct
64 Correct 546 ms 247308 KB Output is correct
65 Execution timed out 1086 ms 241084 KB Time limit exceeded
66 Halted 0 ms 0 KB -