結果

問題 No.2280 FizzBuzz Difference
ユーザー noya2noya2
提出日時 2023-05-10 01:15:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 64 ms / 2,000 ms
コード長 4,380 bytes
コンパイル時間 3,872 ms
コンパイル使用メモリ 268,844 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-05-04 19:20:41
合計ジャッジ時間 5,188 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 44 ms
5,248 KB
testcase_02 AC 64 ms
5,376 KB
testcase_03 AC 14 ms
5,376 KB
testcase_04 AC 62 ms
5,376 KB
testcase_05 AC 46 ms
5,376 KB
testcase_06 AC 47 ms
5,376 KB
testcase_07 AC 59 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,m,n) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

//using mint = modint998244353;
using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}

ll my_floor_sum(ll n, ll m, ll a, ll b){
    ll ans = a/m*(n-1)*n/2 + b/m*n;
    a %= m, b %= m;
    if (n > m){
        ll d = n/m;
        ans += floor_sum(m,m,a,b) * d + (d-1)*d/2*a*m + d*a*(n-d*m);
        n %= m;
    }
    return floor_sum(n,m,a,b) + ans;
}

ll calc(ll a, ll b, ll k, ll l, ll r){
    ll sum0 = r - l + 1;
    ll sum1 = my_floor_sum(r+1,b,a,b-k-1) - my_floor_sum(l,b,a,b-k-1);
    ll sum2 = my_floor_sum(r+1,b,a,0)   - my_floor_sum(l,b,a,0);
    return sum0-sum1+sum2;
}

void solve(){
    ll m, a, b, k; cin >> m >> a >> b >> k;
    if (k > a){
        out(0);
        return ;
    }
    if (k == a){
        out(calc(a,b,b-k,1,m/a-1));
    }
    else {
        ll ans1 = calc(b,a,k,1,m/b) - calc(b,a,k-1,1,m/b);
        ll ans2 = calc(a,b,k,1,m/a) - calc(a,b,k-1,1,m/a);
        out(ans1+ans2);
    }
}

int main(){
    fast_io();
    int t = 1; cin >> t;
    while(t--) solve();
}
0