#675854 (C++14) No.1596 Distance Sum in 2D Plane

• 問題: No.1596 Distance Sum in 2D Plane
• ユーザー: dekomori_sanae
• 提出日時: 2021-07-09 21:51:10
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 478 ms / 2,000 ms
• コード長: 2,122 bytes
• コンパイル時間: 810 ms
• コンパイル使用メモリ: 98,572 KB
• 実行使用メモリ: 9,796 KB
• 最終ジャッジ日時: 2024-07-01 15:58:20
• 合計ジャッジ時間: 10,255 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 17

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX = 400010;
// a^n (mod.MOD)を求める。計算量はO(logn)
ll modpow(ll a, ll n, ll MOD = mod) {
    if(n == 0) {
        return 1;
    }
    if(n%2 == 1) {
        return (a * modpow(a, n-1, MOD)) % MOD;
    }
    return (modpow(a, n/2, MOD) * modpow(a, n/2, MOD)) % MOD;
}
ll inverse(ll a) {
    return modpow(a, mod - 2);
}
ll fact[MAX];  // fact[i] : iの階乗のmod
ll invfact[MAX];  // invfact[i] : iの階乗の逆数のmod
void init() {
    fact[0] = invfact[0] = 1;
    for(ll i = 1; i < MAX; i++) {
        fact[i] = (i * fact[i-1]) % mod;
        invfact[i] = inverse(fact[i]);
    }
}
// nCrをO(n)で求める。 
ll Comb(ll n, ll r) {
    if(r < 0 || n < 0 || n < r) {
        return 0;
    }
    ll res = fact[n];
    res = (res * invfact[r]) % mod;
    res = (res * invfact[n-r]) % mod;
    return res;
}
 
int main() {
    ll n, m;
    cin >> n >> m;
    init();
    ll a = 2*n * Comb(2*n, n) % mod;
    ll b = 0;
    rep(i, m) {
        ll t, x, y;
        cin >> t >> x >> y;
        if(t == 1) {
            b += Comb(x + y, x) * Comb((n - (x + 1)) + (n - y), n - y) % mod;
        }
        else if(t == 2) {
            b += Comb(x + y, x) * Comb((n - x) + (n - (y + 1)), n - x) % mod;
        }
        b %= mod;
    }
    
    out((a + mod - b) % mod);
    re0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX