#765112 (C++17) No.1955 Not Prime

提出ソース

結果

問題	No.1955 Not Prime
ユーザー	raven7959
提出日時	2022-05-22 16:27:20
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,571 bytes
コンパイル時間	2,853 ms
コンパイル使用メモリ	227,868 KB
実行使用メモリ	74,948 KB
最終ジャッジ日時	2024-09-20 12:41:45
合計ジャッジ時間	4,584 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	22 ms 11,552 KB
testcase_01	AC	21 ms 11,552 KB
testcase_02	WA	-
testcase_03	WA	-
testcase_04	AC	22 ms 11,552 KB
testcase_05	AC	21 ms 11,684 KB
testcase_06	AC	23 ms 11,928 KB
testcase_07	AC	59 ms 16,956 KB
testcase_08	AC	52 ms 15,932 KB
testcase_09	AC	77 ms 16,148 KB
testcase_10	AC	67 ms 11,716 KB
testcase_11	AC	130 ms 74,948 KB
testcase_12	AC	37 ms 13,280 KB
testcase_13	AC	79 ms 17,828 KB
testcase_14	AC	31 ms 13,488 KB
testcase_15	AC	31 ms 13,240 KB
testcase_16	AC	45 ms 15,704 KB
testcase_17	AC	66 ms 19,640 KB
testcase_18	AC	79 ms 17,728 KB
testcase_19	AC	77 ms 21,680 KB
testcase_20	AC	21 ms 11,572 KB
testcase_21	AC	38 ms 13,708 KB
testcase_22	AC	21 ms 11,540 KB
testcase_23	AC	22 ms 11,424 KB
testcase_24	AC	21 ms 11,548 KB
testcase_25	AC	21 ms 11,656 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n"
#define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vld = vector<long double>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvc = vector<vector<char>>;
using vvd = vector<vector<double>>;
using vvld = vector<vector<long double>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<ll>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvvvl = vector<vector<vector<vector<ll>>>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
const int INF = 1e9;
const ll LINF = 2e18;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
bool ispow2(int i) { return i && (i & -i) == i; }
bool ispow2(ll i) { return i && (i & -i) == i; }
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < int(v.size()) - 1) os << ' ';
    }
    return os;
}

static uint32_t RandXor(){
    static uint32_t x=123456789;
    static uint32_t y=362436069;
    static uint32_t z=521288629;
    static uint32_t w=88675123;
    uint32_t t;
 
    t=x^(x<<11);
    x=y; y=z; z=w;
    return w=(w^(w>>19))^(t^(t>>8));
}

static double Rand01(){
    return (RandXor()+0.5)*(1.0/UINT_MAX);
}

struct sieve{
    vector<bool> is_prime;
    vector<int> min_factor,primes;

    sieve(int N): is_prime(N+1,true),min_factor(N+1,-1){
        is_prime[1]=false;
        min_factor[1]=1;
        for(int i=2;i<=N;i++){
            if(!is_prime[i]) continue;
            primes.push_back(i);
            min_factor[i]=i;
            for(int j=i;j<=N;j+=i){
                is_prime[j]=false;
                if(min_factor[j]==-1) min_factor[j]=i;
            }
        }
    }

    vector<pair<int,int>> factorize(int n){
        vector<pair<int,int>> ret;
        while(n>1){
            int p=min_factor[n];
            int e=0;
            while(n%p==0){
                e++;
                n/=p;
            }
            ret.emplace_back(p,e);
        }
        return ret;
    }
};

template <typename T = int>
struct Edge{
    int from, to;
    T cost;
    int idx;
    Edge() = default;
    Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}
    operator int() const { return to; }
};

template <typename T = int>
struct Graph{
    vector<vector<Edge<T>>> g;
    int es;
    Graph() = default;
    explicit Graph(int n) : g(n), es(0) {}
    size_t size() const{
        return g.size();
    }

    void add_directed_edge(int from, int to, T cost = 1){
        g[from].emplace_back(from, to, cost, es++);
    }

    void add_edge(int from, int to, T cost = 1){
        g[from].emplace_back(from, to, cost, es);
        g[to].emplace_back(to, from, cost, es++);
    }

