oj.uz

Submission #388824

# Submission time Handle Problem Language Result Execution time Memory
388824 2021-04-13T05:34:06 Z talant117408 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 936 ms 262148 KB 
/*
    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]++;
	}
	set <int> powers[h];
	for (int i = 0; i < n; i++) {
		powers[doges[i].first].insert(doges[i].second);
	}
	
	for (int i = 0; i < h; i++) {
		
		if (sz(powers[i]) == 0) continue;
		
		vector <int> ps;
		for (auto to : powers[i]) ps.pb(to);
		reverse(all(ps));
		
		for (auto jump : ps) {
			int cnt = 0;
			for (int pos = i; pos < h; pos += jump) {
              	auto it = lb(all(graph[i]), mp(pos, 0));
				if (who[pos] && pos != i && (it == graph[i].end() || (*it).first != pos)) {
					graph[i].pb(mp(pos, cnt));
				}
				cnt++;
			}
			cnt = 0;
			for (int pos = i; pos >= 0; pos -= jump) {
              	auto it = lb(all(graph[i]), mp(pos, 0));
				if (who[pos] && pos != i && (it == graph[i].end() || (*it).first != pos)) {
					graph[i].pb(mp(pos, cnt));
				}
				cnt++;
			}
		}
	}
	
	for (int i = 0; i < h; i++) {
		dist[i] = 1e9;
	}
	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 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 976 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct
16 Correct 1 ms 1100 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 103 ms 33272 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 2 ms 1100 KB Output is correct
24 Correct 2 ms 1356 KB Output is correct
25 Correct 2 ms 1252 KB Output is correct
26 Correct 1 ms 1100 KB Output is correct
27 Correct 1 ms 1100 KB Output is correct
28 Correct 2 ms 1484 KB Output is correct
29 Correct 2 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 1228 KB Output is correct
34 Correct 2 ms 1228 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 2 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct
16 Correct 2 ms 1100 KB Output is correct
17 Correct 2 ms 1356 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 104 ms 33344 KB Output is correct
21 Correct 1 ms 1104 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 2 ms 1180 KB Output is correct
24 Correct 3 ms 1356 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 1 ms 1100 KB Output is correct
27 Correct 1 ms 1100 KB Output is correct
28 Correct 2 ms 1484 KB Output is correct
29 Correct 2 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 1228 KB Output is correct
34 Correct 2 ms 1176 KB Output is correct
35 Correct 18 ms 4044 KB Output is correct
36 Correct 4 ms 1484 KB Output is correct
37 Correct 20 ms 5196 KB Output is correct
38 Correct 23 ms 5132 KB Output is correct
39 Correct 24 ms 5324 KB Output is correct
40 Correct 23 ms 5324 KB Output is correct
41 Correct 23 ms 5124 KB Output is correct
42 Correct 6 ms 1280 KB Output is correct
43 Correct 6 ms 1356 KB Output is correct
44 Correct 105 ms 33484 KB Output is correct
45 Correct 20 ms 3096 KB Output is correct
46 Correct 19 ms 3020 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1172 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 3 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 102 ms 33344 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 1356 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1100 KB Output is correct
27 Correct 1 ms 1100 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 1228 KB Output is correct
34 Correct 3 ms 1228 KB Output is correct
35 Correct 18 ms 3936 KB Output is correct
36 Correct 4 ms 1484 KB Output is correct
37 Correct 20 ms 5196 KB Output is correct
38 Correct 23 ms 5196 KB Output is correct
39 Correct 24 ms 5396 KB Output is correct
40 Correct 23 ms 5324 KB Output is correct
41 Correct 23 ms 5196 KB Output is correct
42 Correct 6 ms 1356 KB Output is correct
43 Correct 6 ms 1356 KB Output is correct
44 Correct 103 ms 33572 KB Output is correct
45 Correct 19 ms 3024 KB Output is correct
46 Correct 18 ms 3080 KB Output is correct
47 Correct 58 ms 12728 KB Output is correct
48 Correct 17 ms 5192 KB Output is correct
49 Correct 14 ms 4684 KB Output is correct
50 Correct 11 ms 4100 KB Output is correct
51 Correct 37 ms 7560 KB Output is correct
52 Correct 39 ms 8176 KB Output is correct
53 Correct 20 ms 5580 KB Output is correct
54 Correct 2 ms 2508 KB Output is correct
55 Correct 2 ms 2508 KB Output is correct
56 Runtime error 936 ms 262148 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -