oj.uz

답안 #709911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709911 2023-03-14T19:12:09 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 258960 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 = 295;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 208052 KB Output is correct
2 Correct 95 ms 208056 KB Output is correct
3 Correct 95 ms 208072 KB Output is correct
4 Correct 100 ms 208164 KB Output is correct
5 Correct 100 ms 208180 KB Output is correct
6 Correct 94 ms 208152 KB Output is correct
7 Correct 106 ms 208176 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 208076 KB Output is correct
2 Correct 96 ms 208164 KB Output is correct
3 Correct 98 ms 208072 KB Output is correct
4 Correct 150 ms 208132 KB Output is correct
5 Correct 103 ms 208076 KB Output is correct
6 Correct 97 ms 208180 KB Output is correct
7 Correct 95 ms 208108 KB Output is correct
8 Correct 104 ms 208172 KB Output is correct
9 Correct 99 ms 208192 KB Output is correct
10 Correct 96 ms 208212 KB Output is correct
11 Correct 103 ms 208380 KB Output is correct
12 Correct 96 ms 208280 KB Output is correct
13 Correct 99 ms 208236 KB Output is correct
14 Correct 114 ms 208500 KB Output is correct
15 Correct 108 ms 208412 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 208076 KB Output is correct
2 Correct 101 ms 208112 KB Output is correct
3 Correct 99 ms 208148 KB Output is correct
4 Correct 99 ms 208076 KB Output is correct
5 Correct 97 ms 208104 KB Output is correct
6 Correct 101 ms 208080 KB Output is correct
7 Correct 111 ms 208204 KB Output is correct
8 Correct 95 ms 208128 KB Output is correct
9 Correct 95 ms 208136 KB Output is correct
10 Correct 108 ms 208308 KB Output is correct
11 Correct 102 ms 208368 KB Output is correct
12 Correct 102 ms 208204 KB Output is correct
13 Correct 97 ms 208288 KB Output is correct
14 Correct 98 ms 208420 KB Output is correct
15 Correct 96 ms 208360 KB Output is correct
16 Correct 98 ms 208420 KB Output is correct
17 Correct 112 ms 209052 KB Output is correct
18 Correct 98 ms 210236 KB Output is correct
19 Correct 106 ms 210408 KB Output is correct
20 Correct 108 ms 210532 KB Output is correct
21 Correct 106 ms 208580 KB Output is correct
22 Correct 101 ms 210180 KB Output is correct
23 Correct 95 ms 210004 KB Output is correct
24 Correct 102 ms 210404 KB Output is correct
25 Correct 98 ms 210520 KB Output is correct
26 Correct 96 ms 210508 KB Output is correct
27 Correct 100 ms 210440 KB Output is correct
28 Correct 102 ms 210572 KB Output is correct
29 Correct 107 ms 210520 KB Output is correct
30 Correct 97 ms 210384 KB Output is correct
31 Correct 104 ms 210516 KB Output is correct
32 Correct 118 ms 210488 KB Output is correct
33 Correct 133 ms 210580 KB Output is correct
34 Correct 119 ms 210652 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 208160 KB Output is correct
2 Correct 102 ms 208068 KB Output is correct
3 Correct 103 ms 208108 KB Output is correct
4 Correct 94 ms 208120 KB Output is correct
5 Correct 98 ms 208208 KB Output is correct
6 Correct 103 ms 208184 KB Output is correct
7 Correct 106 ms 208128 KB Output is correct
8 Correct 95 ms 208188 KB Output is correct
9 Correct 94 ms 208120 KB Output is correct
10 Correct 96 ms 208228 KB Output is correct
11 Correct 100 ms 208392 KB Output is correct
12 Correct 106 ms 208344 KB Output is correct
13 Correct 98 ms 208204 KB Output is correct
14 Correct 99 ms 208416 KB Output is correct
15 Correct 101 ms 208432 KB Output is correct
16 Correct 99 ms 208420 KB Output is correct
17 Correct 117 ms 209228 KB Output is correct
18 Correct 97 ms 210124 KB Output is correct
19 Correct 97 ms 210504 KB Output is correct
20 Correct 104 ms 210552 KB Output is correct
21 Correct 113 ms 208660 KB Output is correct
22 Correct 100 ms 210224 KB Output is correct
23 Correct 96 ms 209972 KB Output is correct
24 Correct 97 ms 210488 KB Output is correct
25 Correct 99 ms 210504 KB Output is correct
26 Correct 105 ms 210412 KB Output is correct
27 Correct 102 ms 210544 KB Output is correct
28 Correct 99 ms 210480 KB Output is correct
29 Correct 109 ms 210552 KB Output is correct
30 Correct 114 ms 210492 KB Output is correct
31 Correct 116 ms 210520 KB Output is correct
32 Correct 105 ms 210524 KB Output is correct
33 Correct 120 ms 210628 KB Output is correct
34 Correct 119 ms 210644 KB Output is correct
35 Correct 126 ms 210980 KB Output is correct
36 Correct 101 ms 209596 KB Output is correct
37 Correct 140 ms 211788 KB Output is correct
38 Correct 136 ms 212044 KB Output is correct
39 Correct 142 ms 212044 KB Output is correct
40 Correct 139 ms 212056 KB Output is correct
41 Correct 138 ms 212104 KB Output is correct
42 Correct 109 ms 211004 KB Output is correct
43 Correct 108 ms 211008 KB Output is correct
44 Correct 102 ms 211064 KB Output is correct
45 Correct 219 ms 212892 KB Output is correct
46 Correct 225 ms 212888 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 208076 KB Output is correct
2 Correct 96 ms 208172 KB Output is correct
3 Correct 108 ms 208172 KB Output is correct
4 Correct 114 ms 208116 KB Output is correct
5 Correct 113 ms 208076 KB Output is correct
6 Correct 105 ms 208156 KB Output is correct
7 Correct 108 ms 208168 KB Output is correct
8 Correct 118 ms 208204 KB Output is correct
9 Correct 110 ms 208236 KB Output is correct
10 Correct 99 ms 208300 KB Output is correct
11 Correct 94 ms 208404 KB Output is correct
12 Correct 95 ms 208268 KB Output is correct
13 Correct 101 ms 208296 KB Output is correct
14 Correct 119 ms 208440 KB Output is correct
15 Correct 103 ms 208556 KB Output is correct
16 Correct 95 ms 208416 KB Output is correct
17 Correct 110 ms 209064 KB Output is correct
18 Correct 108 ms 210192 KB Output is correct
19 Correct 107 ms 210424 KB Output is correct
20 Correct 97 ms 210516 KB Output is correct
21 Correct 108 ms 208588 KB Output is correct
22 Correct 102 ms 210252 KB Output is correct
23 Correct 99 ms 210068 KB Output is correct
24 Correct 102 ms 210448 KB Output is correct
25 Correct 108 ms 210624 KB Output is correct
26 Correct 107 ms 210552 KB Output is correct
27 Correct 116 ms 210468 KB Output is correct
28 Correct 111 ms 210580 KB Output is correct
29 Correct 113 ms 210528 KB Output is correct
30 Correct 98 ms 210564 KB Output is correct
31 Correct 120 ms 210508 KB Output is correct
32 Correct 123 ms 210440 KB Output is correct
33 Correct 120 ms 210628 KB Output is correct
34 Correct 119 ms 210644 KB Output is correct
35 Correct 127 ms 211012 KB Output is correct
36 Correct 100 ms 209624 KB Output is correct
37 Correct 140 ms 211812 KB Output is correct
38 Correct 134 ms 211996 KB Output is correct
39 Correct 170 ms 212060 KB Output is correct
40 Correct 136 ms 212168 KB Output is correct
41 Correct 136 ms 212056 KB Output is correct
42 Correct 110 ms 211000 KB Output is correct
43 Correct 126 ms 211036 KB Output is correct
44 Correct 100 ms 210992 KB Output is correct
45 Correct 223 ms 212896 KB Output is correct
46 Correct 227 ms 212824 KB Output is correct
47 Correct 261 ms 225892 KB Output is correct
48 Correct 123 ms 236372 KB Output is correct
49 Correct 135 ms 238676 KB Output is correct
50 Correct 117 ms 241292 KB Output is correct
51 Correct 190 ms 245440 KB Output is correct
52 Correct 205 ms 245584 KB Output is correct
53 Correct 131 ms 243792 KB Output is correct
54 Correct 114 ms 242792 KB Output is correct
55 Correct 115 ms 242788 KB Output is correct
56 Correct 125 ms 243916 KB Output is correct
57 Correct 333 ms 243080 KB Output is correct
58 Correct 124 ms 243348 KB Output is correct
59 Correct 130 ms 243368 KB Output is correct
60 Correct 146 ms 243468 KB Output is correct
61 Correct 135 ms 243320 KB Output is correct
62 Correct 193 ms 245336 KB Output is correct
63 Correct 359 ms 257900 KB Output is correct
64 Correct 544 ms 258960 KB Output is correct
65 Execution timed out 1085 ms 252620 KB Time limit exceeded
66 Halted 0 ms 0 KB -