oj.uz

답안 #709876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709876 2023-03-14T18:29:59 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 539 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 = 90;
const int MAXN = 3e4 + 5;

vector<pair<int, int> > d;

int dist[MAXN][B];
vector<array<int, 3> > g[MAXN][B];

int 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)
*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 63744 KB Output is correct
2 Correct 33 ms 63632 KB Output is correct
3 Correct 39 ms 63740 KB Output is correct
4 Correct 31 ms 63636 KB Output is correct
5 Correct 30 ms 63700 KB Output is correct
6 Correct 34 ms 63640 KB Output is correct
7 Correct 37 ms 63700 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 63636 KB Output is correct
2 Correct 38 ms 63692 KB Output is correct
3 Correct 31 ms 63684 KB Output is correct
4 Correct 39 ms 63720 KB Output is correct
5 Correct 35 ms 63660 KB Output is correct
6 Correct 38 ms 63700 KB Output is correct
7 Correct 32 ms 63656 KB Output is correct
8 Correct 34 ms 63760 KB Output is correct
9 Correct 38 ms 63856 KB Output is correct
10 Correct 33 ms 64016 KB Output is correct
11 Correct 37 ms 64212 KB Output is correct
12 Correct 30 ms 64084 KB Output is correct
13 Correct 33 ms 64084 KB Output is correct
14 Correct 42 ms 64228 KB Output is correct
15 Correct 39 ms 64224 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 63696 KB Output is correct
2 Correct 40 ms 63720 KB Output is correct
3 Correct 32 ms 63700 KB Output is correct
4 Correct 33 ms 63740 KB Output is correct
5 Correct 36 ms 63772 KB Output is correct
6 Correct 35 ms 63700 KB Output is correct
7 Correct 37 ms 63668 KB Output is correct
8 Correct 31 ms 63748 KB Output is correct
9 Correct 37 ms 63796 KB Output is correct
10 Correct 33 ms 64000 KB Output is correct
11 Correct 42 ms 64092 KB Output is correct
12 Correct 35 ms 63996 KB Output is correct
13 Correct 37 ms 64056 KB Output is correct
14 Correct 35 ms 64208 KB Output is correct
15 Correct 45 ms 64204 KB Output is correct
16 Correct 33 ms 64668 KB Output is correct
17 Correct 40 ms 67980 KB Output is correct
18 Correct 60 ms 73968 KB Output is correct
19 Correct 53 ms 75340 KB Output is correct
20 Correct 64 ms 75348 KB Output is correct
21 Correct 35 ms 65868 KB Output is correct
22 Correct 56 ms 74020 KB Output is correct
23 Correct 62 ms 72996 KB Output is correct
24 Correct 59 ms 74936 KB Output is correct
25 Correct 64 ms 75344 KB Output is correct
26 Correct 58 ms 75388 KB Output is correct
27 Correct 54 ms 75416 KB Output is correct
28 Correct 72 ms 75484 KB Output is correct
29 Correct 67 ms 75396 KB Output is correct
30 Correct 64 ms 75340 KB Output is correct
31 Correct 77 ms 75384 KB Output is correct
32 Correct 65 ms 75384 KB Output is correct
33 Correct 90 ms 75476 KB Output is correct
34 Correct 89 ms 75444 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 63724 KB Output is correct
2 Correct 34 ms 63628 KB Output is correct
3 Correct 39 ms 63660 KB Output is correct
4 Correct 34 ms 63688 KB Output is correct
5 Correct 42 ms 63688 KB Output is correct
6 Correct 31 ms 63636 KB Output is correct
7 Correct 34 ms 63736 KB Output is correct
8 Correct 38 ms 63700 KB Output is correct
9 Correct 33 ms 63744 KB Output is correct
10 Correct 33 ms 64112 KB Output is correct
11 Correct 39 ms 64196 KB Output is correct
12 Correct 42 ms 64028 KB Output is correct
13 Correct 37 ms 64108 KB Output is correct
14 Correct 35 ms 64212 KB Output is correct
15 Correct 42 ms 64232 KB Output is correct
16 Correct 42 ms 64636 KB Output is correct
17 Correct 47 ms 67940 KB Output is correct
18 Correct 63 ms 73796 KB Output is correct
19 Correct 66 ms 75384 KB Output is correct
20 Correct 61 ms 75308 KB Output is correct
21 Correct 41 ms 65876 KB Output is correct
22 Correct 52 ms 74032 KB Output is correct
23 Correct 61 ms 72980 KB Output is correct
24 Correct 63 ms 74892 KB Output is correct
25 Correct 68 ms 75348 KB Output is correct
26 Correct 54 ms 75400 KB Output is correct
27 Correct 60 ms 75356 KB Output is correct
28 Correct 62 ms 75476 KB Output is correct
29 Correct 76 ms 75396 KB Output is correct
30 Correct 57 ms 75260 KB Output is correct
31 Correct 76 ms 75380 KB Output is correct
32 Correct 65 ms 75284 KB Output is correct
33 Correct 98 ms 75508 KB Output is correct
34 Correct 92 ms 75512 KB Output is correct
35 Correct 77 ms 74000 KB Output is correct
36 Correct 51 ms 70280 KB Output is correct
37 Correct 91 ms 77424 KB Output is correct
38 Correct 93 ms 78028 KB Output is correct
39 Correct 94 ms 78140 KB Output is correct
40 Correct 97 ms 78120 KB Output is correct
41 Correct 94 ms 78156 KB Output is correct
42 Correct 57 ms 75872 KB Output is correct
43 Correct 57 ms 75888 KB Output is correct
44 Correct 61 ms 75936 KB Output is correct
45 Correct 132 ms 81840 KB Output is correct
46 Correct 130 ms 81900 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 63696 KB Output is correct
2 Correct 39 ms 63688 KB Output is correct
3 Correct 36 ms 63716 KB Output is correct
4 Correct 30 ms 63644 KB Output is correct
5 Correct 37 ms 63664 KB Output is correct
6 Correct 31 ms 63700 KB Output is correct
7 Correct 36 ms 63612 KB Output is correct
8 Correct 38 ms 63692 KB Output is correct
9 Correct 37 ms 63856 KB Output is correct
10 Correct 30 ms 64048 KB Output is correct
11 Correct 32 ms 64212 KB Output is correct
12 Correct 30 ms 64048 KB Output is correct
13 Correct 33 ms 64096 KB Output is correct
14 Correct 42 ms 64236 KB Output is correct
15 Correct 33 ms 64236 KB Output is correct
16 Correct 35 ms 64580 KB Output is correct
17 Correct 49 ms 68060 KB Output is correct
18 Correct 52 ms 73796 KB Output is correct
19 Correct 54 ms 75384 KB Output is correct
20 Correct 58 ms 75332 KB Output is correct
21 Correct 38 ms 65780 KB Output is correct
22 Correct 60 ms 74092 KB Output is correct
23 Correct 53 ms 72976 KB Output is correct
24 Correct 58 ms 74876 KB Output is correct
25 Correct 57 ms 75368 KB Output is correct
26 Correct 55 ms 75312 KB Output is correct
27 Correct 54 ms 75328 KB Output is correct
28 Correct 58 ms 75472 KB Output is correct
29 Correct 68 ms 75284 KB Output is correct
30 Correct 60 ms 75320 KB Output is correct
31 Correct 63 ms 75392 KB Output is correct
32 Correct 63 ms 75300 KB Output is correct
33 Correct 84 ms 75388 KB Output is correct
34 Correct 82 ms 75468 KB Output is correct
35 Correct 72 ms 73928 KB Output is correct
36 Correct 48 ms 70276 KB Output is correct
37 Correct 89 ms 77392 KB Output is correct
38 Correct 88 ms 78092 KB Output is correct
39 Correct 87 ms 78044 KB Output is correct
40 Correct 87 ms 78128 KB Output is correct
41 Correct 90 ms 78128 KB Output is correct
42 Correct 59 ms 75864 KB Output is correct
43 Correct 61 ms 75852 KB Output is correct
44 Correct 59 ms 75868 KB Output is correct
45 Correct 111 ms 81896 KB Output is correct
46 Correct 110 ms 81988 KB Output is correct
47 Correct 351 ms 145196 KB Output is correct
48 Correct 304 ms 203784 KB Output is correct
49 Correct 340 ms 216240 KB Output is correct
50 Correct 373 ms 230860 KB Output is correct
51 Correct 453 ms 246656 KB Output is correct
52 Correct 492 ms 246512 KB Output is correct
53 Correct 380 ms 242996 KB Output is correct
54 Correct 347 ms 241208 KB Output is correct
55 Correct 358 ms 241232 KB Output is correct
56 Correct 357 ms 242576 KB Output is correct
57 Correct 539 ms 241532 KB Output is correct
58 Correct 383 ms 241864 KB Output is correct
59 Correct 402 ms 242144 KB Output is correct
60 Correct 450 ms 242716 KB Output is correct
61 Correct 428 ms 242624 KB Output is correct
62 Correct 443 ms 246908 KB Output is correct
63 Runtime error 336 ms 262144 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -