結果
問題 | No.2207 pCr検査 |
ユーザー |
![]() |
提出日時 | 2023-02-03 22:39:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,805 ms / 3,000 ms |
コード長 | 2,439 bytes |
コンパイル時間 | 2,081 ms |
コンパイル使用メモリ | 219,584 KB |
最終ジャッジ日時 | 2025-02-10 09:39:56 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
コンパイルメッセージ
main.cpp: In function ‘std::pair<std::vector<int>, std::vector<int> > {anonymous}::primes_lpf(int)’: main.cpp:32:48: warning: result of ‘2^4’ is 6; did you mean ‘1 << 4’ (16)? [-Wxor-used-as-pow] 32 | for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) { | ^ | - | 1 << main.cpp:32:46: note: you can silence this warning by using a hexadecimal constant (0x2 rather than 2) 32 | for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) { | ^ | 0x2 main.cpp:46:47: warning: result of ‘2^4’ is 6; did you mean ‘1 << 4’ (16)? [-Wxor-used-as-pow] 46 | for (; x <= n; x += add_next, add_next ^= 2 ^ 4) { | ^ | - | 1 << main.cpp:46:45: note: you can silence this warning by using a hexadecimal constant (0x2 rather than 2) 46 | for (; x <= n; x += add_next, add_next ^= 2 ^ 4) { | ^ | 0x2
ソースコード
#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;}int cnt[10000010];} int main() {ios::sync_with_stdio(false);cin.tie(0);int k;cin >> k;int p;rep(i, k) {int e;cin >> p >> e;cnt[p] = e;}for(int r = 1; r < p; r++) {for(auto [p, c]: factorize(p + 1 - r)) {k += cnt[p] == 0;cnt[p] -= c;k -= cnt[p] == 0;}for(auto [p, c]: factorize(r)) {k += cnt[p] == 0;cnt[p] += c;k -= cnt[p] == 0;}if (k == 0) {cout << p << ' ' << r << '\n';return 0;}}cout << -1 << ' ' << -1 << '\n';}