結果
問題 | No.1268 Fruit Rush 2 |
ユーザー | KoD |
提出日時 | 2020-10-23 23:05:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 127 ms / 2,000 ms |
コード長 | 3,238 bytes |
コンパイル時間 | 866 ms |
コンパイル使用メモリ | 82,860 KB |
実行使用メモリ | 9,448 KB |
最終ジャッジ日時 | 2023-09-28 17:44:35 |
合計ジャッジ時間 | 4,184 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 58 ms
7,860 KB |
testcase_17 | AC | 51 ms
7,400 KB |
testcase_18 | AC | 54 ms
7,212 KB |
testcase_19 | AC | 54 ms
7,396 KB |
testcase_20 | AC | 54 ms
7,328 KB |
testcase_21 | AC | 51 ms
7,188 KB |
testcase_22 | AC | 59 ms
7,864 KB |
testcase_23 | AC | 59 ms
7,784 KB |
testcase_24 | AC | 53 ms
7,404 KB |
testcase_25 | AC | 52 ms
7,200 KB |
testcase_26 | AC | 97 ms
9,184 KB |
testcase_27 | AC | 98 ms
9,448 KB |
testcase_28 | AC | 97 ms
9,252 KB |
testcase_29 | AC | 97 ms
9,376 KB |
testcase_30 | AC | 98 ms
9,256 KB |
testcase_31 | AC | 75 ms
9,376 KB |
testcase_32 | AC | 76 ms
9,376 KB |
testcase_33 | AC | 127 ms
9,316 KB |
testcase_34 | AC | 64 ms
9,316 KB |
testcase_35 | AC | 127 ms
9,308 KB |
ソースコード
#line 1 "main.cpp" /** * @title Template */ #include <iostream> #include <algorithm> #include <utility> #include <numeric> #include <vector> #include <array> #include <cassert> #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp" template <class T, class U> constexpr bool chmin(T &lhs, const U &rhs) { if (lhs > rhs) { lhs = rhs; return true; } return false; } template <class T, class U> constexpr bool chmax(T &lhs, const U &rhs) { if (lhs < rhs) { lhs = rhs; return true; } return false; } /** * @title Chmin/Chmax */ #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp" #line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp" class range { public: class iterator { private: int64_t M_position; public: constexpr iterator(int64_t position) noexcept: M_position(position) { } constexpr void operator ++ () noexcept { ++M_position; } constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; } constexpr int64_t operator * () const noexcept { return M_position; } }; class reverse_iterator { private: int64_t M_position; public: constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { } constexpr void operator ++ () noexcept { --M_position; } constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; } constexpr int64_t operator * () const noexcept { return M_position; } }; private: const iterator M_first, M_last; public: constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { } constexpr iterator begin() const noexcept { return M_first; } constexpr iterator end() const noexcept { return M_last; } constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } }; /** * @title Range */ #line 16 "main.cpp" using i32 = std::int32_t; using i64 = std::int64_t; using u32 = std::uint32_t; using u64 = std::uint64_t; using isize = std::ptrdiff_t; using usize = std::size_t; constexpr i32 inf32 = (i32(1) << 30) - 1; constexpr i64 inf64 = (i64(1) << 62) - 1; int main() { usize N; std::cin >> N; std::vector<u64> A(N); for (auto &x: A) { std::cin >> x; } std::sort(A.begin(), A.end()); std::vector<std::array<u64, 3>> dp(N); u64 ans = 0; for (auto i: range(0, N)) { dp[i][0] += 1; if (i + 1 < N) { for (auto j: range(0, 3)) { if (A[i] + j + 1 == A[i + 1]) { dp[i + 1][1] += dp[i][j]; } if (A[i] + j - 1 == A[i + 1]) { dp[i + 1][2] += dp[i][j]; } } } if (i + 2 < N) { for (auto j: range(0, 3)) { if (A[i] + j + 1 == A[i + 2]) { dp[i + 2][1] += dp[i][j]; } if (A[i] + j - 1 == A[i + 2]) { dp[i + 2][2] += dp[i][j]; } } } // std::cout << A[i] << ": "; for (auto x: dp[i]) { // std::cout << x << ' '; ans += x; } // std::cout << '\n'; } std::cout << ans << '\n'; return 0; }