oj.uz

Submission #338803

# Submission time Handle Problem Language Result Execution time Memory
338803 2020-12-24T00:07:01 Z alishahali1382 Asceticism (JOI18_asceticism) C++14
49 / 100
 600 ms 2048 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=100010;

ll n, m, k, u, v, x, y, t, a, b, ans;
ll F[MAXN], I[MAXN];

ll powmod(ll a, ll b){
	ll res=1;
	for (; b; b>>=1, a=a*a%mod) if (b&1) res=res*a%mod;
	return res;
}
ll nCr(ll n, ll r){
	if (r<0 || r>n) return 0;
	return F[n]*I[r]%mod*I[n-r]%mod;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	F[0]=1;
	for (int i=1; i<MAXN; i++) F[i]=F[i-1]*i%mod;
	I[MAXN-1]=powmod(F[MAXN-1], mod-2);
	for (int i=MAXN-1; i; i--) I[i-1]=I[i]*i%mod;
	cin>>n>>k;
	for (int i=0; i<=k; i++){
		for (int j=0; j<=k-i; j++){
			ll res=nCr(n-k+i, i)*powmod(k-i-j, n)%mod*nCr(k-i, j)%mod;
			if ((i+j)&1) res*=-1;
			ans=(ans + res)%mod;
		}
	}
	debug(ans)
	if (ans<0) ans+=mod;
	cout<<ans<<"\n";
	
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 2 ms 1900 KB Output is correct
4 Correct 2 ms 1900 KB Output is correct
5 Correct 2 ms 1904 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 3 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 2 ms 1900 KB Output is correct
4 Correct 2 ms 1900 KB Output is correct
5 Correct 2 ms 1904 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 3 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 2028 KB Output is correct
12 Correct 2 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 3 ms 1900 KB Output is correct
15 Correct 5 ms 1900 KB Output is correct
16 Correct 5 ms 1900 KB Output is correct
17 Correct 2 ms 1900 KB Output is correct
18 Correct 3 ms 1900 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 2 ms 1900 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 2 ms 1900 KB Output is correct
4 Correct 2 ms 1900 KB Output is correct
5 Correct 2 ms 1904 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 3 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 2028 KB Output is correct
12 Correct 2 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 3 ms 1900 KB Output is correct
15 Correct 5 ms 1900 KB Output is correct
16 Correct 5 ms 1900 KB Output is correct
17 Correct 2 ms 1900 KB Output is correct
18 Correct 3 ms 1900 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 2 ms 1900 KB Output is correct
21 Correct 2 ms 1900 KB Output is correct
22 Correct 3 ms 1900 KB Output is correct
23 Correct 9 ms 1900 KB Output is correct
24 Correct 10 ms 1900 KB Output is correct
25 Correct 33 ms 2048 KB Output is correct
26 Correct 33 ms 1900 KB Output is correct
27 Correct 33 ms 1900 KB Output is correct
28 Correct 11 ms 1900 KB Output is correct
29 Correct 3 ms 1900 KB Output is correct
30 Correct 34 ms 1900 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 2 ms 1900 KB Output is correct
4 Correct 2 ms 1900 KB Output is correct
5 Correct 2 ms 1904 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 3 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 2028 KB Output is correct
12 Correct 2 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 3 ms 1900 KB Output is correct
15 Correct 5 ms 1900 KB Output is correct
16 Correct 5 ms 1900 KB Output is correct
17 Correct 2 ms 1900 KB Output is correct
18 Correct 3 ms 1900 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 2 ms 1900 KB Output is correct
21 Correct 2 ms 1900 KB Output is correct
22 Correct 3 ms 1900 KB Output is correct
23 Correct 9 ms 1900 KB Output is correct
24 Correct 10 ms 1900 KB Output is correct
25 Correct 33 ms 2048 KB Output is correct
26 Correct 33 ms 1900 KB Output is correct
27 Correct 33 ms 1900 KB Output is correct
28 Correct 11 ms 1900 KB Output is correct
29 Correct 3 ms 1900 KB Output is correct
30 Correct 34 ms 1900 KB Output is correct
31 Correct 2 ms 1900 KB Output is correct
32 Correct 2 ms 1900 KB Output is correct
33 Execution timed out 971 ms 1960 KB Time limit exceeded
34 Halted 0 ms 0 KB -