Submission #416738

#	Time	Username	Problem	Language	Result	Execution time	Memory
416738		peuch	Sky Walking (IOI19_walk)	C++17	0 / 100	4080 ms	202788 KiB

walk

#include "walk.h"
#include<bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 10;
const long long INF = 1e18;

map<pair<int, int>, int> node;
vector<long long> dist;
vector<int> marc;
vector<vector<long long> > ar, wg;
int cnt = -1;

struct event{
	int l, r, h;
	event(int _l = 0, int _r = 0, int _h = 0){
		l = _l, r = _r, h = _h;
	}
	bool operator < (event x) const {
		if(h == x.h) return r - l < x.l - x.r;
		return h > x.h;	
	}
};

vector<event> line;

void dijkstra(int ini);

long long min_distance(std::vector<int> X, std::vector<int> H, std::vector<int> L, std::vector<int> R, std::vector<int> Y, int S, int G) {
	for(int i = 0; i < X.size(); i++)
		line.push_back(event(i, i, H[i]));
	for(int i = 0; i < L.size(); i++)
		line.push_back(event(L[i], R[i], Y[i]));
	sort(line.begin(), line.end());
	vector<int> last(X.size(), 0);
	set<int> torres;
	for(int i = 0; i < line.size(); i++){
		int l = line[i].l, r = line[i].r, y = line[i].h;
		if(l == r) torres.insert(l);
		else{
			set<int> :: iterator it = torres.lower_bound(l);
			if(node[make_pair(*it, y)] == 0) {
				node[make_pair(*it, y)] = ++cnt;
				ar.push_back(vector<long long>(0));
				wg.push_back(vector<long long>(0));
				dist.push_back(INF);
				marc.push_back(0);
				if(last[*it] != 0) {
					ar[node[make_pair(*it, y)]].push_back(node[make_pair(*it, last[*it])]);
					ar[node[make_pair(*it, last[*it])]].push_back(node[make_pair(*it, y)]);
					wg[node[make_pair(*it, y)]].push_back(abs(y - last[*it]));
					wg[node[make_pair(*it, last[*it])]].push_back(abs(y - last[*it]));
				}
				last[*it] = y;
			}
			int ult = *it;
			it++;
			while(it != torres.end() && *it <= r){
				if(node[make_pair(*it, y)] == 0) {
					node[make_pair(*it, y)] = ++cnt;
					ar.push_back(vector<long long>(0));
					wg.push_back(vector<long long>(0));
					dist.push_back(INF);
					marc.push_back(0);
					if(last[*it] != 0) {
						ar[node[make_pair(*it, y)]].push_back(node[make_pair(*it, last[*it])]);
						ar[node[make_pair(*it, last[*it])]].push_back(node[make_pair(*it, y)]);
						wg[node[make_pair(*it, y)]].push_back(abs(y - last[*it]));
						wg[node[make_pair(*it, last[*it])]].push_back(abs(y - last[*it]));
					}
					last[*it] = y;
				}
				ar[node[make_pair(*it, y)]].push_back(node[make_pair(ult, y)]);
				ar[node[make_pair(ult, y)]].push_back(node[make_pair(*it, y)]);
				wg[node[make_pair(*it, y)]].push_back(abs(X[*it] - X[ult]));
				wg[node[make_pair(ult, y)]].push_back(abs(X[*it] - X[ult]));
				
				ult = *it;
				it++;
			}
		}
	}
	for(int i = 0; i < X.size(); i++){
		if(node[make_pair(i, 0)] == 0) {
			node[make_pair(i, 0)] = ++cnt;
			ar.push_back(vector<long long>(0));
			wg.push_back(vector<long long>(0));	
			dist.push_back(INF);
			marc.push_back(0);
			if(last[i] != 0) {
				ar[node[make_pair(i, 0)]].push_back(node[make_pair(i, last[i])]);
				ar[node[make_pair(i, last[i])]].push_back(node[make_pair(i, 0)]);
				wg[node[make_pair(i, 0)]].push_back(abs(0 - last[i]));
				wg[node[make_pair(i, last[i])]].push_back(abs(0 - last[i]));			
			}
			last[i] = 0;
		}
	}
	dijkstra(node[make_pair(S, 0)]);
	if(dist[node[make_pair(G, 0)]] >= INF) dist[node[make_pair(G, 0)]] = -1;
	return dist[node[make_pair(G, 0)]];
}

void dijkstra(int ini){
	dist[ini] = 0;
	set<pair<long long, int> > s;
	for(int i = 0; i <= cnt; i++)
		s.insert(make_pair(dist[i], i));
	while(!s.empty()){
		int cur = s.begin()->second;
		if(dist[cur] >= INF) break;
		marc[cur] = 1;
		s.erase(s.begin());
		for(int i = 0; i < ar[cur].size(); i++){
			int viz = ar[cur][i];
			if(marc[viz]) continue;
			s.erase(make_pair(dist[viz], viz));
			dist[viz] = min(dist[viz], dist[cur] + wg[cur][i]);
			s.insert(make_pair(dist[viz], viz));
		}
	}
}

Compilation message (stderr)

walk.cpp: In function 'long long int min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for(int i = 0; i < X.size(); i++)
      |                 ~~^~~~~~~~~~
walk.cpp:32:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for(int i = 0; i < L.size(); i++)
      |                 ~~^~~~~~~~~~
walk.cpp:37:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for(int i = 0; i < line.size(); i++){
      |                 ~~^~~~~~~~~~~~~
walk.cpp:83:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |  for(int i = 0; i < X.size(); i++){
      |                 ~~^~~~~~~~~~
walk.cpp: In function 'void dijkstra(int)':
walk.cpp:114:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |   for(int i = 0; i < ar[cur].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 18
• Subtask 5: 0 / 43