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

提出ソース

結果

問題	No.1340 おーじ君をさがせ
ユーザー	rniya
提出日時	2021-01-16 13:15:40
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	8,471 bytes
コンパイル時間	1,981 ms
コンパイル使用メモリ	205,840 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-05-05 15:12:36
合計ジャッジ時間	19,587 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	38 ms 5,248 KB
testcase_01	AC	32 ms 5,376 KB
testcase_02	AC	37 ms 5,376 KB
testcase_03	AC	52 ms 5,376 KB
testcase_04	AC	31 ms 5,376 KB
testcase_05	AC	26 ms 5,376 KB
testcase_06	AC	21 ms 5,376 KB
testcase_07	AC	38 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	14 ms 5,376 KB
testcase_10	AC	505 ms 5,376 KB
testcase_11	AC	299 ms 5,376 KB
testcase_12	AC	260 ms 5,376 KB
testcase_13	AC	253 ms 5,376 KB
testcase_14	AC	248 ms 5,376 KB
testcase_15	AC	266 ms 5,376 KB
testcase_16	AC	265 ms 5,376 KB
testcase_17	AC	279 ms 5,376 KB
testcase_18	AC	237 ms 5,376 KB
testcase_19	AC	301 ms 5,376 KB
testcase_20	AC	254 ms 5,376 KB
testcase_21	AC	535 ms 5,376 KB
testcase_22	AC	506 ms 5,376 KB
testcase_23	AC	566 ms 5,376 KB
testcase_24	AC	510 ms 5,376 KB
testcase_25	AC	588 ms 5,376 KB
testcase_26	AC	541 ms 5,376 KB
testcase_27	AC	555 ms 5,376 KB
testcase_28	AC	493 ms 5,376 KB
testcase_29	AC	541 ms 5,376 KB
testcase_30	AC	533 ms 5,376 KB
testcase_31	AC	514 ms 5,376 KB
testcase_32	AC	497 ms 5,376 KB
testcase_33	AC	482 ms 5,376 KB
testcase_34	AC	445 ms 5,376 KB
testcase_35	AC	549 ms 5,376 KB
testcase_36	AC	517 ms 5,376 KB
testcase_37	AC	504 ms 5,376 KB
testcase_38	AC	509 ms 5,376 KB
testcase_39	AC	131 ms 5,376 KB
testcase_40	AC	139 ms 5,376 KB
testcase_41	AC	142 ms 5,376 KB
testcase_42	AC	28 ms 5,376 KB
testcase_43	AC	27 ms 5,376 KB
testcase_44	AC	263 ms 5,376 KB
testcase_45	AC	97 ms 5,376 KB
testcase_46	AC	97 ms 5,376 KB
testcase_47	AC	103 ms 5,376 KB
testcase_48	AC	117 ms 5,376 KB
testcase_49	AC	117 ms 5,376 KB
testcase_50	AC	118 ms 5,376 KB
testcase_51	AC	119 ms 5,376 KB
testcase_52	AC	226 ms 5,376 KB
testcase_53	AC	216 ms 5,376 KB
testcase_54	AC	223 ms 5,376 KB
testcase_55	AC	171 ms 5,376 KB
testcase_56	AC	274 ms 5,376 KB
testcase_57	AC	270 ms 5,376 KB
testcase_58	WA	-
testcase_59	WA	-
testcase_60	AC	2 ms 5,376 KB
testcase_61	WA	-

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

