Submission #62317
ソースコード
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 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 | #define _USE_MATH_DEFINES#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < (n); ++i)#define FOR(i, m, n) for (int i = (m); i < (n); ++i)#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)#define rfor(i, m, n) for (int i = (m); i >= (n); --i)#define unless(c) if (!(c))#define sz(x) ((int)(x).size())#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)using namespace std;using ll = long long;using LD = long double;using VB = vector<bool>;using VVB = vector<VB>;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<ll>;using VVL = vector<VL>;using VS = vector<string>;using VD = vector<LD>;using PII = pair<int, int>;using VP = vector<PII>;using PLL = pair<ll, ll>;using VPL = vector<PLL>;template <class T> using PQ = priority_queue<T>;template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;constexpr int inf = 1e9;constexpr long long inf_ll = 1e18, MOD = 1000000007;constexpr long double PI = M_PI, EPS = 1e-12;// --- input --- //#ifdef _WIN32#define getchar_unlocked _getchar_nolock#define putchar_unlocked _putchar_nolock#define fwrite_unlocked fwrite#define fflush_unlocked fflush#endifclass Input { static int gc() { return getchar_unlocked(); } template <class T> static void i(T& v) { cin >> v; } static void i(char& v) { while (isspace(v = gc())) ; } static void i(bool& v) { v = in<char>() != '0'; } static void i(string& v) { v.clear(); char c; for (i(c); !isspace(c); c = gc()) v += c; } static void i(int& v) { bool neg = false; v = 0; char c; i(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c); c = gc()) v = v * 10 + (c - '0'); if (neg) v = -v; } static void i(long long& v) { bool neg = false; v = 0; char c; i(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c); c = gc()) v = v * 10 + (c - '0'); if (neg) v = -v; } static void i(double& v) { double dp = 1; bool neg = false, adp = false; v = 0; char c; i(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c) || c == '.'; c = gc()) { if (c == '.') adp = true; else if (adp) v += (c - '0') * (dp *= 0.1); else v = v * 10 + (c - '0'); } if (neg) v = -v; } static void i(long double& v) { long double dp = 1; bool neg = false, adp = false; v = 0; char c; i(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c) || c == '.'; c = gc()) { if (c == '.') adp = true; else if (adp) v += (c - '0') * (dp *= 0.1); else v = v * 10 + (c - '0'); } if (neg) v = -v; } template <class T, class U> static void i(pair<T, U>& v) { i(v.first); i(v.second); } template <class T> static void i(vector<T>& v) { for (auto& e : v) i(e); } template <size_t N = 0, class T> static void input_tuple(T& v) { if constexpr (N < tuple_size_v<T>) { i(get<N>(v)); input_tuple<N + 1>(v); } } template <class... T> static void i(tuple<T...>& v) { input_tuple(v); } struct InputV { int n, m; InputV(int _n) : n(_n), m(0) {} InputV(const pair<int, int>& nm) : n(nm.first), m(nm.second) {} template <class T> operator vector<T>() { vector<T> v(n); i(v); return v; } template <class T> operator vector<vector<T>>() { vector<vector<T>> v(n, vector<T>(m)); i(v); return v; } };public: static string read_line() { string v; char c; for (i(c); c != '\n' && c != '\0'; c = gc()) v += c; return v; } template <class T> static T in() { T v; i(v); return v; } template <class T> operator T() const { return in<T>(); } int operator--(int) const { return in<int>() - 1; } InputV operator[](int n) const { return InputV(n); } InputV operator[](const pair<int, int>& n) const { return InputV(n); } void operator()() const {} template <class H, class... T> void operator()(H&& h, T&&... t) const { i(h); operator()(forward<T>(t)...); }private: template <template <class...> class, class...> struct Multiple; template <template <class...> class V, class Head, class... Tail> struct Multiple<V, Head, Tail...> { template <class... Args> using vec = V<vector<Head>, Args...>; using type = typename Multiple<vec, Tail...>::type; }; template <template <class...> class V> struct Multiple<V> { using type = V<>; }; template <class... T> using multiple_t = typename Multiple<tuple, T...>::type; template <size_t N = 0, class T> void in_multiple(T& t) const { if constexpr (N < tuple_size_v<T>) { auto& vec = get<N>(t); using V = typename remove_reference_t<decltype(vec)>::value_type; vec.push_back(in<V>()); in_multiple<N + 1>(t); } }public: template <class... T> auto multiple(int H) const { multiple_t<T...> res; while (H--) in_multiple(res); return res; }} in;#define input(T) Input::in<T>()#define INT input(int)#define LL input(long long)#define STR input(string)#define inputs(T, ...) \ T __VA_ARGS__; \ in(__VA_ARGS__)#define ini(...) inputs(int, __VA_ARGS__)#define inl(...) inputs(long long, __VA_ARGS__)#define ins(...) inputs(string, __VA_ARGS__)// --- output --- //struct BoolStr { const char *t, *f; BoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");struct DivStr { const char *d, *l; DivStr(const char* _d, const char* _l) : d(_d), l(_l) {}} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");class Output { BoolStr B{Yes}; DivStr D{spc}; void p(int v) const { if (v < 0) putchar_unlocked('-'), v = -v; char b[10]; int i = 0; while (v) b[i++] = '0' + v % 10, v /= 10; if (!i) b[i++] = '0'; while (i--) putchar_unlocked(b[i]); } void p(long long v) const { if (v < 0) putchar_unlocked('-'), v = -v; char b[20]; int i = 0; while (v) b[i++] = '0' + v % 10, v /= 10; if (!i) b[i++] = '0'; while (i--) putchar_unlocked(b[i]); } void p(bool v) const { p(v ? B.t : B.f); } void p(char v) const { putchar_unlocked(v); } void p(const char* v) const { fwrite_unlocked(v, 1, strlen(v), stdout); } void p(double v) const { printf("%.20f", v); } void p(long double v) const { printf("%.20Lf", v); } template <class T> void p(const T& v) const { cout << v; } template <class T, class U> void p(const pair<T, U>& v) const { p(v.first); p(D.d); p(v.second); } template <class T> void p(const vector<T>& v) const { rep(i, sz(v)) { if (i) p(D.d); p(v[i]); } } template <class T> void p(const vector<vector<T>>& v) const { rep(i, sz(v)) { if (i) p(D.l); p(v[i]); } }public: Output& operator()() { p(D.l); return *this; } template <class H> Output& operator()(H&& h) { p(h); p(D.l); return *this; } template <class H, class... T> Output& operator()(H&& h, T&&... t) { p(h); p(D.d); return operator()(forward<T>(t)...); } template <class It> Output& range(const It& l, const It& r) { for (It i = l; i != r; i++) { if (i != l) p(D.d); p(*i); } p(D.l); return *this; } template <class T> Output& range(const T& a) { range(a.begin(), a.end()); return *this; } template <class... T> void exit(T&&... t) { operator()(forward<T>(t)...); std::exit(EXIT_SUCCESS); } Output& flush() { fflush_unlocked(stdout); return *this; } Output& set(const BoolStr& b) { B = b; return *this; } Output& set(const DivStr& d) { D = d; return *this; } Output& set(const char* t, const char* f) { B = BoolStr(t, f); return *this; }} out;// --- step --- //template <class T> struct Step { class It { T a, b, c; public: constexpr It() : a(T()), b(T()), c(T()) {} constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {} constexpr It& operator++() { --b; a += c; return *this; } constexpr It operator++(int) { It tmp = *this; --b; a += c; return tmp; } constexpr const T& operator*() const { return a; } constexpr const T* operator->() const { return &a; } constexpr bool operator==(const It& i) const { return b == i.b; } constexpr bool operator!=(const It& i) const { return !(b == i.b); } constexpr T start() const { return a; } constexpr T count() const { return b; } constexpr T step() const { return c; } }; constexpr Step(T b, T c, T s) : be(b, c, s) {} constexpr It begin() const { return be; } constexpr It end() const { return en; } constexpr T start() const { return be.start(); } constexpr T count() const { return be.count(); } constexpr T step() const { return be.step(); } constexpr T sum() const { return start() * count() + step() * (count() * (count() - 1) / 2); } operator vector<T>() const { return to_a(); } template <class F> void each(const F& f) const { for (T i : *this) f(i); } auto to_a() const { vector<T> res; res.reserve(count()); each([&](T i) { res.push_back(i); }); return res; } template <class F, class U = invoke_result_t<F, T>> auto map(const F& f) const { vector<U> res; res.reserve(count()); each([&](T i) { res.push_back(f(i)); }); return res; } template <class F> auto select(const F& f) const { vector<T> res; each([&](T i) { if (f(i)) res.push_back(i); }); return res; } template <class F> int count_if(const F& f) const { int res = 0; each([&](T i) { if (f(i)) ++res; }); return res; } template <class F> optional<T> find_if(const F& f) const { for (T i : *this) if (f(i)) return i; return nullopt; } template <class F> auto max_by(const F& f) const { auto v = map(f); return *max_element(v.begin(), v.end()); } template <class F> auto min_by(const F& f) const { auto v = map(f); return *min_element(v.begin(), v.end()); } template <class F> bool all_of(const F& f) const { for (T i : *this) if (!f(i)) return false; return true; } template <class F> bool any_of(const F& f) const { for (T i : *this) if (f(i)) return true; return false; } template <class F, class U = invoke_result_t<F, T>> auto sum(const F& f) const { U res = 0; each([&](T i) { res += static_cast<U>(f(i)); }); return res; } using value_type = T; using iterator = It;private: It be, en;};template <class T> inline constexpr auto step(T a) { return Step<T>(0, a, 1);}template <class T> inline constexpr auto step(T a, T b) { return Step<T>(a, b - a, 1);}template <class T> inline constexpr auto step(T a, T b, T c) { return Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);}// --- functions --- //inline namespace { template <class T> inline void Sort(T& a) { sort(all(a)); } template <class T> inline void RSort(T& a) { sort(rall(a)); } template <class T, class F> inline void Sort(T& a, const F& f) { sort(all(a), f); } template <class T, class F> inline void RSort(T& a, const F& f) { sort(rall(a), f); } template <class T> inline T Sorted(T a) { Sort(a); return a; } template <class T> inline T RSorted(T a) { RSort(a); return a; } template <class T, class F> inline T Sorted(T& a, const F& f) { Sort(a, f); return a; } template <class T, class F> inline T RSorted(T& a, const F& f) { RSort(a, f); return a; } template <class T, class F> inline void SortBy(T& a, const F& f) { sort(all(a), [&](const auto& x, const auto& y) { return f(x) < f(y); }); } template <class T, class F> inline void RSortBy(T& a, const F& f) { sort(rall(a), [&](const auto& x, const auto& y) { return f(x) < f(y); }); } template <class T> inline void Reverse(T& a) { reverse(all(a)); } template <class T> inline void Unique(T& a) { a.erase(unique(all(a)), a.end()); } template <class T> inline void Uniq(T& a) { Sort(a); Unique(a); } template <class T> inline void Rotate(T& a, int left) { rotate(a.begin(), a.begin() + left, a.end()); } template <class T> inline T Reversed(T a) { Reverse(a); return a; } template <class T> inline T Uniqued(T a) { Unique(a); return a; } template <class T> inline T Uniqed(T a) { Uniq(a); return a; } template <class T> inline T Rotated(T a, int left) { Rotate(a, left); return a; } template <class T> inline auto Max(const T& a) { return *max_element(all(a)); } template <class T> inline auto Min(const T& a) { return *min_element(all(a)); } template <class T> inline int MaxPos(const T& a) { return max_element(all(a)) - a.begin(); } template <class T> inline int MinPos(const T& a) { return min_element(all(a)) - a.begin(); } template <class T, class F> inline auto MaxBy(const T& a, const F& f) { return *max_element(all(a), [&](const auto& x, const auto& y) { return f(x) < f(y); }); } template <class T, class F> inline auto MinBy(const T& a, const F& f) { return *min_element(all(a), [&](const auto& x, const auto& y) { return f(x) < f(y); }); } template <class T, class U> inline int Count(const T& a, const U& v) { return count(all(a), v); } template <class T, class F> inline int CountIf(const T& a, const F& f) { return count_if(all(a), f); } template <class T, class U> inline int Find(const T& a, const U& v) { return find(all(a), v) - a.begin(); } template <class T, class F> inline int FindIf(const T& a, const F& f) { return find_if(all(a), f) - a.begin(); } template <class T, class U = typename T::value_type> inline U Sum(const T& a) { return accumulate(all(a), U()); } template <class T, class U> inline bool Includes(const T& a, const U& v) { return find(all(a), v) != a.end(); } template <class T, class F> inline auto Sum(const T& v, const F& f) { return accumulate(next(v.begin()), v.end(), f(*v.begin()), [&](auto a, auto b) { return a + f(b); }); } template <class T, class U> inline int Lower(const T& a, const U& v) { return lower_bound(all(a), v) - a.begin(); } template <class T, class U> inline int Upper(const T& a, const U& v) { return upper_bound(all(a), v) - a.begin(); } template <class T, class F> inline void RemoveIf(T& a, const F& f) { a.erase(remove_if(all(a), f), a.end()); } template <class F> inline auto Vector(size_t size, const F& f) { vector<invoke_result_t<F, size_t>> res(size); for (size_t i = 0; i < size; ++i) res[i] = f(i); return res; } template <class T> inline auto Grid(size_t h, size_t w, const T& v = T()) { return vector<vector<T>>(h, vector<T>(w, v)); } template <class T> inline auto Slice(const T& v, size_t i, size_t len) { return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T(); } template <class T, class F> inline auto Each(const T& v, F&& f) { for (auto& i : v) f(i); } template <class T, class F> inline auto Select(const T& v, const F& f) { T res; for (const auto& e : v) if (f(e)) res.push_back(e); return res; } template <class T, class F> inline auto Map(const T& v, F&& f) { vector<invoke_result_t<F, typename T::value_type>> res(v.size()); size_t i = 0; for (const auto& e : v) res[i++] = f(e); return res; } template <class T, class F> inline auto MapIndex(const T& v, const F& f) { vector<invoke_result_t<F, size_t, typename T::value_type>> res(v.size()); size_t i = 0; for (auto it = v.begin(); it != v.end(); ++it, ++i) res[i] = f(i, *it); return res; } template <class T, class F> inline auto TrueIndex(const T& v, const F& f) { vector<size_t> res; for (size_t i = 0; i < v.size(); ++i) if (f(v[i])) res.push_back(i); return res; } template <class T, class U = typename T::value_type> inline auto Indexed(const T& v) { vector<pair<U, int>> res(v.size()); for (int i = 0; i < (int)v.size(); ++i) res[i] = make_pair(static_cast<U>(v[i]), i); return res; } inline auto operator*(string s, size_t n) { string res; for (size_t i = 0; i < n; ++i) res += s; return res; } template <class T> inline auto& operator<<(vector<T>& v, const vector<T>& v2) { v.insert(v.end(), all(v2)); return v; } template <class T> inline T Ceil(T n, T m) { return (n + m - 1) / m; } template <class T> inline T Ceil2(T n, T m) { return Ceil(n, m) * m; } template <class T> inline T Tri(T n) { return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1); } template <class T> inline T nC2(T n) { return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1); } template <class T> inline T Mid(const T& l, const T& r) { return l + (r - l) / 2; } template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; } template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; } template <class T> inline bool inRange(const T& v, const T& min, const T& max) { return min <= v && v < max; } template <class T> inline bool isSquere(T n) { T s = sqrt(n); return s * s == n || (s + 1) * (s + 1) == n; } template <class T = long long> inline T BIT(int b) { return T(1) << b; } template <class T, class U = typename T::value_type> inline U Gcdv(const T& v) { return accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>); } template <class T, class U = typename T::value_type> inline U Lcmv(const T& v) { return accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>); } template <class T> inline T Pow(T a, T n) { T r = 1; while (n > 0) { if (n & 1) r *= a; a *= a; n /= 2; } return r; } template <class T> inline T Powmod(T a, T n, T m = MOD) { T r = 1; while (n > 0) { if (n & 1) r = r * a % m, n--; else a = a * a % m, n /= 2; } return r; }} // namespace// --- dump --- //#if __has_include("/home/yuruhiya/contest/library/dump.hpp")#include "/home/yuruhiya/contest/library/dump.hpp"#else#define dump(...) ((void)0)#endif// ---------------------------------------------------------------- //int main() { VI x = in[3]; out(Max(x) - Min(x));} |
ステータス
| 項目 | データ |
|---|---|
| 問題 | 1341 - Maximum Distance |
| ユーザー名 | yuruhiya |
| 投稿日時 | 2020-08-16 21:30:27 |
| 言語 | C++17 |
| 状態 | Accepted |
| 得点 | 100 |
| ソースコード長 | 18630 Byte |
| 最大実行時間 | 27 ms |
| 最大メモリ使用量 | 708 KB |
セット
| セット | 得点 | Cases | |
|---|---|---|---|
| 1 | ALL | 100 / 100 | * |
テストケース
| ファイル名 | 状態 | 実行時間 | メモリ使用量 | # |
|---|---|---|---|---|
| in01.txt | AC | 23 ms | 604 KB |
1
|
| in02.txt | AC | 21 ms | 708 KB |
1
|
| in03.txt | AC | 20 ms | 552 KB |
1
|
| in04.txt | AC | 21 ms | 524 KB |
1
|
| in05.txt | AC | 21 ms | 364 KB |
1
|
| in06.txt | AC | 14 ms | 592 KB |
1
|
| in07.txt | AC | 23 ms | 564 KB |
1
|
| in08.txt | AC | 27 ms | 540 KB |
1
|
| in09.txt | AC | 20 ms | 516 KB |
1
|
| in10.txt | AC | 20 ms | 488 KB |
1
|
| in11.txt | AC | 17 ms | 460 KB |
1
|
| in12.txt | AC | 23 ms | 432 KB |
1
|
| in13.txt | AC | 18 ms | 532 KB |
1
|
| in14.txt | AC | 21 ms | 504 KB |
1
|
| in15.txt | AC | 23 ms | 608 KB |
1
|
| sample01.txt | AC | 16 ms | 448 KB |
1
|
| sample02.txt | AC | 20 ms | 548 KB |
1
|