제출 #977953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977953		SmuggingSpun	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	153 ms	67896 KiB

skyscraper

#include<bits/stdc++.h>
#define taskname "skyscraper"
using namespace std;
typedef long long ll;
template<class T>bool minimize(T& a, T b){
	if(a > b){
		a = b;
		return true;
	}
	return false;
}
const int lim = 3e4 + 5;
int n, m, b[lim], p[lim];
namespace sub1{
	void solve(){
		if(m == 2){
			return void(cout << (abs(b[0] - b[1]) % p[0] == 0 ? abs(b[0] - b[1]) / p[0] : -1));
		}
		int ans = (abs(b[0] - b[1]) % p[0] == 0 ? abs(b[0] - b[1]) / p[0] : INT_MAX);
		if(abs(b[0] - b[2]) % p[0] == 0 && abs(b[2] - b[1]) % p[2] == 0){
			minimize(ans, abs(b[0] - b[2]) / p[0] + abs(b[2] - b[1]) / p[2]);
		}
		cout << (ans == INT_MAX ? -1 : ans);
	}
}
namespace sub23{
	const int LIM = 2e3 + 5;
	int d[LIM];
	void solve(){
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
		memset(d, 0x0f, sizeof(d));
		pq.emplace(d[0] = 0, 0);
		while(!pq.empty()){
			auto [w, u] = pq.top();
			pq.pop();
			if(w == d[u]){
				for(int v = 0; v < m; v++){
					if(abs(b[u] - b[v]) % p[u] == 0 && minimize(d[v], w + abs(b[u] - b[v]) / p[u])){
						pq.emplace(d[v], v);
					}
				}
			}
		}
		cout << (d[1] == d[LIM - 1] ? -1 : d[1]);
	}
}
namespace sub4{
	const int LIM = 2e3 + 5;
	int d[LIM];
	vector<int>pos[LIM];
	void solve(){
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
		memset(d, 0x0f, sizeof(d));
		pq.emplace(d[b[0]] = 0, b[0]);
		for(int i = 0; i < m; i++){
			pos[b[i]].emplace_back(i);
		}
		while(!pq.empty()){
			auto [w, u] = pq.top();
			pq.pop();
			if(u == b[1]){
				return void(cout << w);
			}
			if(w == d[u]){
				for(int& index : pos[u]){
					for(int v = u - p[index], cnt = 1; v > -1; v -= p[index], cnt++){
						if(minimize(d[v], w + cnt)){
							pq.emplace(d[v], v);
						}
					}
					for(int v = u + p[index], cnt = 1; v < n; v += p[index], cnt++){
						if(minimize(d[v], w + cnt)){
							pq.emplace(d[v], v);
						}
					}
				}
			}
		}
		cout << -1;
	}
}
namespace sub5{
	vector<int>pai[lim];
	vector<pair<int, int>>e[lim];
	int d[lim];
	bool exist(int p, int v){
		auto it = lower_bound(pai[p].begin(), pai[p].end(), v);
		return it != pai[p].end() && *it == v;
	}
	void solve(){
		for(int i = 0; i < m; i++){
			pai[b[i]].emplace_back(p[i]);
		}
		for(int i = 0; i < n; i++){
			sort(pai[i].begin(), pai[i].end());
			pai[i].resize(unique(pai[i].begin(), pai[i].end()) - pai[i].begin());
		}
		for(int i = 0; i < n; i++){
			for(int& jump : pai[i]){
				for(int v = i - jump, cnt = 1; v > -1; v -= jump, cnt++){
					e[i].emplace_back(v, cnt);
					if(exist(v, jump)){
						break;
					}
				}
				for(int v = i + jump, cnt = 1; v < n; v += jump, cnt++){
					e[i].emplace_back(v, cnt);
					if(exist(v, jump)){
						break;
					}
				}
			}
		}
		memset(d, 0x0f, sizeof(d));
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
		pq.emplace(d[b[0]] = 0, b[0]);
		while(!pq.empty()){
			auto [w, u] = pq.top();
			pq.pop();
			if(u == b[1]){
				return void(cout << w);
			}
			if(w == d[u]){
				for(auto& [ev, ew] : e[u]){
					if(minimize(d[ev], w + ew)){
						pq.emplace(d[ev], ev);
					}
				}
			}
		}
		cout << -1;
	}
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		cin >> b[i] >> p[i];
	}
	if(n <= 10 && m <= 3){
		sub1::solve();
	}
	else if(n <= 2000 && m <= 2000){
		sub23::solve();
	}
	else if(n <= 2000){
		sub4::solve();
	}
	else{
		sub5::solve();
	}
}

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

skyscraper.cpp: In function 'void sub23::solve()':
skyscraper.cpp:34:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp: In function 'void sub4::solve()':
skyscraper.cpp:59:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp: In function 'void sub5::solve()':
skyscraper.cpp:118:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  118 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp:124:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  124 |     for(auto& [ev, ew] : e[u]){
      |               ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:137:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |   freopen(taskname".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

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