結果
問題 | No.1683 Robot Guidance |
ユーザー | suta28407928 |
提出日時 | 2021-09-17 23:16:53 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 384 ms / 2,000 ms |
コード長 | 5,338 bytes |
コンパイル時間 | 2,561 ms |
コンパイル使用メモリ | 186,216 KB |
実行使用メモリ | 122,880 KB |
最終ジャッジ日時 | 2024-06-29 22:03:45 |
合計ジャッジ時間 | 17,341 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 319 ms
122,688 KB |
testcase_01 | AC | 304 ms
122,728 KB |
testcase_02 | AC | 302 ms
122,832 KB |
testcase_03 | AC | 319 ms
122,752 KB |
testcase_04 | AC | 310 ms
122,688 KB |
testcase_05 | AC | 304 ms
122,744 KB |
testcase_06 | AC | 308 ms
122,708 KB |
testcase_07 | AC | 296 ms
122,880 KB |
testcase_08 | AC | 379 ms
122,752 KB |
testcase_09 | AC | 312 ms
122,752 KB |
testcase_10 | AC | 357 ms
122,712 KB |
testcase_11 | AC | 347 ms
122,688 KB |
testcase_12 | AC | 384 ms
122,752 KB |
testcase_13 | AC | 306 ms
122,840 KB |
testcase_14 | AC | 383 ms
122,752 KB |
testcase_15 | AC | 373 ms
122,724 KB |
testcase_16 | AC | 275 ms
122,692 KB |
testcase_17 | AC | 287 ms
122,752 KB |
testcase_18 | AC | 270 ms
122,852 KB |
testcase_19 | AC | 276 ms
122,712 KB |
testcase_20 | AC | 298 ms
122,724 KB |
testcase_21 | AC | 294 ms
122,684 KB |
testcase_22 | AC | 275 ms
122,720 KB |
testcase_23 | AC | 338 ms
122,752 KB |
testcase_24 | AC | 352 ms
122,692 KB |
testcase_25 | AC | 341 ms
122,752 KB |
testcase_26 | AC | 295 ms
122,752 KB |
testcase_27 | AC | 363 ms
122,752 KB |
testcase_28 | AC | 318 ms
122,732 KB |
testcase_29 | AC | 317 ms
122,824 KB |
testcase_30 | AC | 324 ms
122,752 KB |
testcase_31 | AC | 303 ms
122,752 KB |
testcase_32 | AC | 337 ms
122,716 KB |
testcase_33 | AC | 298 ms
122,696 KB |
testcase_34 | AC | 337 ms
122,776 KB |
testcase_35 | AC | 364 ms
122,752 KB |
testcase_36 | AC | 380 ms
122,732 KB |
testcase_37 | AC | 321 ms
122,752 KB |
testcase_38 | AC | 343 ms
122,840 KB |
testcase_39 | AC | 354 ms
122,880 KB |
testcase_40 | AC | 288 ms
122,832 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; #define DEBUG #ifdef DEBUG template <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)) #endif using 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 = 5100000; 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);} //#include <atcoder/all> //using namespace atcoder; const int mod = 1e9 + 7; //const int mod = 998244353; template <int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t 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; } 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(int64_t 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) { int64_t t; is >> t; a = ModInt<mod>(t); return (is); } static int get_mod() { return mod; } }; using mint = ModInt<mod>; vector<ll> fac(MAX), finv(MAX), inv(MAX); void comInit(){ fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for(ll i=2; i<MAX; i++){ fac[i] = fac[i-1]*i % mod; inv[i] = mod - inv[mod%i] * (mod/i) % mod; finv[i] = finv[i-1] * inv[i] % mod; } } mint com(ll n, ll k){ if(n == k) return 1; if(n < k) return 0; if(n < 0 || k < 0) return 0; return mint(fac[n]) * (finv[k] * finv[n-k] % mod); } int main(){ ll a,b,x,y; cin >> a >> b >> x >> y; comInit(); ll R = b/4+1; ll U = (b+3)/4; ll L = (b+2)/4; ll D = (b+1)/4; mint ans = 0; for(int i=0; i<=a; i++){ //横移動i回 if(i % 2 != abs(x) % 2) continue; ll j = a-i; if(j % 2 != abs(y) % 2) continue; ll r = (i+x) / 2; ll l = (i-x) / 2; ll u = (j+y) / 2; ll d = (j-y) / 2; ans += com(r+R-1,R-1) * com(u+U-1,U-1) * com(l+L-1,L-1) * com(d+D-1,D-1); } cout << ans << endl; }