Submission #956229

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
956229	2024-04-01T11:02:56 Z	Nelt	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1000 ms	99980 KB

skyscraper

#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]);
    for (ll i = 0; i < n; i++)
        sort(eq[i].begin(), eq[i].end());
    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) and dist[i - j].size() <= 5000)
            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) and dist[i + j].size() <= 5000)
            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) and dist[i - k].size() <= 5000)
                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) and dist[i + k].size() <= 5000)
                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	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 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	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	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	860 KB	Output is correct
15	Correct	1 ms	600 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	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	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 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	1 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	1 ms	756 KB	Output is correct
15	Correct	1 ms	604 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	600 KB	Output is correct
19	Correct	1 ms	756 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	532 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	2 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	4292 KB	Output is correct
30	Correct	3 ms	1628 KB	Output is correct
31	Correct	5 ms	2668 KB	Output is correct
32	Correct	5 ms	1884 KB	Output is correct
33	Correct	28 ms	8020 KB	Output is correct
34	Correct	12 ms	4700 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 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	504 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	344 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	1 ms	860 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	0 ms	600 KB	Output is correct
19	Correct	0 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	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	2 ms	860 KB	Output is correct
28	Correct	3 ms	1628 KB	Output is correct
29	Correct	11 ms	4368 KB	Output is correct
30	Correct	3 ms	1628 KB	Output is correct
31	Correct	5 ms	2652 KB	Output is correct
32	Correct	4 ms	1880 KB	Output is correct
33	Correct	27 ms	8028 KB	Output is correct
34	Correct	12 ms	4444 KB	Output is correct
35	Correct	5 ms	1624 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	3 ms	1256 KB	Output is correct
38	Correct	5 ms	1372 KB	Output is correct
39	Correct	7 ms	1372 KB	Output is correct
40	Correct	7 ms	1372 KB	Output is correct
41	Correct	5 ms	1368 KB	Output is correct
42	Correct	4 ms	1264 KB	Output is correct
43	Correct	4 ms	1500 KB	Output is correct
44	Correct	4 ms	1284 KB	Output is correct
45	Correct	215 ms	31428 KB	Output is correct
46	Correct	84 ms	17432 KB	Output is correct

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	0 ms	600 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	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	2 ms	860 KB	Output is correct
15	Correct	1 ms	600 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	604 KB	Output is correct
19	Correct	0 ms	600 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	600 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	3 ms	1628 KB	Output is correct
29	Correct	11 ms	4188 KB	Output is correct
30	Correct	3 ms	1492 KB	Output is correct
31	Correct	5 ms	2652 KB	Output is correct
32	Correct	4 ms	1884 KB	Output is correct
33	Correct	26 ms	8028 KB	Output is correct
34	Correct	12 ms	4440 KB	Output is correct
35	Correct	7 ms	1624 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	4 ms	1116 KB	Output is correct
38	Correct	5 ms	1372 KB	Output is correct
39	Correct	5 ms	1372 KB	Output is correct
40	Correct	5 ms	1368 KB	Output is correct
41	Correct	6 ms	1372 KB	Output is correct
42	Correct	4 ms	1372 KB	Output is correct
43	Correct	4 ms	1500 KB	Output is correct
44	Correct	4 ms	1284 KB	Output is correct
45	Correct	231 ms	31496 KB	Output is correct
46	Correct	77 ms	17224 KB	Output is correct
47	Correct	5 ms	2392 KB	Output is correct
48	Correct	5 ms	2812 KB	Output is correct
49	Correct	5 ms	2908 KB	Output is correct
50	Correct	4 ms	2908 KB	Output is correct
51	Correct	12 ms	5976 KB	Output is correct
52	Correct	14 ms	6748 KB	Output is correct
53	Correct	8 ms	3928 KB	Output is correct
54	Correct	3 ms	3420 KB	Output is correct
55	Correct	3 ms	3932 KB	Output is correct
56	Correct	11 ms	5612 KB	Output is correct
57	Correct	2 ms	2652 KB	Output is correct
58	Correct	10 ms	7392 KB	Output is correct
59	Correct	13 ms	6880 KB	Output is correct
60	Correct	10 ms	6880 KB	Output is correct
61	Correct	10 ms	6348 KB	Output is correct
62	Correct	169 ms	31004 KB	Output is correct
63	Execution timed out	1048 ms	99980 KB	Time limit exceeded
64	Halted	0 ms	0 KB	-

Submission #956229

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0