#997929 (C++23) No.2824 Lights Up! (Grid Edition)

提出ソース

結果

問題	No.2824 Lights Up! (Grid Edition)
ユーザー	hitonanode
提出日時	2024-07-26 23:26:12
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	8,095 bytes
コンパイル時間	2,242 ms
コンパイル使用メモリ	190,884 KB
実行使用メモリ	12,544 KB
最終ジャッジ日時	2024-07-26 23:26:21
合計ジャッジ時間	8,241 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	49 ms 12,416 KB
testcase_05	AC	46 ms 12,544 KB
testcase_06	AC	49 ms 12,544 KB
testcase_07	AC	110 ms 12,160 KB
testcase_08	AC	47 ms 12,544 KB
testcase_09	AC	47 ms 12,416 KB
testcase_10	AC	49 ms 12,544 KB
testcase_11	AC	109 ms 12,288 KB
testcase_12	AC	47 ms 12,416 KB
testcase_13	WA	-
testcase_14	AC	48 ms 12,288 KB
testcase_15	WA	-
testcase_16	AC	49 ms 12,288 KB
testcase_17	WA	-
testcase_18	AC	48 ms 12,416 KB
testcase_19	WA	-
testcase_20	AC	13 ms 6,944 KB
testcase_21	AC	29 ms 9,600 KB
testcase_22	AC	3 ms 6,940 KB
testcase_23	AC	85 ms 10,624 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	WA	-
testcase_26	AC	15 ms 6,940 KB
testcase_27	WA	-
testcase_28	AC	2 ms 6,940 KB
testcase_29	WA	-
testcase_30	AC	3 ms 6,940 KB
testcase_31	WA	-
testcase_32	AC	5 ms 6,944 KB
testcase_33	AC	3 ms 6,940 KB
testcase_34	AC	3 ms 6,944 KB
testcase_35	WA	-
testcase_36	AC	2 ms 6,944 KB
testcase_37	WA	-
testcase_38	AC	2 ms 6,940 KB
testcase_39	AC	2 ms 6,940 KB
testcase_40	AC	2 ms 6,944 KB
testcase_41	AC	2 ms 6,940 KB
testcase_42	AC	2 ms 6,944 KB
testcase_43	WA	-
testcase_44	AC	2 ms 6,940 KB
testcase_45	AC	2 ms 6,944 KB
testcase_46	AC	1 ms 6,940 KB
testcase_47	AC	1 ms 6,940 KB
testcase_48	AC	1 ms 6,940 KB
testcase_49	AC	2 ms 6,944 KB
testcase_50	AC	2 ms 6,940 KB
testcase_51	AC	2 ms 6,940 KB
testcase_52	AC	2 ms 6,940 KB
testcase_53	WA	-
testcase_54	AC	1 ms 6,940 KB
testcase_55	WA	-
testcase_56	AC	2 ms 6,940 KB
testcase_57	AC	2 ms 6,944 KB
testcase_58	AC	2 ms 6,944 KB
testcase_59	AC	2 ms 6,944 KB
testcase_60	AC	2 ms 6,940 KB
testcase_61	WA	-
testcase_62	AC	2 ms 6,940 KB
testcase_63	WA	-
testcase_64	AC	2 ms 6,944 KB
testcase_65	AC	2 ms 6,944 KB
testcase_66	AC	2 ms 6,940 KB
testcase_67	AC	1 ms 6,940 KB
testcase_68	AC	1 ms 6,940 KB
testcase_69	AC	2 ms 6,940 KB
testcase_70	AC	2 ms 6,944 KB
testcase_71	AC	2 ms 6,940 KB
testcase_72	AC	2 ms 6,944 KB
testcase_73	AC	2 ms 6,940 KB
testcase_74	AC	2 ms 6,944 KB
testcase_75	AC	1 ms 6,940 KB
testcase_76	AC	2 ms 6,944 KB
testcase_77	AC	2 ms 6,940 KB
testcase_78	AC	2 ms 6,940 KB
testcase_79	AC	2 ms 6,944 KB
testcase_80	AC	1 ms 6,940 KB
testcase_81	AC	2 ms 6,940 KB
testcase_82	AC	2 ms 6,940 KB
testcase_83	AC	2 ms 6,940 KB
testcase_84	AC	2 ms 6,940 KB
testcase_85	WA	-
testcase_86	WA	-
testcase_87	WA	-
testcase_88	AC	2 ms 6,940 KB
testcase_89	AC	2 ms 6,940 KB
testcase_90	WA	-
testcase_91	WA	-
testcase_92	WA	-
testcase_93	AC	2 ms 6,944 KB
testcase_94	AC	1 ms 6,944 KB
testcase_95	AC	1 ms 6,940 KB
testcase_96	WA	-
testcase_97	WA	-
testcase_98	WA	-
testcase_99	WA	-
testcase_100	WA	-
testcase_101	WA	-
testcase_102	AC	2 ms 6,940 KB
testcase_103	AC	2 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

void No() {
    puts("-1");
    exit(0);
}

int main() {
    int N;
    cin >> N;
    vector<string> S(N);
    cin >> S;
    dbg(S);

    vector state(N, vector<int>(N));
    REP(i, N) REP(j, N) state.at(i).at(j) = S.at(i).at(j) == '#';

    vector ret(N, vector<int>(N));

    auto sousa = [&](int r, int c) {
        int r1 = (r + N - 1) % N, c1 = (c + N - 1) % N;
        state.at(r).at(c) ^= 1;
        state.at(r1).at(c) ^= 1;
        state.at(r).at(c1) ^= 1;
        state.at(r1).at(c1) ^= 1;
    };

    auto act = [&](int r, int c) {
        ret.at(r).at(c) ^= 1;
        sousa(r, c);
        sousa(r, 0);
        sousa(0, c);
    };

    IFOR(c, 1, N - 1) {
        IFOR(r, 1, N - 1) {
            if (state.at(r).at(c)) act(r, c);
        }
        // if (state.front().at(c) != state.back().at(c)) act(1, c);
    }

    // IFOR(r, 1, N - 1) {
    //     if (state.at(r).front() != state.at(r).back()) act(r, 1);
    // }

    if (state.front().front()) act(0, 0);

    // REP(r, N) {
    //     if (state.at(r).front() != state.at(r).back()) No();
    // }

    // REP(c, N) {
    //     if (state.front().at(c) != state.back().at(c)) No();
    // }

    REP(i, N) REP(j, N) {
        if (state.at(i).at(j)) No();
    }

    // if (state.back().back()) No();

    for (auto s : state) dbg(s);

    int ans = 0;
    for (auto v : ret) ans += accumulate(ALL(v), 0);

    cout << ans << '\n';
    REP(i, N) REP(j, N) {
        if (ret.at(i).at(j)) cout << i << ' ' << j << '\n';
    }
}

yukicoder

結果

テストケース

ソースコード