結果
問題 | No.2260 Adic Sum |
ユーザー | SnowBeenDiding |
提出日時 | 2023-04-07 21:27:33 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 705 ms / 2,000 ms |
コード長 | 6,146 bytes |
コンパイル時間 | 5,730 ms |
コンパイル使用メモリ | 314,700 KB |
実行使用メモリ | 11,108 KB |
最終ジャッジ日時 | 2024-10-06 06:58:46 |
合計ジャッジ時間 | 10,138 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 4 ms
5,248 KB |
testcase_09 | AC | 3 ms
5,248 KB |
testcase_10 | AC | 3 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 4 ms
5,248 KB |
testcase_13 | AC | 3 ms
5,248 KB |
testcase_14 | AC | 21 ms
6,144 KB |
testcase_15 | AC | 29 ms
7,424 KB |
testcase_16 | AC | 17 ms
5,888 KB |
testcase_17 | AC | 32 ms
7,808 KB |
testcase_18 | AC | 408 ms
10,436 KB |
testcase_19 | AC | 436 ms
10,984 KB |
testcase_20 | AC | 294 ms
10,704 KB |
testcase_21 | AC | 301 ms
10,972 KB |
testcase_22 | AC | 258 ms
10,552 KB |
testcase_23 | AC | 157 ms
10,996 KB |
testcase_24 | AC | 422 ms
10,952 KB |
testcase_25 | AC | 55 ms
10,496 KB |
testcase_26 | AC | 52 ms
10,240 KB |
testcase_27 | AC | 55 ms
10,752 KB |
testcase_28 | AC | 54 ms
10,368 KB |
testcase_29 | AC | 53 ms
10,368 KB |
testcase_30 | AC | 54 ms
8,348 KB |
testcase_31 | AC | 124 ms
8,944 KB |
testcase_32 | AC | 126 ms
8,820 KB |
testcase_33 | AC | 53 ms
11,108 KB |
testcase_34 | AC | 148 ms
11,080 KB |
testcase_35 | AC | 705 ms
10,992 KB |
ソースコード
#include <atcoder/all> using namespace atcoder; using mint = modint998244353; const long long MOD = 998244353; // using mint = modint1000000007; // const long long MOD = 1000000007; // using mint = modint;//mint::set_mod(MOD); #include <bits/stdc++.h> #define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++) #define repeq(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++) #define repreq(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); i--) #define endl '\n' // fflush(stdout); #define cYes cout << "Yes" << endl #define cNo cout << "No" << endl #define sortr(v) sort(v, greater<>()) #define pb push_back #define pob pop_back #define mp make_pair #define mt make_tuple #define FI first #define SE second #define ALL(v) (v).begin(), (v).end() #define INFLL 3000000000000000100LL #define INF 1000000100 #define PI acos(-1.0L) #define TAU (PI * 2.0L) using namespace std; typedef long long ll; typedef pair<ll, ll> Pll; typedef tuple<ll, ll, ll> Tlll; typedef vector<int> Vi; typedef vector<Vi> VVi; typedef vector<ll> Vl; typedef vector<Vl> VVl; typedef vector<VVl> VVVl; typedef vector<Tlll> VTlll; typedef vector<mint> Vm; typedef vector<Vm> VVm; typedef vector<string> Vs; typedef vector<double> Vd; typedef vector<char> Vc; typedef vector<bool> Vb; typedef vector<Pll> VPll; typedef priority_queue<ll> PQl; typedef priority_queue<ll, vector<ll>, greater<ll>> PQlr; /* inout */ ostream &operator<<(ostream &os, mint const &m) { os << m.val(); return os; } istream &operator>>(istream &is, mint &m) { long long n; is >> n, m = n; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int n = v.size(); rep(i, 0, n) { os << v[i] << " \n"[i == n - 1]; } return os; } template <typename T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) { int n = v.size(); rep(i, 0, n) os << v[i]; return os; } template <typename T, typename S> ostream &operator<<(ostream &os, pair<T, S> const &p) { os << p.first << ' ' << p.second; return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ':' << val << '\n'; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n'); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n'); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front(); q.pop(); os << " \n"[q.empty()]; } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st) { vector<T> v; while (st.size()) { v.push_back(st.top()); st.pop(); } reverse(ALL(v)); os << v; return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { vector<T> v; while (pq.size()) { v.push_back(pq.top()); pq.pop(); } os << v; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } /* useful */ template <typename T> int SMALLER(vector<T> &a, T x) { return lower_bound(a.begin(), a.end(), x) - a.begin(); } template <typename T> int orSMALLER(vector<T> &a, T x) { return upper_bound(a.begin(), a.end(), x) - a.begin(); } template <typename T> int BIGGER(vector<T> &a, T x) { return a.size() - orSMALLER(a, x); } template <typename T> int orBIGGER(vector<T> &a, T x) { return a.size() - SMALLER(a, x); } template <typename T> int COUNT(vector<T> &a, T x) { return upper_bound(ALL(a), x) - lower_bound(ALL(a), x); } template <typename T, typename S> bool chmax(T &a, S b) { if (a < b) { a = b; return 1; } return 0; } template <typename T, typename S> bool chmin(T &a, S b) { if (a > b) { a = b; return 1; } return 0; } template <typename T> void press(T &v) { v.erase(unique(ALL(v)), v.end()); } template <typename T> vector<int> zip(vector<T> b) { pair<T, int> p[b.size() + 10]; int a = b.size(); vector<int> l(a); for (int i = 0; i < a; i++) p[i] = mp(b[i], i); sort(p, p + a); int w = 0; for (int i = 0; i < a; i++) { if (i && p[i].first != p[i - 1].first) w++; l[p[i].second] = w; } return l; } template <typename T> vector<T> vis(vector<T> &v) { vector<T> S(v.size() + 1); rep(i, 1, S.size()) S[i] += v[i - 1] + S[i - 1]; return S; } ll dem(ll a, ll b) { return ((a + b - 1) / (b)); } ll dtoll(double d, int g) { return round(d * pow(10, g)); } string tobin(ll n, ll d) { string ret; rep(i, 0, d) { ret += (n % 2) ? '1' : '0'; n /= 2; } reverse(ALL(ret)); return ret; } const double EPS = 1e-10; void init() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(12); } // do {} while (next_permutation(ALL(vec))); /********************************** START **********************************/ void sol(); int main() { init(); int q = 1; // cin >> q; while (q--) sol(); return 0; } /********************************** SOLVE **********************************/ void sol() { ll n, p; cin >> n >> p; ll pp = p; Vl a(n); cin >> a; ll ans = 0; while (pp <= 1000000010LL) { Vl b(n); rep(i, 0, n) b[i] = a[i] % pp; map<ll, ll> ma; rep(i, 0, n) ma[b[i]]++; for (auto p : ma) { ans += p.SE * (p.SE - 1) / 2; } pp *= p; } cout << ans << endl; }