結果
問題 | No.990 N×Mマス計算(Kの倍数) |
ユーザー | ir5 |
提出日時 | 2024-06-21 17:08:12 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 180 ms / 2,000 ms |
コード長 | 2,908 bytes |
コンパイル時間 | 1,885 ms |
コンパイル使用メモリ | 149,116 KB |
実行使用メモリ | 17,280 KB |
最終ジャッジ日時 | 2024-06-21 17:08:17 |
合計ジャッジ時間 | 4,469 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 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 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 52 ms
7,680 KB |
testcase_11 | AC | 41 ms
6,940 KB |
testcase_12 | AC | 152 ms
6,940 KB |
testcase_13 | AC | 26 ms
6,940 KB |
testcase_14 | AC | 58 ms
6,944 KB |
testcase_15 | AC | 32 ms
6,940 KB |
testcase_16 | AC | 66 ms
8,704 KB |
testcase_17 | AC | 27 ms
6,944 KB |
testcase_18 | AC | 151 ms
6,944 KB |
testcase_19 | AC | 57 ms
6,940 KB |
testcase_20 | AC | 180 ms
17,280 KB |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n; public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}}; template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif namespace solver { template<typename T1, typename T2> struct In2 { T1 a; T2 b; friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; } }; template<typename T1, typename T2, typename T3> struct In3 { T1 a; T2 b; T3 c; friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; } }; ll n, m, k; char op; vector<ll> bs, as; void read() { cin >> n >> m >> k >> op; take(bs, m); take(as, n); } ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } using RetType = ll; RetType run() { if (op == '+') { map<ll, ll> mp; ll res = 0; for (ll a : as) mp[a % k]++; for (ll b : bs) { ll invb = ((-b % k) + k) % k; res += mp[invb]; } return res; } map<ll, ll> mp1, mp2; for (ll x : as) mp1[gcd(x, k)]++; for (ll x : bs) mp2[gcd(x, k)]++; ll res = 0; for (auto it1 : mp1) for (auto it2 : mp2) if (it1.first * it2.first % k == 0) { res += it1.second * it2.second; } return res; } } // namespace template <typename F> void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { solver::read(); } run(solver::run); }