oj.uz

답안 #709918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709918 2023-03-14T19:35:04 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 61780 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 = 500;
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 1620 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 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

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 1 ms 1748 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 2 ms 1876 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 2004 KB Output is correct
15 Correct 2 ms 2004 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1648 KB Output is correct
4 Correct 1 ms 1748 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 1876 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 2004 KB Output is correct
15 Correct 2 ms 2004 KB Output is correct
16 Correct 1 ms 2132 KB Output is correct
17 Correct 4 ms 3156 KB Output is correct
18 Correct 3 ms 5204 KB Output is correct
19 Correct 3 ms 5588 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 5204 KB Output is correct
23 Correct 4 ms 4820 KB Output is correct
24 Correct 5 ms 5460 KB Output is correct
25 Correct 4 ms 5716 KB Output is correct
26 Correct 3 ms 5588 KB Output is correct
27 Correct 3 ms 5588 KB Output is correct
28 Correct 4 ms 5716 KB Output is correct
29 Correct 10 ms 5688 KB Output is correct
30 Correct 4 ms 5588 KB Output is correct
31 Correct 6 ms 5588 KB Output is correct
32 Correct 5 ms 5588 KB Output is correct
33 Correct 16 ms 5716 KB Output is correct
34 Correct 17 ms 5760 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 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 1876 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 2004 KB Output is correct
15 Correct 2 ms 2004 KB Output is correct
16 Correct 1 ms 2132 KB Output is correct
17 Correct 4 ms 3156 KB Output is correct
18 Correct 3 ms 5204 KB Output is correct
19 Correct 3 ms 5588 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 2 ms 5204 KB Output is correct
23 Correct 3 ms 4820 KB Output is correct
24 Correct 5 ms 5460 KB Output is correct
25 Correct 3 ms 5716 KB Output is correct
26 Correct 3 ms 5588 KB Output is correct
27 Correct 3 ms 5588 KB Output is correct
28 Correct 4 ms 5716 KB Output is correct
29 Correct 9 ms 5660 KB Output is correct
30 Correct 5 ms 5656 KB Output is correct
31 Correct 6 ms 5688 KB Output is correct
32 Correct 5 ms 5588 KB Output is correct
33 Correct 16 ms 5716 KB Output is correct
34 Correct 16 ms 5752 KB Output is correct
35 Correct 18 ms 5204 KB Output is correct
36 Correct 5 ms 3924 KB Output is correct
37 Correct 29 ms 6188 KB Output is correct
38 Correct 26 ms 6408 KB Output is correct
39 Correct 28 ms 6420 KB Output is correct
40 Correct 28 ms 6484 KB Output is correct
41 Correct 27 ms 6484 KB Output is correct
42 Correct 8 ms 5972 KB Output is correct
43 Correct 6 ms 5972 KB Output is correct
44 Correct 7 ms 5932 KB Output is correct
45 Correct 79 ms 6476 KB Output is correct
46 Correct 79 ms 6496 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 2 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 1876 KB Output is correct
11 Correct 2 ms 2004 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 2004 KB Output is correct
15 Correct 3 ms 2004 KB Output is correct
16 Correct 1 ms 2132 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 2 ms 5076 KB Output is correct
19 Correct 3 ms 5588 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 5204 KB Output is correct
23 Correct 3 ms 4820 KB Output is correct
24 Correct 4 ms 5460 KB Output is correct
25 Correct 3 ms 5716 KB Output is correct
26 Correct 3 ms 5588 KB Output is correct
27 Correct 3 ms 5640 KB Output is correct
28 Correct 4 ms 5716 KB Output is correct
29 Correct 10 ms 5688 KB Output is correct
30 Correct 5 ms 5588 KB Output is correct
31 Correct 6 ms 5588 KB Output is correct
32 Correct 5 ms 5588 KB Output is correct
33 Correct 19 ms 5760 KB Output is correct
34 Correct 17 ms 5716 KB Output is correct
35 Correct 18 ms 5204 KB Output is correct
36 Correct 4 ms 3924 KB Output is correct
37 Correct 29 ms 6164 KB Output is correct
38 Correct 29 ms 6440 KB Output is correct
39 Correct 25 ms 6472 KB Output is correct
40 Correct 25 ms 6484 KB Output is correct
41 Correct 28 ms 6480 KB Output is correct
42 Correct 7 ms 6100 KB Output is correct
43 Correct 7 ms 5972 KB Output is correct
44 Correct 6 ms 5972 KB Output is correct
45 Correct 78 ms 6468 KB Output is correct
46 Correct 80 ms 6480 KB Output is correct
47 Correct 116 ms 27052 KB Output is correct
48 Correct 26 ms 47868 KB Output is correct
49 Correct 25 ms 52112 KB Output is correct
50 Correct 26 ms 56816 KB Output is correct
51 Correct 76 ms 61692 KB Output is correct
52 Correct 72 ms 61644 KB Output is correct
53 Correct 37 ms 61328 KB Output is correct
54 Correct 27 ms 60440 KB Output is correct
55 Correct 25 ms 60400 KB Output is correct
56 Correct 31 ms 61560 KB Output is correct
57 Correct 91 ms 60536 KB Output is correct
58 Correct 30 ms 60732 KB Output is correct
59 Correct 34 ms 60804 KB Output is correct
60 Correct 39 ms 60716 KB Output is correct
61 Correct 38 ms 60748 KB Output is correct
62 Correct 64 ms 61652 KB Output is correct
63 Correct 392 ms 61780 KB Output is correct
64 Correct 580 ms 61324 KB Output is correct
65 Correct 857 ms 61332 KB Output is correct
66 Execution timed out 1079 ms 61264 KB Time limit exceeded
67 Halted 0 ms 0 KB -