#655494 (C++17) No.1501 酔歩

• 問題: No.1501 酔歩
• ユーザー: sigma425
• 提出日時: 2021-05-08 04:33:04
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 3,748 bytes
• コンパイル時間: 2,361 ms
• コンパイル使用メモリ: 206,128 KB
• 実行使用メモリ: 8,224 KB
• 最終ジャッジ日時: 2023-10-14 03:55:34
• 合計ジャッジ時間: 7,731 ms
• ジャッジサーバーID （参考情報）: judge12 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,368 KB
testcase_01	AC	1 ms; 4,368 KB
testcase_02	AC	2 ms; 4,368 KB
testcase_03	AC	1 ms; 4,372 KB
testcase_04	WA	-
testcase_05	AC	61 ms; 7,148 KB
testcase_06	AC	47 ms; 6,236 KB
testcase_07	AC	60 ms; 6,684 KB
testcase_08	AC	15 ms; 4,368 KB
testcase_09	AC	51 ms; 6,412 KB
testcase_10	AC	22 ms; 4,420 KB
testcase_11	AC	45 ms; 5,896 KB
testcase_12	AC	34 ms; 5,096 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	80 ms; 7,996 KB
testcase_23	AC	80 ms; 8,000 KB
testcase_24	AC	77 ms; 8,000 KB
testcase_25	AC	83 ms; 7,996 KB
testcase_26	AC	80 ms; 8,048 KB
testcase_27	AC	78 ms; 8,040 KB
testcase_28	AC	78 ms; 8,000 KB
testcase_29	AC	81 ms; 8,224 KB
testcase_30	AC	83 ms; 8,056 KB
testcase_31	AC	79 ms; 8,024 KB
testcase_32	AC	79 ms; 8,000 KB
testcase_33	AC	79 ms; 8,056 KB
testcase_34	AC	77 ms; 8,056 KB
testcase_35	AC	79 ms; 8,004 KB
testcase_36	AC	80 ms; 8,028 KB
testcase_37	AC	76 ms; 8,048 KB
testcase_38	AC	81 ms; 8,048 KB
testcase_39	AC	82 ms; 8,064 KB
testcase_40	AC	75 ms; 8,052 KB
testcase_41	WA	-
testcase_42	AC	45 ms; 7,992 KB
testcase_43	WA	-
testcase_44	WA	-
testcase_45	AC	43 ms; 8,116 KB
testcase_46	AC	44 ms; 8,004 KB
testcase_47	AC	44 ms; 8,000 KB
testcase_48	AC	57 ms; 8,000 KB
testcase_49	AC	57 ms; 8,084 KB
testcase_50	AC	58 ms; 8,040 KB
testcase_51	AC	61 ms; 7,992 KB
testcase_52	AC	58 ms; 8,220 KB
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> void chmax(T& x, U y){if(x<y) x=y;}
template<class T,class U> void chmin(T& x, U y){if(y<x) x=y;}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

int bsf(ll x) { return __builtin_ctzll(x); } 
ll gcd(ll a, ll b){
	a = abs(a), b = abs(b);
	if(a==0) return b;
	if(b==0) return a;
	int shift = bsf(a|b);
	a >>= bsf(a);
	do{
		b >>= bsf(b);
		if(a>b) swap(a,b);
		b -= a;
	}while(b);
	return a<<shift;
}

struct Frac{
	ll x,y;		// x/y
	Frac(ll x_ = 0):x(x_),y(1){}
	Frac(ll x_,ll y_){
		ll g = gcd(x_,y_);
		if(y_ < 0) g = -g;
		x = x_ / g;
		y = y_ / g;
	}

	Frac operator-() const { return {-x,y}; }
	Frac operator+(const Frac& r) const { return {x * r.y + y * r.x, y * r.y}; }
	Frac operator-(const Frac& r) const { return *this + (-r); }
	Frac operator*(const Frac& r) const { return {x * r.x, y * r.y}; }
	Frac operator/(const Frac& r) const { return {x * r.y, y * r.x}; }
	Frac& operator+=(const Frac& r) { return *this = *this + r; }
	Frac& operator-=(const Frac& r) { return *this = *this - r; }
	Frac& operator*=(const Frac& r) { return *this = *this * r; }
	Frac& operator/=(const Frac& r) { return *this = *this / r; }
	bool operator<(const Frac& r) const { return x * r.y < y * r.x; }
	bool operator>(const Frac& r) const { return r < *this; }
	bool operator<=(const Frac& r) const { return !(r < *this); }
	bool operator>=(const Frac& r) const { return !(*this < r); }
	bool operator==(const Frac& r) const { return x == r.x && y == r.y; }
	bool operator!=(const Frac& r) const { return !(*this == r); }
	friend ostream& operator<<(ostream &o,const Frac& x){
		return o << x.x << "/" << x.y;
	}
};

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N,K; cin >> N >> K; K--;
	V<int> A(N); rep(i,N) cin >> A[i];
	V<Frac> f(N);
	f[N-1] = 1;
	if(N > 2){
		V<Frac> a(N),b(N);
		// f[1] = x
		// f[i] = a[i]x + b[i]
		a[1] = 1;
		for(int i=2;i<N;i++){
			a[i] = Frac(A[i-2]+A[i],A[i]) * a[i-1] - Frac(A[i-2],A[i]) * a[i-2];
			b[i] = Frac(A[i-2]+A[i],A[i]) * b[i-1] - Frac(A[i-2],A[i]) * b[i-2];
		}
		Frac x = (Frac(1)-b[N-1])/a[N-1];
		Frac res = a[K]*x + b[K];
		if(res == 0) cout << 0 << endl;
		else cout << res << endl;
	}
}