#567484 (C++17) No.1257 変わった平均値

• 問題: No.1257 変わった平均値
• ユーザー: kcvlex
• 提出日時: 2020-10-16 21:45:34
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 4,319 bytes
• コンパイル時間: 1,753 ms
• コンパイル使用メモリ: 153,124 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-20 21:15:13
• 合計ジャッジ時間: 2,345 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	WA	-
testcase_24	AC	1 ms; 5,376 KB

ソースコード

#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}

template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}

template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }


void solve() {
    ll a, b, c, d, e, f;
    std::cin >> a >> b >> c >> d >> e >> f;
    
    if (a == d && 
        b == e && 
        c == f) 
    {
        std::cout << "Yes\n";
        return;
    }


    pll arr1[] = { pll(std::abs(a), a), pll(std::abs(b), b), pll(std::abs(c), c) };
    pll arr2[] = { pll(std::abs(d), d), pll(std::abs(e), e), pll(std::abs(f), f) };

    auto score = [&](ll x) -> ll {
        if (std::abs(x) == std::abs(d)) return 0;
        if (std::abs(x) == std::abs(e)) return 1;
        if (std::abs(x) == std::abs(f)) return 2;
        return 3;
    };

    std::sort(ALL(arr1), 
            [&](pll a, pll b) {
                ll sa = score(a.first), sb = score(b.first);
                if (sa != sb) return sa < sb;
                return a < b;
            });

    vec<ll> av;

    for (ll i = 0; i < 3; i++) {
        if (arr1[i].first != arr2[i].first) {
            std::cout << "No\n";
            return;
        }
        if (arr1[i].second != arr2[i].second) {
            av.push_back(1);
            av.push_back(1);
        }
    }

    for (ll i = 0; i < 3; i++) {
        if (arr1[i].second != arr2[i].second) break;
        if (i == 2) {
            std::cout << "Yes\n2\n";
            return;
        }
    }

    std::cout << "Yes\n";
    for (ll e : av) std::cout << e << "\n";
}

int main() {
    solve();
    return 0;
}