結果
| 問題 | No.117 組み合わせの数 |
| ユーザー |
 小指が強い人
|
| 提出日時 | 2016-07-10 11:37:26 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
AC
|
| 実行時間 | 749 ms / 5,000 ms |
| コード長 | 3,752 bytes |
| コンパイル時間 | 1,410 ms |
| コンパイル使用メモリ | 168,968 KB |
| 実行使用メモリ | 51,456 KB |
| 最終ジャッジ日時 | 2024-10-13 10:04:55 |
| 合計ジャッジ時間 | 3,228 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:108:32: warning: ‘y’ may be used uninitialized in this function [-Wmaybe-uninitialized]
108 | ll r1=q.query(x-y+1,x+1);
| ~^~
ソースコード
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;
#define REP(i, a, n) for(ll i = a; i < n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007
template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
void write(long double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}
class RMQ{
int n;
vector<ll>dat;
public:
RMQ(int n_){
n=1;
while(n<n_)n*=2;
dat.resize(2*n-1);
for(int i=0;i<2*n-1;i++)dat[i]=1;
}
void update(int k,ll a){
k+=n-1;
dat[k]=a;
while(k>0){
k=(k-1)/2;
dat[k]=(dat[k*2+1]*dat[k*2+2])%MD;
}
}
ll query(int a,int b,int k=0,int l=0,int r=0){
if(r<=l)r=n;
if(r<=a || b<=l)return 1;
if(a<=l && r<=b)return dat[k];
ll vl=query(a,b,k*2+1,l,(r+l)/2);
ll vr=query(a,b,k*2+2,(r+l)/2,r);
return (vl*vr)%MD;
}
};
ull power( const ull& a, ull k, const ull& n )
{
if ( a == 0 || n == 0 ) return( 0 );
if ( k == 0 ) return( 1 % n );
ull currentMod = a % n;
ull currentValue = ( ( k & 1 ) > 0 ) ? currentMod : 1;
for ( k >>= 1 ; k > 0 ; k >>= 1 ) {
currentMod = ( currentMod * currentMod ) % n;
if ( ( k & 1 ) > 0 )
currentValue = ( currentValue * currentMod ) % n;
}
return( currentValue );
}
int main(void)
{
RMQ q(2000010);
vector<ll> fd(2000010,1);
REP(i,1,2000010){
q.update(i,i);
fd[i]=(fd[i-1]*power(i,MD-2,MD))%MD;
}
int t=read<int>();
rep(i,t){
string s=read<string>();
int x=atoi(s.data()+2),y;
rep(i,(int)s.size())
if(s[i]==',')
y=atoi(s.data()+i+1);
char c=s[0];
if(c=='P'){
if(x>=y)write(q.query(x-y+1,x+1));
else write(0);
}
else if(c=='C'){
if(x>=y){
ll r1=q.query(x-y+1,x+1);
write((r1*fd[y])%MD);
}
else write(0);
}
else if(c=='H'){
if(x==0&&y==0){
write(1);
continue;
}
x+=y-1;
if(x>=y){
ll r1=q.query(x-y+1,x+1);
write((r1*fd[y])%MD);
}
else write(0);
}
}
return 0;
}