제출 #145197

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
145197	2019-08-19 08:44:50	ecnerwala	Sky Walking (IOI19_walk)	C++14	100 / 100	1565 ms	132924 KiB

walk

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "walk.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using height_t = pair<int, int>;
ll min_distance(vector<int> X_, vector<int> H_, vector<int> L, vector<int> R, vector<int> Y_, int S, int T) {
  int N = int(X_.size());
  int M = int(Y_.size());
  vector<ll> X(X_.begin(), X_.end());
  vector<height_t> H(N);
  for (int i = 0; i < N; i++) {
    H[i] = {H_[i], i};
  }
  vector<height_t> Y(M);
  for (int e = 0; e < M; e++) {
    Y[e] = {Y_[e], -1-e};
  }
  vector<vector<height_t>> needs(N);
  vector<height_t> heights;
  heights.insert(heights.end(), H.begin(), H.end());
  heights.insert(heights.end(), Y.begin(), Y.end());
  sort(heights.begin(), heights.end());
  reverse(heights.begin(), heights.end());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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