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

提出ソース

結果

問題	No.1773 Love Triangle
ユーザー	Sumitacchan
提出日時	2021-12-31 00:35:23
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	96 ms / 2,000 ms
コード長	6,606 bytes
コンパイル時間	2,239 ms
コンパイル使用メモリ	210,916 KB
実行使用メモリ	7,168 KB
最終ジャッジ日時	2024-10-07 03:50:55
合計ジャッジ時間	8,419 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	2 ms 6,820 KB
testcase_06	AC	2 ms 6,816 KB
testcase_07	AC	2 ms 6,816 KB
testcase_08	AC	2 ms 6,816 KB
testcase_09	AC	2 ms 6,820 KB
testcase_10	AC	2 ms 6,820 KB
testcase_11	AC	2 ms 6,820 KB
testcase_12	AC	2 ms 6,816 KB
testcase_13	AC	2 ms 6,820 KB
testcase_14	AC	2 ms 6,816 KB
testcase_15	AC	2 ms 6,816 KB
testcase_16	AC	2 ms 6,816 KB
testcase_17	AC	2 ms 6,820 KB
testcase_18	AC	44 ms 6,820 KB
testcase_19	AC	2 ms 6,816 KB
testcase_20	AC	7 ms 6,816 KB
testcase_21	AC	2 ms 6,816 KB
testcase_22	AC	7 ms 6,816 KB
testcase_23	AC	4 ms 6,820 KB
testcase_24	AC	5 ms 6,816 KB
testcase_25	AC	8 ms 6,820 KB
testcase_26	AC	3 ms 6,816 KB
testcase_27	AC	2 ms 6,816 KB
testcase_28	AC	3 ms 6,816 KB
testcase_29	AC	2 ms 6,820 KB
testcase_30	AC	33 ms 6,816 KB
testcase_31	AC	5 ms 6,820 KB
testcase_32	AC	5 ms 6,820 KB
testcase_33	AC	3 ms 6,820 KB
testcase_34	AC	2 ms 6,816 KB
testcase_35	AC	2 ms 6,820 KB
testcase_36	AC	16 ms 6,820 KB
testcase_37	AC	1 ms 6,820 KB
testcase_38	AC	83 ms 6,912 KB
testcase_39	AC	82 ms 6,912 KB
testcase_40	AC	87 ms 6,912 KB
testcase_41	AC	93 ms 7,040 KB
testcase_42	AC	96 ms 7,168 KB
testcase_43	AC	95 ms 7,040 KB
testcase_44	AC	89 ms 6,912 KB
testcase_45	AC	81 ms 7,040 KB
testcase_46	AC	89 ms 7,168 KB
testcase_47	AC	91 ms 6,912 KB
testcase_48	AC	86 ms 7,040 KB
testcase_49	AC	86 ms 7,040 KB
testcase_50	AC	84 ms 6,912 KB
testcase_51	AC	96 ms 6,912 KB
testcase_52	AC	88 ms 6,912 KB
testcase_53	AC	84 ms 7,040 KB
testcase_54	AC	83 ms 6,912 KB
testcase_55	AC	91 ms 7,040 KB
testcase_56	AC	84 ms 7,040 KB
testcase_57	AC	87 ms 6,912 KB
testcase_58	AC	83 ms 7,040 KB
testcase_59	AC	86 ms 7,040 KB
testcase_60	AC	85 ms 7,168 KB
testcase_61	AC	81 ms 7,168 KB
testcase_62	AC	85 ms 7,040 KB
testcase_63	AC	81 ms 7,040 KB
testcase_64	AC	89 ms 7,040 KB
testcase_65	AC	84 ms 7,040 KB
testcase_66	AC	94 ms 7,040 KB
testcase_67	AC	86 ms 7,168 KB
testcase_68	AC	89 ms 7,040 KB
testcase_69	AC	87 ms 7,040 KB
testcase_70	AC	81 ms 7,040 KB
testcase_71	AC	87 ms 7,040 KB
testcase_72	AC	83 ms 7,040 KB
testcase_73	AC	85 ms 7,168 KB
testcase_74	AC	88 ms 7,040 KB
testcase_75	AC	89 ms 7,040 KB
testcase_76	AC	79 ms 7,040 KB
testcase_77	AC	87 ms 7,040 KB
testcase_78	AC	2 ms 6,816 KB
testcase_79	AC	5 ms 7,040 KB
testcase_80	AC	7 ms 7,168 KB
testcase_81	AC	48 ms 7,040 KB
testcase_82	AC	36 ms 7,168 KB
testcase_83	AC	15 ms 6,820 KB
testcase_84	AC	15 ms 6,816 KB
testcase_85	AC	15 ms 6,820 KB
testcase_86	AC	4 ms 6,816 KB
testcase_87	AC	8 ms 6,820 KB
testcase_88	AC	5 ms 6,824 KB
testcase_89	AC	6 ms 6,820 KB
testcase_90	AC	28 ms 6,912 KB
testcase_91	AC	23 ms 6,816 KB
testcase_92	AC	4 ms 6,816 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, (int)v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, (int)m.size()){ REP(j_debug, (int)m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < (int)v.size(); i++) { cout << v[i]; if(i != (int)v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

template<long long MOD>
struct ModInt{

    using ll = long long;
    ll val;

    void setval(ll v) { val = v % MOD; };
    ModInt(): val(0) {}
    ModInt(ll v) { setval(v); };

    ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); }
    ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); }
    ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); }
    ModInt operator/(const ModInt &x) const { return *this * x.inv(); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt operator+=(const ModInt &x) { return *this = *this + x; }
    ModInt operator-=(const ModInt &x) { return *this = *this - x; }
    ModInt operator*=(const ModInt &x) { return *this = *this * x; }
    ModInt operator/=(const ModInt &x) { return *this = *this / x; }
    bool operator==(const ModInt &x) const { return (*this).val == x.val; }

    friend ostream& operator<<(ostream &os, const ModInt &x) { os << x.val; return os; }
    friend istream& operator>>(istream &is, ModInt &x) { is >> x.val; x.val = (x.val % MOD + MOD) % MOD; return is; }

    ModInt pow(ll n) const {
        ModInt a = 1;
        if(n == 0) return a;
        int i0 = 64 - __builtin_clzll(n);
        for(int i = i0 - 1; i >= 0; i--){
            a = a * a;
            if((n >> i) & 1) a *= (*this); 
        }
        return a;
    }
    ModInt inv() const { return this->pow(MOD - 2); }
};

