#861646 (C++17) No.2277 Honest or Dishonest ?

提出ソース

結果

問題	No.2277 Honest or Dishonest ?
ユーザー	dyktr_06
提出日時	2023-04-21 22:36:49
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	31 ms / 2,000 ms
コード長	8,562 bytes
コンパイル時間	4,797 ms
コンパイル使用メモリ	265,392 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-11-08 06:38:17
合計ジャッジ時間	6,867 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	26 ms 5,248 KB
testcase_04	AC	27 ms 5,248 KB
testcase_05	AC	9 ms 5,248 KB
testcase_06	AC	22 ms 5,248 KB
testcase_07	AC	18 ms 5,248 KB
testcase_08	AC	8 ms 5,248 KB
testcase_09	AC	17 ms 5,248 KB
testcase_10	AC	14 ms 5,248 KB
testcase_11	AC	7 ms 5,248 KB
testcase_12	AC	12 ms 5,248 KB
testcase_13	AC	24 ms 5,248 KB
testcase_14	AC	16 ms 5,248 KB
testcase_15	AC	8 ms 5,248 KB
testcase_16	AC	17 ms 5,248 KB
testcase_17	AC	10 ms 5,248 KB
testcase_18	AC	24 ms 5,248 KB
testcase_19	AC	25 ms 5,248 KB
testcase_20	AC	20 ms 5,248 KB
testcase_21	AC	18 ms 5,248 KB
testcase_22	AC	17 ms 5,248 KB
testcase_23	AC	25 ms 5,248 KB
testcase_24	AC	15 ms 5,248 KB
testcase_25	AC	19 ms 5,248 KB
testcase_26	AC	6 ms 5,248 KB
testcase_27	AC	13 ms 5,248 KB
testcase_28	AC	9 ms 5,248 KB
testcase_29	AC	13 ms 5,248 KB
testcase_30	AC	12 ms 5,248 KB
testcase_31	AC	20 ms 5,248 KB
testcase_32	AC	13 ms 5,248 KB
testcase_33	AC	25 ms 5,248 KB
testcase_34	AC	26 ms 5,248 KB
testcase_35	AC	4 ms 5,248 KB
testcase_36	AC	17 ms 5,248 KB
testcase_37	AC	26 ms 5,248 KB
testcase_38	AC	7 ms 5,248 KB
testcase_39	AC	9 ms 5,248 KB
testcase_40	AC	4 ms 5,248 KB
testcase_41	AC	29 ms 5,248 KB
testcase_42	AC	20 ms 5,248 KB
testcase_43	AC	31 ms 5,248 KB
testcase_44	AC	30 ms 5,248 KB
testcase_45	AC	31 ms 5,248 KB
testcase_46	AC	31 ms 5,248 KB
testcase_47	AC	31 ms 5,248 KB
testcase_48	AC	31 ms 5,376 KB
testcase_49	AC	30 ms 5,248 KB
testcase_50	AC	30 ms 5,248 KB
testcase_51	AC	30 ms 5,248 KB
testcase_52	AC	30 ms 5,248 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 1000000007;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <long long Modulus>
struct ModInt{
    long long val;
    constexpr ModInt(const long long &_val = 0) noexcept : val(_val) {
        normalize();
    }
    void normalize(){
        val = (val % Modulus + Modulus) % Modulus;
    }
    inline ModInt& operator+=(const ModInt& rhs) noexcept {
        if(val += rhs.val, val >= Modulus) val -= Modulus;
        return *this;
    }
    inline ModInt& operator-=(const ModInt& rhs) noexcept {
        if(val -= rhs.val, val < 0) val += Modulus;
        return *this;
    }
    inline ModInt& operator*=(const ModInt& rhs) noexcept {
        val = val * rhs.val % Modulus;
        return *this;
    }
    inline ModInt& operator/=(const ModInt& rhs) noexcept {
        val = val * inv(rhs.val).val % Modulus;
        return *this;
    }
    inline ModInt& operator++() noexcept {
        if(++val >= Modulus) val -= Modulus;
        return *this;
    }
    inline ModInt operator++(int) noexcept {
        ModInt t = val;
        if(++val >= Modulus) val -= Modulus;
        return t;
    }
    inline ModInt& operator--() noexcept {
        if(--val < 0) val += Modulus;
        return *this;
    }
    inline ModInt operator--(int) noexcept {
        ModInt t = val;
        if(--val < 0) val += Modulus;
        return t;
    }
    inline ModInt operator-() const noexcept { return (Modulus - val) % Modulus; }
    inline ModInt inv(void) const { return inv(val); }
    ModInt inv(const long long& n) const {
        long long a = n, b = Modulus, u = 1, v = 0;
        while(b){
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        u %= Modulus;
        if(u < 0) u += Modulus;
        return u;
    }
    friend inline ModInt operator+(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) += rhs; }
    friend inline ModInt operator-(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) -= rhs; }
    friend inline ModInt operator*(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) *= rhs; }
    friend inline ModInt operator/(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) /= rhs; }
    friend inline bool operator==(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val == rhs.val; }
    friend inline bool operator!=(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val != rhs.val; }
    friend inline istream& operator>>(istream& is, ModInt& x) noexcept {
        is >> x.val;
        x.normalize();
        return is;
    }
    friend inline ostream& operator<<(ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

template <typename T>
struct WeightedUnionFind{
    vector<int> par, rank, siz;
    vector<T> diff_weight;

    WeightedUnionFind(const int &N, const T &e = 0) : par(N), rank(N), siz(N), diff_weight(N){
        for(int i = 0; i < N; ++i){
            par[i] = i;
            rank[i] = 0;
            siz[i] = 1;
            diff_weight[i] = e;
        }
    }

    int root(const int &x){
        if(par[x] == x){
            return x;
        }
        int rx = root(par[x]);
        diff_weight[x] += diff_weight[par[x]];
        return par[x] = rx;
    }

    T weight(const int &x){
        root(x);
        return diff_weight[x];
    }

    T diff(const int &x, const int &y){
        return weight(y) - weight(x);
    }

    void unite(const int &x, const int &y, T &w){
        w += weight(x);
        w -= weight(y);

        int rx = root(x);
        int ry = root(y);
        if(rx == ry) return;

        if(rank[rx] < rank[ry]){
            swap(rx, ry);
            w = -w;
        }

        par[ry] = rx;
        siz[rx] += siz[ry];
        diff_weight[ry] = w;
        if(rank[rx] == rank[ry]) ++rank[rx];
    }

    bool same(const int &x, const int &y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }

    int size(const int &x){
        return siz[root(x)];
    }
};

ll n, q;

using mint = ModInt<998244353>;

void input(){
    in(n, q);
}

void solve(){
    WeightedUnionFind<ll> uf(n);
    rep(i, q){
        ll a, b, c; in(a, b, c); a--; b--;
        if(uf.same(a, b)){
            if(abs(uf.diff(a, b)) % 2 != c){
                out(0);
                return;
            }
        }else{
            uf.unite(a, b, c);
        }
    }
    mint ans = 1;
    rep(i, n){
        if(uf.root(i) == i) ans *= 2;
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード