#898536 (C++17(clang)) No.2406 Difference of Coordinate Squared

提出ソース

結果

問題	No.2406 Difference of Coordinate Squared
ユーザー	mikam
提出日時	2023-08-04 22:20:04
言語	C++17(clang) (17.0.6 + boost 1.83.0)
結果	AC
実行時間	424 ms / 2,000 ms
コード長	5,221 bytes
コンパイル時間	8,238 ms
コンパイル使用メモリ	237,476 KB
実行使用メモリ	237,696 KB
最終ジャッジ日時	2024-11-26 18:04:12
合計ジャッジ時間	32,555 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	398 ms 237,696 KB
testcase_01	AC	398 ms 237,568 KB
testcase_02	AC	405 ms 237,696 KB
testcase_03	AC	399 ms 237,696 KB
testcase_04	AC	410 ms 237,568 KB
testcase_05	AC	400 ms 237,568 KB
testcase_06	AC	395 ms 237,568 KB
testcase_07	AC	397 ms 237,696 KB
testcase_08	AC	400 ms 237,696 KB
testcase_09	AC	400 ms 237,696 KB
testcase_10	AC	394 ms 237,696 KB
testcase_11	AC	424 ms 237,696 KB
testcase_12	AC	408 ms 237,568 KB
testcase_13	AC	396 ms 237,568 KB
testcase_14	AC	397 ms 237,568 KB
testcase_15	AC	396 ms 237,568 KB
testcase_16	AC	402 ms 237,696 KB
testcase_17	AC	397 ms 237,568 KB
testcase_18	AC	398 ms 237,568 KB
testcase_19	AC	400 ms 237,568 KB
testcase_20	AC	397 ms 237,568 KB
testcase_21	AC	407 ms 237,696 KB
testcase_22	AC	395 ms 237,568 KB
testcase_23	AC	395 ms 237,568 KB
testcase_24	AC	397 ms 237,696 KB
testcase_25	AC	393 ms 237,568 KB
testcase_26	AC	394 ms 237,568 KB
testcase_27	AC	401 ms 237,568 KB
testcase_28	AC	410 ms 237,568 KB
testcase_29	AC	396 ms 237,568 KB
testcase_30	AC	401 ms 237,568 KB
testcase_31	AC	394 ms 237,568 KB
testcase_32	AC	392 ms 237,696 KB
testcase_33	AC	389 ms 237,568 KB
testcase_34	AC	393 ms 237,568 KB
testcase_35	AC	397 ms 237,696 KB
testcase_36	AC	394 ms 237,696 KB
testcase_37	AC	399 ms 237,696 KB
testcase_38	AC	402 ms 237,568 KB
testcase_39	AC	399 ms 237,568 KB
testcase_40	AC	400 ms 237,568 KB
testcase_41	AC	394 ms 237,568 KB
testcase_42	AC	396 ms 237,568 KB
testcase_43	AC	391 ms 237,568 KB
testcase_44	AC	397 ms 237,568 KB
testcase_45	AC	392 ms 237,568 KB
testcase_46	AC	400 ms 237,568 KB
testcase_47	AC	396 ms 237,696 KB
testcase_48	AC	398 ms 237,568 KB
testcase_49	AC	394 ms 237,696 KB
testcase_50	AC	398 ms 237,568 KB
testcase_51	AC	409 ms 237,568 KB
testcase_52	AC	401 ms 237,696 KB
testcase_53	AC	391 ms 237,696 KB
testcase_54	AC	397 ms 237,568 KB
testcase_55	AC	392 ms 237,696 KB
testcase_56	AC	396 ms 237,568 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp:40:79: warning: expression result unused [-Wunused-value]
   40 | template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
      |                                                                               ^~~~
main.cpp:112:16: note: in instantiation of function template specialization 'print<atcoder::static_modint<998244353>>' requested here
  112 |         return print(ans/mint(4).pow(n));
      |                ^
1 warning generated.

ソースコード

raw source code

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}
vi divisor(int n){
    vi ret;
    for(int i=1;i*i<=n;i++){
        if(n%i==0){
            ret.push_back(i);
            if(i*i!=n)ret.push_back(n/i);
        }
    }
    sort(all(ret));
    return ret;
}
class comb{
private:
    int MAX_N;
    vector<mint> _fac,_ifac,_inv;
    void init(){
        for(int i=2;i<=MAX_N;i++)_fac[i]=_fac[i-1]*i;
        _ifac[MAX_N]=1/_fac[MAX_N];
        for(int i=MAX_N-1;i>=1;i--)_ifac[i]=_ifac[i+1]*(i+1);
        for(int i=2;i<MAX_N;i++)_inv[i] = _fac[i-1]*_ifac[i];
    }
public:
    comb(int n=20002000):MAX_N(n),_fac(n+1,1),_ifac(n+1,1),_inv(n+1,1){init();}
    mint fac(int k){assert(k<=MAX_N);return _fac[k];}
    mint ifac(int k){assert(k<=MAX_N);return _ifac[k];}
    mint inv(int k){assert(k<=MAX_N);return _inv[k];}
    mint nPr(int n,int r){if(r<0||n<r)return 0;return fac(n)*ifac(n-r);}
    mint nCr(int n,int r){if(r<0||n<r)return 0;return nPr(n,r)*ifac(r);}
    mint nHr(int n,int r,int low=0){r-=n*low;if(n==0&&r==0)return 1;if(n<=0||r<0)return 0;return nCr(n+r-1,r);}

} com;
signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n,m);
    m = abs(m);
    auto f = [&](int x)->mint {
        int k = abs(x);
        int r = n - k;
        if(r<0||r&1)return 0;
        r/=2;
        return com.nCr(n,r);
    };
    if(m==0){
        mint ans = f(0)*f(0);
        for(int u=1;u<=n;u++){
            ans += 4*f(u)*f(0);
        }
        return print(ans/mint(4).pow(n));
    }

    mint ans = 0;
    for(auto u:divisor(m)){
        int v = m/u;
        ans += 2*f(u)*f(v);
    }
    print(ans/mint(4).pow(n));
    return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード