結果
問題 | No.2207 pCr検査 |
ユーザー | Kude |
提出日時 | 2023-02-03 22:31:24 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,666 ms / 3,000 ms |
コード長 | 4,055 bytes |
コンパイル時間 | 2,789 ms |
コンパイル使用メモリ | 229,676 KB |
実行使用メモリ | 123,944 KB |
最終ジャッジ日時 | 2023-09-15 18:38:37 |
合計ジャッジ時間 | 45,829 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 350 ms
123,028 KB |
testcase_01 | AC | 349 ms
122,600 KB |
testcase_02 | AC | 780 ms
122,800 KB |
testcase_03 | AC | 693 ms
122,708 KB |
testcase_04 | AC | 632 ms
123,124 KB |
testcase_05 | AC | 1,124 ms
122,832 KB |
testcase_06 | AC | 445 ms
122,832 KB |
testcase_07 | AC | 517 ms
122,668 KB |
testcase_08 | AC | 514 ms
123,944 KB |
testcase_09 | AC | 909 ms
122,760 KB |
testcase_10 | AC | 358 ms
122,860 KB |
testcase_11 | AC | 832 ms
122,804 KB |
testcase_12 | AC | 2,140 ms
123,164 KB |
testcase_13 | AC | 1,372 ms
123,204 KB |
testcase_14 | AC | 582 ms
123,428 KB |
testcase_15 | AC | 2,444 ms
123,264 KB |
testcase_16 | AC | 1,254 ms
123,172 KB |
testcase_17 | AC | 2,001 ms
123,492 KB |
testcase_18 | AC | 1,612 ms
122,776 KB |
testcase_19 | AC | 956 ms
122,968 KB |
testcase_20 | AC | 1,354 ms
123,032 KB |
testcase_21 | AC | 2,533 ms
122,848 KB |
testcase_22 | AC | 2,592 ms
123,268 KB |
testcase_23 | AC | 2,666 ms
123,060 KB |
testcase_24 | AC | 642 ms
122,760 KB |
testcase_25 | AC | 1,271 ms
123,368 KB |
testcase_26 | AC | 1,128 ms
123,336 KB |
testcase_27 | AC | 1,978 ms
123,464 KB |
testcase_28 | AC | 1,626 ms
122,924 KB |
testcase_29 | AC | 1,509 ms
122,736 KB |
testcase_30 | AC | 1,535 ms
123,224 KB |
testcase_31 | AC | 1,482 ms
123,596 KB |
ソースコード
#include<bits/stdc++.h> namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include<atcoder/all> #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair<int,int>; using VI = vector<int>; using VVI = vector<VI>; using VL = vector<ll>; using VVL = vector<VL>; pair<vector<int>, vector<int>> primes_lpf(const int n) { vector<int> primes; primes.reserve(n / 10); vector<int> lpf(n + 1); for (int i = 2; i <= n; i += 2) lpf[i] = 2; for (int i = 3; i <= n; i += 6) lpf[i] = 3; if (2 <= n) primes.push_back(2); if (3 <= n) primes.push_back(3); // 5 * x <= n, x <= floor(n / 5) const int n5 = n / 5; int x = 5; char add_next = 2; for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) { int px = lpf[x]; if (px == 0) { lpf[x] = px = x; primes.push_back(x); } for (int i = 2;; ++i) { int q = primes[i]; int y = q * x; if (y > n) break; lpf[y] = q; if (q == px) break; } } for (; x <= n; x += add_next, add_next ^= 2 ^ 4) { if (lpf[x] == 0) { lpf[x] = x; primes.push_back(x); } } return {move(primes), move(lpf)}; } constexpr int PSIZE = 10000010; auto [primes, lpf] = primes_lpf(PSIZE); vector<pair<int, int>>& factorize(int x) { static vector<pair<int, int>> fs; fs.clear(); while (x != 1) { int p = lpf[x], c = 0; do {x /= p; c++;} while (x % p == 0); fs.emplace_back(p, c); } return fs; } class mint61 { using ull = unsigned long long; using ui128 = __uint128_t; public: static constexpr unsigned long long mod = (1ULL << 61) - 1; ull v = 0; explicit constexpr mint61() {} explicit constexpr mint61(ull x) { v = (x >> 61) + (x & mod); if (v >= mod) v -= mod; } static constexpr mint61 raw(ull x) { mint61 res; res.v = x; return res; } friend constexpr mint61 operator+(mint61 lhs, mint61 rhs) { auto res = lhs.v + rhs.v; return raw(res < mod ? res : res - mod); } friend constexpr mint61 operator-(mint61 lhs, mint61 rhs) { return raw(lhs.v >= rhs.v ? lhs.v - rhs.v : mod + lhs.v - rhs.v); } static constexpr ull multiply_loose_mod(mint61 lhs, mint61 rhs) { // ab = q(m+1)+r = qm+q+r // q+r = ab-qm = ab-floor(ab/(m+1))m < ab-(ab/(m+1)-1)m = ab/(m+1)+m <= (m-1)^2/(m+1)+m = 2m-1-2/(m+1) auto mul = ui128(lhs.v) * rhs.v; return ull(mul >> 61) + ull(mul & mod); } friend constexpr mint61 operator*(mint61 lhs, mint61 rhs) { auto res = multiply_loose_mod(lhs, rhs); return raw(res < mod ? res : res - mod); } mint61& operator+=(mint61 rhs) { return *this = *this + rhs; } mint61& operator-=(mint61 rhs) { return *this = *this - rhs; } mint61& operator*=(mint61 rhs) { return *this = *this * rhs; } friend ostream& operator<<(ostream& os, mint61 x) { return os << x.v; } }; mint61 hsh[10000010]; } int main() { ios::sync_with_stdio(false); static auto RNG = std::mt19937(std::chrono::system_clock::now().time_since_epoch().count()); static auto Distribution = std::uniform_int_distribution<unsigned long long>(2, mint61::mod - 1); cin.tie(0); rep(i, 10000010) hsh[i] = mint61::raw(Distribution(RNG)); mint61 now, tgt; int k; cin >> k; int p; rep(i, k) { int e; cin >> p >> e; tgt += hsh[p] * mint61::raw(e); } for(int r = 1; r < p; r++) { for(auto [p, c]: factorize(p + 1 - r)) { rrep(_, c) now += hsh[p]; } for(auto [p, c]: factorize(r)) { rrep(_, c) now -= hsh[p]; } if (now.v == tgt.v) { cout << p << ' ' << r << '\n'; return 0; } } cout << -1 << ' ' << -1 << '\n'; }