oj.uz

Submission #370951

# Submission time Handle Problem Language Result Execution time Memory
370951 2021-02-25T08:05:23 Z blue Asceticism (JOI18_asceticism) C++17
100 / 100
 138 ms 1388 KB 
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

long long mod = 1'000'000'007;
long long fact[100002];

long long pow(long long b, long long e)
{
    if(e == 0) return 1;
    if(e % 2) return (b * pow(b, e-1)) % mod;
    else
    {
        long long temp = pow(b, e/2);
        return (temp*temp) % mod;
    }
}

long long choose(long long n, long long k)
{
    return (((fact[n] * pow(fact[k], mod-2)) % mod) * pow(fact[n-k], mod-2)) % mod;
}

int main()
{
    fact[0] = 1;
    for(long long i = 1; i <= 100001; i++) fact[i] = (fact[i-1] * i) % mod;

    long long N, K;
    cin >> N >> K;

    long long ans = 0;

    for(long long i = 0; i <= K; i++)
    {
        // long long temp = (mod +  (pow(-1, i) * ((choose(N-1, K) * pow(K-i, N)) % mod) )    ) % mod;
        long long temp = choose(N+1, i) * pow(K-i, N);
        temp = temp % mod;

        // cout << choose(N+1, K) << ' ' << pow(K-i, N) << '\n';
        // cout << temp << '\n';

        if(i % 2 == 0) ans = (ans + temp) % mod;
        else ans = (mod + ans - temp) % mod;
    }

    cout << ans << '\n';
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 3 ms 1132 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 2 ms 1132 KB Output is correct
6 Correct 2 ms 1132 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1132 KB Output is correct
9 Correct 2 ms 1260 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 3 ms 1132 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 2 ms 1132 KB Output is correct
6 Correct 2 ms 1132 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1132 KB Output is correct
9 Correct 2 ms 1260 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 2 ms 1132 KB Output is correct
16 Correct 2 ms 1132 KB Output is correct
17 Correct 2 ms 1132 KB Output is correct
18 Correct 2 ms 1132 KB Output is correct
19 Correct 2 ms 1132 KB Output is correct
20 Correct 2 ms 1132 KB Output is correct
21 Correct 2 ms 1132 KB Output is correct
22 Correct 2 ms 1132 KB Output is correct
23 Correct 3 ms 1132 KB Output is correct
24 Correct 3 ms 1132 KB Output is correct
25 Correct 3 ms 1132 KB Output is correct
26 Correct 3 ms 1132 KB Output is correct
27 Correct 3 ms 1132 KB Output is correct
28 Correct 3 ms 1132 KB Output is correct
29 Correct 2 ms 1132 KB Output is correct
30 Correct 3 ms 1132 KB Output is correct
31 Correct 2 ms 1132 KB Output is correct
32 Correct 2 ms 1132 KB Output is correct
33 Correct 8 ms 1152 KB Output is correct
34 Correct 23 ms 1160 KB Output is correct
35 Correct 115 ms 1260 KB Output is correct
36 Correct 128 ms 1260 KB Output is correct
37 Correct 138 ms 1160 KB Output is correct
38 Correct 19 ms 1132 KB Output is correct
39 Correct 46 ms 1132 KB Output is correct
40 Correct 58 ms 1388 KB Output is correct