結果
問題 | No.1358 [Zelkova 2nd Tune *] 語るなら枚数を... |
ユーザー | suta28407928 |
提出日時 | 2021-01-22 22:32:12 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,267 bytes |
コンパイル時間 | 2,840 ms |
コンパイル使用メモリ | 184,908 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-12-28 03:07:51 |
合計ジャッジ時間 | 6,847 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 16 WA * 1 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>//#include <atcoder/all>using namespace std;//using namespace atcoder;#define DEBUG#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifusing namespace std;typedef long long ll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<char> vc;typedef vector<string> vs;typedef vector<bool> vb;typedef vector<double> vd;typedef pair<ll,ll> P;typedef pair<int,int> pii;typedef vector<P> vpl;typedef tuple<ll,ll,ll> tapu;#define rep(i,n) for(int i=0; i<(n); i++)#define REP(i,a,b) for(int i=(a); i<(b); i++)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()const int inf = (1<<30) - 1;const ll linf = 1LL<<61;const int MAX = 510000;int dy[8] = {0,1,0,-1,1,-1,-1,1};int dx[8] = {-1,0,1,0,1,-1,1,-1};const double pi = acos(-1);const double eps = 1e-7;template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a = b; return true;}else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a = b; return true;}else return false;}template<typename T> inline void print(T &a){int sz = a.size();for(auto itr = a.begin(); itr != a.end(); itr++){cout << *itr;sz--;if(sz) cout << " ";}cout << "\n";}template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){cout << a << " " << b << " " << c << "\n";}void mark() {cout << "#" << "\n";}ll pcount(ll x) {return __builtin_popcountll(x);}//const int mod = 1e9 + 7;const int mod = 998244353;ll GCD(ll a, ll b){if(b==0) return a;else return GCD(b,a%b);}ll LCM(ll a, ll b){return a/GCD(a,b)*b;}long long extGCD(long long a, long long b, long long &x, long long &y) {if (b == 0) {x = 1;y = 0;return a;}long long d = extGCD(b, a%b, y, x);y -= a/b * x;return d;}int main(){int t; cin >> t;while(t--){vl a(3); rep(i,3) cin >> a[i];ll Y; cin >> Y;REP(i,1,3){if(Y / a[i] <= 1000000){swap(a[0], a[i]); break;}}ll lc = LCM(a[1], a[2]);ll gc = GCD(a[1], a[2]);vl b(3); b[1] = a[1]/gc, b[2] = a[2]/gc;ll ans = 0;ll x,y;extGCD(a[1], a[2], x, y);for(ll i=0; i*a[0]<=Y; i++){//cout << i << "\n";ll rest = Y - i*a[0];if(rest % gc != 0) continue;if(rest == 0){ans++;break;}ll tmp = rest / gc;x *= tmp;y *= tmp;//cout << x << " " << y << "\n";//cout << b[1] << " " << b[2] << "\n";swap(x,y);ll k,t;if(x >= 0){k = x / b[1];if(y < 0) t = (y - b[2] + 1) / b[2];else t = y / b[2];ans += k + t + 1;}else{k = (x - b[1] + 1) / b[1];if(y < 0) t = (y - b[2] + 1) / b[2];else t = y / b[2];ans += k + t + 1;}swap(x,y);x /= tmp;y /= tmp;//cout << k << " " << t << "\n";}cout << ans << "\n";}}