oj.uz

Submission #709884

# Submission time Handle Problem Language Result Execution time Memory
709884 2023-03-14T18:34:12 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 246012 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 = 65;
const int MAXN = 3e4 + 5;

vector<pair<int, int> > d;

int dist[MAXN][B];
vector<array<int, 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;
        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

# Verdict Execution time Memory Grader output
1 Correct 23 ms 46036 KB Output is correct
2 Correct 23 ms 46064 KB Output is correct
3 Correct 24 ms 46016 KB Output is correct
4 Correct 23 ms 46044 KB Output is correct
5 Correct 25 ms 46088 KB Output is correct
6 Correct 24 ms 46080 KB Output is correct
7 Correct 23 ms 46052 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 46036 KB Output is correct
2 Correct 23 ms 46068 KB Output is correct
3 Correct 23 ms 46036 KB Output is correct
4 Correct 23 ms 46020 KB Output is correct
5 Correct 24 ms 46068 KB Output is correct
6 Correct 23 ms 46036 KB Output is correct
7 Correct 31 ms 46032 KB Output is correct
8 Correct 23 ms 46084 KB Output is correct
9 Correct 24 ms 46156 KB Output is correct
10 Correct 25 ms 46420 KB Output is correct
11 Correct 25 ms 46524 KB Output is correct
12 Correct 24 ms 46460 KB Output is correct
13 Correct 26 ms 46420 KB Output is correct
14 Correct 26 ms 46560 KB Output is correct
15 Correct 28 ms 46476 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 46036 KB Output is correct
2 Correct 23 ms 46036 KB Output is correct
3 Correct 29 ms 46132 KB Output is correct
4 Correct 25 ms 46068 KB Output is correct
5 Correct 26 ms 46036 KB Output is correct
6 Correct 24 ms 46036 KB Output is correct
7 Correct 25 ms 46112 KB Output is correct
8 Correct 24 ms 46112 KB Output is correct
9 Correct 25 ms 46204 KB Output is correct
10 Correct 25 ms 46420 KB Output is correct
11 Correct 27 ms 46468 KB Output is correct
12 Correct 24 ms 46420 KB Output is correct
13 Correct 25 ms 46420 KB Output is correct
14 Correct 26 ms 46528 KB Output is correct
15 Correct 26 ms 46528 KB Output is correct
16 Correct 27 ms 46796 KB Output is correct
17 Correct 34 ms 49368 KB Output is correct
18 Correct 38 ms 53528 KB Output is correct
19 Correct 41 ms 54620 KB Output is correct
20 Correct 39 ms 54512 KB Output is correct
21 Correct 27 ms 47672 KB Output is correct
22 Correct 39 ms 53620 KB Output is correct
23 Correct 37 ms 52812 KB Output is correct
24 Correct 45 ms 54276 KB Output is correct
25 Correct 42 ms 54612 KB Output is correct
26 Correct 43 ms 54540 KB Output is correct
27 Correct 53 ms 54588 KB Output is correct
28 Correct 42 ms 54604 KB Output is correct
29 Correct 68 ms 54480 KB Output is correct
30 Correct 58 ms 54524 KB Output is correct
31 Correct 48 ms 54568 KB Output is correct
32 Correct 57 ms 54512 KB Output is correct
33 Correct 99 ms 54704 KB Output is correct
34 Correct 70 ms 54716 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 46088 KB Output is correct
2 Correct 24 ms 46036 KB Output is correct
3 Correct 25 ms 46084 KB Output is correct
4 Correct 25 ms 46044 KB Output is correct
5 Correct 26 ms 45996 KB Output is correct
6 Correct 26 ms 46088 KB Output is correct
7 Correct 33 ms 46116 KB Output is correct
8 Correct 25 ms 46164 KB Output is correct
9 Correct 24 ms 46156 KB Output is correct
10 Correct 26 ms 46364 KB Output is correct
11 Correct 27 ms 46548 KB Output is correct
12 Correct 25 ms 46420 KB Output is correct
13 Correct 25 ms 46392 KB Output is correct
14 Correct 26 ms 46532 KB Output is correct
15 Correct 30 ms 46496 KB Output is correct
16 Correct 27 ms 46852 KB Output is correct
17 Correct 32 ms 49424 KB Output is correct
18 Correct 37 ms 53528 KB Output is correct
19 Correct 39 ms 54472 KB Output is correct
20 Correct 39 ms 54616 KB Output is correct
21 Correct 28 ms 47640 KB Output is correct
22 Correct 44 ms 53640 KB Output is correct
23 Correct 46 ms 52884 KB Output is correct
24 Correct 43 ms 54308 KB Output is correct
25 Correct 41 ms 54604 KB Output is correct
26 Correct 40 ms 54532 KB Output is correct
27 Correct 45 ms 54604 KB Output is correct
28 Correct 42 ms 54672 KB Output is correct
29 Correct 56 ms 54460 KB Output is correct
30 Correct 47 ms 54528 KB Output is correct
31 Correct 52 ms 54524 KB Output is correct
32 Correct 46 ms 54456 KB Output is correct
33 Correct 73 ms 54608 KB Output is correct
34 Correct 80 ms 54696 KB Output is correct
35 Correct 56 ms 54464 KB Output is correct
36 Correct 41 ms 51016 KB Output is correct
37 Correct 71 ms 57144 KB Output is correct
38 Correct 73 ms 57676 KB Output is correct
39 Correct 76 ms 57760 KB Output is correct
40 Correct 73 ms 57748 KB Output is correct
41 Correct 82 ms 57800 KB Output is correct
42 Correct 46 ms 55332 KB Output is correct
43 Correct 45 ms 55268 KB Output is correct
44 Correct 46 ms 55320 KB Output is correct
45 Correct 111 ms 61596 KB Output is correct
46 Correct 86 ms 61460 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 46056 KB Output is correct
2 Correct 24 ms 46136 KB Output is correct
3 Correct 23 ms 46100 KB Output is correct
4 Correct 24 ms 46088 KB Output is correct
5 Correct 24 ms 46132 KB Output is correct
6 Correct 25 ms 46104 KB Output is correct
7 Correct 27 ms 46212 KB Output is correct
8 Correct 24 ms 46068 KB Output is correct
9 Correct 23 ms 46164 KB Output is correct
10 Correct 24 ms 46392 KB Output is correct
11 Correct 26 ms 46524 KB Output is correct
12 Correct 24 ms 46400 KB Output is correct
13 Correct 24 ms 46352 KB Output is correct
14 Correct 26 ms 46576 KB Output is correct
15 Correct 25 ms 46520 KB Output is correct
16 Correct 25 ms 46768 KB Output is correct
17 Correct 39 ms 49348 KB Output is correct
18 Correct 46 ms 53512 KB Output is correct
19 Correct 43 ms 54448 KB Output is correct
20 Correct 45 ms 54612 KB Output is correct
21 Correct 26 ms 47648 KB Output is correct
22 Correct 37 ms 53564 KB Output is correct
23 Correct 38 ms 52848 KB Output is correct
24 Correct 41 ms 54216 KB Output is correct
25 Correct 41 ms 54584 KB Output is correct
26 Correct 42 ms 54676 KB Output is correct
27 Correct 44 ms 54612 KB Output is correct
28 Correct 49 ms 54724 KB Output is correct
29 Correct 58 ms 54464 KB Output is correct
30 Correct 44 ms 54468 KB Output is correct
31 Correct 55 ms 54456 KB Output is correct
32 Correct 53 ms 54464 KB Output is correct
33 Correct 76 ms 54688 KB Output is correct
34 Correct 83 ms 54732 KB Output is correct
35 Correct 64 ms 54476 KB Output is correct
36 Correct 43 ms 51028 KB Output is correct
37 Correct 83 ms 57036 KB Output is correct
38 Correct 86 ms 57716 KB Output is correct
39 Correct 68 ms 57804 KB Output is correct
40 Correct 84 ms 57636 KB Output is correct
41 Correct 76 ms 57784 KB Output is correct
42 Correct 43 ms 55340 KB Output is correct
43 Correct 45 ms 55244 KB Output is correct
44 Correct 47 ms 55352 KB Output is correct
45 Correct 82 ms 61608 KB Output is correct
46 Correct 89 ms 61488 KB Output is correct
47 Correct 284 ms 107960 KB Output is correct
48 Correct 211 ms 148004 KB Output is correct
49 Correct 252 ms 156840 KB Output is correct
50 Correct 253 ms 167072 KB Output is correct
51 Correct 352 ms 178964 KB Output is correct
52 Correct 377 ms 179140 KB Output is correct
53 Correct 286 ms 175432 KB Output is correct
54 Correct 242 ms 173900 KB Output is correct
55 Correct 257 ms 173748 KB Output is correct
56 Correct 261 ms 175184 KB Output is correct
57 Correct 432 ms 173948 KB Output is correct
58 Correct 264 ms 174540 KB Output is correct
59 Correct 269 ms 174492 KB Output is correct
60 Correct 307 ms 175488 KB Output is correct
61 Correct 296 ms 175064 KB Output is correct
62 Correct 335 ms 179556 KB Output is correct
63 Correct 357 ms 209528 KB Output is correct
64 Correct 372 ms 222508 KB Output is correct
65 Correct 429 ms 231544 KB Output is correct
66 Execution timed out 1041 ms 246012 KB Time limit exceeded
67 Halted 0 ms 0 KB -