제출 #48166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
48166		E869120	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1018 ms	103440 KiB

skyscraper

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

int N, M, A[30009], P[30009], dist[7400009], sz; pair<int, int>vec[2400009];
vector<pair<int, int>>X[2400009]; vector<int> G[30009];
map<pair<int, int>, int>M1; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>Q;

void connect(int px, int py, int qx, int qy, int cost) {
	int pos1 = lower_bound(vec, vec + sz, make_pair(px, py)) - vec;
	int pos2 = lower_bound(vec, vec + sz, make_pair(qx, qy)) - vec;
	X[pos1].push_back(make_pair(pos2, cost));
}

int main() {
	cin >> N >> M;
	for (int i = 1; i <= M; i++) {
		cin >> A[i] >> P[i]; G[A[i]].push_back(P[i]);
		if (M1[make_pair(A[i] % P[i], P[i])] == 0) {
			M1[make_pair(A[i] % P[i], P[i])] = 1;
			for (int j = A[i] % P[i]; j < N; j += P[i]) { vec[sz] = make_pair(j, P[i]); sz++; }
		}
	}
	for (int i = 0; i < N; i++) { sort(G[i].begin(), G[i].end()); vec[sz] = make_pair(i, 0); sz++; }
	sort(vec, vec + sz);
	
	for (int i = 0; i < sz; i++) {
		int pos = vec[i].first, state = vec[i].second;

		if (state == 0) {
			int pos1 = lower_bound(vec, vec + sz, make_pair(pos, 0)) - vec;
			int cx = pos1;
			for (int j = 0; j < G[pos].size(); j++) {
				while (vec[cx] != make_pair(pos, G[pos][j])) cx++;
				X[pos1].push_back(make_pair(cx, 0));
			}
		}
		else {
			connect(pos, state, pos, 0, 0);
			if (pos - state >= 0) connect(pos, state, pos - state, state, 1);
			if (pos + state < N) connect(pos, state, pos + state, state, 1);
		}
	}
	for (int i = 0; i < sz; i++) dist[i] = (1 << 30);
	int sx = lower_bound(vec, vec + sz, make_pair(A[1], 0)) - vec;
	int gx = lower_bound(vec, vec + sz, make_pair(A[2], 0)) - vec;
	dist[sx] = 0; Q.push(make_pair(dist[sx], sx));

	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));
			}
		}
	}
	int ans = dist[gx]; if (ans == (1 << 30)) ans = -1;
	cout << ans << endl;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:38:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < G[pos].size(); j++) {
                    ~~^~~~~~~~~~~~~~~
skyscraper.cpp:57: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: 21 / 21
• Subtask 5: 0 / 43