結果

問題 No.3531 Erase Pair
コンテスト
ユーザー hitonanode
提出日時 2026-05-04 21:59:27
言語 C++23
(gcc 15.2.0 + boost 1.89.0)
コンパイル:
g++-15 -O2 -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
AC  
実行時間 19 ms / 500 ms
コード長 10,595 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 3,470 ms
コンパイル使用メモリ 305,532 KB
実行使用メモリ 6,400 KB
最終ジャッジ日時 2026-05-06 03:06:13
合計ジャッジ時間 7,336 ms
ジャッジサーバーID
（参考情報） 		judge2_1 / judge3_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff #
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_CYAN = "\033[1;36m", 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

map<vector<lint>, bool> memo;

bool Bruteforce(vector<lint> A) {
    if (A.size() <= 1) return true;
    sort(ALL(A));
    if (memo.contains(A)) return memo.at(A);

    bool found = false;
    REP(i, A.size()) REP(j, i) {
        const lint sum = A.at(i) + A.at(j);
        if (binary_search(ALL(A), sum)) continue;

        vector<lint> nxt = A;
        nxt.erase(nxt.begin() + i);
        nxt.erase(nxt.begin() + j);

        const bool b = Bruteforce(nxt);
        found |= b;
    }

    return memo[A] = found;
}

// https://hitonanode.github.io/cplib-cpp/random/rand_nondeterministic.hpp
#include <chrono>
#include <random>

struct rand_int_ {
    using lint = long long;
    std::mt19937 mt;
    rand_int_() : mt(42) {}
    // rand_int_() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}
    lint operator()(lint x) { return this->operator()(0, x); } // [0, x)
    lint operator()(lint l, lint r) {
        std::uniform_int_distribution<lint> d(l, r - 1);
        return d(mt);
    }
} rnd;


bool Solve(const vector<lint> &A) {
    const int n = A.size();
    const int n0 = count(ALL(A), 0LL);
    if (n0 >= 2) return false;
    if (n % 2 == 0 and n0) return false;

    if (n % 2 and n0) {
        int nl = 0, nr = 0;
        map<lint, pint> mp;
        for (lint a : A) {
            if (a > 0) mp[a].first++, nl++;
            if (a < 0) mp[-a].second++, nr++;
        }

        if (mp.size() == 1) {

            for (auto [_, fs] : mp) {
                auto [l, r] = fs;
                if (l % 2) return false;
                // if (l > nr - r) return false;
                // if (r > nl - l) return false;
            }
        }

        if (mp.size() == 2) {
            auto [b1, lr1] = *mp.begin();
            auto [b2, lr2] = *(next(mp.begin()));
            if (b1 * 2 != b2) return true;

            auto [l1, r1] = lr1;
            auto [l2, r2] = lr2;

            if ((l1 + l2) % 2 == 0) return true;

            if (l1 <= l2) return true;
            if (r1 <= r2) return true;

            if (!l1) return true;
            if (!r1) return true;
            if (!l1 and !r2) return true;
            if (!r1 and !l2) return true;

            if (!r1 and !r2) return true;
            if (!l1 and !l2) return true;

            return false;
        }

        if (mp.size() == 3) {
            auto [b1, lr1] = *mp.begin();
            auto [b2, lr2] = *next(mp.begin());
            auto [b3, lr3] = *next(next(mp.begin()));
            if (b1 * 2 != b2) return true;
            if (b1 * 3 != b3) return true;

            auto [l1, r1] = lr1;
            auto [l2, r2] = lr2;
            auto [l3, r3] = lr3;

            // if (l3 and r3) return true;
            // return false;

            if ((l1 + l2 + l3) % 2 == 0) return true;
            if (l1 <= l2 + l3) return true;
            if (r1 <= r2 + r3) return true;

            if (l2 % 2 == 0 and l3) return true;
            if (l3 > 1) return true;
            if (r3 > 1) return true;
            // if (l2 )
            if (r2 % 2 == 0 and r3) return true;

            // if (l1 == 0 and r1 == 0) return true;

            return false;
        }
    }
    return true;
}

int main() {
    for (long long ntry = 1;; ntry++) {
        break;
        // const int n = rnd(1, 12);
        const int n = rnd(1, 8) * 2 + 1;
        vector<lint> a(n);
        // for (auto &x : a) x = rnd(-10, 11);
        for (auto &x : a) {
            while (x == 0) x = rnd(-3, 4);
        }
        a.at(0) = 0;
        
        sort(ALL(a));
        const auto sol = Solve(a);
        const auto bru = Bruteforce(a);
        if (sol != bru) {
            dbg(make_tuple(bru, sol, a));
            // dbg(sol);
            // dbg(bru);
            // exit(1);
        }
        if (__builtin_popcountll(ntry) == 1) {
            dbg(ntry);
            ;
        }
    }
    
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        vector<lint> A(N);
        cin >> A;
        sort(ALL(A));

        const auto ret = Solve(A);
        cout << (ret ? "Yes" : "No") << '\n';
    }
}
0