結果

問題 No.1183 コイン遊び
ユーザー FF256grhyFF256grhy
提出日時 2020-08-22 13:04:27
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 286 ms / 2,000 ms
コード長 4,798 bytes
コンパイル時間 2,348 ms
コンパイル使用メモリ 201,872 KB
実行使用メモリ 11,100 KB
最終ジャッジ日時 2023-08-05 09:43:06
合計ジャッジ時間 10,723 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,384 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 7 ms
4,376 KB
testcase_11 AC 18 ms
4,380 KB
testcase_12 AC 178 ms
7,832 KB
testcase_13 AC 158 ms
7,304 KB
testcase_14 AC 263 ms
10,272 KB
testcase_15 AC 282 ms
10,804 KB
testcase_16 AC 282 ms
10,800 KB
testcase_17 AC 284 ms
11,100 KB
testcase_18 AC 283 ms
10,816 KB
testcase_19 AC 281 ms
10,796 KB
testcase_20 AC 281 ms
10,888 KB
testcase_21 AC 265 ms
10,764 KB
testcase_22 AC 270 ms
10,804 KB
testcase_23 AC 286 ms
10,796 KB
testcase_24 AC 286 ms
10,804 KB
testcase_25 AC 281 ms
10,808 KB
testcase_26 AC 282 ms
10,948 KB
testcase_27 AC 284 ms
10,864 KB
testcase_28 AC 282 ms
10,800 KB
testcase_29 AC 266 ms
10,868 KB
testcase_30 AC 277 ms
10,824 KB
testcase_31 AC 281 ms
10,772 KB
testcase_32 AC 283 ms
10,776 KB
testcase_33 AC 284 ms
10,812 KB
testcase_34 AC 281 ms
10,804 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
// テンプレテスト中
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); i++)
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); i++)
#define incCI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)
#define incCD(i, l, r) for(LL i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); i--)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); i--)
#define decCI(i, l, r) for(LL i = (r)    ; i >  (l); i--)
#define decCD(i, l, r) for(LL i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto v, auto l, auto r) { return (l <= v && v <= r); };
auto inID = [](auto v, auto l, auto r) { return (l <= v && v <  r); };
auto inCI = [](auto v, auto l, auto r) { return (l <  v && v <= r); };
auto inCD = [](auto v, auto l, auto r) { return (l <  v && v <  r); };
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define CT continue
#define RV(v) reverse(ALL(v))
auto * IS = & cin;
// input elements (as a tuple)
template<typename U, int I> void in_(U & t) { }
template<typename U, int I, typename A, typename ... B> void in_(U & t) { (* IS) >> get<I>(t); in_<U, I + 1, B ...>(t); }
template<typename ... T> auto in() { tuple<T ...> t; in_<tuple<T ...>, 0, T ...>(t); return t; }
// input an array
template<typename T, int N> auto ain() { array<T, N> a; inc(i, N) { (* IS) >> a[i]; } return a; }
// input a (multi-dimensional) vector
template<typename T> T vin() { T v; (* IS) >> v; return v; }
template<typename T, typename N, typename ... M> auto vin(N n, M ... m) {
	vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;
}
// input multi-column (as a tuple of vector)
template<typename U, int I> void colin_(U & t) { }
template<typename U, int I, typename A, typename ... B> void colin_(U & t) {
	A a; (* IS) >> a; get<I>(t).push_back(a); colin_<U, I + 1, B ...>(t);
}
template<typename ... T> auto colin(int n) {
	tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;
}
auto * OS = & cout;
// output elements
void out_(string s) { }
template<typename A                > void out_(string s, A && a            ) { (* OS) << a; }
template<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }
auto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };
auto out  = [](auto ... a) { outF("", " " , "\n", a ...); };
auto outS = [](auto ... a) { outF("", " " , " " , a ...); };
auto outL = [](auto ... a) { outF("", "\n", "\n", a ...); };
auto outN = [](auto ... a) { outF("", ""  , ""  , a ...); };
array<string, 3> SEQ_FMT = { "", " ", "" };
auto & SEQ_BEG = SEQ_FMT[0];
auto & SEQ_MID = SEQ_FMT[1];
auto & SEQ_END = SEQ_FMT[2];
// output a (multi-dimensional) vector
template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {
	os << SEQ_BEG; inc(i, v.size()) { os << (i == 0 ? "" : SEQ_MID) << v[i]; } return (os << SEQ_END);
}
template<typename T                            > void vout_(T && v              ) { (* OS) << v; }
template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {
	inc(i, v.size()) { (* OS) << (i == 0 ? "" : a); vout_(v[i], b ...); }
}
template<typename T, typename A, typename ... B> void vout(T && v, A a, B ... b) {
	vout_(v, b ...); (* OS) << a << flush;
}

// ---- ----

auto fl = [](auto a, auto b) { assert(b != 0); return a / b - (a % b != 0 && ((a >= 0) != (b >= 0)) ? 1 : 0); };
auto ce = [](auto a, auto b) { assert(b != 0); return a / b + (a % b != 0 && ((a >= 0) == (b >= 0)) ? 1 : 0); };
auto mo = [](auto a, auto b) { assert(b != 0); a %= b; if(a < 0) { a += abs(b); } return a; };

int main() {
	auto [n] = in<int>();
	auto a = vin<int>(n);
	auto b = vin<int>(n);
	bool p = true;
	int c = 0;
	inc(i, n) {
		bool f = (a[i] == b[i]);
		if(f != p) { c++; }
		p = f;
	}
	out(ce(c, 2));
}
0