제출 #1053328

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053328		Tob	Sky Walking (IOI19_walk)	C++14	10 / 100	4067 ms	255572 KiB

walk

#include <bits/stdc++.h>

#include "walk.h"

#define F first
#define S second
#define pb push_back

#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef vector <int> vi;

const int N = 1e5 + 7, C = 12e5 + 7;
const ll inf = 1e18;

int n, m, cnt;
ll g[N], h[N], dis[C];
vector <pii> ad[N], adj[C];
map <int, vector <int> > ma;

void Edge(int x, int y, int val) {
	adj[x].pb({y, val});
	adj[y].pb({x, val});
}

ll min_distance(vi x, vi h, vi l, vi r, vi y, int sta, int en) {
	n = x.size(); m = l.size();
	for (int i = 0; i < n; i++) ma[h[i]].pb(i);
	for (int i = 0; i < m; i++) ma[y[i]].pb(i+n);
	set <int> st;
	cnt = n;
	auto itt = --ma.end();
	while (1) {
		auto it = *itt;
		vector <int> v = it.S;
		for (auto xx : v) {
			if (xx < n) st.insert(xx);
			else {
				xx -= n;
				auto p = st.lower_bound(l[xx]);
				int la = -1;
				while (p != st.end() && *p <= r[xx]) {
					ad[*p].pb({it.F, cnt});
					if (la != -1) Edge(cnt-1, cnt, x[*p]-x[la]);
					la = *p;
					++p;
					cnt++;
				}
			}
		}
		if (itt == ma.begin()) break;
		--itt;
	}
	for (int i = 0; i < n; i++) {
		reverse(all(ad[i]));
		ad[i].erase(unique(all(ad[i])), ad[i].end());
		if (ad[i].empty()) continue;
		Edge(i, ad[i][0].S, ad[i][0].F);
		for (int j = 1; j < ad[i].size(); j++) Edge(ad[i][j-1].S, ad[i][j].S, ad[i][j].F-ad[i][j-1].F);
	}
	
	set <pii> s;
	s.insert({0, sta});
	for (int i = 0; i < cnt; i++) dis[i] = inf;
	dis[sta] = 0;
	
	while (!s.empty()) {
		auto p = s.begin();
		int xx = p -> S;
		s.erase(p);
		for (auto y : adj[xx]) {
			if (dis[xx] + y.S < dis[y.F]) {
				if (dis[y.F] != inf) s.erase({dis[y.F], y.F});
				dis[y.F] = dis[xx] + y.S;
				s.insert({dis[y.F], y.F});
			}
		}
	}
	
	return (dis[en] >= inf) ? -1 : dis[en];
}

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

walk.cpp: In function 'll min_distance(vi, vi, vi, vi, vi, int, int)':
walk.cpp:63:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for (int j = 1; j < ad[i].size(); j++) Edge(ad[i][j-1].S, ad[i][j].S, ad[i][j].F-ad[i][j-1].F);
      |                   ~~^~~~~~~~~~~~~~

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