結果
問題 | No.990 N×Mマス計算(Kの倍数) |
ユーザー | ゆにぽけ |
提出日時 | 2023-10-09 10:14:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,384 bytes |
コンパイル時間 | 1,506 ms |
コンパイル使用メモリ | 135,632 KB |
実行使用メモリ | 8,960 KB |
最終ジャッジ日時 | 2024-07-26 18:25:04 |
合計ジャッジ時間 | 3,474 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | WA | - |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 29 ms
6,944 KB |
testcase_11 | AC | 17 ms
6,944 KB |
testcase_12 | WA | - |
testcase_13 | AC | 12 ms
6,944 KB |
testcase_14 | AC | 35 ms
6,944 KB |
testcase_15 | AC | 17 ms
6,940 KB |
testcase_16 | AC | 32 ms
6,940 KB |
testcase_17 | AC | 16 ms
6,940 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 94 ms
8,960 KB |
ソースコード
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cassert> #include<cmath> #include<ctime> #include<iomanip> #include<numeric> #include<stack> #include<queue> #include<map> #include<unordered_map> #include<set> #include<unordered_set> #include<bitset> #include<random> using namespace std; template<int m> struct modint { private: unsigned int value; static constexpr int mod() {return m;} public: constexpr modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= mod()) { y %= mod(); if(y < 0) y += mod(); } value = (unsigned int)y; } constexpr unsigned int val() noexcept {return value;} constexpr modint &operator+=(const modint &other) noexcept { value += other.value; if(value >= mod()) value -= mod(); return *this; } constexpr modint &operator-=(const modint &other) noexcept { unsigned int x = value; if(x < other.value) x += mod(); x -= other.value; value = x; return *this; } constexpr modint &operator*=(const modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int) (x % mod()); return *this; } constexpr modint &operator/=(const modint &other) noexcept { return *this *= other.inverse(); } constexpr modint inverse() const noexcept { assert(value); long long a = value,b = mod(),x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return modint(x); } constexpr modint power(long long N) const noexcept { assert(N >= 0); modint p = *this,ret = 1; while(N) { if(N & 1) ret *= p; p *= p; N >>= 1; } return ret; } constexpr modint operator+() {return *this;} constexpr modint operator-() {return modint() - *this;} constexpr modint &operator++(int) noexcept {return *this += 1;} constexpr modint &operator--(int) noexcept {return *this -= 1;} friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;} friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;} friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;} friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;} friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;} }; //using mint = modint<998244353>; using mint = modint<1000000007>; int gcd(int a,int b) { while(b) { a %= b; swap(a,b); } return a; } int lcm(int a,int b) {return a/gcd(a,b)*b;} int N,M,K,A[1 << 17],B[1 << 17]; char op; void solve() { cin >> N >> M >> K >> op; for(int i = 0;i < M;i++) cin >> B[i]; for(int i = 0;i < N;i++) cin >> A[i]; if(op == '+') { map<int,int> cnt; for(int i = 0;i < M;i++) cnt[B[i]%K]++; long long ans = 0; for(int i = 0;i < N;i++) { int r = A[i]%K; if(r) r = K-r; if(cnt.count(r)) ans += cnt[r]; } cout << ans << endl; } else { map<int,int> a,b; for(int i = 0;i < N;i++) a[gcd(K,A[i])]++; for(int i = 0;i < M;i++) b[gcd(K,B[i])]++; long long ans = 0; for(auto it = a.begin();it != a.end();it++)for(auto jt = b.begin();jt != b.end();jt++) { if(lcm(it->first,jt->first) == K) ans += (long long)it->second*jt->second; } cout << ans << endl; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; //cin >> tt; while(tt--) solve(); }