結果
問題 | No.1409 Simple Math in yukicoder |
ユーザー | minato |
提出日時 | 2021-02-26 23:10:57 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,936 ms / 2,000 ms |
コード長 | 7,469 bytes |
コンパイル時間 | 5,401 ms |
コンパイル使用メモリ | 303,712 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-04-27 03:39:59 |
合計ジャッジ時間 | 78,972 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 3 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 95 ms
6,944 KB |
testcase_08 | AC | 333 ms
6,944 KB |
testcase_09 | AC | 87 ms
6,940 KB |
testcase_10 | AC | 263 ms
6,944 KB |
testcase_11 | AC | 330 ms
6,944 KB |
testcase_12 | AC | 277 ms
6,944 KB |
testcase_13 | AC | 103 ms
6,940 KB |
testcase_14 | AC | 78 ms
6,944 KB |
testcase_15 | AC | 119 ms
6,940 KB |
testcase_16 | AC | 122 ms
6,944 KB |
testcase_17 | AC | 430 ms
6,944 KB |
testcase_18 | AC | 212 ms
6,940 KB |
testcase_19 | AC | 237 ms
6,940 KB |
testcase_20 | AC | 183 ms
6,940 KB |
testcase_21 | AC | 147 ms
6,944 KB |
testcase_22 | AC | 275 ms
6,940 KB |
testcase_23 | AC | 59 ms
6,940 KB |
testcase_24 | AC | 49 ms
6,940 KB |
testcase_25 | AC | 267 ms
6,948 KB |
testcase_26 | AC | 291 ms
6,940 KB |
testcase_27 | AC | 494 ms
6,944 KB |
testcase_28 | AC | 471 ms
6,944 KB |
testcase_29 | AC | 478 ms
6,948 KB |
testcase_30 | AC | 502 ms
6,940 KB |
testcase_31 | AC | 490 ms
6,940 KB |
testcase_32 | AC | 459 ms
6,944 KB |
testcase_33 | AC | 474 ms
6,940 KB |
testcase_34 | AC | 463 ms
6,940 KB |
testcase_35 | AC | 474 ms
6,944 KB |
testcase_36 | AC | 492 ms
6,940 KB |
testcase_37 | AC | 1,829 ms
6,940 KB |
testcase_38 | AC | 1,864 ms
6,944 KB |
testcase_39 | AC | 1,835 ms
6,944 KB |
testcase_40 | AC | 1,834 ms
6,944 KB |
testcase_41 | AC | 1,868 ms
6,940 KB |
testcase_42 | AC | 1,819 ms
6,944 KB |
testcase_43 | AC | 1,821 ms
6,944 KB |
testcase_44 | AC | 1,844 ms
6,944 KB |
testcase_45 | AC | 1,827 ms
6,940 KB |
testcase_46 | AC | 1,822 ms
6,940 KB |
testcase_47 | AC | 1,831 ms
6,944 KB |
testcase_48 | AC | 1,848 ms
6,940 KB |
testcase_49 | AC | 1,846 ms
6,940 KB |
testcase_50 | AC | 1,836 ms
6,944 KB |
testcase_51 | AC | 1,887 ms
6,940 KB |
testcase_52 | AC | 1,835 ms
6,944 KB |
testcase_53 | AC | 1,882 ms
6,940 KB |
testcase_54 | AC | 1,886 ms
6,940 KB |
testcase_55 | AC | 1,855 ms
6,944 KB |
testcase_56 | AC | 1,844 ms
6,940 KB |
testcase_57 | AC | 1,928 ms
6,948 KB |
testcase_58 | AC | 1,918 ms
6,944 KB |
testcase_59 | AC | 1,936 ms
6,940 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<long long, long long>; template <class T> using vec = vector<T>; template <class T> using vvec = vector<vector<T>>; #define rep(i, n) for (int i = 0; i < (n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) constexpr char ln = '\n'; template <class Container> inline int SZ(const Container& v) { return int(v.size()); } template <class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); } inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); } inline int popcount(ull x) { return __builtin_popcountll(x); } inline int kthbit(ull x, int k) { return (x >> k) & 1; } inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; } const string YESNO[2] = {"NO", "YES"}; const string YesNo[2] = {"No", "Yes"}; inline void YES(bool t = true) { cout << YESNO[t] << "\n"; } inline void Yes(bool t = true) { cout << YesNo[t] << "\n"; } template <class T> inline void drop(T x) { cout << x << "\n"; exit(0); } inline void print() { cout << "\n"; } template <class T> inline void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); } template <class T, class... Args> inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); } #ifdef MINATO_LOCAL template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; } template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; } template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); } template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; } string debug_delim(int& i) { return i++ == 0 ? "" : ", "; } #define debug_embrace(x) { int i = 0; os << "{"; { x } return os << "}"; } template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) } template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) } template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) } template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) } template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } void debug_out() { cerr << endl; } template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); } #define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__) #else #define debug(...) (void(0)) #endif struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_; /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include <atcoder/all> using namespace atcoder; // //using mint = modint998244353; // //using mint = modint1000000007; // //using mint = modint; // // istream& operator>>(istream& is, modint998244353& M) { long long x; is >> x; M = x; return is; } // ostream& operator<<(ostream& os, const modint998244353& M) { return os << M.val(); } // istream& operator>>(istream& is, modint1000000007& M) { long long x; is >> x; M = x; return is; } // ostream& operator<<(ostream& os, const modint1000000007& M) { return os << M.val(); } // template <int m> istream& operator>>(istream& is, static_modint<m>& M) { long long x; is >> x; M = x; return is; } // template <int m> ostream& operator<<(ostream& os, const static_modint<m>& M) { return os << M.val(); } // istream& operator>>(istream& is, modint& M) { long long x; is >> x; M = x; return is; } // ostream& operator<<(ostream& os, const modint& M) { return os << M.val(); } // // //vector<mint> multiply(vector<mint> a, vector<mint> b) { return convolution(a,b); } //O(NloglogN) struct PrimeFactorTable { public: PrimeFactorTable() {} PrimeFactorTable(int n) : n_(n), table(n + 1) { iota(table.begin(), table.end(), 0); for (int i = 2; i * i <= n; i++) { if (table[i] == i) { for (int j = i * i; j <= n; j += i) { if (table[j] == j) table[j] = i; } } } } int operator[](int x) const { return table[x]; } vector<pair<int, int>> prime_factor(int x) const { assert(1 <= x and x <= n_); vector<pair<int, int>> ret; while (x != 1) { if (ret.empty() or ret.back().first != table[x]) { ret.emplace_back(table[x], 1); } else { ret.back().second++; } x /= table[x]; } return ret; } private: int n_; vector<int> table; }; PrimeFactorTable PFT; void solve() { int x,v; cin >> v >> x; const int P = x * v + 1; vec<ll> table(P); vec<int> ans; ans.reserve(x); for (int i = 1; i < P; i++) { if (SZ(ans) >= x) break; if (PFT[i]==i) { table[i] = pow_mod(i,x,P); } else{ int u = PFT[i]; int v = i / u; table[i] = table[u] * table[v] % P; } if (table[i]==1) ans.emplace_back(i); } print(ans); } void naive() { int x,v; cin >> v >> x; for (int i = 1; i <= x*v; i++) { debug(i,pow_mod(i,x,x*v+1)); } } int main() { PFT = PrimeFactorTable(100000); //naive(); int Q; cin >> Q; for (int q = 0; q < Q; q++) { solve(); } }