結果
問題 | No.1384 Bishop and Rook |
ユーザー | FF256grhy |
提出日時 | 2023-08-24 19:31:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 205 ms / 2,000 ms |
コード長 | 6,960 bytes |
コンパイル時間 | 2,730 ms |
コンパイル使用メモリ | 210,256 KB |
実行使用メモリ | 11,752 KB |
最終ジャッジ日時 | 2024-12-23 04:41:13 |
合計ジャッジ時間 | 11,391 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 124 ms
11,752 KB |
testcase_02 | AC | 58 ms
5,460 KB |
testcase_03 | AC | 24 ms
5,248 KB |
testcase_04 | AC | 32 ms
5,248 KB |
testcase_05 | AC | 85 ms
6,608 KB |
testcase_06 | AC | 110 ms
7,640 KB |
testcase_07 | AC | 130 ms
11,612 KB |
testcase_08 | AC | 103 ms
7,512 KB |
testcase_09 | AC | 4 ms
5,248 KB |
testcase_10 | AC | 71 ms
7,636 KB |
testcase_11 | AC | 4 ms
5,248 KB |
testcase_12 | AC | 5 ms
5,248 KB |
testcase_13 | AC | 4 ms
5,248 KB |
testcase_14 | AC | 169 ms
11,612 KB |
testcase_15 | AC | 4 ms
5,248 KB |
testcase_16 | AC | 200 ms
11,608 KB |
testcase_17 | AC | 3 ms
5,248 KB |
testcase_18 | AC | 6 ms
5,248 KB |
testcase_19 | AC | 167 ms
11,612 KB |
testcase_20 | AC | 4 ms
5,248 KB |
testcase_21 | AC | 8 ms
5,248 KB |
testcase_22 | AC | 7 ms
5,248 KB |
testcase_23 | AC | 7 ms
5,248 KB |
testcase_24 | AC | 7 ms
5,248 KB |
testcase_25 | AC | 7 ms
5,248 KB |
testcase_26 | AC | 6 ms
5,248 KB |
testcase_27 | AC | 7 ms
5,248 KB |
testcase_28 | AC | 6 ms
5,248 KB |
testcase_29 | AC | 7 ms
5,248 KB |
testcase_30 | AC | 6 ms
5,248 KB |
testcase_31 | AC | 5 ms
5,248 KB |
testcase_32 | AC | 6 ms
5,248 KB |
testcase_33 | AC | 7 ms
5,248 KB |
testcase_34 | AC | 6 ms
5,248 KB |
testcase_35 | AC | 6 ms
5,248 KB |
testcase_36 | AC | 5 ms
5,248 KB |
testcase_37 | AC | 4 ms
5,248 KB |
testcase_38 | AC | 5 ms
5,248 KB |
testcase_39 | AC | 5 ms
5,248 KB |
testcase_40 | AC | 6 ms
5,248 KB |
testcase_41 | AC | 23 ms
5,248 KB |
testcase_42 | AC | 20 ms
5,248 KB |
testcase_43 | AC | 24 ms
5,248 KB |
testcase_44 | AC | 28 ms
5,248 KB |
testcase_45 | AC | 28 ms
5,248 KB |
testcase_46 | AC | 22 ms
5,248 KB |
testcase_47 | AC | 26 ms
5,248 KB |
testcase_48 | AC | 24 ms
5,248 KB |
testcase_49 | AC | 16 ms
5,248 KB |
testcase_50 | AC | 15 ms
5,248 KB |
testcase_51 | AC | 2 ms
5,248 KB |
testcase_52 | AC | 205 ms
11,744 KB |
testcase_53 | AC | 87 ms
6,484 KB |
testcase_54 | AC | 3 ms
5,248 KB |
testcase_55 | AC | 2 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define incII(i, l, r) for(decay_t<decltype(r)> i = (l) ; i <= (r); i++) #define incIX(i, l, r) for(decay_t<decltype(r)> i = (l) ; i < (r); i++) #define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++) #define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i < (r); i++) #define decII(i, l, r) for(decay_t<decltype(r)> i = (r) ; i >= (l); i--) #define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--) #define decXI(i, l, r) for(decay_t<decltype(r)> i = (r) ; i > (l); i--) #define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i > (l); i--) #define inc(i, n) incIX(i, 0, n) #define dec(i, n) decIX(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec1(i, n) decII(i, 1, n) auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); }; auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a < r); }; auto inXI = [](auto a, auto l, auto r) -> bool { return (l < a && a <= r); }; auto inXX = [](auto a, auto l, auto r) -> bool { return (l < a && a < r); }; auto setmin = [](auto & a, auto b) -> bool { return (b < a ? a = b, true : false); }; auto setmax = [](auto & a, auto b) -> bool { return (b > a ? a = b, true : false); }; auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); }; auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); }; using LL = long long int; using LD = long double; #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(a) begin(a), end(a) #define RALL(a) rbegin(a), rend(a) #define RV(a) reverse(ALL(a)) #define ST(a) sort(ALL(a)) #define RST(a) sort(RALL(a)) #define SC static_cast #define SI(a) SC<int>(a.size()) #define SL(a) SC<LL>(a.size()) #define RF(e, ...) for(auto && e: __VA_ARGS__) #define SF(a, ...) for(auto && [__VA_ARGS__]: a) #define until(...) while(not(__VA_ARGS__)) #define if_not(...) if(not(__VA_ARGS__)) #define ef else if #define UR assert(false) template<typename A> istream & operator>>(istream & is, vector<A> & v); template<typename A> ostream & operator<<(ostream & os, vector<A> const & v); template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a); template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a); template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p); template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p); template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t); template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t); template<int I = 0, typename T> void tin_ (istream & is, T & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } } template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } } template<typename A> istream & operator>>(istream & is, vector<A> & v) { for(auto && e: v) { is >> e; } return is; } template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; } template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a) { for(auto && e: a) { is >> e; } return is; } template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; } template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p) { return is >> p.first >> p.second; } template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; } template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t) { tin_ (is, t); return is; } template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; } auto * IS = & cin; auto * OS = & cout; template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); } #define IN(...) __VA_ARGS__; in(__VA_ARGS__) template<typename A > auto make_v(A a) { return a; } template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); } template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; } void out_([[maybe_unused]] string const & s) { } template<typename A > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; } template<typename A, typename ... B> void out_( string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); } auto outF = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; }; auto outN = [](auto const & ... a) { outF("" , "" , a ...); }; auto outS = [](auto const & ... a) { outF(" " , " " , a ...); }; auto outL = [](auto const & ... a) { outF("\n", "\n", a ...); }; auto outSN = [](auto const & ... a) { outF(" " , "" , a ...); }; auto outNL = [](auto const & ... a) { outF("" , "\n", a ...); }; auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); }; auto out = outSL; template<typename A > void disp_(A const & a) { * OS << a; } template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } } auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; }; auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; }; auto dispL = [](auto const & a, auto const & ... t) { dispT(a, "\n", t ...); }; struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_; // ---- ---- int main() { auto solve = [](int h, int w) { if(h == 1 && w == 1) { out("0\n1 1"); return; } if_not(h % 2 == 0 && w % 2 == 0) { out(-1); return; } vector<int> di(2 * w), dj(2 * w); inc(j, w) { di[2 * j] = ((j % 2 == 0) == (j < w / 2) ? +1 : -1); } di[1 * w - 1] = (w % 4 == 0 ? +1 : -1); di[2 * w - 1] = +1; inc(j, w - 1) { dj[j] = +1; dj[w + j] = -1; } vector<pair<int, int>> ans; int I = 1, J = 1; inc(i_, h / 2) { inc(j, 2 * w) { ans.EB(I, J); I += di[j]; J += dj[j]; } } out(h * w - 1); dispL(ans); }; int IN(t); inc(tt, t) { int IN(h, w); solve(h, w); } }