Submission #61803

ソースコード

?
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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
#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 }}}
// SegmentTree {{{
template <typename Monoid>
struct SegmentTree {
using Func = function<Monoid(Monoid, Monoid)>;
const size_t sz;
const Func fn;
const Monoid unity;
vector<Monoid> seg;
SegmentTree(const size_t n, const Monoid &u, Func f)
: sz(1 << (__lg(n + 5) + 1)), fn(f), unity(u), seg(sz * 2, unity) {}
void set(size_t k, const Monoid &v) {
seg[k + sz] = v;
}
Monoid& operator[](size_t k) {
return seg[k + sz];
}
const Monoid& operator[](size_t k) const {
return seg[k + sz];
}
void build() {
for (size_t k = sz - 1; k > 0; --k) {
seg[k] = fn(seg[2 * k], seg[2 * k + 1]);
}
}
void update(size_t k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = fn(seg[2 * k], seg[2 * k + 1]);
}
}
Monoid query(size_t l, size_t r) const {
Monoid L = unity;
Monoid R = unity;
for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
if (l & 1) {
L = fn(L, seg[l++]);
}
if (r & 1) {
R = fn(seg[--r], R);
}
}
return fn(L, R);
}
};
// }}}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.setf(ios_base::fixed);
cout.precision(10);
var(size_t, T);
vector<tuple<intmax_t, intmax_t, size_t>> qs(T);
rep(i, 0, T) {
var(intmax_t, L, K);
qs[i] = {L, K, i};
}
sort(all(qs));
vector<intmax_t> res(T);
SegmentTree<intmax_t> sg(size_t(2e6) + 1, 0, [](auto a, auto b) { return a + b; });
intmax_t cur = 0;
for (const auto [L, K, i]: qs) {
while (cur <= L) {
rep(i, 0, cur) {
const intmax_t norm = cur * cur + i * i;
sg.update(norm, sg[norm] + 2);
}
const intmax_t norm = 2 * cur * cur;
sg.update(norm, sg[norm] + 1);
cur++;
}
intmax_t ng = -1, ok = 2 * L * L;
while (ok - ng > 1) {
const intmax_t mid = (ok + ng) / 2;
if (sg.query(0, mid + 1) >= K) ok = mid;
else ng = mid;
}
res[i] = ok;
}
for (const auto e: res) output(sqrt(e));
return 0;
}

ステータス

項目 データ
問題 1353 - Function of Euclidean Distance
ユーザー名 もけ
投稿日時 2020-08-06 16:55:09
言語 C++17
状態 Accepted
得点 400
ソースコード長 5702 Byte
最大実行時間 289 ms
最大メモリ使用量 50816 KB

セット

セット 得点 Cases
1 task01 60 / 60 in01*, sample01.txt
2 task02 340 / 340 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01_01.txt AC 28 ms 33372 KB
1
2
in01_02.txt AC 76 ms 33200 KB
1
2
in01_03.txt AC 22 ms 33156 KB
1
2
in01_04.txt AC 64 ms 33364 KB
1
2
in01_05.txt AC 65 ms 33308 KB
1
2
in01_06.txt AC 30 ms 33388 KB
1
2
in01_07.txt AC 28 ms 33212 KB
1
2
in01_08.txt AC 33 ms 33168 KB
1
2
in01_09.txt AC 68 ms 33248 KB
1
2
in01_10.txt AC 65 ms 33320 KB
1
2
in02_01.txt AC 239 ms 38008 KB
2
in02_02.txt AC 245 ms 39560 KB
2
in02_03.txt AC 235 ms 41108 KB
2
in02_04.txt AC 141 ms 42276 KB
2
in02_05.txt AC 68 ms 43440 KB
2
in02_06.txt AC 282 ms 44988 KB
2
in02_07.txt AC 285 ms 46536 KB
2
in02_08.txt AC 284 ms 47960 KB
2
in02_09.txt AC 284 ms 49388 KB
2
in02_10.txt AC 289 ms 50816 KB
2
sample01.txt AC 27 ms 47628 KB
1
2
sample02.txt AC 72 ms 47712 KB
2