제출 #699861

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

skyscraper

#include <bits/stdc++.h>
using namespace std;
const int mxN = 3e4 + 1;
pair<int, int> doge[mxN];
queue<int> jump[mxN];
map<int, int> dist[mxN];
queue<pair<int, int>> q[2];
int curdist = 0;
int n;
void PushElement(pair<int, pair<int, int>> &nxt) {
	q[(nxt.first & 1)].push(nxt.second);
}
void AddElement(pair<int, pair<int, int>> &nxt) {
	if (!(0 <= nxt.second.first && nxt.second.first < n)) return;
	if (dist[nxt.second.first].find(nxt.second.second) == dist[nxt.second.first].end()) {
		PushElement(nxt);
		dist[nxt.second.first][nxt.second.second] = nxt.first;
	} else if (dist[nxt.second.first][nxt.second.second] > nxt.first) {
		PushElement(nxt);
		dist[nxt.second.first][nxt.second.second] = nxt.first;
	}
}
void solve() {
	int m;
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		cin >> doge[i].first >> doge[i].second;
		if (i != 0) jump[doge[i].first].push(doge[i].second);
	}
	pair<int, pair<int, int>> nxt;
	nxt = {0, doge[0]};
	AddElement(nxt);
	while (!q[(curdist & 1)].empty()) {
		while (!q[(curdist & 1)].empty()) {
			pair<int, int> cur = q[(curdist & 1)].front();
			q[(curdist & 1)].pop();
			if (dist[cur.first][cur.second] < curdist) continue;
			if (cur.first == doge[1].first) {
				cout << curdist << endl;
				return;
			}
			while (!jump[cur.first].empty()) {
				int delta = jump[cur.first].front();
				jump[cur.first].pop();
				nxt = {curdist, {cur.first, delta}};
				AddElement(nxt);
			}
			nxt = {curdist + 1, {cur.first - cur.second, cur.second}};
			AddElement(nxt);
			nxt = {curdist + 1, {cur.first + cur.second, cur.second}};
			AddElement(nxt);
		}
		curdist++;
	}
	cout << "-1\n";
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	solve();
}

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