#605288 (C++17) No.1340 おーじ君をさがせ

提出ソース

結果

問題	No.1340 おーじ君をさがせ
ユーザー	rniya
提出日時	2021-01-16 13:13:13
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,485 bytes
コンパイル時間	2,673 ms
コンパイル使用メモリ	206,384 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-05-05 15:08:28
合計ジャッジ時間	4,779 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	1 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	1 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	WA	-
testcase_11	AC	14 ms 5,376 KB
testcase_12	AC	3 ms 5,376 KB
testcase_13	AC	11 ms 5,376 KB
testcase_14	AC	27 ms 5,376 KB
testcase_15	AC	24 ms 5,376 KB
testcase_16	AC	3 ms 5,376 KB
testcase_17	AC	8 ms 5,376 KB
testcase_18	AC	13 ms 5,376 KB
testcase_19	AC	2 ms 5,376 KB
testcase_20	AC	2 ms 5,376 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	AC	50 ms 5,376 KB
testcase_33	AC	50 ms 5,376 KB
testcase_34	AC	49 ms 5,376 KB
testcase_35	WA	-
testcase_36	AC	1 ms 5,376 KB
testcase_37	AC	2 ms 5,376 KB
testcase_38	AC	52 ms 5,376 KB
testcase_39	AC	20 ms 5,376 KB
testcase_40	AC	21 ms 5,376 KB
testcase_41	AC	19 ms 5,376 KB
testcase_42	AC	1 ms 5,376 KB
testcase_43	AC	2 ms 5,376 KB
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	1 ms 5,376 KB
testcase_46	AC	15 ms 5,376 KB
testcase_47	AC	16 ms 5,376 KB
testcase_48	AC	18 ms 5,376 KB
testcase_49	AC	19 ms 5,376 KB
testcase_50	AC	17 ms 5,376 KB
testcase_51	AC	18 ms 5,376 KB
testcase_52	AC	34 ms 5,376 KB
testcase_53	AC	32 ms 5,376 KB
testcase_54	AC	32 ms 5,376 KB
testcase_55	AC	25 ms 5,376 KB
testcase_56	WA	-
testcase_57	AC	2 ms 5,376 KB
testcase_58	AC	1 ms 5,376 KB
testcase_59	AC	10 ms 5,376 KB
testcase_60	AC	1 ms 5,376 KB
testcase_61	AC	11 ms 5,376 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

template<class T>
struct Matrix{
    vector<vector<T>> A;
    Matrix(size_t n,size_t m):A(n,vector<T>(m,0)){}
    Matrix(size_t n):A(n,vector<T>(n,0)){}
    size_t height() const {return A.size();}
    size_t width() const {return A[0].size();}
    inline const vector<T> &operator[](int i) const {return A[i];}
    inline vector<T> &operator[](int i){return A[i];}
    static Matrix I(size_t n){
        Matrix res(n);
        for (int i=0;i<n;++i) res[i][i]=1;
        return res;
    }
    Matrix operator+(const Matrix &B) const {return Matrix(*this)+=B;}
    Matrix operator-(const Matrix &B) const {return Matrix(*this)-=B;}
    Matrix operator*(const Matrix &B) const {return Matrix(*this)*=B;}
    Matrix operator^(const long long k) const {return Matrix(*this)^=k;}
    Matrix &operator+=(const Matrix &B){
        size_t n=height(),m=width();
        assert(n==B.height()&&m==B.width());
        for (int i=0;i<n;++i){
            for (int j=0;j<m;++j){
                (*this)[i][j]|=B[i][j];
            }
        }
        return *this;
    }
    Matrix &operator-=(const Matrix &B){
        size_t n=height(),m=width();
        assert(n==B.height()&&m==B.width());
        for (int i=0;i<n;++i){
            for (int j=0;j<m;++j){
                (*this)[i][j]-=B[i][j];
            }
        }
        return *this;
    }
    Matrix &operator*=(const Matrix &B){
        size_t n=height(),m=B.width(),l=width();
        assert(l==B.height());
        vector<vector<T>> C(n,vector<T>(m,0));
        for (int i=0;i<n;++i){
            for (int j=0;j<m;++j){
                for (int k=0;k<l;++k){
                    C[i][j]|=(*this)[i][k]&B[k][j];
                }
            }
        }
        A.swap(C);
        return *this;
    }
    Matrix &operator^=(long long k){
        Matrix res=Matrix::I(height());
        while (k>0){
            if (k&1) res*=*this;
            *this*=*this; k>>=1LL;
        }
        A.swap(res.A);
        return *this;
    }
    T determinant(){
        Matrix B(*this);
        T res=1;
        for (int i=0;i<width();++i){
            int pivot=-1;
            for (int j=i;j<height();++j){
                if (B[j][i]!=0){
                    pivot=j;
                }
            }
            if (pivot<0) return 0;
            if (pivot!=i){
                res*=-1;
                swap(B[i],B[pivot]);
            }
            res*=B[i][i];
            T v=T(1)/B[i][i];
            for (int j=0;j<width();++j) B[i][j]*=v;
            for (int j=i+1;j<height();++j){
                T w=B[j][i];
                for (int k=0;k<width();++k){
                    B[j][k]-=B[i][k]*w;
                }
            }
        }
        return res;
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M,T; cin >> N >> M >> T;
    Matrix<int> SM(N);
    for (;M--;){
        int a,b; cin >> a >> b;
        SM[a][b]=1;
    }
    SM^=T;
    int ans=0;
    for (int i=0;i<N;++i) ans+=SM[0][i];
    cout << ans << '\n';
}

yukicoder

結果

テストケース

ソースコード