제출 #698333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
698333		jk410	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1081 ms	94864 KiB

skyscraper

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#define all(v) v.begin(),v.end()
#define compress(v) v.erase(unique(all(v)),v.end())
using namespace std;
const int INF = (int)1e9;
struct edge {
	int v, cost;
	bool operator<(const edge& tmp)const {
		return cost > tmp.cost;
	}
};
int N,M;
int B[30000];
vector<int> P[30000];
map<int, bool> Used[30000];
vector<edge> Edge[30000];
int Dist[30000];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		int p;
		cin >> B[i] >> p;
		P[B[i]].push_back(p);
	}
	for (int i = 0; i < N; i++) {
		for (int j : P[i]) {
			for (int k = 1; i - k * j >= 0; k++) {
				Edge[i].push_back({ i - k * j,k });
				if (Used[i - k * j][j])
					break;
				Used[i - k * j][j] = true;
			}
		}
	}
	for (int i = N - 1; i >= 0; i--) {
		Used[i].clear();
		for (int j : P[i]) {
			for (int k = 1; i + k * j < N; k++) {
				Edge[i].push_back({ i + k * j,k });
				if (Used[i + k * j][j])
					break;
				Used[i + k * j][j] = true;
			}
		}
	}
	priority_queue<edge> q;
	fill(Dist, Dist + N, INF);
	Dist[B[0]] = 0;
	q.push({ B[0],0});
	while (!q.empty()) {
		auto t = q.top();
		q.pop();
		if (Dist[t.v] < t.cost)
			continue;
		for (edge i : Edge[t.v]) {
			if (Dist[i.v] > t.cost + i.cost) {
				Dist[i.v] = t.cost + i.cost;
				q.push({ i.v,Dist[i.v] });
			}
		}
	}
	int ans = Dist[B[1]];
	if (ans == INF)
		ans = -1;
	cout << ans;
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 14 / 14
• Subtask 4: 21 / 21
• Subtask 5: 0 / 43