oj.uz

답안 #373913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373913 2021-03-06T04:36:29 Z i_am_noob Asceticism (JOI18_asceticism) C++14
100 / 100
 13 ms 2028 KB 
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2,avx512f")
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;

#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
#define inf 1010000000
//#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define ceiling(a,b) (((a)+(b)-1)/(b))
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {static int cnt=0;cerr << x << endl;cnt++;if(cnt>1000) exit(0);}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 826
#endif

inline char readchar(){
    const int maxn=1000000;
    static char buf[maxn],*p=buf,*q=buf;
    if(p==q&&(q=(p=buf)+fread(buf,1,maxn,stdin))==buf) return EOF;
    else return *p++;
}
inline int readint(){
    int c=readchar(),x=0,neg=0;
    while((c<'0'||c>'9')&&c!='-'&&c!=EOF) c=readchar();
    if(c=='-') neg=1,c=readchar();
    while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^'0'),c=readchar();
    return neg?-x:x;
}

const int Mod=1000000007,Mod2=998244353;
const int MOD=Mod;
const int maxn=100005;
//i_am_noob
int n,k;
ll ans,fact[maxn],invf[maxn];

ll Pow(ll a, int b){
    ll res=1;
    while(b){
        if(b&1) res=res*a%MOD;
        a=a*a%MOD,b>>=1;
    }
    return res;
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    #ifdef i_am_noob
    freopen("input1.txt","r",stdin);
    freopen("output1.txt","w",stdout);
    freopen("output2.txt","w",stderr);
    #endif
    fact[0]=1;
    rep2(i,1,maxn) fact[i]=fact[i-1]*i%MOD;
    invf[0]=invf[1]=1;
    rep2(i,2,maxn) invf[i]=invf[MOD%i]*(MOD-MOD/i)%MOD;
    rep2(i,2,maxn) invf[i]=invf[i-1]*invf[i]%MOD;
    cin >> n >> k;
    n--,k--;
    rep(k+1){
        ans+=Pow(k+1-i,n+1)*fact[n+2]%MOD*invf[i]%MOD*invf[n+2-i]%MOD*(i&1?-1:1);
        if(ans>=MOD) ans-=MOD;
        if(ans<0) ans+=MOD;
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1900 KB Output is correct
2 Correct 4 ms 1900 KB Output is correct
3 Correct 4 ms 1920 KB Output is correct
4 Correct 4 ms 1900 KB Output is correct
5 Correct 4 ms 1900 KB Output is correct
6 Correct 4 ms 1900 KB Output is correct
7 Correct 4 ms 1900 KB Output is correct
8 Correct 4 ms 1900 KB Output is correct
9 Correct 4 ms 1900 KB Output is correct
10 Correct 4 ms 1900 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1900 KB Output is correct
2 Correct 4 ms 1900 KB Output is correct
3 Correct 4 ms 1920 KB Output is correct
4 Correct 4 ms 1900 KB Output is correct
5 Correct 4 ms 1900 KB Output is correct
6 Correct 4 ms 1900 KB Output is correct
7 Correct 4 ms 1900 KB Output is correct
8 Correct 4 ms 1900 KB Output is correct
9 Correct 4 ms 1900 KB Output is correct
10 Correct 4 ms 1900 KB Output is correct
11 Correct 4 ms 1900 KB Output is correct
12 Correct 4 ms 1900 KB Output is correct
13 Correct 4 ms 1900 KB Output is correct
14 Correct 4 ms 1900 KB Output is correct
15 Correct 4 ms 1900 KB Output is correct
16 Correct 4 ms 1900 KB Output is correct
17 Correct 4 ms 1900 KB Output is correct
18 Correct 4 ms 1900 KB Output is correct
19 Correct 4 ms 1900 KB Output is correct
20 Correct 4 ms 1900 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1900 KB Output is correct
2 Correct 4 ms 1900 KB Output is correct
3 Correct 4 ms 1920 KB Output is correct
4 Correct 4 ms 1900 KB Output is correct
5 Correct 4 ms 1900 KB Output is correct
6 Correct 4 ms 1900 KB Output is correct
7 Correct 4 ms 1900 KB Output is correct
8 Correct 4 ms 1900 KB Output is correct
9 Correct 4 ms 1900 KB Output is correct
10 Correct 4 ms 1900 KB Output is correct
11 Correct 4 ms 1900 KB Output is correct
12 Correct 4 ms 1900 KB Output is correct
13 Correct 4 ms 1900 KB Output is correct
14 Correct 4 ms 1900 KB Output is correct
15 Correct 4 ms 1900 KB Output is correct
16 Correct 4 ms 1900 KB Output is correct
17 Correct 4 ms 1900 KB Output is correct
18 Correct 4 ms 1900 KB Output is correct
19 Correct 4 ms 1900 KB Output is correct
20 Correct 4 ms 1900 KB Output is correct
21 Correct 4 ms 1920 KB Output is correct
22 Correct 4 ms 1900 KB Output is correct
23 Correct 4 ms 1900 KB Output is correct
24 Correct 4 ms 1900 KB Output is correct
25 Correct 4 ms 2028 KB Output is correct
26 Correct 4 ms 1900 KB Output is correct
27 Correct 4 ms 1900 KB Output is correct
28 Correct 4 ms 1900 KB Output is correct
29 Correct 4 ms 1900 KB Output is correct
30 Correct 4 ms 1900 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1900 KB Output is correct
2 Correct 4 ms 1900 KB Output is correct
3 Correct 4 ms 1920 KB Output is correct
4 Correct 4 ms 1900 KB Output is correct
5 Correct 4 ms 1900 KB Output is correct
6 Correct 4 ms 1900 KB Output is correct
7 Correct 4 ms 1900 KB Output is correct
8 Correct 4 ms 1900 KB Output is correct
9 Correct 4 ms 1900 KB Output is correct
10 Correct 4 ms 1900 KB Output is correct
11 Correct 4 ms 1900 KB Output is correct
12 Correct 4 ms 1900 KB Output is correct
13 Correct 4 ms 1900 KB Output is correct
14 Correct 4 ms 1900 KB Output is correct
15 Correct 4 ms 1900 KB Output is correct
16 Correct 4 ms 1900 KB Output is correct
17 Correct 4 ms 1900 KB Output is correct
18 Correct 4 ms 1900 KB Output is correct
19 Correct 4 ms 1900 KB Output is correct
20 Correct 4 ms 1900 KB Output is correct
21 Correct 4 ms 1920 KB Output is correct
22 Correct 4 ms 1900 KB Output is correct
23 Correct 4 ms 1900 KB Output is correct
24 Correct 4 ms 1900 KB Output is correct
25 Correct 4 ms 2028 KB Output is correct
26 Correct 4 ms 1900 KB Output is correct
27 Correct 4 ms 1900 KB Output is correct
28 Correct 4 ms 1900 KB Output is correct
29 Correct 4 ms 1900 KB Output is correct
30 Correct 4 ms 1900 KB Output is correct
31 Correct 4 ms 1900 KB Output is correct
32 Correct 4 ms 1900 KB Output is correct
33 Correct 5 ms 1900 KB Output is correct
34 Correct 5 ms 1900 KB Output is correct
35 Correct 12 ms 1900 KB Output is correct
36 Correct 13 ms 2028 KB Output is correct
37 Correct 13 ms 1900 KB Output is correct
38 Correct 5 ms 1900 KB Output is correct
39 Correct 7 ms 1900 KB Output is correct
40 Correct 8 ms 1900 KB Output is correct