結果

問題 No.2247 01 ZigZag
ユーザー sten_san
提出日時 2023-03-17 21:51:53
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,610 bytes
コンパイル時間 1,707 ms
コンパイル使用メモリ 193,076 KB
最終ジャッジ日時 2025-02-11 12:57:10
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 49 WA * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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)...);
    };
}

int main() {
    int n, m, k; cin >> n >> m >> k;

ababa:

    if (min(n, m) == 0) {
        if (k != 0) {
            cout << -1 << endl;
        }
        else {
            for (int i = 0; i < max(n, m); ++i) {
                cout << (m != 0);
            }
            cout << endl;
        }
        return 0;
    }

    if (!((k + 2) / 2 <= max(n, m) && k / 2 <= min(n, m))) {
        cout << -1 << endl;
        return 0;
    }

    if ((k + 1) % 2 == 0) {
        int r = n - (k + 1) / 2 + 1;
        while (r--) {
            cout << 0;
        }
        for (int i = 1; i < k + 1; ++i) {
            cout << (i % 2);
        }
        r = m - (k + 1) / 2;
        while (r--) {
            cout << 1;
        }
        return 0;
    }

    if ((k + 2) / 2 <= n && k / 2 <= m) {
        int r = n - (k + 2) / 2 + 1;
        while (r--) {
            cout << 0;
        }
        for (int i = 1; i < k; ++i) {
            cout << (i % 2);
        }
        r = m - k / 2;
        while (r--) {
            cout << 1;
        }
        cout << 0 << endl;
        return 0;
    }

    cout << 1; --k; --m;
    goto ababa;
}
0