oj.uz

Submission #956221

# Submission time Handle Problem Language Result Execution time Memory
956221 2024-04-01T10:53:47 Z Nelt Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 97164 KB 
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
 
void solve()
{
    ll n, m;
    cin >> n >> m;
    ll b[m], p[m];
    vector<ll> eq[n];
    for (ll i = 0; i < m; i++)
        cin >> b[i] >> p[i], eq[b[i]].push_back(p[i]);
    map<ll, ll> dist[n];
    dist[b[0]][p[0]] = 0;
    queue<pair<ll, ll>> q;
    q.push(make_pair(b[0], p[0]));
    while (!q.empty())
    {
        auto [i, j] = q.front();
        q.pop();
        if (i == b[1])
        {
            cout << dist[i][j] << endl;
            return;
        }
        if (i - j >= 0 and !dist[i - j].count(j))
            dist[i - j][j] = dist[i][j] + 1, q.push(make_pair(i - j, j));
        if (i + j < n and !dist[i + j].count(j))
            dist[i + j][j] = dist[i][j] + 1, q.push(make_pair(i + j, j));
        for (ll k : eq[i])
        {
            if (i - k >= 0 and !dist[i - k].count(k))
                dist[i - k][k] = dist[i][j] + 1, q.push(make_pair(i - k, k));
            if (i + k < n and !dist[i + k].count(k))
                dist[i + k][k] = dist[i][j] + 1, q.push(make_pair(i + k, k));
        }
        eq[i].clear();
        if (!dist[b[1]].empty())
        {
            ll ans = 1e18;
            for (auto j : dist[b[1]])
                ans = min(ans, j.second);
            cout << ans << endl;
            return;
        }
    }
    cout << "-1\n";
}
 
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t = 1;
    // precomp();
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        solve();
    cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 412 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 4 ms 1628 KB Output is correct
29 Correct 12 ms 4320 KB Output is correct
30 Correct 3 ms 1628 KB Output is correct
31 Correct 6 ms 2560 KB Output is correct
32 Correct 4 ms 1884 KB Output is correct
33 Correct 31 ms 8016 KB Output is correct
34 Correct 14 ms 4444 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 3 ms 1628 KB Output is correct
29 Correct 12 ms 4196 KB Output is correct
30 Correct 3 ms 1624 KB Output is correct
31 Correct 6 ms 2652 KB Output is correct
32 Correct 4 ms 1884 KB Output is correct
33 Correct 29 ms 8032 KB Output is correct
34 Correct 14 ms 4444 KB Output is correct
35 Correct 5 ms 1892 KB Output is correct
36 Correct 1 ms 612 KB Output is correct
37 Correct 3 ms 1124 KB Output is correct
38 Correct 5 ms 1628 KB Output is correct
39 Correct 5 ms 1380 KB Output is correct
40 Correct 5 ms 1380 KB Output is correct
41 Correct 5 ms 1380 KB Output is correct
42 Correct 4 ms 1268 KB Output is correct
43 Correct 4 ms 1500 KB Output is correct
44 Correct 5 ms 1296 KB Output is correct
45 Correct 248 ms 31404 KB Output is correct
46 Correct 88 ms 16924 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 388 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 2 ms 856 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 3 ms 1628 KB Output is correct
29 Correct 14 ms 4188 KB Output is correct
30 Correct 3 ms 1628 KB Output is correct
31 Correct 6 ms 2652 KB Output is correct
32 Correct 4 ms 2052 KB Output is correct
33 Correct 34 ms 7960 KB Output is correct
34 Correct 14 ms 4444 KB Output is correct
35 Correct 6 ms 1884 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 3 ms 1112 KB Output is correct
38 Correct 5 ms 1608 KB Output is correct
39 Correct 5 ms 1372 KB Output is correct
40 Correct 5 ms 1368 KB Output is correct
41 Correct 5 ms 1372 KB Output is correct
42 Correct 4 ms 1380 KB Output is correct
43 Correct 4 ms 1500 KB Output is correct
44 Correct 4 ms 1284 KB Output is correct
45 Correct 247 ms 31428 KB Output is correct
46 Correct 89 ms 16992 KB Output is correct
47 Correct 5 ms 2288 KB Output is correct
48 Correct 5 ms 2908 KB Output is correct
49 Correct 5 ms 2976 KB Output is correct
50 Correct 4 ms 2908 KB Output is correct
51 Correct 12 ms 5976 KB Output is correct
52 Correct 13 ms 6492 KB Output is correct
53 Correct 7 ms 3928 KB Output is correct
54 Correct 2 ms 3416 KB Output is correct
55 Correct 3 ms 3932 KB Output is correct
56 Correct 8 ms 5744 KB Output is correct
57 Correct 2 ms 2652 KB Output is correct
58 Correct 12 ms 7392 KB Output is correct
59 Correct 10 ms 6880 KB Output is correct
60 Correct 10 ms 6880 KB Output is correct
61 Correct 9 ms 6356 KB Output is correct
62 Correct 145 ms 30944 KB Output is correct
63 Execution timed out 1038 ms 97164 KB Time limit exceeded
64 Halted 0 ms 0 KB -