結果

問題 No.1596 Distance Sum in 2D Plane
ユーザー saki0080saki0080
提出日時 2021-07-10 03:13:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 184 ms / 2,000 ms
コード長 5,052 bytes
コンパイル時間 2,189 ms
コンパイル使用メモリ 205,340 KB
実行使用メモリ 12,500 KB
最終ジャッジ日時 2023-09-14 15:23:02
合計ジャッジ時間 6,211 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 18 ms
12,500 KB
testcase_01 AC 16 ms
12,108 KB
testcase_02 AC 181 ms
12,432 KB
testcase_03 AC 181 ms
12,424 KB
testcase_04 AC 184 ms
12,432 KB
testcase_05 AC 184 ms
12,376 KB
testcase_06 AC 183 ms
12,392 KB
testcase_07 AC 182 ms
12,376 KB
testcase_08 AC 182 ms
12,376 KB
testcase_09 AC 181 ms
12,344 KB
testcase_10 AC 182 ms
12,248 KB
testcase_11 AC 155 ms
12,352 KB
testcase_12 AC 154 ms
12,276 KB
testcase_13 AC 154 ms
12,324 KB
testcase_14 AC 16 ms
12,284 KB
testcase_15 AC 16 ms
12,204 KB
testcase_16 AC 17 ms
12,248 KB
testcase_17 AC 16 ms
12,488 KB
testcase_18 AC 16 ms
12,172 KB
testcase_19 AC 16 ms
12,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>T dup(T x, T y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
int keta(ll n) { int ret = 0; while (n>0) { n/=10; ret++; } return ret; }

#ifdef _DEBUG
inline void dump() { cerr << endl; }
template <typename Head> void dump(Head &&head) { cerr << head; dump(); }
template <typename Head, typename... Tail> void dump(Head &&head, Tail &&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do { cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif

template <typename T> struct edge {
  int src, to;
  T cost;
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
  operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;

const ll LINF = 1LL << 60;
const int INF = 1001001001;

/////////////////////////////////////////////////////////////////////

template<int mod>
struct ModInt {
  ll x;
  ModInt(ll x=0):x((x%mod+mod)%mod){}
  ModInt operator-() const { return ModInt(-x); }
  ModInt& operator+=(const ModInt a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  ModInt& operator-=(const ModInt a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  ModInt& operator*=(const ModInt a) { (x *= a.x) %= mod; return *this; }
  ModInt operator+(const ModInt a) const { return ModInt(*this)+=a; }
  ModInt operator-(const ModInt a) const { return ModInt(*this)-=a; }
  ModInt operator*(const ModInt a) const { return ModInt(*this)*=a; }
  ModInt pow(ll t) const {
    if (!t) return 1;
    ModInt a = *this, r = 1;
    while (t) {
      if (t & 1) r *= a;
      a *= a;
      t >>= 1;
    }
    return r;
  }
  ModInt inv() const {
    ll a = x;
    ll b = mod;
    ll c = 1, d = 0;
    while (b) {
      ll t = a/b;
      a -= t*b; swap(a, b);
      c -= t*d; swap(c, d);
    }
    c %= mod;
    if (c < 0) c += mod;
    return c;
  }
  ModInt& operator/=(const ModInt a) { return (*this) *= a.inv(); }
  ModInt operator/(const ModInt a) const { return ModInt(*this)/=a; }
  bool operator==(const ModInt a) const { return x == a.x; }
  bool operator!=(const ModInt a) const { return x != a.x; }
  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
  friend istream &operator>>(istream &is, ModInt &a) {
    ll t;
    is >> t;
    a = ModInt(t);
    return (is);
  }
};
const ll mod = 1000000007;
using mint = ModInt<mod>;

template<typename T, int mod>
struct Comb {
  vector<T> fact, finv, inv;
  Comb(int n) : fact(n, 1), finv(n, 1), inv(n, 1) { init(n); }
  void init(int n) {
    n = min(n, mod);
    fact.assign(n, 1), finv.assign(n, 1), inv.assign(n, 1);
    for (ll i=2; i<n; i++) {
      fact[i] = fact[i-1] * i % mod;
      inv[i] = mod - inv[mod%i] * (mod/i) % mod;
      finv[i] = finv[i-1] * inv[i] % mod;
    }
  }
  T lucas(int n, int r) {
    T ret = 1;
    while (n > 0) {
      ret *= ncr(n%mod, r%mod);
      if (ret <= 0) break;
      n /= mod, r /= mod;
    }
    return ret;
  }
  T ncr(int n, int r) {
    if (n<r || n<0 || r<0) return 0;
    if (n>=mod) return lucas(n, r);
    return fact[n] * (finv[r] * finv[n-r] % mod) % mod;
  }
  T nhr(int n, int r) { return ncr(n+r-1, r); }
  T npr(int n, int r) {
    if (n<r || n<0 || r<0) return 0;
    return fact[n] * finv[n-r] % mod;
  }
};
Comb<ll, mod> com(400010);

void solve()
{
  ll n,m; cin>>n>>m;

  mint ans = com.nhr(n+1, n) * 2*n;

  rep(i, m) {
    ll t,x,y; cin>>t>>x>>y;
    if (t == 1) {
      mint a = com.nhr(x+1, y);
      mint b = com.nhr(n-x, n-y);
      mint c = a * b;
      ans -= c;
    } else {
      mint a = com.nhr(y+1, x);
      mint b = com.nhr(n-y, n-x);
      mint c = a * b;
      ans -= c;
    }
  }
  cout << ans << "\n";

}

int main()
{
  int t;
  t = 1;
  // cin>>t;
  while (t--) solve();

  return 0;
}
0