#725108 (C++17) No.1773 Love Triangle

• 問題: No.1773 Love Triangle
• ユーザー: tko919
• 提出日時: 2021-12-19 15:45:32
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 198 ms / 2,000 ms
• コード長: 4,980 bytes
• コンパイル時間: 2,157 ms
• コンパイル使用メモリ: 209,100 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-15 14:34:16
• 合計ジャッジ時間: 14,158 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	3 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	3 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	139 ms; 5,376 KB
testcase_19	AC	4 ms; 5,376 KB
testcase_20	AC	11 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	11 ms; 5,376 KB
testcase_23	AC	9 ms; 5,376 KB
testcase_24	AC	59 ms; 5,376 KB
testcase_25	AC	56 ms; 5,376 KB
testcase_26	AC	3 ms; 5,376 KB
testcase_27	AC	4 ms; 5,376 KB
testcase_28	AC	3 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	109 ms; 5,376 KB
testcase_31	AC	77 ms; 5,376 KB
testcase_32	AC	55 ms; 5,376 KB
testcase_33	AC	17 ms; 5,376 KB
testcase_34	AC	3 ms; 5,376 KB
testcase_35	AC	4 ms; 5,376 KB
testcase_36	AC	25 ms; 5,376 KB
testcase_37	AC	2 ms; 5,376 KB
testcase_38	AC	189 ms; 5,376 KB
testcase_39	AC	185 ms; 5,376 KB
testcase_40	AC	184 ms; 5,376 KB
testcase_41	AC	190 ms; 5,376 KB
testcase_42	AC	195 ms; 5,376 KB
testcase_43	AC	187 ms; 5,376 KB
testcase_44	AC	189 ms; 5,376 KB
testcase_45	AC	188 ms; 5,376 KB
testcase_46	AC	193 ms; 5,376 KB
testcase_47	AC	187 ms; 5,376 KB
testcase_48	AC	193 ms; 5,376 KB
testcase_49	AC	193 ms; 5,376 KB
testcase_50	AC	187 ms; 5,376 KB
testcase_51	AC	189 ms; 5,376 KB
testcase_52	AC	184 ms; 5,376 KB
testcase_53	AC	188 ms; 5,376 KB
testcase_54	AC	184 ms; 5,376 KB
testcase_55	AC	195 ms; 5,376 KB
testcase_56	AC	187 ms; 5,376 KB
testcase_57	AC	190 ms; 5,376 KB
testcase_58	AC	197 ms; 5,376 KB
testcase_59	AC	197 ms; 5,376 KB
testcase_60	AC	196 ms; 5,376 KB
testcase_61	AC	194 ms; 5,376 KB
testcase_62	AC	194 ms; 5,376 KB
testcase_63	AC	196 ms; 5,376 KB
testcase_64	AC	191 ms; 5,376 KB
testcase_65	AC	194 ms; 5,376 KB
testcase_66	AC	191 ms; 5,376 KB
testcase_67	AC	196 ms; 5,376 KB
testcase_68	AC	198 ms; 5,376 KB
testcase_69	AC	195 ms; 5,376 KB
testcase_70	AC	194 ms; 5,376 KB
testcase_71	AC	196 ms; 5,376 KB
testcase_72	AC	193 ms; 5,376 KB
testcase_73	AC	196 ms; 5,376 KB
testcase_74	AC	196 ms; 5,376 KB
testcase_75	AC	196 ms; 5,376 KB
testcase_76	AC	197 ms; 5,376 KB
testcase_77	AC	196 ms; 5,376 KB
testcase_78	AC	2 ms; 5,376 KB
testcase_79	AC	3 ms; 5,376 KB
testcase_80	AC	5 ms; 5,376 KB
testcase_81	AC	197 ms; 5,376 KB
testcase_82	AC	196 ms; 5,376 KB
testcase_83	AC	55 ms; 5,376 KB
testcase_84	AC	84 ms; 5,376 KB
testcase_85	AC	139 ms; 5,376 KB
testcase_86	AC	38 ms; 5,376 KB
testcase_87	AC	84 ms; 5,376 KB
testcase_88	AC	45 ms; 5,376 KB
testcase_89	AC	61 ms; 5,376 KB
testcase_90	AC	170 ms; 5,376 KB
testcase_91	AC	118 ms; 5,376 KB
testcase_92	AC	29 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

