結果
問題 | No.1183 コイン遊び |
ユーザー | KoD |
提出日時 | 2020-08-22 13:03:09 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 322 ms / 2,000 ms |
コード長 | 3,365 bytes |
コンパイル時間 | 794 ms |
コンパイル使用メモリ | 80,448 KB |
実行使用メモリ | 20,736 KB |
最終ジャッジ日時 | 2024-11-14 23:31:50 |
合計ジャッジ時間 | 10,943 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 2 ms
6,816 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,820 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 2 ms
6,820 KB |
testcase_10 | AC | 9 ms
6,816 KB |
testcase_11 | AC | 22 ms
6,816 KB |
testcase_12 | AC | 201 ms
14,408 KB |
testcase_13 | AC | 180 ms
13,372 KB |
testcase_14 | AC | 297 ms
17,944 KB |
testcase_15 | AC | 318 ms
18,956 KB |
testcase_16 | AC | 318 ms
19,528 KB |
testcase_17 | AC | 322 ms
19,824 KB |
testcase_18 | AC | 321 ms
20,388 KB |
testcase_19 | AC | 320 ms
19,760 KB |
testcase_20 | AC | 317 ms
19,528 KB |
testcase_21 | AC | 302 ms
20,736 KB |
testcase_22 | AC | 308 ms
20,228 KB |
testcase_23 | AC | 316 ms
19,408 KB |
testcase_24 | AC | 318 ms
19,884 KB |
testcase_25 | AC | 320 ms
20,352 KB |
testcase_26 | AC | 319 ms
20,436 KB |
testcase_27 | AC | 321 ms
18,964 KB |
testcase_28 | AC | 318 ms
19,832 KB |
testcase_29 | AC | 305 ms
18,964 KB |
testcase_30 | AC | 314 ms
20,464 KB |
testcase_31 | AC | 319 ms
20,000 KB |
testcase_32 | AC | 320 ms
20,128 KB |
testcase_33 | AC | 318 ms
18,968 KB |
testcase_34 | AC | 321 ms
20,552 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/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/Programming/Library/other/range.cpp" #line 4 "/Users/kodamankod/Desktop/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 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp" #include <type_traits> #include <iterator> #line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp" template <class T> class rev_impl { public: using iterator = decltype(std::rbegin(std::declval<T>())); private: const iterator M_begin; const iterator M_end; public: constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { } constexpr iterator begin() const noexcept { return M_begin; } constexpr iterator end() const noexcept { return M_end; } }; template <class T> constexpr decltype(auto) rev(T &&cont) { return rev_impl<T>(std::forward<T>(cont)); } /** * @title Reverser */ #line 17 "main.cpp" using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; constexpr i32 inf32 = (i32(1) << 30) - 1; constexpr i64 inf64 = (i64(1) << 62) - 1; int main() { size_t N; std::cin >> N; std::vector<i32> A(N), B(N); for (auto &x: A) { std::cin >> x; } for (auto &x: B) { std::cin >> x; } std::vector<i32> C(N); for (auto i: range(0, N)) { C[i] = A[i] ^ B[i]; } C.push_back(0); i32 ans = 0; for (auto i: range(0, N)) { if (C[i] == 1 && C[i + 1] == 0) { ++ans; } } std::cout << ans << '\n'; return 0; }