結果
問題 | No.2406 Difference of Coordinate Squared |
ユーザー | siganai |
提出日時 | 2023-08-04 23:06:52 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 113 ms / 2,000 ms |
コード長 | 7,483 bytes |
コンパイル時間 | 2,852 ms |
コンパイル使用メモリ | 209,196 KB |
実行使用メモリ | 19,300 KB |
最終ジャッジ日時 | 2024-05-05 01:41:06 |
合計ジャッジ時間 | 4,278 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 95 ms
11,008 KB |
testcase_02 | AC | 21 ms
11,008 KB |
testcase_03 | AC | 113 ms
19,300 KB |
testcase_04 | AC | 30 ms
11,008 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 41 ms
6,656 KB |
testcase_07 | AC | 33 ms
6,144 KB |
testcase_08 | AC | 29 ms
8,448 KB |
testcase_09 | AC | 38 ms
8,704 KB |
testcase_10 | AC | 63 ms
10,496 KB |
testcase_11 | AC | 13 ms
9,344 KB |
testcase_12 | AC | 74 ms
9,856 KB |
testcase_13 | AC | 72 ms
9,600 KB |
testcase_14 | AC | 51 ms
9,984 KB |
testcase_15 | AC | 55 ms
10,880 KB |
testcase_16 | AC | 53 ms
7,808 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 16 ms
5,464 KB |
testcase_19 | AC | 16 ms
10,112 KB |
testcase_20 | AC | 86 ms
10,496 KB |
testcase_21 | AC | 15 ms
7,424 KB |
testcase_22 | AC | 37 ms
10,032 KB |
testcase_23 | AC | 85 ms
10,880 KB |
testcase_24 | AC | 19 ms
5,376 KB |
testcase_25 | AC | 4 ms
5,376 KB |
testcase_26 | AC | 1 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 1 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 2 ms
5,376 KB |
testcase_34 | AC | 2 ms
5,376 KB |
testcase_35 | AC | 1 ms
5,376 KB |
testcase_36 | AC | 2 ms
5,376 KB |
testcase_37 | AC | 1 ms
5,376 KB |
testcase_38 | AC | 2 ms
5,376 KB |
testcase_39 | AC | 1 ms
5,376 KB |
testcase_40 | AC | 1 ms
5,376 KB |
testcase_41 | AC | 2 ms
5,376 KB |
testcase_42 | AC | 2 ms
5,376 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 2 ms
5,376 KB |
testcase_46 | AC | 1 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
testcase_48 | AC | 2 ms
5,376 KB |
testcase_49 | AC | 2 ms
5,376 KB |
testcase_50 | AC | 2 ms
5,376 KB |
testcase_51 | AC | 2 ms
5,376 KB |
testcase_52 | AC | 2 ms
5,376 KB |
testcase_53 | AC | 2 ms
5,376 KB |
testcase_54 | AC | 1 ms
5,376 KB |
testcase_55 | AC | 1 ms
5,376 KB |
testcase_56 | AC | 2 ms
5,376 KB |
ソースコード
#line 1 "test.cpp" //#pragma GCC target("avx,avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> #ifdef LOCAL #include <debug.hpp> #define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast<void>(0)) #endif using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vpii = vector<pii>; using vpll = vector<pll>; using vs = vector<string>; template<class T> using pq = priority_queue<T, vector<T>, greater<T>>; #define overload4(_1, _2, _3, _4, name, ...) name #define overload3(a,b,c,name,...) name #define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER) #define rep2(i, n) for (ll i = 0; i < (n); ++i) #define rep3(i, a, b) for (ll i = (a); i < (b); ++i) #define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(n) for(ll i = (n) - 1;i >= 0;i--) #define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--) #define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--) #define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define all1(i) begin(i) , end(i) #define all2(i,a) begin(i) , begin(i) + a #define all3(i,a,b) begin(i) + a , begin(i) + b #define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__) #define sum(...) accumulate(all(__VA_ARGS__),0LL) template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; } template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; } template<class T> auto min(const T& a){return *min_element(all(a));} template<class T> auto max(const T& a){return *max_element(all(a));} template<class... Ts> void in(Ts&... t); #define INT(...) int __VA_ARGS__; in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__; in(__VA_ARGS__) #define STR(...) string __VA_ARGS__; in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__; in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__; in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; in(__VA_ARGS__) #define VEC(type, name, size) vector<type> name(size); in(name) #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name) ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;} ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);} ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;} namespace IO{ #define VOID(a) decltype(void(a)) struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting; template<int I> struct P : P<I-1>{}; template<> struct P<0>{}; template<class T> void i(T& t){ i(t, P<3>{}); } void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; } template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; } template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); } template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...);} template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{});} #undef VOID } #define unpack(a) (void)initializer_list<int>{(a, 0)...} template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); } #undef unpack static const double PI = 3.1415926535897932; template <class F> struct REC { F f; REC(F &&f_) : f(forward<F>(f_)) {} template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }}; //constexpr int mod = 1000000007; constexpr int mod = 998244353; #line 2 "library/modint/Modint.hpp" template <int mod> struct Modint{ int x; Modint():x(0) {} Modint(long long y): x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} Modint &operator += (const Modint &p) { if((x += p.x) >= mod) x -= mod; return *this;} Modint &operator -= (const Modint &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this;} Modint &operator *= (const Modint &p) { x = (int)(1LL * x * p.x % mod); return *this;} Modint &operator /= (const Modint &p) { *this *= p.inverse(); return *this;} Modint operator -() const{return Modint(-x);} Modint operator +(const Modint &p) const {return Modint(*this) += p;} Modint operator -(const Modint &p) const {return Modint(*this) -= p;} Modint operator *(const Modint &p) const {return Modint(*this) *= p;} Modint operator /(const Modint &p) const {return Modint(*this) /= p;} Modint &operator ++() {if(x == mod - 1) x = 0; else x++; return *this;} Modint &operator --() {if(x == 0) x = mod - 1; else x--; return *this;} bool operator == (const Modint &p) const {return x == p.x;} bool operator != (const Modint &p) const {return x != p.x;} Modint inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return Modint(u);} Modint pow(long long n) const { Modint ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret;} friend ostream &operator<<(ostream &os, const Modint &p) { return os << p.x; } friend istream &operator>>(istream &is, Modint &a) { long long t; is >> t; a = Modint<mod>(t); return (is); } int get() const { return x; } static constexpr int get_mod() {return mod;} }; #line 86 "test.cpp" using mint = Modint<mod>; using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; vector<mint> fact, fact_inv; void make_fact(int n){ fact.resize(n+1), fact_inv.resize(n+1); fact[0] = mint(1); rep(i,1,n+1) fact[i] = fact[i-1] * mint(i); fact_inv[n] = fact[n].inverse(); rrep(i,0,n) fact_inv[i] = fact_inv[i+1] * mint(i+1); } mint ncr(int n, int r){ if(n < 0 || r < 0 || n < r) return mint(0); return fact[n] * fact_inv[r] * fact_inv[n-r];} mint npr(int n, int r){ if(n < 0 || r < 0 || n < r) return mint(0); return fact[n] * fact_inv[n-r]; } int main() { INT(n); make_fact(n); LL(m); vpii xy; rep(i,0,n+1) { ll y = i * i - m; if(y >= 0) { ll ma = 1e7; ll mi = -1; while(ma - mi > 1) { ll mid = (ma + mi) / 2; if(mid * mid >= y) ma = mid; else mi = mid; } if(ma * ma == y) { xy.emplace_back(i,ma); } } } mint ans; mint inv = mint(1) / mint(4).pow(n); for(auto &[x,y]:xy) { if(x + y > n || (n - x + y) % 2) continue; mint tmp = ncr(n,(x + n + y) / 2) * ncr(n,(x + n - y) / 2); if(x == 0 && y == 0) ans += inv * tmp; else if(x == 0 || y == 0) ans += inv * 2 * tmp; else ans += inv * 4 * tmp; } cout << ans << '\n'; }