結果
問題 | No.2718 Best Consonance |
ユーザー | 👑 amentorimaru |
提出日時 | 2024-04-05 23:19:08 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,790 bytes |
コンパイル時間 | 4,623 ms |
コンパイル使用メモリ | 244,768 KB |
実行使用メモリ | 44,156 KB |
最終ジャッジ日時 | 2024-10-01 03:36:19 |
合計ジャッジ時間 | 45,493 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 627 ms
36,168 KB |
testcase_01 | AC | 627 ms
36,216 KB |
testcase_02 | AC | 632 ms
36,116 KB |
testcase_03 | AC | 627 ms
36,124 KB |
testcase_04 | AC | 628 ms
36,208 KB |
testcase_05 | AC | 626 ms
36,120 KB |
testcase_06 | AC | 628 ms
36,176 KB |
testcase_07 | AC | 633 ms
36,212 KB |
testcase_08 | AC | 628 ms
36,168 KB |
testcase_09 | AC | 641 ms
36,196 KB |
testcase_10 | AC | 636 ms
36,312 KB |
testcase_11 | AC | 637 ms
36,216 KB |
testcase_12 | AC | 669 ms
36,292 KB |
testcase_13 | AC | 655 ms
36,260 KB |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | AC | 900 ms
42,300 KB |
testcase_17 | AC | 774 ms
40,992 KB |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | AC | 834 ms
43,248 KB |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | AC | 637 ms
36,044 KB |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | AC | 1,080 ms
44,048 KB |
testcase_39 | AC | 629 ms
36,056 KB |
ソースコード
#define ATCODER #define _USE_MATH_DEFINES #include<stdio.h> #include<iostream> #include<fstream> #include<algorithm> #include<vector> #include<string> #include <cassert> #include <numeric> #include <unordered_map> #include <unordered_set> #include <queue> #include <math.h> #include <climits> #include <set> #include <map> #include <list> #include <random> #include <iterator> #include <bitset> #include <chrono> #include <type_traits> using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; //template<claLR T> using pq = priority_queue<T, vector<T>, greater<T>>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++) #define VV(type) vector< vector<type> > #define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m) #define vec(type) vector<type> #define VEC(type,n,val) vector<type> val;val.resize(n) #define VL vector<ll> #define VVL vector< vector<ll> > #define VP vector< pair<ll,ll> > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<<i) #define BITSET(x,i) x | (ll(1)<<i) #define BITCUT(x,i) x & ~(ll(1)<<i) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define ALLBIT(n) (ll(1)<<n-1) #define CHMAX(n,v) n=n<v?v:n #define CHMIN(n,v) n=n>v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include <atcoder/all> using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template<typename T = ll> vector<T> read(size_t n) { vector<T> ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template<typename TV, const ll N> void read_tuple_impl(TV&) {} template<typename TV, const ll N, typename Head, typename... Tail> void read_tuple_impl(TV& ts) { get<N>(ts).emplace_back(*(istream_iterator<Head>(cin))); read_tuple_impl<TV, N + 1, Tail...>(ts); } template<typename... Ts> decltype(auto) read_tuple(size_t n) { tuple<vector<Ts>...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return max(a, b); } val e() { return -1e18; } //val mp(func f, val a) { // return MP(a.first + f, a.second); //} //func comp(func f, func g) { // return f + g; //} //func id() { return 0; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n; cin >> n; auto [a, b] = read_tuple<ll, ll>(n); vector<tuple<ll, ll, ll>> mab(n); REP(i, n) { mab[i] = make_tuple(a[i] * b[i], a[i], b[i]); } SORT(mab); vector<ll> c(200000, 1e18); VVL y(200001); FOR(i, 1, 200001) { for (ll v = 1; v * v <= i; v++) { if (i % v)continue; y[i].push_back(v); if (i != v * v) { y[i].push_back(i / v); } } } ll ans = 0; vector<bool> use(200001); PER(i, n) { auto [m, aa, bb] = mab[i]; for (auto& v : y[aa]) { CHMAX(ans, bb / c[v]); } if (!use[aa]) { for (auto& v : y[aa]) { CHMIN(c[v], aa / v); } use[aa] = true; } } cout << ans; return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }