답안 #83920 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83920	2018-11-11T16:56:09 Z	RezwanArefin01	Asceticism (JOI18_asceticism)	C++17	100 / 100	25 ms	1808 KB

asceticism

///usr/bin/g++ -O2 $0 -o ${0%.cpp} && echo "----------" && ./${0%.cpp}; exit;
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii; 

const int N = 1e5 + 10;
const int mod = 1e9 + 7;

int fact[N], inv[N]; 

inline int Pow(int a, int p) {
	int ret = 1; while(p) {
		if(p & 1) ret = (ll) ret * a % mod;
		a = (ll) a * a % mod;
		p >>= 1;
	} return ret;
}

int C(int n, int r) { 
    int ret = (ll) fact[n] * inv[r] % mod;
    return (ll) ret * inv[n - r] % mod; 
}

int main() {
    fact[0] = 1; 
    for(int i = 1; i < N; i++) 
        fact[i] = (ll) fact[i - 1] * i % mod; 
    inv[N - 1] = Pow(fact[N - 1], mod - 2); 
    for(int i = N - 2; i >= 0; i--) 
        inv[i] = (ll) inv[i + 1] * (i + 1) % mod;

    int n, k; scanf("%d %d", &n, &k); 

    int ans = 0; 
    for(int i = 0; i <= k; i++) {
        int add = C(n, i); 
        int x = Pow(k - i, n); 
        if(i <= k - 1) {
            x -= Pow(k - i - 1, n); 
            if(x < 0) x += mod; 
        }
        add = (ll) add * x % mod; 
        if(i & 1) ans -= add;
        else ans += add;
        if(ans >= mod) ans -= mod;
        if(ans < 0) ans += mod;
    }
    printf("%d\n", ans); 
}

Compilation message

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

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	1144 KB	Output is correct
2	Correct	4 ms	1144 KB	Output is correct
3	Correct	4 ms	1176 KB	Output is correct
4	Correct	4 ms	1180 KB	Output is correct
5	Correct	5 ms	1232 KB	Output is correct
6	Correct	4 ms	1332 KB	Output is correct
7	Correct	5 ms	1348 KB	Output is correct
8	Correct	4 ms	1440 KB	Output is correct
9	Correct	5 ms	1572 KB	Output is correct
10	Correct	4 ms	1572 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	1144 KB	Output is correct
2	Correct	4 ms	1144 KB	Output is correct
3	Correct	4 ms	1176 KB	Output is correct
4	Correct	4 ms	1180 KB	Output is correct
5	Correct	5 ms	1232 KB	Output is correct
6	Correct	4 ms	1332 KB	Output is correct
7	Correct	5 ms	1348 KB	Output is correct
8	Correct	4 ms	1440 KB	Output is correct
9	Correct	5 ms	1572 KB	Output is correct
10	Correct	4 ms	1572 KB	Output is correct
11	Correct	4 ms	1572 KB	Output is correct
12	Correct	4 ms	1572 KB	Output is correct
13	Correct	4 ms	1572 KB	Output is correct
14	Correct	5 ms	1572 KB	Output is correct
15	Correct	4 ms	1572 KB	Output is correct
16	Correct	4 ms	1572 KB	Output is correct
17	Correct	4 ms	1572 KB	Output is correct
18	Correct	4 ms	1572 KB	Output is correct
19	Correct	4 ms	1572 KB	Output is correct
20	Correct	4 ms	1572 KB	Output is correct

Subtask #3
25.0 / 25.0

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

Subtask #4
51.0 / 51.0

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

답안 #83920

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 20.0 / 20.0

Subtask #3 25.0 / 25.0

Subtask #4 51.0 / 51.0

Subtask #1
4.0 / 4.0

Subtask #2
20.0 / 20.0

Subtask #3
25.0 / 25.0

Subtask #4
51.0 / 51.0