Submission #61088

ソースコード

?
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
for (auto &e: vec) {
is >> e;
}
return is;
}
inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) {
cout << " ";
}
output(forward<Tail>(tail)...);
}
template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e: vec) {
os << e << delim[&e == &vec.back()];
}
return os;
}
template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class Container>
struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() { return c.rbegin(); }
auto end() { return c.rend(); }
};
template <class Container>
auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
// End Header }}}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.setf(ios_base::fixed);
cout.precision(10);
var(size_t, N, Q);
vector<intmax_t> x(N), y(N);
rep(i, 0, N) input(x[i], y[i]);
x.emplace_back(1);
y.emplace_back(1);
size_t cur = N;
intmax_t res = 0;
while (Q--) {
var(intmax_t, k);
intmax_t minv = LINF;
rep(i, 0, N) {
if (cur == i) continue;
const intmax_t dist = diff(x[cur], x[i]) + diff(y[cur], y[i]);
chmin(minv, diff(dist, k));
}
size_t cnt = 0, nxt;
rep(i, 0, N) {
if (cur == i) continue;
const intmax_t dist = diff(x[cur], x[i]) + diff(y[cur], y[i]);
if (diff(dist, k) == minv) {
cnt++;
nxt = i;
}
}
if (cnt == 1) {
res += diff(x[cur], x[nxt]) + diff(y[cur], y[nxt]);
cur = nxt;
} else {
res += diff(x[cur], x[N]) + diff(y[cur], y[N]);
cur = N;
}
}
output(res);
return 0;
}

ステータス

項目 データ
問題 1354 - 山田之国
ユーザー名 もけ
投稿日時 2020-07-17 20:43:24
言語 C++17
状態 Accepted
得点 50
ソースコード長 4430 Byte
最大実行時間 30 ms
最大メモリ使用量 740 KB

セット

セット 得点 Cases
1 ALL 50 / 50 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 22 ms 604 KB
1
in02.txt AC 19 ms 652 KB
1
in03.txt AC 26 ms 700 KB
1
in04.txt AC 30 ms 740 KB
1
in05.txt AC 26 ms 648 KB
1
in06.txt AC 28 ms 556 KB
1
in07.txt AC 27 ms 596 KB
1
in08.txt AC 25 ms 636 KB
1
in09.txt AC 20 ms 680 KB
1
in10.txt AC 26 ms 716 KB
1
in11.txt AC 23 ms 500 KB
1
in12.txt AC 21 ms 584 KB
1
in13.txt AC 26 ms 624 KB
1
in14.txt AC 26 ms 532 KB
1
in15.txt AC 26 ms 448 KB
1
in16.txt AC 21 ms 620 KB
1
in17.txt AC 21 ms 572 KB
1
in18.txt AC 21 ms 528 KB
1
in19.txt AC 20 ms 736 KB
1
in20.txt AC 21 ms 688 KB
1
in21.txt AC 24 ms 600 KB
1
sample01.txt AC 24 ms 548 KB
1
sample02.txt AC 21 ms 628 KB
1