結果

問題 No.1955 Not Prime
ユーザー haruki_Kharuki_K
提出日時 2022-05-21 10:06:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 9,264 bytes
コンパイル時間 2,591 ms
コンパイル使用メモリ 227,168 KB
実行使用メモリ 19,316 KB
最終ジャッジ日時 2024-09-20 11:20:24
合計ジャッジ時間 3,649 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
7,552 KB
testcase_01 AC 10 ms
7,680 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 10 ms
7,680 KB
testcase_05 AC 10 ms
7,680 KB
testcase_06 AC 11 ms
7,680 KB
testcase_07 AC 22 ms
9,708 KB
testcase_08 AC 20 ms
9,708 KB
testcase_09 AC 26 ms
8,944 KB
testcase_10 AC 18 ms
7,680 KB
testcase_11 AC 42 ms
19,316 KB
testcase_12 AC 14 ms
8,100 KB
testcase_13 AC 26 ms
9,716 KB
testcase_14 AC 12 ms
8,100 KB
testcase_15 AC 13 ms
8,228 KB
testcase_16 AC 16 ms
8,936 KB
testcase_17 AC 21 ms
9,964 KB
testcase_18 AC 26 ms
9,716 KB
testcase_19 AC 28 ms
11,760 KB
testcase_20 AC 10 ms
7,720 KB
testcase_21 AC 16 ms
8,104 KB
testcase_22 AC 10 ms
7,680 KB
testcase_23 AC 10 ms
7,552 KB
testcase_24 AC 10 ms
7,680 KB
testcase_25 AC 10 ms
7,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/twosat>
using namespace atcoder;
// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#define oj_local(x, y) (y)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#define oj_local(x, y) (x)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
bool next_product(vector<int> &v, int m) {
    repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0;
    return false;
}
bool next_product(vector<int> &v, vector<int> const& s) {
    repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0;
    return false;
}
template <class vec> int sort_unique(vec &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
    return v.size();
}
template <class It> auto prefix_sum(It l, It r) {
    vector<typename It::value_type> s = { 0 };
    while (l != r) s.emplace_back(s.back() + *l++);
    return s;
}
template <class It> auto suffix_sum(It l, It r) {
    vector<typename It::value_type> s = { 0 };
    while (l != r) s.emplace_back(*--r + s.back());
    reverse(s.begin(), s.end());
    return s;
}
template <class T> T pop(vector<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T, class V, class C> T pop(priority_queue<T, V, C> &a) { auto x = a.top(); a.pop(); return x; }
template <class T> T pop(queue<T> &a) { auto x = a.front(); a.pop(); return x; }
template <class T> T pop_front(deque<T> &a) { auto x = a.front(); a.pop_front(); return x; }
template <class T> T pop_back(deque<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T> T pop_front(set<T> &a) { auto x = *a.begin(); a.erase(a.begin()); return x; }
template <class T> T pop_back(set<T> &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; }
template <class T> T pop_front(multiset<T> &a) { auto it = a.begin(); auto x = *it; a.erase(it); return x; }
template <class T> T pop_back(multiset<T> &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; }
// <<<
// >>> sieve

namespace Sieve {
    constexpr int MAX = 1e6 + 10;
    vector<int32_t> ps, pf; // primes, min prime factor
    auto sieve_init = [](){
        pf.resize(MAX+1);
        iota(pf.begin(), pf.end(), 0);
        for (int i = 2; i <= MAX; ++i) {
            if (pf[i] == i) ps.push_back(i);
            for (int p : ps) {
                const int x = p*i;
                if (p > pf[i] || x > MAX) break;
                pf[x] = p;
            }
        }
        return 0;
    }();
    bool is_prime(int n) {
        assert(0 <= n); assert(n <= MAX);
        return pf[n] == n && n >= 2;
    }
    vector<pair<int, int>> prime_factor(int n) {
        assert(0 <= n); assert(n <= MAX);
        static vector<pair<int, int>> ret;
        ret.clear();
        uint32_t m = n;
        while (m > 1u) {
            uint32_t p = pf[m], i = 0;
            do m /= p, ++i; while ((uint32_t)pf[m] == p);
            ret.emplace_back(p, i);
        }
        return ret;
    }
    vector<int> divisors(int n) {
        assert(0 <= n); assert(n <= MAX);
        static vector<int> ret;
        ret.clear();
        ret.push_back(1);
        for (auto p : prime_factor(n)) {
            int m = ret.size();
            for (int i = 0; i < m; ++i) {
                for (int j = 0, v = 1;  j < p.second; ++j) {
                    v *= p.first;
                    ret.push_back(ret[i]*v);
                }
            }
        }
        return ret;
    }
}
using namespace Sieve;

// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> a(n), b(n), tenA(n), tenB(n);
    rep (i, n) {
        cin >> a[i] >> b[i];
        auto ten = [&](int x) {
            auto s = to_string(x);
            int p = 1;
            rep (i, s.size()) p *= 10;
            return p;
        };
        tenA[i] = ten(a[i]);
        tenB[i] = ten(b[i]);
    }

    auto check = [&](int i, int j) {
        return not is_prime(a[i]*tenB[j] + b[j]);
    };

    two_sat ts(n);
    rep (j, n) rep (i, j) {
        rep (x, 2) {
            swap(a[i], b[i]);
            swap(tenA[i], tenB[i]);
            rep (y, 2) {
                swap(a[j], b[j]);
                swap(tenA[j], tenB[j]);

                bool ok = true;
                for (auto S : { i, j }) {
                    for (auto T : { i, j }) {
                        ok &= check(S, T);
                    }
                }
                if (not ok) {
                    ts.add_clause(i, x^1, j, y^1);
                }
            }
        }
    }

    cout << (ts.satisfiable() ? "Yes" : "No") << '\n';

}
0