結果
問題 | No.2500 Products in a Range |
ユーザー | asaringo |
提出日時 | 2023-10-13 23:19:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,656 bytes |
コンパイル時間 | 2,159 ms |
コンパイル使用メモリ | 207,436 KB |
実行使用メモリ | 4,476 KB |
最終ジャッジ日時 | 2023-10-13 23:19:59 |
合計ジャッジ時間 | 5,252 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,352 KB |
testcase_01 | AC | 1 ms
4,352 KB |
testcase_02 | AC | 2 ms
4,352 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,352 KB |
testcase_06 | AC | 1 ms
4,352 KB |
testcase_07 | AC | 14 ms
4,348 KB |
testcase_08 | AC | 58 ms
4,348 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 49 ms
4,352 KB |
testcase_11 | AC | 60 ms
4,352 KB |
testcase_12 | AC | 24 ms
4,348 KB |
testcase_13 | AC | 2 ms
4,356 KB |
testcase_14 | AC | 63 ms
4,348 KB |
testcase_15 | AC | 4 ms
4,348 KB |
testcase_16 | AC | 36 ms
4,352 KB |
testcase_17 | AC | 17 ms
4,352 KB |
testcase_18 | AC | 20 ms
4,352 KB |
testcase_19 | AC | 7 ms
4,352 KB |
testcase_20 | AC | 3 ms
4,352 KB |
testcase_21 | AC | 2 ms
4,348 KB |
testcase_22 | AC | 57 ms
4,352 KB |
testcase_23 | AC | 56 ms
4,352 KB |
testcase_24 | AC | 59 ms
4,348 KB |
testcase_25 | AC | 92 ms
4,352 KB |
testcase_26 | AC | 89 ms
4,352 KB |
testcase_27 | AC | 89 ms
4,348 KB |
testcase_28 | AC | 8 ms
4,348 KB |
testcase_29 | AC | 3 ms
4,348 KB |
testcase_30 | AC | 2 ms
4,348 KB |
testcase_31 | WA | - |
testcase_32 | AC | 2 ms
4,348 KB |
testcase_33 | AC | 20 ms
4,352 KB |
testcase_34 | AC | 50 ms
4,348 KB |
testcase_35 | AC | 2 ms
4,348 KB |
testcase_36 | AC | 2 ms
4,348 KB |
testcase_37 | AC | 2 ms
4,348 KB |
testcase_38 | AC | 1 ms
4,352 KB |
testcase_39 | AC | 2 ms
4,352 KB |
testcase_40 | WA | - |
testcase_41 | AC | 1 ms
4,352 KB |
testcase_42 | AC | 1 ms
4,348 KB |
testcase_43 | AC | 2 ms
4,352 KB |
testcase_44 | AC | 10 ms
4,352 KB |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | AC | 88 ms
4,348 KB |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | AC | 19 ms
4,348 KB |
testcase_51 | AC | 22 ms
4,352 KB |
testcase_52 | AC | 42 ms
4,348 KB |
testcase_53 | AC | 7 ms
4,348 KB |
testcase_54 | AC | 2 ms
4,352 KB |
testcase_55 | AC | 19 ms
4,352 KB |
testcase_56 | AC | 22 ms
4,352 KB |
testcase_57 | AC | 43 ms
4,348 KB |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
ソースコード
#include <bits/stdc++.h> using namespace std; #define overload2(a, b, c, ...) c #define overload3(a, b, c, d, ...) d #define overload4(a, b, c, d, e ...) e #define overload5(a, b, c, d, e, f ...) f #define overload6(a, b, c, d, e, f, g ...) g #define fast_io ios::sync_with_stdio(false); cin.tie(nullptr); #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math") typedef long long ll; typedef long double ld; #define chmin(a,b) a = min(a,b); #define chmax(a,b) a = max(a,b); #define bit_count(x) __builtin_popcountll(x) #define leading_zero_count(x) __builtin_clz(x) #define trailing_zero_count(x) __builtin_ctz(x) #define gcd(a,b) __gcd(a,b) #define lcm(a,b) a / gcd(a,b) * b #define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__) #define rep1(i,n) for(int i = 0 ; i < n ; i++) #define rrep(i,a,b) for(int i = a ; i < b ; i++) #define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++) #define pt(a) cout << a << endl; #define print(...) printall(__VA_ARGS__); #define debug(a) cout << #a << " " << a << endl; #define all(a) a.begin(), a.end() #define endl "\n"; #define v1(T,n,a) vector<T>(n,a) #define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a)) #define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a)) #define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a)) template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;} template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;} template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;} template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;} template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;} template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;} template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;} template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;} template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;} void solve(){ ll n, l, r; cin >> n >> l >> r; vector<ll> A(n); cin >> A; sort(all(A)); bool gd = false; rep(i,n) if(l <= A[i] && A[i] <= r) gd = true; int res = gd; if(r < 0){ rep(i,n){ rep(j,i+1,n){ ll a = A[i]; ll b = A[j]; if(l <= a * b && a * b <= r){ print(2) return; } } } pt(gd) return; } rep(i,n){ vector<ll> B; rrep(j,i,n){ B.push_back(A[j]); if(B.size() == 1) continue; bool ok = true; int sz = B.size(); if(B[0] * B[1] < l) ok = false; if(B[0] * B[1] > r) ok = false; if(B[sz-1] * B[sz-2] < l) ok = false; if(B[sz-1] * B[sz-2] > r) ok = false; if(B[0] * B[sz-1] < l) ok = false; if(B[0] * B[sz-1] > r) ok = false; if(ok) { chmax(res,j-i+1); } } } pt(res) } int main(){ fast_io int t = 1; // cin >> t; rep(i,t) solve(); }