oj.uz

Submission #388816

# Submission time Handle Problem Language Result Execution time Memory
388816 2021-04-13T04:55:10 Z talant117408 Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 2 ms 1372 KB 
#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];
bool adj[2003][2003];
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] && pos != doges[i].first && !adj[doges[i].first][pos]) {
              	adj[doges[i].first][pos] = 1;
				graph[doges[i].first].pb(mp(pos, cnt));
			}
			cnt++;
		}
		cnt = 0;
		for (int pos = doges[i].first; pos >= 0; pos -= jump) {
			if (who[pos] && pos != doges[i].first && !adj[doges[i].first][pos]) {
              	adj[doges[i].first][pos] = 1;
				graph[doges[i].first].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 1024 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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 992 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 1100 KB Output is correct
10 Correct 1 ms 1148 KB Output is correct
11 Correct 1 ms 1228 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Incorrect 1 ms 1100 KB Output isn't correct

Subtask #3
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 1032 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 1100 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Incorrect 1 ms 1104 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
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 1044 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 1100 KB Output is correct
10 Correct 2 ms 1220 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 2 ms 972 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Incorrect 1 ms 1100 KB Output isn't correct
16 Halted 0 ms 0 KB -

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 976 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 1100 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 2 ms 972 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Incorrect 1 ms 1100 KB Output isn't correct
16 Halted 0 ms 0 KB -