結果
問題 | No.2718 Best Consonance |
ユーザー | woodywoody |
提出日時 | 2024-04-06 04:00:03 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 669 ms / 4,000 ms |
コード長 | 7,579 bytes |
コンパイル時間 | 4,132 ms |
コンパイル使用メモリ | 244,372 KB |
実行使用メモリ | 52,748 KB |
最終ジャッジ日時 | 2024-10-02 12:56:09 |
合計ジャッジ時間 | 18,922 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 231 ms
46,340 KB |
testcase_01 | AC | 212 ms
46,468 KB |
testcase_02 | AC | 216 ms
46,340 KB |
testcase_03 | AC | 225 ms
46,336 KB |
testcase_04 | AC | 218 ms
46,340 KB |
testcase_05 | AC | 232 ms
46,340 KB |
testcase_06 | AC | 224 ms
46,464 KB |
testcase_07 | AC | 273 ms
46,336 KB |
testcase_08 | AC | 269 ms
46,336 KB |
testcase_09 | AC | 264 ms
46,344 KB |
testcase_10 | AC | 259 ms
46,472 KB |
testcase_11 | AC | 266 ms
46,472 KB |
testcase_12 | AC | 275 ms
46,340 KB |
testcase_13 | AC | 278 ms
46,340 KB |
testcase_14 | AC | 401 ms
52,360 KB |
testcase_15 | AC | 312 ms
50,820 KB |
testcase_16 | AC | 328 ms
51,268 KB |
testcase_17 | AC | 312 ms
50,180 KB |
testcase_18 | AC | 385 ms
51,720 KB |
testcase_19 | AC | 371 ms
50,696 KB |
testcase_20 | AC | 355 ms
52,228 KB |
testcase_21 | AC | 365 ms
51,964 KB |
testcase_22 | AC | 368 ms
52,240 KB |
testcase_23 | AC | 330 ms
49,800 KB |
testcase_24 | AC | 365 ms
52,552 KB |
testcase_25 | AC | 390 ms
52,588 KB |
testcase_26 | AC | 384 ms
52,520 KB |
testcase_27 | AC | 402 ms
52,528 KB |
testcase_28 | AC | 397 ms
52,540 KB |
testcase_29 | AC | 371 ms
52,612 KB |
testcase_30 | AC | 398 ms
52,552 KB |
testcase_31 | AC | 424 ms
52,576 KB |
testcase_32 | AC | 370 ms
52,724 KB |
testcase_33 | AC | 380 ms
52,748 KB |
testcase_34 | AC | 234 ms
46,340 KB |
testcase_35 | AC | 279 ms
46,340 KB |
testcase_36 | AC | 422 ms
52,568 KB |
testcase_37 | AC | 255 ms
46,464 KB |
testcase_38 | AC | 669 ms
52,528 KB |
testcase_39 | AC | 249 ms
46,468 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,b) for(int i=0;i<b;i++) #define rrep(i,b) for(int i=b-1;i>=0;i--) #define rep1(i,b) for(int i=1;i<b;i++) #define repx(i,x,b) for(int i=x;i<b;i++) #define rrepx(i,x,b) for(int i=b-1;i>=x;i--) #define fore(i,a) for(auto& i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ull = long long; using ld = long double; template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>; template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}} #define retval(x) {cout << #x << endl; return;} #define cout2(x,y) cout << x << " " << y << endl; #define coutp(p) cout << p.fi << " " << p.se << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outdv fore(yans , ans) cout << yans.val() << "\n"; #define assertmle(x) if (!(x)) {vi v(3e8);} #define asserttle(x) if (!(x)) {while(1){}} #define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define coutv2(v) fore(vy , v) cout << vy << "\n"; #define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define coutvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>; using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>; using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>; using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>; using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>; using mint = modint998244353; //using mint = modint1000000007; //using mint = dynamic_modint<0>; using vm = vector<mint>; using vvm = vector<vector<mint>>; vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<<endl;} #define no {cout <<"No"<<endl;} const double eps = 1e-10; const ll LINF = 2001002003004005006ll; const int INF = 1001001001; #ifdef MY_LOCAL_DEBUG #include "./debug/localDebug.cpp" #define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl #define show1(a) cerr<<#a<<" = "<<a<<endl #define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl #define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl #define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl #define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl #define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl #define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;} #define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";} #define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";} #define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}} #define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}} #else #define showp(p) #define show1(a) #define show2(a,b) #define show3(a,b,c) #define show4(a,b,c,d) #define show5(a,b,c,d,e) #define DEBUG_LINE #define showv(v) #define showv2(v) #define showvm(v) #define showvm2(v) #define showmat(v) #define showmatm(v) #endif #define overload5(a,b,c,d,e,f, ...) f #define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__) namespace math{ vvi div,mul; void div_init(int n){ div.resize(n+1); mul.resize(n+1); for(int i = 1;i <= n;i++){ for(int j = i;j <= n;j+=i){ div[j].pb(i); mul[i].pb(j); } } return; } vl divisor(ll x){ vl res; for(ll i=1;i*i<=x;i++){ if (x%i != 0) continue; res.pb(i); if (i*i != x) res.pb(x/i); } sort(rng(res)); return res; } ll floorsqrt(ll x) { ll l = 0, r = ll(2e9)+1; while (l+1<r) { ll c = (l+r)/2; if (c*c <= x) l = c; else r = c; } return l; } ll floorlog(int a,ll x){ ll tmp=1; ll ret=0; while(tmp <= x){ if (tmp >= LLONG_MAX/a) break; tmp *= a; ret++; } ret--; return ret; } ll pow(ll x , int a){ assert(x > 0); assert(a >= 0); ll ret = 1; rep(_,a){ assert (ret < LLONG_MAX/x); ret *= x; } return ret; } ll base(ll x,int a){ ll ans=0,y; for (ll i=0;x>0;i++){ y = x/a; ans += (x - y*a)*pow(10,i); x = y; } return ans; } string baseS(ll x,int a){ string ans; ll y; for (ll i=0;x>0;i++){ y = x/a; ans += '0' + (x - y*a); x = y; } reverse(rng(ans)); return ans; } template<typename T> ll inv(vector<T>& v){ int n = sz(v); map<T,int> mp; fore(y,v) mp[y] = 0; int m = 0; fore(y,mp) y.se = m++; fenwick_tree<T> fw(m); ll ret = 0; rep(i,n){ int k = mp[v[i]]; ret += fw.sum(k+1,m); fw.add(k,1); } return ret; } } // namespace math // .div.mul : div[i]、mul[i]はそれぞれiの約数、倍数を格納している。 // .div_init(n) : div,mulを初期化。引数はnまで。n < 3e5程 // .divisor(x) : xの約数列挙。xは64bit整数。 // .floorsqrt(x) : floor(sqrt(x))。xは64bit整数。誤差は発生しない。 // .floorlog(a , x) : floor(loga(x))。xは64bit整数。誤差は発生しない。 // .pow(x , a) : x^a。誤差は発生しない。 // .base(x , a) : x(10進数)をa進数表記に。1 <= a <= 10。戻り値はll型。 // .baseS(x , a) : x(10進数)をa進数表記に。1 <= a <= 10。戻り値はstring型。 // .inv(v) : vの転倒数。 void solve(){ int n; cin>>n; math::div_init(2e5); vl a(n); vl b(n); rep(i,n) cin>>a[i]>>b[i]; vpli v(n); rep(i,n) v[i] = {a[i]*b[i], i}; sort(rrng(v)); vl mn((int)2e5+1,LINF); ll ans = 0; rep(i,n){ int id = v[i].se; fore(k, math::div[a[id]]){ ll tmp = (b[id]*k/mn[k]); chmax(ans, tmp); chmin(mn[k], a[id]); } } out; return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin>>t; rep(i,t){ solve(); } return 0; }