結果

問題 No.1918 Simple Math ?
ユーザー rianoriano
提出日時 2022-03-29 00:51:41
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 358 ms / 2,000 ms
コード長 6,280 bytes
コンパイル時間 1,576 ms
コンパイル使用メモリ 174,352 KB
実行使用メモリ 4,384 KB
最終ジャッジ日時 2023-09-11 11:31:46
合計ジャッジ時間 6,186 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 37 ms
4,376 KB
testcase_01 AC 3 ms
4,380 KB
testcase_02 AC 3 ms
4,380 KB
testcase_03 AC 3 ms
4,384 KB
testcase_04 AC 3 ms
4,376 KB
testcase_05 AC 4 ms
4,376 KB
testcase_06 AC 38 ms
4,376 KB
testcase_07 AC 34 ms
4,380 KB
testcase_08 AC 18 ms
4,380 KB
testcase_09 AC 11 ms
4,376 KB
testcase_10 AC 27 ms
4,380 KB
testcase_11 AC 8 ms
4,380 KB
testcase_12 AC 27 ms
4,380 KB
testcase_13 AC 20 ms
4,376 KB
testcase_14 AC 12 ms
4,380 KB
testcase_15 AC 9 ms
4,380 KB
testcase_16 AC 108 ms
4,380 KB
testcase_17 AC 123 ms
4,384 KB
testcase_18 AC 187 ms
4,376 KB
testcase_19 AC 169 ms
4,380 KB
testcase_20 AC 149 ms
4,376 KB
testcase_21 AC 255 ms
4,380 KB
testcase_22 AC 264 ms
4,384 KB
testcase_23 AC 265 ms
4,380 KB
testcase_24 AC 272 ms
4,380 KB
testcase_25 AC 243 ms
4,380 KB
testcase_26 AC 358 ms
4,384 KB
testcase_27 AC 194 ms
4,376 KB
testcase_28 AC 104 ms
4,380 KB
testcase_29 AC 2 ms
4,380 KB
testcase_30 AC 51 ms
4,380 KB
testcase_31 AC 251 ms
4,380 KB
testcase_32 AC 6 ms
4,380 KB
testcase_33 AC 9 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)
#define vll(n,i) vector<long long>(n,i)
#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))
#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))
#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))
#define all(v) v.begin(),v.end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")

//Graph
struct graph {
    long long N;
	vector<vector<tuple<long long,long long,int>>> G;
    vector<long long> par_v;
    vector<long long> par_e;
    int edge_count = 0;
    
	graph(long long n) {
        N = n;
		G = vector<vector<tuple<long long,long long,int>>>(N);
        par_v = vector<long long>(N,-1);
        par_e = vector<long long>(N,-1);
	}

    void unite(long long a,long long b,long long cost = 1,bool directed = false){
        G[a].emplace_back(b,cost,edge_count);
        if(!directed) G[b].emplace_back(a,cost,edge_count);
        edge_count++;
    }
};

const ll mod = 1e9+7;
template<uint64_t mod>
struct modint{
    uint64_t val;
    constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}
    constexpr modint operator-() const noexcept{
        return modint(*this)=mod-val;
    }
    constexpr modint operator+(const modint rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept{
        val+=rhs.val;
        val-=((val>=mod)?mod:0);
        return (*this);
    }
    constexpr modint &operator-=(const modint rhs) noexcept{
        val+=((val<rhs.val)?mod:0);
        val-=rhs.val;
        return (*this);
    }
    constexpr modint &operator*=(const modint rhs) noexcept{
        val=val*rhs.val%mod;
        return (*this);
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        uint64_t ex=mod-2;
        modint now=1;
        while(ex){
            now*=((ex&1)?rhs:1);
            rhs*=rhs,ex>>=1;
        }
        return (*this)*=now;
    }
    modint & operator++(){
        val++;
        if (val == mod) val = 0;
        return *this;
    }
    modint operator++(int){
        modint<mod> res = *this;
        ++*this;
        return res;
    }
    constexpr bool operator==(const modint rhs) noexcept{
        return val==rhs.val;
    }
    constexpr bool operator!=(const modint rhs) noexcept{
        return val!=rhs.val;
    }
    friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{
        return os<<(x.val);
    }
    friend constexpr istream &operator>>(istream& is,modint& x) noexcept{
        uint64_t t;
        is>>t,x=t;
        return is;
    }
};
typedef modint<mod> mint;
mint pw(long long a,long long b,long long m = mod){
    if(a%m==0) return mint(0);
    if(b==0) return mint(1);
    else if(b%2==0){
        long long x = pw(a,b/2,m).val;
        return mint(x*x);
    }
    else{
        long long x = pw(a,b-1,m).val;
        return mint(a*x);
    }
}
mint 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;
    return mint(u);
}
#define vm(n,i) vector<mint>(n,i)
#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))
#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))
#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))
void out(vector<ll> &v){
    for(ll x:v) cout << x << " ";
    cout << "\n"; return;
}



int main(){
    riano_; mint ans = 0;
    ll N,M,K,H,W,Q,L,R,T; cin >> T;
    rep(ii,T){
        ll a; cin >> a >> N; ans = 0;
        ll NN = N;
        ll len = 3; ll r = 0; mint s = 0; ll f = 0;
        rep(i,a){
            s += mint(i+1)*mint((len+r)/a);
            f += (len+r)/a;
            r = (len+r)%a;
            len += 2;
        }
        //解から二分探索 binary search
        //分かれ目の"r"側の値を求める
        ll l,rr;
        l = 0; rr = min(N/f+1,(ll)1e6+1); //初期値の代入
        while(l<rr){
            ll c = (l+rr)/2;
            ll n = c*f+c*(c-1)*a;
            //cの場合に検証
            if(n<=N){//cが"l側"になる条件判定
                l = c+1;
            }
            else rr = c;
        }
        // rep(i,5){
        //     cout << i*f+2*i*(i-1)*a << endl;
        // }
        l--;
        //cout << l << endl;
        N -= l*f+l*(l-1)*a;
        // ans += mint(l)*s;
        // for(int i=l-1;i>=1;i--){
        //     ans += (mint(3*a+1)+mint(2*a)*mint(l-1-i))*mint(a)*mint(i);
        // }
        for(int i=1;i<=l;i++){
            //cout << s << " " << f << endl;
            ans += s;
            s += mint(f*a);
            s += mint(a+1+2*a*(ll)(i))*mint(a);
            f += 2*a;
        }
        len = 3+2*a*l; r = 0;
        //cout << N << " " << len << endl;
        rep(i,a){
            ll tmp = (len+r)/a;
            if(tmp>N){
                ans += mint(N)*mint(l*a+(ll)(1+i)); break;
            }
            else{
                ans += mint(tmp)*mint(l*a+(ll)(1+i));
                N -= tmp;
            }
            r = (len+r)%a;
            len += 2;
        }
        cout << ans << endl;

        // mint st = 0;
        // vector<ll> aa(10);
        // for(ll j=a;j<=a*NN;j+=a){
        //     st += mint(floor(sqrt(j)));
        //     ll t = floor(sqrt(j));
        //     aa[(t-1)/10] += t;
        //     cout << t << " ";
        // }
        // cout << endl;
        // rep(i,4){
        //     cout << aa[i] << endl;
        // }
        // cout << st << endl;
    }
    //cout << ans << endl;
}
0