結果

問題 No.990 N×Mマス計算(Kの倍数)
ユーザー Konton7Konton7
提出日時 2020-05-02 13:10:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 208 ms / 2,000 ms
コード長 6,678 bytes
コンパイル時間 2,897 ms
コンパイル使用メモリ 232,064 KB
実行使用メモリ 22,784 KB
最終ジャッジ日時 2024-06-09 10:41:27
合計ジャッジ時間 4,449 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 58 ms
9,856 KB
testcase_11 AC 36 ms
6,940 KB
testcase_12 AC 198 ms
6,944 KB
testcase_13 AC 26 ms
6,940 KB
testcase_14 AC 50 ms
6,944 KB
testcase_15 AC 29 ms
6,944 KB
testcase_16 AC 68 ms
10,624 KB
testcase_17 AC 24 ms
6,940 KB
testcase_18 AC 208 ms
6,940 KB
testcase_19 AC 57 ms
6,940 KB
testcase_20 AC 188 ms
22,784 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w)
{
    return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T>
vector<T> cumsum(const vector<T> &v)
{
    T s = 0;
    vector<T> ret;

    rep(i, v.size())
    {
        s += v[i];
        s %= mod;
        ret.emplace_back(s);
    }
    return ret;
}

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c)
{
    VS ret;
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            ret.emplace_back(part);
            part = "";
        }
        else if (s[i] != c)
        {
            part += s[i];
        }
    }
    return ret;
}

string removezero(string &s)
{
    string ret;
    for (auto z : s)
        if (z != '0')
            ret += z;
    return ret;
}

ll sumdigit(ll x)
{
    ll ans{0};
    while (x > 0)
    {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

vector<int> cummonster(const string &v)
{
    int s = 0;
    vector<int> ret = {0};

    rep(i, v.length())
    {
        if (v[i] == 'E')
            s++;
        ret.emplace_back(s);
    }
    return ret;
}

void shave(vector<int> &v, int n)
{
    vector<int> x, y;
    int n_sq = sqrt(n) + 1;
    for (int i = 3; i < n + 1; i += 2)
    {
        x.emplace_back(i);
    }
    for (int i = 3; i < n_sq; i += 2)
    {
        for (auto itr = x.begin(); itr != x.end(); itr++)
        {
            if (*itr == i || *itr % i != 0)
                y.emplace_back(*itr);
        }
        x.clear();
        x = y;
        y.clear();
    }
    if (n >= 2)
        x.insert(x.begin(), 2);

    for (auto itr = x.begin(); itr != x.end(); itr++)
    {
        v.emplace_back(*itr);
    }
}


int main()
{

    // cin.tie(0);
    // ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, m, k;
    cin >> n >> m >> k;
    VI a(n), b(m);
    ll ans{0};
    char op;
    cin >> op;
    rep(i, m) cin >> b[i];
    rep(i, n) cin >> a[i];

    if (op == '+')
    {
        map<int, ll> amap, bmap;
        rep(i, m)
        {
            bmap[b[i] % k]++;
        }
        rep(j, n)
        {
            amap[a[j] % k]++;
        }

        for (auto [key, value] : bmap)
        {
            ans += value * amap[(k - key) % k];
        }
    }

    if (op == '*')
    {
        VI prime, factor, factor_count;
        shave(prime, sqrt(k) + 1);
        map<VI, ll> amap, bmap;

        int j = k, c, f;
        for (auto i : prime)
        {
            if (k % i == 0)
            {
                factor.emplace_back(i);
                c = 0;
                while (j % i == 0)
                {
                    j /= i;
                    c++;
                }
                factor_count.emplace_back(c);
            }
            if (j == 1)
                break;
        }
        if (j != 1)
        {
            factor.emplace_back(j);
            factor_count.emplace_back(1);
        }

        f = factor.size();

        VI fi(f, 0);
        for (auto ai : a)
        {
            fill(allpt(fi), 0);
            rep(i, f)
            {
                if (ai % factor[i] == 0)
                {
                    rep(ci, factor_count[i]) if (ai % factor[i] == 0)
                    {
                        ai /= factor[i];
                        fi[i]++;
                    }
                }
            }
            amap[fi]++;
        }
        for (auto bi : b)
        {
            fill(allpt(fi), 0);
            rep(i, f)
            {
                if (bi % factor[i] == 0)
                {
                    rep(ci, factor_count[i]) if (bi % factor[i] == 0)
                    {
                        bi /= factor[i];
                        fi[i]++;
                    }
                }
            }
            bmap[fi]++;
        }

        for (auto [bkey, bvalue] : bmap)
            for (auto [akey, avalue] : amap)
            {
                bool cond = true;
                rep(i, f)
                {
                    cond &= (akey[i] + bkey[i] >= factor_count[i]);
                }
                if (cond)
                    ans += avalue * bvalue;
            }
    }
    cout << ans << rt;

    return 0;
}
0