結果

問題 No.1290 Addition and Subtraction Operation
ユーザー 👑 hitonanodehitonanode
提出日時 2020-11-13 22:45:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 4,865 bytes
コンパイル時間 2,920 ms
コンパイル使用メモリ 207,428 KB
実行使用メモリ 5,904 KB
最終ジャッジ日時 2023-09-30 03:46:21
合計ジャッジ時間 6,957 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 1 ms
4,376 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 1 ms
4,376 KB
testcase_16 AC 2 ms
4,380 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 1 ms
4,380 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 2 ms
4,376 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 1 ms
4,380 KB
testcase_25 AC 1 ms
4,376 KB
testcase_26 AC 1 ms
4,376 KB
testcase_27 AC 1 ms
4,376 KB
testcase_28 AC 2 ms
4,376 KB
testcase_29 AC 2 ms
4,376 KB
testcase_30 AC 1 ms
4,380 KB
testcase_31 AC 2 ms
4,380 KB
testcase_32 AC 1 ms
4,384 KB
testcase_33 AC 2 ms
4,376 KB
testcase_34 AC 2 ms
4,376 KB
testcase_35 AC 2 ms
4,376 KB
testcase_36 AC 2 ms
4,380 KB
testcase_37 AC 1 ms
4,376 KB
testcase_38 AC 1 ms
4,380 KB
testcase_39 AC 1 ms
4,380 KB
testcase_40 AC 2 ms
4,376 KB
testcase_41 AC 2 ms
4,380 KB
testcase_42 AC 15 ms
4,380 KB
testcase_43 AC 15 ms
4,376 KB
testcase_44 AC 15 ms
4,380 KB
testcase_45 AC 15 ms
4,380 KB
testcase_46 AC 15 ms
4,380 KB
testcase_47 AC 15 ms
4,376 KB
testcase_48 AC 15 ms
4,380 KB
testcase_49 AC 15 ms
4,380 KB
testcase_50 AC 14 ms
4,376 KB
testcase_51 AC 15 ms
4,376 KB
testcase_52 AC 15 ms
4,376 KB
testcase_53 AC 15 ms
4,376 KB
testcase_54 AC 15 ms
4,376 KB
testcase_55 AC 15 ms
4,380 KB
testcase_56 AC 15 ms
4,376 KB
testcase_57 AC 16 ms
5,812 KB
testcase_58 AC 19 ms
5,764 KB
testcase_59 AC 15 ms
5,812 KB
testcase_60 AC 31 ms
5,808 KB
testcase_61 AC 25 ms
5,808 KB
testcase_62 AC 27 ms
5,768 KB
testcase_63 AC 19 ms
5,704 KB
testcase_64 AC 12 ms
5,852 KB
testcase_65 AC 13 ms
5,708 KB
testcase_66 AC 22 ms
5,748 KB
testcase_67 AC 32 ms
5,708 KB
testcase_68 AC 25 ms
5,808 KB
testcase_69 AC 19 ms
5,724 KB
testcase_70 AC 18 ms
5,744 KB
testcase_71 AC 22 ms
5,876 KB
testcase_72 AC 14 ms
5,796 KB
testcase_73 AC 23 ms
5,800 KB
testcase_74 AC 11 ms
5,764 KB
testcase_75 AC 12 ms
5,736 KB
testcase_76 AC 18 ms
5,724 KB
testcase_77 AC 31 ms
5,800 KB
testcase_78 AC 28 ms
5,804 KB
testcase_79 AC 21 ms
5,776 KB
testcase_80 AC 35 ms
5,800 KB
testcase_81 AC 35 ms
5,764 KB
testcase_82 AC 25 ms
5,728 KB
testcase_83 AC 33 ms
5,804 KB
testcase_84 AC 32 ms
5,720 KB
testcase_85 AC 18 ms
5,904 KB
testcase_86 AC 15 ms
5,788 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
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, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x) {}
#endif


// UnionFind Tree (0-indexed), based on size of each disjoint set
struct UnionFind
{
    std::vector<int> par;
    vector<lint> cou;
    UnionFind(int N = 0) : par(N), cou(N, 1) {
        iota(par.begin(), par.end(), 0);
    }
    int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
    bool unite(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return false;
        if (cou[x] < cou[y]) std::swap(x, y);
        par[y] = x, cou[x] += cou[y];
        return true;
    }
    lint count(int x) { return cou[find(x)]; }
    bool same(int x, int y) { return find(x) == find(y); }
};

int main()
{
    int N, M;
    cin >> N >> M;
    vector<lint> B(N);
    cin >> B;
    for (int i = 1; i < N; i += 2) {
        B[i] *= -1;
    }
    vector<lint> diff = B;
    IREP(i, N - 1) {
        diff[i + 1] -= diff[i];
    }
    
    diff.emplace_back(-B.back());
    dbg(B);
    dbg(diff);
    UnionFind uf(diff.size());
    uf.cou = diff;

    while (M--) {
        int a, b;
        cin >> a >> b;
        a--;
        uf.unite(a, b);
    }
    REP(i, diff.size()) {
        if (uf.count(i)) {
            puts("NO");
            return 0;
        }
    }
    puts("YES");
}
0