oj.uz

답안 #709916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709916 2023-03-14T19:33:51 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 40112 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 = 315;
const int MAXN = 3e4 + 5;

vector<pair<int, int> > d;

int dist[MAXN][B];
vector<short> sm[MAXN];
vector<short> bg[MAXN];

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);
            bg[d[i].first].push_back(d[i].second);
        }
        else
        {
            sm[d[i].first].push_back(d[i].second);
        }
    }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < B; j++)
            dist[i][j] = INF;
    priority_queue<array<int, 3> > st;
    st.push({0, d[0].first, 0});
    dist[d[0].first][0] = 0;
    while (!st.empty())
    {
        auto [dst, pos, pw] = st.top();
        dst = -dst;
        st.pop();
        if (dst > dist[pos][pw]) continue;
        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.push({-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.push({-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.push({-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.push({-dist[pos + pw][0], pos + pw, 0});
                }
            }
            continue;
        }
        for (auto& mv : bg[pos])
        {
            for (int j = pos, k = 0; j < n; j += mv, k++)
            {
                if (dist[j][0] > dst + k)
                {
                    dist[j][0] = dst + k;
                    st.push({-dist[j][0], j, 0});
                }
            }
            for (int j = pos, k = 0; j >= 0; j -= mv, k++)
            {
                if (dist[j][0] > dst + k)
                {
                    dist[j][0] = dst + k;
                    st.push({-dist[j][0], j, 0});
                }
            }
        }
        for (auto& mv : sm[pos])
        {
            if (dist[pos][mv] > dst + 0)
            {
                dist[pos][mv] = dst + 0;
                st.push({-dist[pos][mv], pos, mv});
            }
        }
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1624 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 2 ms 1748 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 2 ms 1620 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 2 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 2 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 4 ms 2648 KB Output is correct
18 Correct 3 ms 3924 KB Output is correct
19 Correct 3 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 2132 KB Output is correct
22 Correct 2 ms 3924 KB Output is correct
23 Correct 3 ms 3756 KB Output is correct
24 Correct 3 ms 4052 KB Output is correct
25 Correct 3 ms 4180 KB Output is correct
26 Correct 3 ms 4180 KB Output is correct
27 Correct 2 ms 4180 KB Output is correct
28 Correct 3 ms 4180 KB Output is correct
29 Correct 9 ms 4236 KB Output is correct
30 Correct 3 ms 4180 KB Output is correct
31 Correct 5 ms 4180 KB Output is correct
32 Correct 4 ms 4180 KB Output is correct
33 Correct 15 ms 4300 KB Output is correct
34 Correct 15 ms 4308 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1728 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1752 KB Output is correct
10 Correct 2 ms 1752 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 4 ms 2648 KB Output is correct
18 Correct 2 ms 3928 KB Output is correct
19 Correct 2 ms 4184 KB Output is correct
20 Correct 2 ms 4188 KB Output is correct
21 Correct 1 ms 2144 KB Output is correct
22 Correct 2 ms 3936 KB Output is correct
23 Correct 3 ms 3692 KB Output is correct
24 Correct 4 ms 4168 KB Output is correct
25 Correct 3 ms 4180 KB Output is correct
26 Correct 3 ms 4180 KB Output is correct
27 Correct 3 ms 4180 KB Output is correct
28 Correct 3 ms 4180 KB Output is correct
29 Correct 11 ms 4240 KB Output is correct
30 Correct 4 ms 4188 KB Output is correct
31 Correct 6 ms 4180 KB Output is correct
32 Correct 4 ms 4180 KB Output is correct
33 Correct 16 ms 4180 KB Output is correct
34 Correct 16 ms 4180 KB Output is correct
35 Correct 17 ms 4052 KB Output is correct
36 Correct 5 ms 3156 KB Output is correct
37 Correct 28 ms 4688 KB Output is correct
38 Correct 24 ms 4948 KB Output is correct
39 Correct 26 ms 4948 KB Output is correct
40 Correct 23 ms 4940 KB Output is correct
41 Correct 22 ms 4936 KB Output is correct
42 Correct 6 ms 4564 KB Output is correct
43 Correct 5 ms 4564 KB Output is correct
44 Correct 6 ms 4564 KB Output is correct
45 Correct 83 ms 5040 KB Output is correct
46 Correct 79 ms 5016 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1620 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 2 ms 3924 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 3 ms 4180 KB Output is correct
21 Correct 2 ms 2132 KB Output is correct
22 Correct 2 ms 3936 KB Output is correct
23 Correct 3 ms 3668 KB Output is correct
24 Correct 3 ms 4052 KB Output is correct
25 Correct 3 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 3 ms 4180 KB Output is correct
28 Correct 4 ms 4180 KB Output is correct
29 Correct 9 ms 4228 KB Output is correct
30 Correct 4 ms 4180 KB Output is correct
31 Correct 6 ms 4180 KB Output is correct
32 Correct 5 ms 4180 KB Output is correct
33 Correct 15 ms 4308 KB Output is correct
34 Correct 17 ms 4308 KB Output is correct
35 Correct 15 ms 4132 KB Output is correct
36 Correct 4 ms 3156 KB Output is correct
37 Correct 24 ms 4716 KB Output is correct
38 Correct 22 ms 4948 KB Output is correct
39 Correct 22 ms 4964 KB Output is correct
40 Correct 22 ms 4948 KB Output is correct
41 Correct 23 ms 4932 KB Output is correct
42 Correct 6 ms 4536 KB Output is correct
43 Correct 6 ms 4564 KB Output is correct
44 Correct 6 ms 4564 KB Output is correct
45 Correct 79 ms 5040 KB Output is correct
46 Correct 80 ms 5012 KB Output is correct
47 Correct 96 ms 18068 KB Output is correct
48 Correct 18 ms 30972 KB Output is correct
49 Correct 20 ms 33700 KB Output is correct
50 Correct 20 ms 36664 KB Output is correct
51 Correct 68 ms 40084 KB Output is correct
52 Correct 74 ms 40112 KB Output is correct
53 Correct 32 ms 39552 KB Output is correct
54 Correct 21 ms 38700 KB Output is correct
55 Correct 21 ms 38680 KB Output is correct
56 Correct 28 ms 39892 KB Output is correct
57 Correct 88 ms 38868 KB Output is correct
58 Correct 24 ms 38996 KB Output is correct
59 Correct 28 ms 38972 KB Output is correct
60 Correct 36 ms 38996 KB Output is correct
61 Correct 30 ms 39080 KB Output is correct
62 Correct 55 ms 40008 KB Output is correct
63 Correct 174 ms 40080 KB Output is correct
64 Correct 293 ms 40052 KB Output is correct
65 Correct 741 ms 39956 KB Output is correct
66 Execution timed out 1081 ms 39572 KB Time limit exceeded
67 Halted 0 ms 0 KB -