結果
問題 | No.2262 Fractions |
ユーザー | milanis48663220 |
提出日時 | 2023-04-07 23:15:02 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,300 bytes |
コンパイル時間 | 1,538 ms |
コンパイル使用メモリ | 133,584 KB |
実行使用メモリ | 38,940 KB |
最終ジャッジ日時 | 2024-10-02 20:28:03 |
合計ジャッジ時間 | 70,408 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,436 ms
29,492 KB |
testcase_01 | AC | 375 ms
29,148 KB |
testcase_02 | AC | 367 ms
29,032 KB |
testcase_03 | AC | 393 ms
29,040 KB |
testcase_04 | AC | 394 ms
29,016 KB |
testcase_05 | AC | 377 ms
29,140 KB |
testcase_06 | AC | 397 ms
29,144 KB |
testcase_07 | AC | 391 ms
29,140 KB |
testcase_08 | AC | 382 ms
29,032 KB |
testcase_09 | AC | 411 ms
29,148 KB |
testcase_10 | AC | 399 ms
29,012 KB |
testcase_11 | AC | 1,007 ms
29,292 KB |
testcase_12 | AC | 997 ms
29,292 KB |
testcase_13 | AC | 1,020 ms
29,292 KB |
testcase_14 | AC | 1,028 ms
29,292 KB |
testcase_15 | AC | 998 ms
29,288 KB |
testcase_16 | AC | 626 ms
29,088 KB |
testcase_17 | AC | 618 ms
29,144 KB |
testcase_18 | AC | 621 ms
29,016 KB |
testcase_19 | TLE | - |
testcase_20 | AC | 1,927 ms
33,136 KB |
testcase_21 | TLE | - |
testcase_22 | AC | 1,955 ms
34,800 KB |
testcase_23 | AC | 1,727 ms
30,956 KB |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | TLE | - |
testcase_29 | TLE | - |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | TLE | - |
testcase_35 | TLE | - |
testcase_36 | TLE | - |
testcase_37 | AC | 289 ms
29,016 KB |
testcase_38 | AC | 290 ms
28,912 KB |
testcase_39 | TLE | - |
testcase_40 | TLE | - |
testcase_41 | TLE | - |
testcase_42 | TLE | - |
testcase_43 | TLE | - |
testcase_44 | TLE | - |
testcase_45 | TLE | - |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <deque> #include <set> #include <map> #include <tuple> #include <cmath> #include <numeric> #include <functional> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template<typename T> vector<vector<T>> vec2d(int n, int m, T v){ return vector<vector<T>>(n, vector<T>(m, v)); } template<typename T> vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){ return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v))); } template<typename T> void print_vector(vector<T> v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } /** * 有理数の計算用。dが分母でnが分子。 * atcoderだとたいていmodintで足りるが、Project Eulerだとたまに使える。 */ template <typename T> class frac{ public: T n, d; frac(T _n, T _d){ T g = gcd(_n, _d); n = _n/g; d = _d/g; if(d < 0) { d *= -1; n *= -1; } } frac operator+(frac f){ return frac(n*f.d+d*f.n, f.d*d); } frac operator-(frac f){ return frac(n*f.d-d*f.n, f.d*d); } frac operator*(frac f){ return frac(f.n*n, f.d*d); } frac inv(){ return frac(d, n); } bool operator<(frac f){ if(d*f.d < 0) return n*f.d-d*f.n > 0; else return n*f.d-d*f.n < 0; } bool operator>(frac f){ if(d*f.d < 0) return n*f.d-d*f.n < 0; else return n*f.d-d*f.n > 0; } bool operator==(frac f){ return n*f.d-d*f.n == 0; } void operator+=(frac f){ n = n*f.d+d*f.n, d = f.d*d; reduction(); } void operator-=(frac f){ n = n*f.d-d*f.n, d = f.d*d; reduction(); } void reduction(){ T g = gcd(n, d); n /= g, d /= g; } }; template <typename T> bool operator<(const frac<T> f1, const frac<T> f2){ if(f1.d*f2.d < 0) return f1.n*f2.d-f1.d*f2.n > 0; else return f1.n*f2.d-f1.d*f2.n < 0; } template <typename T> bool operator>(const frac<T> f1, const frac<T> f2){ if(f1.d*f2.d < 0) return f1.n*f2.d-f1.d*f2.n > 0; else return f1.n*f2.d-f1.d*f2.n > 0; } template <typename T> bool operator==(const frac<T> f1, const frac<T> f2){ return f1.n*f2.d-f1.d*f2.n == 0; } template <typename T> ostream& operator<<(ostream& os, const frac<T>& f){ os << f.n << '/' << f.d; return os; } class Eratosthenes{ public: int m; vector<bool> is_prime; vector<int> primes; Eratosthenes(int m_){ m = m_; init(); } private: void init(){ is_prime.assign(m+1, true); is_prime[0] = false, is_prime[1] = false; for(int i = 2; i <= m; i++){ if(is_prime[i]){ primes.push_back(i); for(int j = 2; i*j <= m; j++) is_prime[i*j] = false; } } } }; const int N = 300000; Eratosthenes et(N); vector<int> facs[N+1]; int meb[N+1]; void init(){ for(int x = 1; x <= N; x++) meb[x] = 1; for(int p: et.primes){ for(int i = 1; i*p <= N; i++){ if(i%p == 0){ meb[i*p] = 0; }else{ meb[i*p] *= -1; } } } for(int x = 1; x <= N; x++){ if(meb[x] == 0) continue; for(int i = 1; i*x <= N; i++){ facs[i*x].push_back(x); } } } using F = frac<ll>; const int M = 1000000000; void solve(){ ll n; ll k; cin >> n >> k; ll sum = 0; // x/n以下になるやつの個数 auto count = [&](ll x){ ll ans = 0; for(int i = 1; i <= n; i++){ ll tmp = 0; for(int j: facs[i]){ ll r = min((x*i)/n, n); tmp += (ll)meb[j]*(r/j); } ans += tmp; } return ans; }; if(count(n*n) < k){ cout << -1 << endl; return; } ll l = 0, r = n*n; while(r-l > 1){ ll x = (l+r)/2; if(count(x) < k) l = x; else r = x; } ll cnt_r = count(r); vector<F> fs; for(int x = 1; x <= n; x++){ // (l/n) < y/x <= (r/n) ll yl = (l*x)/n; if(yl > n) continue; ll yr = (r*x)/n; chmin(yr, n); for(ll y = yl; y <= yr; y++){ if(gcd(x, y) != 1) continue; fs.push_back(F(y, x)); if(x == 407 && y == 2023){ } } } sort(fs.begin(), fs.end()); ll cur = cnt_r; while(cur > k){ fs.pop_back(); cur--; } cout << fs.back() << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; init(); int t; cin >> t; while(t--) solve(); }