oj.uz

Submission #388806

# Submission time Handle Problem Language Result Execution time Memory
388806 2021-04-13T04:32:17 Z talant117408 Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 402 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];
vector <int> 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].pb(i);
	}
	
	for (int i = 0; i < n; i++) {
		int cnt = 0;
		int jump = doges[i].second;
		int j = doges[i].first;
		while (j+jump < h) {
			j += jump;
			cnt++;
			if (sz(who[j])) {
				graph[doges[i].first].pb(mp(j, cnt));
			}
		}
		j = doges[i].first;
		cnt = 0;
		while (j-jump >= 0) {
			j -= jump;
			cnt++;
			if (sz(who[j])) {
				graph[doges[i].first].pb(mp(j, 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 1740 KB Output is correct
2 Correct 1 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 2 ms 1740 KB Output is correct
6 Correct 1 ms 1740 KB Output is correct
7 Correct 1 ms 1740 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 1 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 1 ms 1740 KB Output is correct
6 Correct 1 ms 1740 KB Output is correct
7 Correct 1 ms 1740 KB Output is correct
8 Correct 1 ms 1740 KB Output is correct
9 Correct 1 ms 1740 KB Output is correct
10 Correct 2 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 3 ms 2124 KB Output is correct
13 Correct 7 ms 3920 KB Output is correct
14 Correct 2 ms 1868 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 2 ms 1868 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 66 ms 33920 KB Output is correct
21 Correct 2 ms 1872 KB Output is correct
22 Correct 2 ms 1868 KB Output is correct
23 Correct 2 ms 1868 KB Output is correct
24 Correct 2 ms 1996 KB Output is correct
25 Correct 2 ms 1996 KB Output is correct
26 Correct 9 ms 3912 KB Output is correct
27 Correct 7 ms 2892 KB Output is correct
28 Correct 2 ms 2124 KB Output is correct
29 Correct 2 ms 1868 KB Output is correct
30 Correct 2 ms 1740 KB Output is correct
31 Correct 2 ms 1740 KB Output is correct
32 Correct 2 ms 1740 KB Output is correct
33 Correct 2 ms 1868 KB Output is correct
34 Correct 2 ms 1888 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 1 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 1 ms 1740 KB Output is correct
6 Correct 1 ms 1740 KB Output is correct
7 Correct 1 ms 1740 KB Output is correct
8 Correct 1 ms 1740 KB Output is correct
9 Correct 1 ms 1740 KB Output is correct
10 Correct 2 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 2004 KB Output is correct
13 Correct 5 ms 3920 KB Output is correct
14 Correct 2 ms 1896 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 2 ms 1868 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 67 ms 34032 KB Output is correct
21 Correct 2 ms 1868 KB Output is correct
22 Correct 2 ms 1904 KB Output is correct
23 Correct 2 ms 1872 KB Output is correct
24 Correct 3 ms 1996 KB Output is correct
25 Correct 3 ms 1996 KB Output is correct
26 Correct 10 ms 3952 KB Output is correct
27 Correct 7 ms 2892 KB Output is correct
28 Correct 3 ms 2124 KB Output is correct
29 Correct 2 ms 1864 KB Output is correct
30 Correct 2 ms 1732 KB Output is correct
31 Correct 1 ms 1740 KB Output is correct
32 Correct 2 ms 1740 KB Output is correct
33 Correct 2 ms 1868 KB Output is correct
34 Correct 2 ms 1868 KB Output is correct
35 Correct 11 ms 4048 KB Output is correct
36 Correct 3 ms 2124 KB Output is correct
37 Correct 13 ms 5580 KB Output is correct
38 Correct 15 ms 5068 KB Output is correct
39 Correct 15 ms 5324 KB Output is correct
40 Correct 17 ms 5164 KB Output is correct
41 Correct 14 ms 5068 KB Output is correct
42 Correct 115 ms 35280 KB Output is correct
43 Correct 101 ms 19048 KB Output is correct
44 Runtime error 402 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 1740 KB Output is correct
2 Correct 1 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 2 ms 1740 KB Output is correct
6 Correct 2 ms 1740 KB Output is correct
7 Correct 1 ms 1740 KB Output is correct
8 Correct 1 ms 1740 KB Output is correct
9 Correct 1 ms 1740 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 3 ms 2128 KB Output is correct
13 Correct 6 ms 3920 KB Output is correct
14 Correct 2 ms 1868 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 3 ms 2128 KB Output is correct
18 Correct 2 ms 1868 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 68 ms 33988 KB Output is correct
21 Correct 2 ms 1868 KB Output is correct
22 Correct 2 ms 1868 KB Output is correct
23 Correct 2 ms 1868 KB Output is correct
24 Correct 2 ms 1996 KB Output is correct
25 Correct 2 ms 1996 KB Output is correct
26 Correct 9 ms 3912 KB Output is correct
27 Correct 7 ms 2892 KB Output is correct
28 Correct 3 ms 2252 KB Output is correct
29 Correct 2 ms 1868 KB Output is correct
30 Correct 2 ms 1728 KB Output is correct
31 Correct 2 ms 1740 KB Output is correct
32 Correct 2 ms 1868 KB Output is correct
33 Correct 2 ms 1868 KB Output is correct
34 Correct 2 ms 1868 KB Output is correct
35 Correct 12 ms 3960 KB Output is correct
36 Correct 3 ms 2124 KB Output is correct
37 Correct 13 ms 5576 KB Output is correct
38 Correct 15 ms 5068 KB Output is correct
39 Correct 15 ms 5360 KB Output is correct
40 Correct 15 ms 5196 KB Output is correct
41 Correct 18 ms 5068 KB Output is correct
42 Correct 124 ms 35336 KB Output is correct
43 Correct 97 ms 18912 KB Output is correct
44 Runtime error 396 ms 262148 KB Execution killed with signal 9
45 Halted 0 ms 0 KB -