Submission #103857

#	Time	Username	Problem	Language	Result	Execution time	Memory
103857		E869120	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1028 ms	72396 KiB

skyscraper

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

const int MAX_N = 1000000;

vector<pair<int, int>>X[30009]; map<int, int>Map[30009], Map2[30009];
int N, M, B[30009], P[30009], dist[30009], cntv;
vector<int>Q[MAX_N];

int main() {
	srand((unsigned)time(NULL));
	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++) {
		if (Map2[B[i]][P[i]] == 1) continue;
		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)); cntv++;
			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)); cntv++;
			if (Map[j][P[i]] == 1) break;
		}
		Map2[B[i]][P[i]] = 1;
		assert(cntv <= 1000000);
	}

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

	for (int i = 0; i < MAX_N - 1; i++) {
		for (int j = 0; j < Q[i].size(); j++) {
			int pos = Q[i][j];
			for (int k = 0; k < X[pos].size(); k++) {
				int to = X[pos][k].first, cost = X[pos][k].second;
				if (dist[to] > dist[pos] + cost) {
					dist[to] = dist[pos] + cost;
					Q[dist[to]].push_back(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:44:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < Q[i].size(); j++) {
                   ~~^~~~~~~~~~~~~
skyscraper.cpp:46:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = 0; k < X[pos].size(); k++) {
                    ~~^~~~~~~~~~~~~~~

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