Submission #103852

#	Time	Username	Problem	Language	Result	Execution time	Memory
103852		E869120	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	36 / 100	754 ms	263168 KiB

skyscraper

#include <iostream>
#include <vector>
#include <map>
#include <queue>
using namespace std;

vector<pair<int, int>>X[30009]; map<int, int>Map[30009];
int N, M, B[30009], P[30009], dist[30009];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>Q;

int main() {
	cin >> N >> M;
	for (int i = 0; i < M; i++) { cin >> B[i] >> P[i]; Map[B[i]][P[i]] = 1; }
	for (int i = 0; i < M; i++) {
		int cnt = 0;
		for (int j = B[i] - P[i]; j >= 0; j -= P[i]) {
			cnt++;
			X[B[i]].push_back(make_pair(j, cnt));
			if (Map[j][P[i]] == 1) break;
		}
		cnt = 0;
		for (int j = B[i] + P[i]; j < N; j += P[i]) {
			cnt++;
			X[B[i]].push_back(make_pair(j, cnt));
			if (Map[j][P[i]] == 1) break;
		}
	}

	for (int i = 0; i < N; i++) dist[i] = (1 << 30);
	dist[B[0]] = 0; Q.push(make_pair(0, B[0]));

	while (!Q.empty()) {
		int pos = Q.top().second; Q.pop();
		for (int i = 0; i < X[pos].size(); i++) {
			int to = X[pos][i].first, cost = X[pos][i].second;
			if (dist[to] > dist[pos] + cost) {
				dist[to] = dist[pos] + cost;
				Q.push(make_pair(dist[to], to));
			}
		}
	}
	if (dist[B[1]] == (1 << 30)) cout << "-1" << endl;
	else cout << dist[B[1]] << endl;
	return 0;
}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:34:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < X[pos].size(); i++) {
                   ~~^~~~~~~~~~~~~~~

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