template<int mod=1000000007>struct fp {
    int v; static int get_mod(){return mod;}
    int inv() const{
        int tmp,a=v,b=mod,x=1,y=0;
        while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
        if(x<0){x+=mod;} return x;
    }
    fp(ll x=0){init(x%mod+mod);}
    fp& init(int x){v=(x<mod?x:x-mod); return *this;}
    fp operator-()const{return fp()-*this;}
    fp pow(ll t){fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;}
    fp& operator+=(const fp& x){return init(v+x.v);}
    fp& operator-=(const fp& x){return init(v+mod-x.v);}
    fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;}
    fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;}
    fp operator+(const fp& x)const{return fp(*this)+=x;}
    fp operator-(const fp& x)const{return fp(*this)-=x;}
    fp operator*(const fp& x)const{return fp(*this)*=x;}
    fp operator/(const fp& x)const{return fp(*this)/=x;}
    bool operator==(const fp& x)const{return v==x.v;}
    bool operator!=(const fp& x)const{return v!=x.v;}
    friend istream& operator>>(istream& is,fp& x){return is>>x.v;}
    friend ostream& operator<<(ostream& os,const fp& x){return os<<x.v;}
}; using Fp=fp<>;
template<typename T>struct factorial {
    vector<T> Fact,Finv,Inv;
    factorial(int maxx){
        Fact.resize(maxx); Finv.resize(maxx); Inv.resize(maxx);
        Fact[0]=Fact[1]=Finv[0]=Finv[1]=Inv[1]=1;
        rep(i,2,maxx){Fact[i]=Fact[i-1]*i;} Finv[maxx-1]=Fact[maxx-1].inv();
        for(int i=maxx-1;i>=2;i--){Finv[i-1]=Finv[i]*i; Inv[i]=Finv[i]*Fact[i-1];}
    }
    T fact(int n,bool inv=0){if(n<0)return 0; return (inv?Finv[n]:Fact[n]);}
    T inv(int n){if(n<0)return 0; return Inv[n];}
    T nPr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(n-r,inv^1);}
    T nCr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(r,inv^1)*fact(n-r,inv^1);}
    T nHr(int n,int r,bool inv=0){return nCr(n+r-1,r,inv);}
};

template<class T>struct matrix{
    int h,w; vector<vector<T>> val; T det;
    matrix(){}
    matrix(int n,int m):h(n),w(m),val(vector<vector<T>>(n,vector<T>(m))){}
    vector<T>& operator[](const int i){return val[i];}
    matrix& operator+=(const matrix& m){
        rep(i,0,h)rep(j,0,w)val[i][j]+=m.val[i][j];
        return *this;
    }
    matrix& operator-=(const matrix& m){
        rep(i,0,h)rep(j,0,w)val[i][j]-=m.val[i][j];
        return *this;
    }
    matrix& operator*=(const matrix& m){
        matrix<T> res(h,m.w);
        rep(i,0,h)rep(j,0,m.w)rep(k,0,w)res.val[i][j]+=val[i][k]*m.val[k][j];
        *this=res; return *this;
    }
    matrix operator+(const matrix& m)const{return matrix(*this)+=m;}
    matrix operator-(const matrix& m)const{return matrix(*this)-=m;}
    matrix operator*(const matrix& m)const{return matrix(*this)*=m;}
    matrix pow(ll k){
        matrix<T> res(h,h),c=*this; rep(i,0,h)res.val[i][i]=1;
        while(k){if(k&1)res*=c; c*=c; k>>=1;} return res;
    }
    vector<int> gauss(int c=-1){
        if(val.empty())return {};
        if(c==-1)c=w;
        int cur=0; vector<int> res; det=1;
        rep(i,0,c){
            if(cur==h)break;
            rep(j,cur,h)if(val[j][i]!=0){
                swap(val[cur],val[j]);
                if(cur!=j)det*=-1;
                break;
            }
            det*=val[cur][i];
            if(val[cur][i]==0)continue;
            rep(j,0,h)if(j!=cur){
                T z=val[j][i]/val[cur][i];
                rep(k,i,w)val[j][k]-=val[cur][k]*z;
            }
            res.push_back(i);
            cur++;
        }
        return res;
    }
    friend istream& operator>>(istream& is,matrix& m){
        rep(i,0,m.h)rep(j,0,m.w)is>>m[i][j];
        return is;
    }
    friend ostream& operator<<(ostream& os,matrix& m){
        rep(i,0,m.h){
            rep(j,0,m.w)os<<m[i][j]<<(j==m.w-1 and i!=m.h-1?'\n':' ');
        }
        return os;
    }
};

struct XorShift{
    random_device rnd;
    unsigned x=123456789,y=362436069,z=521288629,w=rnd();
    XorShift(){}
    unsigned run(){
        unsigned t=x^(x<<11);
        x=y,y=z,z=w;
        return w=(w^(w<<19))^(t^(t>>8));
    }
};

int main(){
    int n,m;
    cin>>n>>m;

    XorShift rnd;
    matrix<Fp> m1(n,n);
    rep(_,0,m){
        int x,y,z;
        cin>>x>>y>>z;
        x--; y--; z--;

        unsigned val=rnd.run();
        m1[x][y]+=val;
        m1[y][z]+=val;
        m1[z][x]+=val;
        m1[x][z]-=val;
        m1[y][x]-=val;
        m1[z][y]-=val;
    }

    auto ret=m1.gauss().size()/2;
    cout<<ret<<'\n';
    return 0;
}