제출 #296400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
296400		theStaticMind	Sky Walking (IOI19_walk)	C++14	0 / 100	4062 ms	102280 KiB

walk

#include <bits/stdc++.h>
#include "walk.h"
using namespace std;
#define ii pair<int,int>

vector<int>E[100000], B[100000];
vector<ii> adj[100000];

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) {
	map<int, int> curr;
	priority_queue<pair<long long, ii>> Q;
	map<ii, long long> val;
	set<ii> vis;

	for(int i = 0; i < r.size(); i++){
		E[r[i]].push_back(y[i]);
		B[l[i]].push_back(y[i]);
	}

	for(int i = 0; i < x.size(); i++){

		for(auto& Y : curr){
			if(Y.first > h[i]) break;

			adj[i].push_back({Y.second, Y.first});
			adj[Y.second].push_back({i, Y.first});

			Y.second = i;
		}

		for(auto Y : E[i]) curr.erase(Y);
		for(auto Y : B[i]) curr[Y] = i;
	}

	val[{s, 0}] = 0;
	Q.push({0, {s, 0}});

	while(!Q.empty()){
		ii p = Q.top().second;
		Q.pop();
		if(vis.count(p)) continue;
		vis.insert(p);
		for(auto y : adj[p.first]){
			if(vis.count(y) || (val.count(y) && val[y] <= val[p] + abs(p.second - y.second) + abs(x[p.first] - x[y.first]))) continue;
			val[y] = val[p] + abs(p.second - y.second) + abs(x[p.first] - x[y.first]);
			Q.push({-val[y], y});
		}
	}
	long long ans = 1e18;
	for(auto p : val){
		if(p.first.first == g) ans = min(ans, p.second + p.first.second);
	}
	return ans;
}

컴파일 시 표준 에러 (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:15:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for(int i = 0; i < r.size(); i++){
      |                 ~~^~~~~~~~~~
walk.cpp:20:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for(int i = 0; i < x.size(); i++){
      |                 ~~^~~~~~~~~~

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