Submission #48178

#	Time	Username	Problem	Language	Result	Execution time	Memory
48178		square1001	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1008 ms	181068 KiB

skyscraper

#include <deque>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
struct edge {
	int to, cost;
	edge() : to(-1), cost(-1) {};
	edge(int to_, int cost_) : to(to_), cost(cost_) {};
};
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	int N, M;
	cin >> N >> M;
	vector<int> B(M), P(M);
	vector<vector<int> > vmod(N), vx(N);
	for (int i = 0; i < M; i++) {
		cin >> B[i] >> P[i];
		vx[B[i]].push_back(P[i]);
		if(P[i] < N) vmod[P[i]].push_back(B[i] % P[i]);
	}
	for (int i = 0; i < N; i++) {
		sort(vx[i].begin(), vx[i].end());
	}
	vector<vector<edge> > g(N);
	for (int i = 1; i < N; i++) {
		sort(vmod[i].begin(), vmod[i].end());
		vmod[i].erase(unique(vmod[i].begin(), vmod[i].end()), vmod[i].end());
		for (int j : vmod[i]) {
			int pre = -1;
			for (int k = j; k < N; k += i) {
				if (j != k) g[pre].push_back(edge(g.size(), 1));
				g.push_back(j == k ? vector<edge>({ edge(k, 0) }) : vector<edge>({ edge(k, 0), edge(pre, 1) }));
				pre = g.size() - 1;
				if (binary_search(vx[k].begin(), vx[k].end(), i)) {
					g[k].push_back(edge(pre, 0));
				}
			}
		}
	}
	vector<int> dist(g.size(), -1); dist[B[0]] = 0;
	deque<int> que; que.push_back(B[0]);
	while (!que.empty()) {
		int u = que.front(); que.pop_front();
		for (edge e : g[u]) {
			if (dist[e.to] == -1) {
				dist[e.to] = dist[u] + e.cost;
				if (e.cost == 0) que.push_front(e.to);
				else que.push_back(e.to);
			}
		}
	}
	cout << dist[B[1]] << '\n';
	return 0;
}

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