Submission #969786

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
969786	2024-04-25T15:14:37 Z	Pring	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	92 ms	6604 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;

const int MXN = 30005, INF = 1e9;
int n, m, pos[MXN], p[MXN];
int dis[MXN];
vector<int> v[MXN];
priority_queue<pii, vector<pii>, greater<pii>> pq;

bool PUSH(int to, int len, int t) {
    if (len < dis[to]) {
        dis[to] = len;
        pq.push(mp(len, to));
    }
    auto it = lower_bound(v[to].begin(), v[to].end(), t);
    if (it != v[to].end() && *it == t) return false;
    return true;
}

void DIJKSTRA(int sr) {
    fill(dis, dis + n, INF);
    dis[sr] = 0;
    pq.push(mp(0, sr));
    while (pq.size()) {
        auto [len, id] = pq.top();
        pq.pop();
        if (dis[id] < len) continue;
        // dis[id] = len;
        if (id == pos[1]) break;
        for (auto &t : v[id]) {
            for (int i = 1; id + t * i < n; i++) {
                int to = id + t * i;
                if (!PUSH(to, len + i, t)) break;
            }
            for (int i = 1; id - t * i >= 0; i++) {
                int to = id - t * i;
                if (!PUSH(to, len + i, t)) break;
            }
        }
    }
}

void miku() {
    cin >> n >> m;
    FOR(i, 0, m) {
        cin >> pos[i] >> p[i];
        v[pos[i]].push_back(p[i]);
    }
    FOR(i, 0, n) {
        sort(v[i].begin(), v[i].end());
        v[i].erase(unique(v[i].begin(), v[i].end()), v[i].end());
    }
    DIJKSTRA(pos[0]);
    cout << (dis[pos[1]] == INF ? -1 : dis[pos[1]]) << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1116 KB	Output is correct
2	Correct	1 ms	1116 KB	Output is correct
3	Correct	1 ms	1116 KB	Output is correct
4	Correct	1 ms	1116 KB	Output is correct
5	Correct	1 ms	1116 KB	Output is correct
6	Correct	1 ms	1112 KB	Output is correct
7	Correct	1 ms	1116 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1112 KB	Output is correct
2	Correct	1 ms	1116 KB	Output is correct
3	Correct	1 ms	1116 KB	Output is correct
4	Correct	1 ms	1116 KB	Output is correct
5	Correct	1 ms	1116 KB	Output is correct
6	Correct	1 ms	1116 KB	Output is correct
7	Correct	1 ms	1116 KB	Output is correct
8	Correct	1 ms	1116 KB	Output is correct
9	Correct	1 ms	1268 KB	Output is correct
10	Correct	1 ms	1156 KB	Output is correct
11	Correct	1 ms	1116 KB	Output is correct
12	Correct	1 ms	1116 KB	Output is correct
13	Correct	1 ms	1116 KB	Output is correct
14	Correct	1 ms	1116 KB	Output is correct
15	Correct	1 ms	1116 KB	Output is correct
16	Correct	1 ms	1116 KB	Output is correct
17	Correct	1 ms	1116 KB	Output is correct
18	Correct	1 ms	1116 KB	Output is correct
19	Correct	1 ms	1116 KB	Output is correct
20	Correct	1 ms	1116 KB	Output is correct
21	Correct	1 ms	1112 KB	Output is correct
22	Correct	1 ms	1116 KB	Output is correct
23	Correct	2 ms	1116 KB	Output is correct
24	Correct	1 ms	1116 KB	Output is correct
25	Correct	1 ms	1112 KB	Output is correct
26	Correct	1 ms	1116 KB	Output is correct
27	Correct	1 ms	1116 KB	Output is correct
28	Correct	1 ms	1116 KB	Output is correct
29	Correct	2 ms	1432 KB	Output is correct
30	Correct	1 ms	1116 KB	Output is correct
31	Correct	1 ms	1112 KB	Output is correct
32	Correct	1 ms	1116 KB	Output is correct
33	Correct	3 ms	1504 KB	Output is correct
34	Correct	3 ms	1500 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1112 KB	Output is correct
2	Correct	1 ms	1112 KB	Output is correct
3	Correct	1 ms	1116 KB	Output is correct
4	Correct	1 ms	1112 KB	Output is correct
5	Correct	1 ms	1116 KB	Output is correct
6	Correct	1 ms	1116 KB	Output is correct
7	Correct	1 ms	1116 KB	Output is correct
8	Correct	1 ms	1116 KB	Output is correct
9	Correct	1 ms	1116 KB	Output is correct
10	Correct	1 ms	1368 KB	Output is correct
11	Correct	1 ms	1112 KB	Output is correct
12	Correct	1 ms	1116 KB	Output is correct
13	Correct	1 ms	1116 KB	Output is correct
14	Correct	1 ms	1116 KB	Output is correct
15	Correct	1 ms	1112 KB	Output is correct
16	Correct	1 ms	1128 KB	Output is correct
17	Correct	1 ms	1124 KB	Output is correct
18	Correct	1 ms	1300 KB	Output is correct
19	Correct	1 ms	1116 KB	Output is correct
20	Correct	1 ms	1116 KB	Output is correct
21	Correct	1 ms	1116 KB	Output is correct
22	Correct	1 ms	1116 KB	Output is correct
23	Correct	1 ms	1116 KB	Output is correct
24	Correct	2 ms	1112 KB	Output is correct
25	Correct	1 ms	1112 KB	Output is correct
26	Correct	1 ms	1112 KB	Output is correct
27	Correct	1 ms	1116 KB	Output is correct
28	Correct	2 ms	1116 KB	Output is correct
29	Correct	3 ms	1372 KB	Output is correct
30	Correct	1 ms	1116 KB	Output is correct
31	Correct	2 ms	1116 KB	Output is correct
32	Correct	1 ms	1116 KB	Output is correct
33	Correct	4 ms	1504 KB	Output is correct
34	Correct	3 ms	1504 KB	Output is correct
35	Correct	7 ms	1632 KB	Output is correct
36	Correct	2 ms	1272 KB	Output is correct
37	Correct	6 ms	1628 KB	Output is correct
38	Correct	6 ms	1576 KB	Output is correct
39	Correct	5 ms	1628 KB	Output is correct
40	Correct	5 ms	1628 KB	Output is correct
41	Correct	5 ms	1628 KB	Output is correct
42	Correct	4 ms	1628 KB	Output is correct
43	Correct	5 ms	1884 KB	Output is correct
44	Correct	4 ms	1628 KB	Output is correct
45	Correct	9 ms	1900 KB	Output is correct
46	Correct	8 ms	1916 KB	Output is correct

Subtask #5
43.0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1112 KB	Output is correct
2	Correct	1 ms	1128 KB	Output is correct
3	Correct	1 ms	1128 KB	Output is correct
4	Correct	1 ms	1112 KB	Output is correct
5	Correct	1 ms	1116 KB	Output is correct
6	Correct	1 ms	1116 KB	Output is correct
7	Correct	1 ms	1112 KB	Output is correct
8	Correct	1 ms	1116 KB	Output is correct
9	Correct	1 ms	1116 KB	Output is correct
10	Correct	1 ms	1116 KB	Output is correct
11	Correct	1 ms	1112 KB	Output is correct
12	Correct	1 ms	1112 KB	Output is correct
13	Correct	1 ms	1116 KB	Output is correct
14	Correct	1 ms	1116 KB	Output is correct
15	Correct	1 ms	1116 KB	Output is correct
16	Correct	1 ms	1116 KB	Output is correct
17	Correct	1 ms	1116 KB	Output is correct
18	Correct	1 ms	1116 KB	Output is correct
19	Correct	1 ms	1116 KB	Output is correct
20	Correct	1 ms	1116 KB	Output is correct
21	Correct	1 ms	1112 KB	Output is correct
22	Correct	1 ms	1116 KB	Output is correct
23	Correct	1 ms	1116 KB	Output is correct
24	Correct	1 ms	1116 KB	Output is correct
25	Correct	1 ms	1116 KB	Output is correct
26	Correct	1 ms	1116 KB	Output is correct
27	Correct	1 ms	1116 KB	Output is correct
28	Correct	1 ms	1116 KB	Output is correct
29	Correct	2 ms	1368 KB	Output is correct
30	Correct	1 ms	1116 KB	Output is correct
31	Correct	2 ms	1116 KB	Output is correct
32	Correct	1 ms	1116 KB	Output is correct
33	Correct	4 ms	1504 KB	Output is correct
34	Correct	3 ms	1504 KB	Output is correct
35	Correct	8 ms	1628 KB	Output is correct
36	Correct	2 ms	1156 KB	Output is correct
37	Correct	6 ms	1372 KB	Output is correct
38	Correct	6 ms	1628 KB	Output is correct
39	Correct	5 ms	1540 KB	Output is correct
40	Correct	5 ms	1628 KB	Output is correct
41	Correct	6 ms	1656 KB	Output is correct
42	Correct	4 ms	1628 KB	Output is correct
43	Correct	4 ms	1628 KB	Output is correct
44	Correct	4 ms	1628 KB	Output is correct
45	Correct	9 ms	1884 KB	Output is correct
46	Correct	8 ms	1884 KB	Output is correct
47	Correct	12 ms	2264 KB	Output is correct
48	Correct	5 ms	1880 KB	Output is correct
49	Correct	5 ms	1884 KB	Output is correct
50	Correct	3 ms	1628 KB	Output is correct
51	Correct	15 ms	2604 KB	Output is correct
52	Correct	15 ms	2520 KB	Output is correct
53	Correct	7 ms	2140 KB	Output is correct
54	Correct	2 ms	1372 KB	Output is correct
55	Correct	2 ms	1372 KB	Output is correct
56	Correct	6 ms	2392 KB	Output is correct
57	Correct	2 ms	1624 KB	Output is correct
58	Correct	6 ms	1884 KB	Output is correct
59	Correct	6 ms	1884 KB	Output is correct
60	Correct	6 ms	1884 KB	Output is correct
61	Correct	6 ms	1884 KB	Output is correct
62	Correct	10 ms	2396 KB	Output is correct
63	Correct	35 ms	3852 KB	Output is correct
64	Correct	39 ms	3820 KB	Output is correct
65	Correct	47 ms	3796 KB	Output is correct
66	Correct	92 ms	6604 KB	Output is correct
67	Correct	65 ms	6600 KB	Output is correct

Submission #969786

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 43.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
43.0 / 43.0