ソースコード

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<uint32_t mod> class modint{
    using i64=int64_t;
    using u32=uint32_t;
    using u64=uint64_t;
public:
    u32 v;
    constexpr modint(const i64 x=0) noexcept :v(x<0?mod-1-(-(x+1)%mod):x%mod){}
    constexpr u32 &value() noexcept {return v;}
    constexpr const u32 &value() const noexcept {return v;}
    constexpr modint operator+(const modint &rhs) const noexcept {return modint(*this)+=rhs;}
    constexpr modint operator-(const modint &rhs) const noexcept {return modint(*this)-=rhs;}
    constexpr modint operator*(const modint &rhs) const noexcept {return modint(*this)*=rhs;}
    constexpr modint operator/(const modint &rhs) const noexcept {return modint(*this)/=rhs;}
    constexpr modint &operator+=(const modint &rhs) noexcept {
        v+=rhs.v;
        if (v>=mod) v-=mod;
        return *this;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept {
        if (v<rhs.v) v+=mod;
        v-=rhs.v;
        return *this;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept {
        v=(u64)v*rhs.v%mod;
        return *this;
    }
    constexpr modint &operator/=(const modint &rhs) noexcept {
        return *this*=rhs.pow(mod-2);
    }
    constexpr modint pow(u64 exp) const noexcept {
        modint self(*this),res(1);
        while (exp>0){
            if (exp&1) res*=self;
            self*=self; exp>>=1;
        }
        return res;
    }
    constexpr modint &operator++() noexcept {if (++v==mod) v=0; return *this;}
    constexpr modint &operator--() noexcept {if (v==0) v=mod; return --v,*this;}
    constexpr modint operator++(int) noexcept {modint t=*this; return ++*this,t;}
    constexpr modint operator--(int) noexcept {modint t=*this; return --*this,t;}
    constexpr modint operator-() const noexcept {return modint(mod-v);}
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept {return modint(x)+y;}
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept {return modint(x)-y;}
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept {return modint(x)*y;}
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept {return modint(x)/y;}
    constexpr bool operator==(const modint &rhs) const noexcept {return v==rhs.v;}
    constexpr bool operator!=(const modint &rhs) const noexcept {return v!=rhs.v;}
    constexpr bool operator!() const noexcept {return !v;}
    friend istream &operator>>(istream &s,modint &rhs) noexcept {
        i64 v; rhs=modint{(s>>v,v)}; return s;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept {
        return s<<rhs.v;
    }
};

template<class T,size_t N>
struct SquareMatrix{
    array<array<T,N>,N> A;
    SquareMatrix()=default;
    size_t size() {return N;}
    inline const array<T,N> &operator[](int i) const {return A[i];}
    inline array<T,N> &operator[](int i){return A[i];}
    static SquareMatrix add_identity(){
        return SquareMatrix();
    }
    static SquareMatrix mul_identity(){
        SquareMatrix res;
        for (size_t i=0;i<N;++i) res[i][i]=1;
        return res;
    }
    SquareMatrix operator+(const SquareMatrix &B) const {return SquareMatrix(*this)+=B;}
    SquareMatrix operator-(const SquareMatrix &B) const {return SquareMatrix(*this)-=B;}
    SquareMatrix operator*(const SquareMatrix &B) const {return SquareMatrix(*this)*=B;}
    SquareMatrix operator^(const long long &k) const {return SquareMatrix(*this)^=k;}
    SquareMatrix &operator+=(const SquareMatrix &B){
        for (size_t i=0;i<N;++i){
            for (size_t j=0;j<N;++j){
                (*this)[i][j]+=B[i][j];
            }
        }
        return *this;
    }
    SquareMatrix &operator-=(const SquareMatrix &B){
        for (size_t i=0;i<N;++i){
            for (size_t j=0;j<N;++j){
                (*this)[i][j]-=B[i][j];
            }
        }
        return *this;
    }
    SquareMatrix &operator*=(const SquareMatrix &B){
        array<array<T,N>,N> C;
        for (size_t i=0;i<N;++i){
            for (size_t j=0;j<N;++j){
                for (size_t k=0;k<N;++k){
                    C[i][j]+=(*this)[i][k]*B[k][j];
                }
            }
        }
        A.swap(C);
        return *this;
    }
    SquareMatrix &operator^=(long long k){
        SquareMatrix res=SquareMatrix::mul_identity();
        while (k>0){
            if (k&1) res*=*this;
            *this*=*this; k>>=1LL;
        }
        A.swap(res.A);
        return *this;
    }
};

const int MAX_N=110;
using mint1=modint<1000000009>;
using mint2=modint<998244353>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M; ll T; cin >> N >> M >> T;
    SquareMatrix<mint1,MAX_N> SM1;
    SquareMatrix<mint2,MAX_N> SM2;
    for (int i=0;i<M;++i){
        int a,b; cin >> a >> b;
        SM1[a][b]=1;
        SM2[a][b]=1;
    }
    SM1^=T; SM2^=T;
    int ans=0;
    for (int i=0;i<N;++i) ans+=(SM1[0][i]!=0&&SM2[0][i]!=0);

    cout << ans << '\n';
}

yukicoder

結果

テストケース

ソースコード