結果
問題 | No.467 隠されていたゲーム |
ユーザー |
![]() |
提出日時 | 2020-02-13 16:49:01 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 3,768 bytes |
コンパイル時間 | 1,856 ms |
コンパイル使用メモリ | 177,044 KB |
実行使用メモリ | 34,628 KB |
最終ジャッジ日時 | 2024-10-06 05:18:34 |
合計ジャッジ時間 | 3,021 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#include "bits/stdc++.h"#include <unordered_set>#define rep(i,n) for(ll i = 0; i < n; i++)typedef long long ll;typedef unsigned long long ull;using namespace std;#define vll vector<vector<long long>>#define vl vector<long long>#define vi vector<int>#define vii vector<vector<int>>#define pb push_back#define pf push_front#define ld long double#define Sort(a) sort(a.begin(),a.end())#define cSort(a,cmp) sort(a.begin(),a.end(),cmp)#define reSort(a) sort(a.rbegin(), a.rend())static const ll llMAX = numeric_limits<long long>::max();static const int intMAX = numeric_limits<int>::max();static const ll llMIN = numeric_limits<long long>::min();static const int intMIN = numeric_limits<int>::min();static const ll d_5 = 100000;static const ll d9_7 = 1000000007;static const ll d_9 = 1000000000;static const double PI=3.14159265358979323846;template<class T>void Printvector(std::vector<T> a){int size = a.size();rep(i,size){cout<<a[i]<<" ";}cout<<endl;}template<class T>void Printvector(std::vector<std::vector<T>> a){int size = a.size();rep(i,size){int size2=a[i].size();rep(j,size2){cout<<a[i][j]<<" ";}cout<<endl;}cout<<endl;}ll digitpower(ll a,ll b){//aのb乗を計算if(b==1){return a;}else if(b==0){return 1;}int mode=0;if(b%2==1){ll tmp = digitpower(a,(b-1)/2);if(mode==1){tmp%=d9_7;}tmp*=tmp;if(mode==1){tmp%=d9_7;}tmp*=a;if(mode==1){return tmp%d9_7;}else{return tmp;}}else{ll tmp = digitpower(a,(b)/2);if(mode==1){tmp%=d9_7;}tmp*=tmp;if(mode==1){tmp%=d9_7;}if(mode==1){return tmp%d9_7;}else{return tmp;}}}vl facs(2000010,-1);ll Factrial(ll num){if(facs[num]!=-1){return facs[num];}if(num==1||num<=0){return 1;}else if(num<0){printf("ERROR_minus\n");return 0;}else{facs[num]=(num*Factrial(num-1))%d9_7;return facs[num];}}long long modinv(long long a, long long m) {//modの逆元long long b = m, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}vl invs(2000010,-1);ll linercomb(ll n,ll k, ll mod){//n,kの線形時間で求めるif(n<k)return 0;if(n<0)return 0;if(k==0 || k==n)return 1;ll ans=Factrial(n);if(invs[k]==-1){invs[k]=modinv(Factrial(k),mod);}ans*=invs[k];ans%=d9_7;ll k1=Factrial(n-k);k1%=mod;ans*=modinv(k1,mod);ans%=mod;return ans;}unordered_map<ll,ll> prime_factor(int64_t n) {unordered_map<ll,ll> ret;for(int64_t i = 2; i * i <= n; i++) {while(n % i == 0) {ret[i]++;n /= i;}}if(n != 1) ret[n] = 1;return ret;}template<class T>vector<T> getaccum(vector<T> a){int size=a.size();vector<T> ans(size);ans[0]=a[0];for(int i=0;i<size-1;i++){ans[i+1]=ans[i]+a[i+1];//ans[i+1]%=d9_7;}return ans;}struct datas{int item1;int item2;int score;};/*bool cmp(const datas &a, const datas &b){return a.num < b.num;}*/ll getaccumnum(vector<ll> accum,int l,int r){//閉区間[l,r]の総和if(l==0){return accum[r];}else{return accum[r]-accum[l-1];}}int main(void){int n;cin>>n;vl d(n);ll dmax=0;rep(i,n){cin>>d[i];dmax=max(dmax,d[i]);}ll x,y;cin>>x>>y;if(x==0 && y == 0){cout<<0<<endl;return 0;}bitset<15> bits;rep(i,n){if(d[i]==max(abs(x),abs(y))){cout<<1<<endl;return 0;}}ll xymax=max(abs(x),abs(y));cout<<max((xymax+dmax-1)/dmax,(ll)2)<<endl;}//<<std::setprecision(30)