#862045 (C++14) No.2277 Honest or Dishonest ?

提出ソース

結果

問題	No.2277 Honest or Dishonest ?
ユーザー	woodywoody
提出日時	2023-04-22 12:50:09
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	80 ms / 2,000 ms
コード長	5,095 bytes
コンパイル時間	4,200 ms
コンパイル使用メモリ	234,884 KB
実行使用メモリ	13,568 KB
最終ジャッジ日時	2024-11-08 06:50:42
合計ジャッジ時間	8,223 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	60 ms 11,648 KB
testcase_04	AC	66 ms 11,776 KB
testcase_05	AC	20 ms 7,040 KB
testcase_06	AC	50 ms 10,368 KB
testcase_07	AC	41 ms 9,216 KB
testcase_08	AC	15 ms 6,912 KB
testcase_09	AC	35 ms 8,576 KB
testcase_10	AC	28 ms 7,552 KB
testcase_11	AC	13 ms 5,376 KB
testcase_12	AC	21 ms 6,656 KB
testcase_13	AC	58 ms 11,136 KB
testcase_14	AC	24 ms 7,552 KB
testcase_15	AC	16 ms 6,272 KB
testcase_16	AC	37 ms 9,088 KB
testcase_17	AC	18 ms 6,144 KB
testcase_18	AC	53 ms 11,264 KB
testcase_19	AC	55 ms 11,520 KB
testcase_20	AC	44 ms 9,984 KB
testcase_21	AC	37 ms 8,832 KB
testcase_22	AC	34 ms 8,704 KB
testcase_23	AC	50 ms 10,496 KB
testcase_24	AC	31 ms 8,320 KB
testcase_25	AC	41 ms 9,344 KB
testcase_26	AC	9 ms 6,144 KB
testcase_27	AC	23 ms 7,040 KB
testcase_28	AC	16 ms 6,400 KB
testcase_29	AC	25 ms 7,808 KB
testcase_30	AC	22 ms 7,040 KB
testcase_31	AC	40 ms 9,728 KB
testcase_32	AC	22 ms 7,424 KB
testcase_33	AC	51 ms 11,264 KB
testcase_34	AC	64 ms 12,288 KB
testcase_35	AC	6 ms 5,248 KB
testcase_36	AC	35 ms 8,832 KB
testcase_37	AC	54 ms 11,264 KB
testcase_38	AC	11 ms 5,248 KB
testcase_39	AC	16 ms 5,992 KB
testcase_40	AC	7 ms 5,248 KB
testcase_41	AC	66 ms 12,544 KB
testcase_42	AC	43 ms 9,984 KB
testcase_43	AC	64 ms 12,800 KB
testcase_44	AC	80 ms 13,568 KB
testcase_45	AC	77 ms 13,568 KB
testcase_46	AC	75 ms 13,440 KB
testcase_47	AC	67 ms 13,568 KB
testcase_48	AC	76 ms 13,568 KB
testcase_49	AC	73 ms 13,440 KB
testcase_50	AC	67 ms 12,928 KB
testcase_51	AC	78 ms 13,568 KB
testcase_52	AC	65 ms 13,056 KB

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

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

struct edge{
    int from,to;
    ll cost;

    edge(int from_=0,int to_=0,ll cost_=0) : from(from_),to(to_),cost(cost_) {}
};

void solve(){
    int n,q; cin>>n>>q;
    vi a(q),b(q),c(q);
    vector<vector<edge>> e(n);
    rep(i,q){
        cin>>a[i]>>b[i]>>c[i];
        a[i]--; b[i]--;
        e[a[i]].pb(edge(a[i] , b[i] , c[i]));
        e[b[i]].pb(edge(b[i] , a[i] , c[i]));
    }

    vi st(n,-1);
    bool ok = true;
    auto dfs = [&](auto dfs,int x,int pre)->void{
        if (!ok) return;
        fore(ey , e[x]){
            if(ey.to == pre) continue;
            int nxt = st[x];
            nxt ^= ey.cost;
            if (st[ey.to]!=-1 && nxt!=st[ey.to]){
                ok = false;
                break;
            }
            if (st[ey.to]!=-1) continue;
            st[ey.to] = nxt;
            dfs(dfs , ey.to ,x);
            if (!ok) break;
        }
    
        return;
    };
    int cnt = 0;
    rep(i,n){
        if (st[i]==-1){
            st[i] = 0;
            cnt++;
            dfs(dfs,i,-1);
        }
    }
    mint ans = mint(2).pow(cnt);
    if (!ok) ans = 0;
    outm;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード