#233530 (C++11) No.645 Count Permutation

• 問題: No.645 Count Permutation
• ユーザー: rickytheta
• 提出日時: 2018-02-02 22:53:43
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 178 ms / 2,000 ms
• コード長: 1,983 bytes
• コンパイル時間: 1,816 ms
• コンパイル使用メモリ: 169,772 KB
• 実行使用メモリ: 55,188 KB
• 最終ジャッジ日時: 2024-12-31 08:02:32
• 合計ジャッジ時間: 4,592 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
other	AC * 34

ソースコード

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
97
98
99
100
101
102
103
104
105
106
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()
#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))
// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
int n;
ll l,r;
ll fact[125252];
ll ifact[125252];
ll modinv(ll a){
  ll r=1;
  ll b=MOD-2;
  while(b){
    if(b&1)r=r*a%MOD;
    a=a*a%MOD;
    b>>=1;
  }
  return r;
}
ll dp[125252][61];
int main(){
  cin>>n>>l>>r;
  
  if(false){
    map<vi,int> cnt;
    map<vi,vector<vi>> lst;
    vi v(n);
    REP(i,n)v[i] = i+1;
    do{
      vi x = v;
      REP(i,n-1){
        if(x[i] > x[i+1])swap(x[i],x[i+1]);
      }
      cnt[x]++;
      lst[x].push_back(v);
    }while(next_permutation(ALL(v)));
    int ans = 0;
    for(auto P : cnt){
      vi V = P.first;
      int cnt = P.second;
      printf("%d\n",cnt);
      if(l<=cnt && cnt<=r){
        ans++;
        DEBUG_VEC(V);
      }
    }
    printf("%d\n",ans);
  }
  fact[0] = 1;
  FOR(i,1,125252)fact[i]=fact[i-1]*i%MOD;
  REP(i,125252)ifact[i]=modinv(fact[i]);
  
  // dp
  dp[0][0] = 1;
  FOR(k,1,60){
    ll sum = 0;
    FOR(l,1,n+1){
      sum += dp[l-1][k-1] * ifact[l-1] % MOD;
      sum %= MOD;
      dp[l][k] = fact[l-1] * sum % MOD;
    }
  }
  // calc
  ll ans = 0;
  // cnt == 0
  if(l==0){
    ans = fact[n-1] * (n-1) % MOD;
  }
  // cnt >= 2
  int x = 1;
  while((1ll<<x) <= r){
    if((1ll<<x) < l){
      x++;continue;
    }
    ans += dp[n-1][x] % MOD;
    ans %= MOD;
    x++;
  }
  printf("%lld\n",ans);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX