Submission #388807

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
388807	2021-04-13T04:36:04 Z	talant117408	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	426 ms	262148 KB

skyscraper

/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const int mod = 998244353;
 
ll mode(ll a) {
    a %= mod;
    if (a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 3e4+7;
int dist[N], who[N];
vector <pii> graph[N];

int main() {
    do_not_disturb
    
    int h, n;
    cin >> h >> n;
    vector <pii> doges(n);
    for (auto &to : doges) cin >> to.first >> to.second;
    for (int i = 0; i < n; i++) {
		who[doges[i].first]++;
	}
	
	for (int i = 0; i < n; i++) {
		int cnt = 0;
		int jump = doges[i].second;

		for (int pos = doges[i].first; pos < h; pos += jump) {
			if (who[pos]) {
				graph[doges[i].first].pb(mp(pos, cnt));
			}
			cnt++;
		}
		cnt = 0;
		for (int pos = doges[i].first; pos >= 0; pos -= jump) {
			if (who[pos]) {
				graph[doges[i].first].pb(mp(pos, cnt));
			}
			cnt++;
		}
	}
	
	for (int i = 0; i < N; i++) {
		dist[i] = 2e9;
	}
	dist[doges[0].first] = 0;
	priority_queue <pii> K;
	K.push(mp(0, doges[0].first));
	
	while(!K.empty()) {
		auto v = K.top().second; K.pop();
		for (auto to : graph[v]) {
			if (dist[to.first] > dist[v]+to.second) {
				dist[to.first] = dist[v]+to.second;
				K.push(mp(-dist[to.first], to.first));
			}
		}
	}
	
	if (dist[doges[1].first] >= 1e9) cout << -1;
	else cout << dist[doges[1].first];
    
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1132 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	2 ms	1228 KB	Output is correct
12	Correct	2 ms	1360 KB	Output is correct
13	Correct	5 ms	3152 KB	Output is correct
14	Correct	1 ms	1228 KB	Output is correct
15	Correct	1 ms	1228 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1232 KB	Output is correct
12	Correct	2 ms	1360 KB	Output is correct
13	Correct	5 ms	3152 KB	Output is correct
14	Correct	1 ms	1228 KB	Output is correct
15	Correct	1 ms	1228 KB	Output is correct
16	Correct	1 ms	1228 KB	Output is correct
17	Correct	2 ms	1356 KB	Output is correct
18	Correct	1 ms	1228 KB	Output is correct
19	Correct	1 ms	1100 KB	Output is correct
20	Correct	67 ms	33244 KB	Output is correct
21	Correct	1 ms	1100 KB	Output is correct
22	Correct	1 ms	1100 KB	Output is correct
23	Correct	1 ms	1228 KB	Output is correct
24	Correct	2 ms	1356 KB	Output is correct
25	Correct	2 ms	1228 KB	Output is correct
26	Correct	8 ms	3272 KB	Output is correct
27	Correct	7 ms	2252 KB	Output is correct
28	Correct	2 ms	1484 KB	Output is correct
29	Correct	1 ms	1100 KB	Output is correct
30	Correct	1 ms	1100 KB	Output is correct
31	Correct	1 ms	1100 KB	Output is correct
32	Correct	1 ms	1100 KB	Output is correct
33	Correct	2 ms	1172 KB	Output is correct
34	Correct	2 ms	1228 KB	Output is correct

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1128 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	1 ms	1104 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	2 ms	1228 KB	Output is correct
12	Correct	2 ms	1360 KB	Output is correct
13	Correct	5 ms	3152 KB	Output is correct
14	Correct	2 ms	1228 KB	Output is correct
15	Correct	1 ms	1228 KB	Output is correct
16	Correct	2 ms	1228 KB	Output is correct
17	Correct	2 ms	1428 KB	Output is correct
18	Correct	1 ms	1228 KB	Output is correct
19	Correct	1 ms	1100 KB	Output is correct
20	Correct	66 ms	33204 KB	Output is correct
21	Correct	1 ms	1100 KB	Output is correct
22	Correct	1 ms	1100 KB	Output is correct
23	Correct	1 ms	1168 KB	Output is correct
24	Correct	2 ms	1228 KB	Output is correct
25	Correct	2 ms	1228 KB	Output is correct
26	Correct	8 ms	3272 KB	Output is correct
27	Correct	7 ms	2252 KB	Output is correct
28	Correct	2 ms	1484 KB	Output is correct
29	Correct	1 ms	1100 KB	Output is correct
30	Correct	1 ms	1100 KB	Output is correct
31	Correct	1 ms	1100 KB	Output is correct
32	Correct	1 ms	1100 KB	Output is correct
33	Correct	2 ms	1164 KB	Output is correct
34	Correct	2 ms	1232 KB	Output is correct
35	Correct	12 ms	3788 KB	Output is correct
36	Correct	3 ms	1488 KB	Output is correct
37	Correct	13 ms	5288 KB	Output is correct
38	Correct	15 ms	5004 KB	Output is correct
39	Correct	15 ms	5268 KB	Output is correct
40	Correct	15 ms	5072 KB	Output is correct
41	Correct	14 ms	5000 KB	Output is correct
42	Correct	121 ms	34456 KB	Output is correct
43	Correct	102 ms	17964 KB	Output is correct
44	Runtime error	426 ms	262148 KB	Execution killed with signal 9
45	Halted	0 ms	0 KB	-

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	2 ms	1228 KB	Output is correct
12	Correct	2 ms	1360 KB	Output is correct
13	Correct	5 ms	3192 KB	Output is correct
14	Correct	2 ms	1228 KB	Output is correct
15	Correct	2 ms	1228 KB	Output is correct
16	Correct	1 ms	1228 KB	Output is correct
17	Correct	2 ms	1356 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	1 ms	1100 KB	Output is correct
20	Correct	66 ms	33244 KB	Output is correct
21	Correct	1 ms	1100 KB	Output is correct
22	Correct	1 ms	1100 KB	Output is correct
23	Correct	1 ms	1100 KB	Output is correct
24	Correct	2 ms	1228 KB	Output is correct
25	Correct	2 ms	1228 KB	Output is correct
26	Correct	8 ms	3208 KB	Output is correct
27	Correct	7 ms	2124 KB	Output is correct
28	Correct	2 ms	1356 KB	Output is correct
29	Correct	1 ms	1100 KB	Output is correct
30	Correct	1 ms	1100 KB	Output is correct
31	Correct	1 ms	1228 KB	Output is correct
32	Correct	1 ms	1100 KB	Output is correct
33	Correct	1 ms	1228 KB	Output is correct
34	Correct	1 ms	1228 KB	Output is correct
35	Correct	10 ms	3660 KB	Output is correct
36	Correct	3 ms	1484 KB	Output is correct
37	Correct	13 ms	5068 KB	Output is correct
38	Correct	14 ms	4736 KB	Output is correct
39	Correct	14 ms	4960 KB	Output is correct
40	Correct	15 ms	4812 KB	Output is correct
41	Correct	14 ms	4812 KB	Output is correct
42	Correct	122 ms	34136 KB	Output is correct
43	Correct	99 ms	17836 KB	Output is correct
44	Runtime error	392 ms	262148 KB	Execution killed with signal 9
45	Halted	0 ms	0 KB	-

Submission #388807

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 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
0 / 21.0

Subtask #5
0 / 43.0