using mint = ModInt<mod>; mint pow(mint x, long long n) { return x.pow(n); }
//using mint = double; //for debug
using mvec = vector<mint>;
using mmat = vector<mvec>;

struct Combination{

    vector<mint> fact, invfact;

    Combination(int N){
        fact = vector<mint>({mint(1)});
        invfact = vector<mint>({mint(1)});
        fact_initialize(N);
    }

    void fact_initialize(int N){
        int i0 = fact.size();
        if(i0 >= N + 1) return;
        fact.resize(N + 1);
        invfact.resize(N + 1);
        for(int i = i0; i <= N; i++) fact[i] = fact[i - 1] * i;
        invfact[N] = (mint)1 / fact[N];
        for(int i = N - 1; i >= i0; i--) invfact[i] = invfact[i + 1] * (i + 1); 
    }

    mint nCr(int n, int r){
        if(n < 0 || r < 0 || r > n) return mint(0);
        if((int)fact.size() < n + 1) fact_initialize(n);
        return fact[n] * invfact[r] * invfact[n - r];
    }

    mint nPr(int n, int r){
        if(n < 0 || r < 0 || r > n) return mint(0);
        if((int)fact.size() < n + 1) fact_initialize(n);
        return fact[n] * invfact[n - r];
    }

    mint Catalan(int n){
        if(n < 0) return 0;
        else if(n == 0) return 1;
        if((int)fact.size() < 2 * n + 1) fact_initialize(2 * n);
        return fact[2 * n] * invfact[n + 1] * invfact[n];
    }

};

template <typename T>
int calc_rank(vector<vector<T>> A){
    if(A.size() == 0){
        return 0;
    }

    int N = A.size(), M = A[0].size();
    for(int i = 0; i < N; i++) assert((int)A[i].size() == M);
    
    int i_now = 0;
    for(int j = 0; j < M; j++){
        int i0 = -1;
        for(int i = i_now; i < N; i++) if(!(A[i][j] == 0)){
            i0 = i; 
            break;
        }
        if(i0 == -1) continue;
        if(i0 != i_now){
            A[i_now].swap(A[i0]);
        }
        for(int i = i_now + 1; i < N; i++){
            if(A[i][j] == 0) continue;
            T alpha = A[i][j] / A[i_now][j];
            for(int k = j; k < M; k++){
                A[i][k] -= A[i_now][k] * alpha;
            }
        }
        i_now++;
        if(i_now == N) break;
    }
    return i_now;
}

struct fast_random
{
    uint32_t x;

    fast_random(int seed = 2463534242): x(seed){}

    uint32_t xorshift(){
        x ^= (x << 13);
        x ^= (x >> 17);
        x ^= (x << 5);
        return x;
    }

    //random integer in [a, b]
    uint32_t randint(uint32_t a, uint32_t b){
        return a + xorshift() % (b - a + 1);
    }

    double uniform(){
        return (double)xorshift() / UINT32_MAX;
    }

    double uniform(double a, double b){
        return a + uniform() * (b - a);
    }

};

signed main(){

    int N, M; cin >> N >> M;
    mmat A(N, mvec(N));
    fast_random rng;
    REP(i, M){
        int u, v, w; cin >> u >> v >> w;
        u--; v--; w--;
        mint x = rng.randint(0, mod - 1);
        A[u][v] += x;
        A[v][w] += x;
        A[w][u] += x;
        A[v][u] -= x;
        A[w][v] -= x;
        A[u][w] -= x;
    }
    int rank = calc_rank(A);
    int ans = rank / 2;
    cout << ans << endl;

    return 0;
}

yukicoder

結果

テストケース

ソースコード