結果

問題 No.990 N×Mマス計算（Kの倍数）
ユーザー haruki_Kharuki_K
提出日時 2020-02-14 22:30:49
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 65 ms / 2,000 ms
コード長 4,995 bytes
コンパイル時間 1,961 ms
コンパイル使用メモリ 185,480 KB
実行使用メモリ 14,260 KB
最終ジャッジ日時 2024-04-27 19:51:10
合計ジャッジ時間 2,822 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 22 ms
6,940 KB
testcase_11 AC 17 ms
6,940 KB
testcase_12 AC 56 ms
6,940 KB
testcase_13 AC 11 ms
6,944 KB
testcase_14 AC 19 ms
6,944 KB
testcase_15 AC 12 ms
6,944 KB
testcase_16 AC 27 ms
7,156 KB
testcase_17 AC 10 ms
6,940 KB
testcase_18 AC 55 ms
6,944 KB
testcase_19 AC 28 ms
6,940 KB
testcase_20 AC 65 ms
14,260 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#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) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
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> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = 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(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
// <<<
ll mod(ll x, ll m) { return (x %= m) < 0 ? x+m : x; }
vector<int> divisors(int n) {
    assert(n > 0);
    vector<int> a;
    int x = 1;
    for ( ; x*x < n; x++) if (n % x == 0) a.push_back(x);
    int s = a.size();
    if (x*x == n) a.push_back(x);
    a.reserve(a.size()+s);
    rep (i,s) a.push_back(n/a[s-1-i]);
    return a;
}
map<int,int> prime_factor(int n) {
    map<int,int> ret;
    for (int i = 2; i*i <= n; i++) {
        if (n % i != 0) continue;
        int c = 0;
        while (n % i == 0) c++, n /= i;
        ret[i] = c;
    }
    if (n > 1) ret[n] = 1;
    return ret;
}

int32_t main() {
    int n,m,k; cin >> n >> m >> k;
    char op; cin >> op;
    vector<int> b(m); cin >> b;
    vector<int> a(n); cin >> a;

    if (op == '+') {
        unordered_map<int,int> cnt;
        rep (j,m) cnt[b[j]%k]++;
        int ans = 0;
        rep (i,n) ans += cnt[mod(-a[i],k)];
        cout << ans << endl;
    } else {
        auto divs = divisors(k);
        auto ps = prime_factor(k);
        unordered_map<int,int> cnt;
        rep (j,m) cnt[__gcd(b[j],k)]++;
        reverse(all(divs));
        for (auto p : ps) {
            for (int d : divs) {
                if (d%p.fst) continue;
                cnt[d/p.fst] += cnt[d];
            }
        }
        dump(cnt);

        int ans = 0;
        rep (i,n) {
            int y = k/__gcd(a[i],k);
            ans += cnt[y];
        }
        cout << ans << endl;

    }



}
0