    void read(int M, int padding = -1, bool weighted = false, bool directed = false){
        for (int i = 0; i < M; i++){
            int a, b;
            cin >> a >> b;
            a += padding;
            b += padding;
            T c = T(1);
            if (weighted) cin >> c;
            if (directed) add_directed_edge(a, b, c);
            else add_edge(a, b, c);
        }
    }

    inline vector<Edge<T>> &operator[](const int &k){
        return g[k];
    }

    inline const vector<Edge<T>> &operator[](const int &k) const{
        return g[k];
    }
};

template <typename T = int>
using Edges = vector<Edge<T>>;

template <typename G>
struct StronglyConnectedComponent{
private:
    G g;
    const int V;
    int cnt;
    vector<int> in,low;
    stack<int> st;
    void dfs(const int v,int &time){
        in[v]=time;
        low[v]=time;
        time++;
        st.push(v);
        for(auto nv:g[v]){
            if(in[nv]<0){
                dfs(nv,time);
                low[v]=min(low[v],low[nv]);
            }
            else if(rev[nv]<0){
                low[v]=min(low[v],in[nv]);
            }
        }
        if(in[v]==low[v]){
            while(true){
                const int u=st.top();
                st.pop();
                rev[u]=cnt;
                if(u==v) break;
            }
            cnt++;
        }
    }

public:
    vector<vector<int>> members;
    vector<int> rev;

    StronglyConnectedComponent(G &_g): 
        g(_g),V(_g.size()),cnt(0),in(_g.size(),-1),low(_g.size()),
        rev(_g.size(),-1){
        int time=0;
        for(int i=0;i<V;i++){
            if(in[i]<0) dfs(i,time);
        }
        for(int i=0;i<V;i++) rev[i]=cnt-rev[i]-1;
        members.resize(cnt);
        for(int i=0;i<V;i++) members[rev[i]].push_back(i);
    }
};

void solve(){
    int N;
    cin>>N;
    vs A(N),B(N);
    rep(i,N) cin>>A[i]>>B[i];
    sieve SE(1000000);
    vi P(1000000);
    for(auto p:SE.primes) P[p]++;
    Graph<int> G(2*N);
    rep(i,N){
        rep(j,i){
            // S,T
            string s1=A[i]+A[j],t1=B[j]+B[i];
            if(P[stoi(s1)] || P[stoi(t1)]){
                G.add_directed_edge(i,j);
                G.add_directed_edge(j+N,i+N);
            }
            // S,S
            string s2=A[i]+B[j],t2=A[j]+B[i];
            if(P[stoi(s2)] || P[stoi(t2)]){
                G.add_directed_edge(i,j+N);
                G.add_directed_edge(j,i+N);
            }
            // T,T
            string s3=B[i]+A[j],t3=B[j]+A[i];
            if(P[stoi(s3)] || P[stoi(t3)]){
                G.add_directed_edge(i+N,j);
                G.add_directed_edge(j+N,i);
            }
            // T,S
            string s4=B[i]+B[j],t4=A[j]+A[i];
            if(P[stoi(s4)] || P[stoi(t4)]){
                G.add_directed_edge(i+N,j+N);
                G.add_directed_edge(j,i);
            }
        }
    }
    rep(i,N){
        string s1=A[i]+B[i];
        if(P[stoi(s1)]){
            rep(j,N){
                if(i==j) continue;
                G.add_directed_edge(j,i+N);
                G.add_directed_edge(j+N,i+N);
            }
        }
        string s2=B[i]+A[i];
        if(P[stoi(s2)]){
            rep(j,N){
                if(i==j) continue;
                G.add_directed_edge(j,i);
                G.add_directed_edge(j+N,i);
            }
        }
    }
    StronglyConnectedComponent<Graph<int>> SCC(G);
    vi num(2*N);
    auto mem=SCC.members;
    rep(i,sz(mem)) for(auto v:mem[i]) num[v]=i;
    bool flg=true;
    rep(i,N) if(num[i]==num[i+N]) flg=false;
    yn(flg);
}

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

    solve();
}

yukicoder

結果

テストケース

ソースコード