oj.uz

답안 #44071

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
44071 2018-03-29T15:40:58 Z zadrga Asceticism (JOI18_asceticism) C++14
4 / 100
 23 ms 2192 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 100111

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

ll fakt[maxn], inv[maxn];

ll fastexp(ll x, ll y){
	ll ret = 1LL;
	while(y){
		if(y & 1)
			ret = (ret * x) % MOD;

		x = (x * x) % MOD;
		y >>= 1;
	}
	return ret;
}

ll C(ll x, ll y){
	ll ret = fakt[x] * inv[y] % MOD * inv[x - y] % MOD;
	return ret;
}

ll eulerian_number(ll n, ll k){
	ll ans = 0LL;
	for(int i = 0; i <= k + 1; i++){
		ll cur = fastexp(-1LL, i) * C(n + 1LL, i) % MOD * fastexp(k + 1LL - i, n) % MOD;
		ans = (ans + cur) % MOD;
	}
	return ans;
}

void preprocess(){
	fakt[0] = inv[0] = 1LL;
	for(ll i = 1; i < maxn; i++){
		fakt[i] = (fakt[i - 1] * i) % MOD; 
		inv[i] = fastexp(fakt[i], MOD - 2);
	}
}

int main(){
	preprocess();

	ll n, k;
	scanf("%lld%lld", &n, &k);
	printf("%lld\n", eulerian_number(n, n - k) );

	return 0;
}

Compilation message

asceticism.cpp: In function 'int main()':
asceticism.cpp:57:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1912 KB Output is correct
2 Correct 19 ms 1912 KB Output is correct
3 Correct 19 ms 1944 KB Output is correct
4 Correct 20 ms 2124 KB Output is correct
5 Correct 19 ms 2124 KB Output is correct
6 Correct 20 ms 2192 KB Output is correct
7 Correct 21 ms 2192 KB Output is correct
8 Correct 20 ms 2192 KB Output is correct
9 Correct 21 ms 2192 KB Output is correct
10 Correct 20 ms 2192 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1912 KB Output is correct
2 Correct 19 ms 1912 KB Output is correct
3 Correct 19 ms 1944 KB Output is correct
4 Correct 20 ms 2124 KB Output is correct
5 Correct 19 ms 2124 KB Output is correct
6 Correct 20 ms 2192 KB Output is correct
7 Correct 21 ms 2192 KB Output is correct
8 Correct 20 ms 2192 KB Output is correct
9 Correct 21 ms 2192 KB Output is correct
10 Correct 20 ms 2192 KB Output is correct
11 Correct 23 ms 2192 KB Output is correct
12 Correct 21 ms 2192 KB Output is correct
13 Correct 20 ms 2192 KB Output is correct
14 Correct 20 ms 2192 KB Output is correct
15 Incorrect 21 ms 2192 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1912 KB Output is correct
2 Correct 19 ms 1912 KB Output is correct
3 Correct 19 ms 1944 KB Output is correct
4 Correct 20 ms 2124 KB Output is correct
5 Correct 19 ms 2124 KB Output is correct
6 Correct 20 ms 2192 KB Output is correct
7 Correct 21 ms 2192 KB Output is correct
8 Correct 20 ms 2192 KB Output is correct
9 Correct 21 ms 2192 KB Output is correct
10 Correct 20 ms 2192 KB Output is correct
11 Correct 23 ms 2192 KB Output is correct
12 Correct 21 ms 2192 KB Output is correct
13 Correct 20 ms 2192 KB Output is correct
14 Correct 20 ms 2192 KB Output is correct
15 Incorrect 21 ms 2192 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1912 KB Output is correct
2 Correct 19 ms 1912 KB Output is correct
3 Correct 19 ms 1944 KB Output is correct
4 Correct 20 ms 2124 KB Output is correct
5 Correct 19 ms 2124 KB Output is correct
6 Correct 20 ms 2192 KB Output is correct
7 Correct 21 ms 2192 KB Output is correct
8 Correct 20 ms 2192 KB Output is correct
9 Correct 21 ms 2192 KB Output is correct
10 Correct 20 ms 2192 KB Output is correct
11 Correct 23 ms 2192 KB Output is correct
12 Correct 21 ms 2192 KB Output is correct
13 Correct 20 ms 2192 KB Output is correct
14 Correct 20 ms 2192 KB Output is correct
15 Incorrect 21 ms 2192 KB Output isn't correct
16 Halted 0 ms 0 KB -