#923820 (C++17) No.2519 Coins in Array

提出ソース

結果

問題	No.2519 Coins in Array
ユーザー	sten_san
提出日時	2023-10-27 23:50:02
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,118 bytes
コンパイル時間	2,205 ms
コンパイル使用メモリ	206,440 KB
実行使用メモリ	4,768 KB
最終ジャッジ日時	2023-10-27 23:50:12
合計ジャッジ時間	9,972 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,372 KB
testcase_01	AC	2 ms 4,372 KB
testcase_02	AC	2 ms 4,372 KB
testcase_03	WA	-
testcase_04	AC	1 ms 4,372 KB
testcase_05	AC	1 ms 4,372 KB
testcase_06	AC	2 ms 4,372 KB
testcase_07	WA	-
testcase_08	AC	2 ms 4,372 KB
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	AC	2 ms 4,372 KB
testcase_15	AC	1 ms 4,372 KB
testcase_16	WA	-
testcase_17	AC	2 ms 4,372 KB
testcase_18	AC	1 ms 4,372 KB
testcase_19	AC	2 ms 4,372 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	1 ms 4,372 KB
testcase_23	AC	270 ms 4,768 KB
testcase_24	AC	280 ms 4,768 KB
testcase_25	WA	-
testcase_26	AC	2 ms 4,372 KB
testcase_27	AC	265 ms 4,768 KB
testcase_28	AC	265 ms 4,768 KB
testcase_29	AC	285 ms 4,768 KB
testcase_30	AC	240 ms 4,504 KB
testcase_31	AC	42 ms 4,372 KB
testcase_32	AC	128 ms 4,372 KB
testcase_33	AC	184 ms 4,372 KB
testcase_34	AC	91 ms 4,372 KB
testcase_35	AC	168 ms 4,372 KB
testcase_36	AC	69 ms 4,372 KB
testcase_37	AC	32 ms 4,372 KB
testcase_38	AC	140 ms 4,372 KB
testcase_39	AC	81 ms 4,372 KB
testcase_40	AC	280 ms 4,768 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

/*

int64_t sign(int64_t x) {
    return clamp<int64_t>(x, -1, 1);
}

int64_t floor(int64_t x, int64_t y) {
    if (0 < sign(x) * sign(y)) {
        return x / y;
    }
    return -((abs(x) + abs(y) - 1) / abs(y));
}

int64_t ceil(int64_t x, int64_t y) {
    if (0 < sign(x) * sign(y)) {
        return (abs(x) + abs(y) - 1) / abs(y);
    }
    return x / y;
}

auto exgcd(int a, int b) -> tuple<int, int> {
    if (b != 0) {
        auto [xp, yp] = exgcd(b, a % b);
        return { yp, xp - (a / b) * yp };
    }

    if (0 <= a) {
        return { 1, 0 };
    }
    return { -1, 0 };
}

int f(int x, int y) {
    if (x == 0 || y == 0 || gcd(x, y) != 1) {
        return 0;
    }

    auto [xp, yp] = exgcd(x, y);

    auto check = [&](int c) {
        return 0 <= floor(yp * c, x) - ceil(-xp * c, y);
    };

    int k = x * y;
    while (0 < k && check(k - 1)) {
        --k;
    }

    return k;
}

int main() {
    for (int i = 1; i <= 100; ++i) {
        for (int j = 1; j <= 100; ++j) {
            if (gcd(i, j) == 1) {
                if ((i - 1) * (j - 1) != f(i, j)) {
                    cout << "ng" << endl;
                }
            }
        }
    }
}

*/

int64_t f(int64_t x, int64_t y) {
    if (x == 0 || y == 0 || gcd(x, y) != 1) {
        return 0;
    }
    return (x - 1) * (y - 1);
}

// f(x, y) の挙動から、1 回でも 0 を作ることができれば答えは 0 になる
// 偶数が 2 つ以上存在すれば 0 を作れる
// 奇数が 2 つ以上存在すれば、結果として偶数を作れるため、0 を作れる

int main() {
    int n; cin >> n;
    auto a = vec<int64_t>(uns, n);
    for (auto &e : a) cin >> e;

    if (count(begin(a), end(a), 0) != 0) {
        int iter1 = 0;
        while (a[iter1] != 0) {
            ++iter1;
        }

        int iter2 = n - 1;
        while (iter1 == iter2) {
            --iter2;
        }

        cout << 0 << endl;

        cout << iter1 + 1 << " " << iter2 + 1 << endl;
        for (int i = 1; i < n - 1; ++i) {
            cout << (n - i) << " " << (n - i - 1) << endl;
        }

        return 0;
    }

    int even = 0;
    for (auto v : a) {
        even += (v % 2 == 0);
    }

    if (2 <= even) {
        int iter1 = 0;
        while (a[iter1] % 2 != 0) {
            ++iter1;
        }

        int iter2 = n - 1;
        while (a[iter2] % 2 != 0) {
            --iter2;
        }

        cout << 0 << endl;

        cout << iter1 + 1 << " " << iter2 + 1 << endl;
        for (int i = 1; i < n - 1; ++i) {
            cout << (n - i) << " " << (n - i - 1) << endl;
        }

        return 0;
    }

    if (n == 2) {
        cout << f(a[0], a[1]) << endl;
        cout << 1 << " " << 2 << endl;
        return 0;
    }

    if (1 <= even) {
        int iter1 = 0;
        while (a[iter1] % 2 != 0) {
            ++iter1;
        }

        int iter2 = 0;
        while (iter1 == iter2) {
            ++iter2;
        }

        cout << 0 << endl;
        cout << iter1 + 1 << " " << iter2 + 1 << endl;
        for (int i = 1; i < n - 1; ++i) {
            cout << (n - i) << " " << (n - i - 1) << endl;
        }

        return 0;
    }

    int odd = 0;
    for (auto v : a) {
        even += (v % 2 == 1);
    }

    if (n == 3 && odd == 3) {
        cout << a[0] * a[1] * a[2] << endl;
        cout << 1 << " " << 2 << endl;
        for (int i = 1; i < n - 1; ++i) {
            cout << (n - i) << " " << (n - i - 1) << endl;
        }
        return 0;
    }

    cout << 0 << endl;
    cout << 1 << " " << 2 << endl;
    for (int i = 1; i < n - 1; ++i) {
        cout << (n - i) << " " << (n - i - 1) << endl;
    }
}

yukicoder

結果

テストケース

ソースコード