#590558 (C++17) No.1290 Addition and Subtraction Operation

提出ソース

結果

問題	No.1290 Addition and Subtraction Operation
ユーザー	rniya
提出日時	2020-12-08 15:31:35
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	30 ms / 2,000 ms
コード長	4,693 bytes
コンパイル時間	2,075 ms
コンパイル使用メモリ	209,024 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-17 14:41:54
合計ジャッジ時間	6,162 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	1 ms 6,944 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	1 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	1 ms 6,944 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	1 ms 6,940 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	1 ms 6,944 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	1 ms 6,944 KB
testcase_21	AC	2 ms 6,944 KB
testcase_22	AC	1 ms 6,944 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	1 ms 6,940 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	1 ms 6,940 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	2 ms 6,944 KB
testcase_29	AC	1 ms 6,940 KB
testcase_30	AC	2 ms 6,944 KB
testcase_31	AC	2 ms 6,944 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	1 ms 6,944 KB
testcase_34	AC	2 ms 6,940 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	1 ms 6,944 KB
testcase_39	AC	1 ms 6,944 KB
testcase_40	AC	1 ms 6,944 KB
testcase_41	AC	2 ms 6,940 KB
testcase_42	AC	14 ms 6,940 KB
testcase_43	AC	14 ms 6,940 KB
testcase_44	AC	14 ms 6,940 KB
testcase_45	AC	15 ms 6,940 KB
testcase_46	AC	14 ms 6,944 KB
testcase_47	AC	15 ms 6,940 KB
testcase_48	AC	15 ms 6,944 KB
testcase_49	AC	14 ms 6,940 KB
testcase_50	AC	13 ms 6,944 KB
testcase_51	AC	15 ms 6,940 KB
testcase_52	AC	14 ms 6,940 KB
testcase_53	AC	15 ms 6,940 KB
testcase_54	AC	15 ms 6,944 KB
testcase_55	AC	14 ms 6,944 KB
testcase_56	AC	14 ms 6,940 KB
testcase_57	AC	13 ms 6,940 KB
testcase_58	AC	17 ms 6,940 KB
testcase_59	AC	13 ms 6,940 KB
testcase_60	AC	26 ms 6,940 KB
testcase_61	AC	21 ms 6,940 KB
testcase_62	AC	24 ms 6,940 KB
testcase_63	AC	17 ms 6,940 KB
testcase_64	AC	10 ms 6,944 KB
testcase_65	AC	12 ms 6,944 KB
testcase_66	AC	20 ms 6,940 KB
testcase_67	AC	30 ms 6,940 KB
testcase_68	AC	24 ms 6,944 KB
testcase_69	AC	18 ms 6,940 KB
testcase_70	AC	17 ms 6,944 KB
testcase_71	AC	19 ms 6,940 KB
testcase_72	AC	12 ms 6,940 KB
testcase_73	AC	21 ms 6,944 KB
testcase_74	AC	10 ms 6,940 KB
testcase_75	AC	12 ms 6,944 KB
testcase_76	AC	17 ms 6,940 KB
testcase_77	AC	28 ms 6,944 KB
testcase_78	AC	25 ms 6,944 KB
testcase_79	AC	19 ms 6,944 KB
testcase_80	AC	30 ms 6,944 KB
testcase_81	AC	30 ms 6,940 KB
testcase_82	AC	23 ms 6,940 KB
testcase_83	AC	30 ms 6,940 KB
testcase_84	AC	29 ms 6,940 KB
testcase_85	AC	16 ms 6,944 KB
testcase_86	AC	14 ms 6,940 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

struct UnionFind{
    int num;
    vector<int> par,rank;
    UnionFind(int n):num(n),par(n),rank(n,1){
        iota(par.begin(),par.end(),0);
    }
    int root(int x){
        return (par[x]==x?x:par[x]=root(par[x]));
    }
    bool merge(int x, int y){
        x=root(x); y=root(y);
        if (x==y) return false;
        if (rank[x]<rank[y]) swap(x,y);
        par[y]=x;
        rank[x]+=rank[y];
        --num;
        return true;
    }
    bool same(int x, int y){return root(x)==root(y);}
    int size(int x){return rank[root(x)];}
    int count(){return num;}
    int operator[](int x){return root(x);}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M; cin >> N >> M;
    vector<int> B(N);
    for (int i=0;i<N;++i) cin >> B[i];

    for (int i=1;i<N;i+=2) B[i]*=-1;
    B.emplace_back(0);
    for (int i=N-1;i>=0;--i) B[i+1]-=B[i];

    UnionFind UF(N+1);
    for (int i=0;i<M;++i){
        int L,R; cin >> L >> R;
        UF.merge(--L,R);
    }

    vector<ll> sum(N+1,0);
    for (int i=0;i<=N;++i) sum[UF[i]]+=B[i];

    for (int i=0;i<=N;++i){
        if (sum[i]!=0){
            cout << "NO" << '\n';
            return 0;
        }
    }

    cout << "YES" << '\n';
}

yukicoder

結果

テストケース

ソースコード