Submission #248513

#	Time	Username	Problem	Language	Result	Execution time	Memory
248513		sahil_k	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	520 ms	262148 KiB

skyscraper

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <queue>
using namespace std;
int main () {
	int n, m;
	cin >> n >> m;
	int rt = sqrt(n);
	vector< pair<int, int> > adj[n*rt];
	int start, end;
	for (int i=0; i<n; i++) {
		for (int j=1; j<rt; j++) {
			adj[i*rt+j].push_back({i*rt, 0});
			if (i-j >= 0) adj[i*rt+j].push_back({(i-j)*rt+j, 1});
			if (i+j < n) adj[i*rt+j].push_back({(i+j)*rt+j, 1});
		}
	}
	int bi, pi;
	for (int i=0; i<m; i++) {
		cin >> bi >> pi;
		if (i == 0) start = bi;
		if (i == 1) end = bi;
		if (pi < rt) {
			adj[bi*rt].push_back({bi*rt+pi, 0});
		} else {
			for (int j=1; j<n; j++) {
				if (bi-j*pi < 0 && bi+j*pi >= n) break;
				if (bi-j*pi >= 0) adj[bi*rt].push_back({(bi-j*pi)*rt, j});
				if (bi+j*pi < n) adj[bi*rt].push_back({(bi+j*pi)*rt, j});
			}
		}
	}
	long long dist[n*rt];
	bool vis[n*rt];
	for (int i=0; i<n*rt; i++) {
		dist[i] = 1e16;
		vis[i] = false;
	}
	priority_queue< pair<long long, int> > ord;
	dist[start*rt] = 0;
	ord.push({0, start*rt});
	while (ord.size() > 0) {
		pair<long long, int> cur = ord.top();
		ord.pop();
		if (vis[cur.second]) continue;
		vis[cur.second] = true;
		cur.first = -cur.first;
		for (auto i: adj[cur.second]) {
			if (!vis[i.first] && cur.first+i.second < dist[i.first]) {
				dist[i.first] = cur.first+i.second;
				ord.push({-dist[i.first], i.first});
			}
		}
	}
	if (dist[end*rt] == 1e16) {
		cout << -1 << endl;
	} else {
		cout << dist[end*rt] << endl;
	}
}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:43:12: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]
  dist[start*rt] = 0;
       ~~~~~^~~
skyscraper.cpp:58:14: warning: 'end' may be used uninitialized in this function [-Wmaybe-uninitialized]
  if (dist[end*rt] == 1e16) {
           ~~~^~~

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