結果
問題 | No.2709 1975 Powers |
ユーザー | coindarw |
提出日時 | 2024-03-31 14:29:36 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,087 ms / 2,000 ms |
コード長 | 5,673 bytes |
コンパイル時間 | 5,911 ms |
コンパイル使用メモリ | 312,192 KB |
実行使用メモリ | 42,504 KB |
最終ジャッジ日時 | 2024-09-30 19:37:16 |
合計ジャッジ時間 | 23,221 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 158 ms
42,360 KB |
testcase_01 | AC | 158 ms
42,364 KB |
testcase_02 | AC | 425 ms
42,504 KB |
testcase_03 | AC | 641 ms
42,496 KB |
testcase_04 | AC | 939 ms
42,372 KB |
testcase_05 | AC | 794 ms
42,500 KB |
testcase_06 | AC | 396 ms
42,372 KB |
testcase_07 | AC | 238 ms
42,372 KB |
testcase_08 | AC | 739 ms
42,372 KB |
testcase_09 | AC | 852 ms
42,372 KB |
testcase_10 | AC | 245 ms
42,492 KB |
testcase_11 | AC | 308 ms
42,500 KB |
testcase_12 | AC | 616 ms
42,372 KB |
testcase_13 | AC | 1,002 ms
42,368 KB |
testcase_14 | AC | 440 ms
42,500 KB |
testcase_15 | AC | 712 ms
42,372 KB |
testcase_16 | AC | 550 ms
42,372 KB |
testcase_17 | AC | 265 ms
42,368 KB |
testcase_18 | AC | 648 ms
42,372 KB |
testcase_19 | AC | 875 ms
42,368 KB |
testcase_20 | AC | 412 ms
42,372 KB |
testcase_21 | AC | 735 ms
42,376 KB |
testcase_22 | AC | 1,087 ms
42,376 KB |
testcase_23 | AC | 918 ms
42,376 KB |
testcase_24 | AC | 643 ms
42,368 KB |
testcase_25 | AC | 884 ms
42,372 KB |
testcase_26 | AC | 947 ms
42,500 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using ll = long long; using lll = __int128_t; #define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i) #define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i) #define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i) #define rreps(i, n) for (int i = ((int)(n)); i > 0; --i) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++) #define length(v) ((int)(v).size()) constexpr int inf = 2'000'000'000; constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353; #define all(v) begin(v), end(v) #define rall(v) rbegin(v), rend(v) using namespace std; using namespace atcoder; // clang-format off #define Vec(type, ...) __make_vec<type>(__VA_ARGS__) template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts> auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));} #define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__) template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);} template <class T, T init, class... Ts> auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));} template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;} inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); } template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); } template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {}; template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>; template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value; template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>; template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>; template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;} template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;} template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;} template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;} void inp() {} template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);} template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];} template <typename T>void oup(const T& a) {cout << a << "\n";} template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);} inline string YESNO(bool cond) { return cond ? "YES" : "NO"; }inline string yesno(bool cond) { return cond ? "yes" : "no"; }inline string YesNo(bool cond) { return cond ? "Yes" : "No"; } inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;} #ifdef ONLINE_JUDGE #define debug(...) #else #define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__) template <typename T>void debug_out(T t) {cerr << t << "\n";} template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);} #endif #ifdef ONLINE_JUDGE #define todo(...) static_assert(false) #else #define todo(...) #endif // clang-format on ll dp[2][5][100000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll n, p, q; inp(n, p, q); vector<int> a(n); vector<vector<int>> mod = vector<vector<int>>(4, vector<int>(2'000'000 + 1)); vector<int> B = {10, 9, 7, 5}; rep(i, 4) { mod[i][0] = 1; reps(j, 2'000'000) { mod[i][j] = (mod[i][j - 1] * B[i]) % p; } } inp(a); sort(all(a)); int cur = 0, nxt = 1; dp[cur][0][0] = 1; rep(i, n) { rep(j, 5) rep(k, p) { dp[nxt][j][k] += dp[cur][j][k]; if (j == 4) continue; int r = (k + mod[j][a[i]]) % p; dp[nxt][j + 1][r] += dp[cur][j][k]; } swap(cur, nxt); memset(dp[nxt], 0, sizeof(dp[nxt])); } oup(dp[cur][4][q]); return 0; }