oj.uz

Submission #736590

# Submission time Handle Problem Language Result Execution time Memory
736590 2023-05-06T01:48:58 Z minhcool Jakarta Skyscrapers (APIO15_skyscraper) C++17
0 / 100
 2 ms 1044 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e4 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

int n, m;
int b[N], p[N];

bool vis[N][205];

int mn_dist[N];

vector<int> doges[N];

priority_queue<pair<int, ii>, vector<pair<int, ii>>, greater<pair<int, ii>>> pq;

void process(){
	cin >> n >> m;
	for(int i = 1; i <= m; i++){
		cin >> b[i] >> p[i];
		b[i]++;
		doges[b[i]].pb(p[i]);
	}
	for(int i = 1; i <= n; i++) mn_dist[i] = oo;
	pq.push({0, {b[1], p[1]}});
	mn_dist[b[1]] = 0;
	if(p[1] <= 200) vis[b[1]][p[1]] = 1;
	while(!pq.empty()){
		int d = pq.top().fi, u = pq.top().se.fi, p = pq.top().se.se;
		pq.pop();
		if(p <= 200){
			if((u > p) && !vis[u - p][p]){
				vis[u - p][p] = 1;
				mn_dist[u - p] = min(mn_dist[u - p], d + 1);
				pq.push({d + 1, {u - p, p}});
			}	
			if((u + p) <= n && !vis[u + p][p]){
				vis[u + p][p] = 1;
				mn_dist[u + p] = min(mn_dist[u + p], d + 1);
				pq.push({d + 1, {u + p, p}});
			}
		}
		if(d == mn_dist[u]){
			for(auto it : doges[u]){
				if(it <= 200){
					if(!vis[u][it]){
						vis[u][it] = 1;
						pq.push({d, {u, it}});
					}
				}
				else{
					for(int i = (u % it); i <= n; i += it){
						if(!i) continue;
						int dist = abs(i - u) / it;
						if(mn_dist[i] > (mn_dist[u] + dist)){
							mn_dist[i] = mn_dist[u] + dist;
							pq.push({mn_dist[i], {u, it}});
						}
					}
				}
			}
		}
	}
	cout << mn_dist[b[2]] << "\n";
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1044 KB Output is correct
3 Correct 2 ms 1044 KB Output is correct
4 Incorrect 2 ms 1036 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1044 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Incorrect 1 ms 980 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Incorrect 1 ms 980 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Incorrect 1 ms 1036 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Incorrect 1 ms 1024 KB Output isn't correct
5 Halted 0 ms 0 KB -