oj.uz

Submission #342368

# Submission time Handle Problem Language Result Execution time Memory
342368 2021-01-02T01:12:05 Z jovan_b Asceticism (JOI18_asceticism) C++17
100 / 100
 80 ms 2028 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

#define pb push_back

const int MOD = 1000000007;

int add(int a, int b){
    a += b;
    if(a >= MOD) a -= MOD;
    return a;
}

int mul(int a, int b){
    return (1LL*a*b)%MOD;
}

int pw(int a, int b){
    if(b == 0) return 1;
    int res = pw(a, b/2);
    res = mul(res, res);
    if(b%2) res = mul(res, a);
    return res;
}

int fak[200005];
int inv[200005];

int bin(int n, int k){
    if(n < 0 || k < 0 || n < k) return 0;
    int res = fak[n];
    res = mul(res, inv[k]);
    res = mul(res, inv[n-k]);
    return res;
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int n, m;
    cin >> n >> m;
    m = n-m;
    int res = 0;
    fak[0] = inv[0] = 1;
    for(int i=1; i<=200000; i++){
        fak[i] = mul(fak[i-1], i);
        inv[i] = pw(fak[i], MOD-2);
    }
    for(int k=0; k<=m+1; k++){
        int tr = pw(m+1-k, n);
        tr = mul(tr, bin(n+1, k));
        if(k%2) res = add(res, MOD-tr);
        else res = add(res, tr);
    }
    cout << res << "\n";
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 1900 KB Output is correct
2 Correct 62 ms 1900 KB Output is correct
3 Correct 63 ms 1900 KB Output is correct
4 Correct 63 ms 1900 KB Output is correct
5 Correct 63 ms 1900 KB Output is correct
6 Correct 62 ms 1900 KB Output is correct
7 Correct 62 ms 1900 KB Output is correct
8 Correct 63 ms 1900 KB Output is correct
9 Correct 63 ms 2028 KB Output is correct
10 Correct 63 ms 1900 KB Output is correct
11 Correct 62 ms 1900 KB Output is correct
12 Correct 63 ms 1900 KB Output is correct
13 Correct 62 ms 1900 KB Output is correct
14 Correct 68 ms 2028 KB Output is correct
15 Correct 64 ms 2028 KB Output is correct
16 Correct 63 ms 1900 KB Output is correct
17 Correct 62 ms 2028 KB Output is correct
18 Correct 62 ms 1900 KB Output is correct
19 Correct 64 ms 1900 KB Output is correct
20 Correct 64 ms 1900 KB Output is correct
21 Correct 62 ms 1872 KB Output is correct
22 Correct 63 ms 1900 KB Output is correct
23 Correct 62 ms 1900 KB Output is correct
24 Correct 63 ms 1900 KB Output is correct
25 Correct 63 ms 2028 KB Output is correct
26 Correct 62 ms 1900 KB Output is correct
27 Correct 62 ms 1900 KB Output is correct
28 Correct 62 ms 1900 KB Output is correct
29 Correct 64 ms 1900 KB Output is correct
30 Correct 63 ms 1900 KB Output is correct
31 Correct 80 ms 1900 KB Output is correct
32 Correct 80 ms 1900 KB Output is correct
33 Correct 78 ms 1900 KB Output is correct
34 Correct 77 ms 1900 KB Output is correct
35 Correct 68 ms 1900 KB Output is correct
36 Correct 64 ms 1900 KB Output is correct
37 Correct 63 ms 1900 KB Output is correct
38 Correct 63 ms 1900 KB Output is correct
39 Correct 72 ms 1920 KB Output is correct
40 Correct 74 ms 1900 KB Output is correct