제출 #48285

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

skyscraper

#include <deque>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
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);
	for (int i = 0; i < M; i++) {
		cin >> B[i] >> P[i];
		if(P[i] < N) vmod[P[i]].push_back(B[i]);
	}
	vector<vector<int> > g(N);
	for (int i = 1; i < N; i++) {
		sort(vmod[i].begin(), vmod[i].end(), [&](int j, int k) { return j % i != k % i ? j % i < k % i : j < k; });
		vmod[i].erase(unique(vmod[i].begin(), vmod[i].end()), vmod[i].end());
		int pl = 0;
		for (int j = 1; j <= vmod[i].size(); j++) {
			if (j != vmod[i].size() && vmod[i][j] % i == vmod[i][j - 1] % i) continue;
			int pre = -1;
			for (int k = vmod[i][j - 1] % i; k < N; k += i) {
				if (pre != -1) g[pre].push_back(g.size() * 2 + 1);
				g.push_back(pre == -1 ? vector<int>({ k * 2 }) : vector<int>({ k * 2, pre * 2 + 1 }));
				pre = g.size() - 1;
				while (pl != j && vmod[i][pl] < k) pl++;
				if (pl != j && vmod[i][pl] == k) g[k].push_back(pre * 2);
			}
			pl = j;
		}
	}
	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 (int e : g[u]) {
			if (dist[e >> 1] == -1) {
				dist[e >> 1] = dist[u] + (e & 1);
				if (e & 1) que.push_back(e >> 1);
				else que.push_front(e >> 1);
			}
		}
	}
	cout << dist[B[1]] << '\n';
	return 0;
}

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

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:22:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 1; j <= vmod[i].size(); j++) {
                   ~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:23:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (j != vmod[i].size() && vmod[i][j] % i == vmod[i][j - 1] % i) continue;
        ~~^~~~~~~~~~~~~~~~~

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