답안 #61422 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
61422	2018-07-25T22:34:05 Z	Benq	Asceticism (JOI18_asceticism)	C++11	100 / 100	58 ms	1536 KB

asceticism

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100005;

template<int SZ> struct Combo {
    int fac[SZ+1], ifac[SZ+1];
    
    ll mul(ll a, ll b) { return a*b%MOD; }
    ll po (ll b, ll p) { return !p?1:po(b*b%MOD,p/2)*(p&1?b:1)%MOD; }
    ll inv (ll b) { return po(b,MOD-2); }

    Combo() {
        fac[0] = ifac[0] = 1;
    	FOR(i,1,SZ+1) 
    	    fac[i] = mul(i,fac[i-1]), ifac[i] = inv(fac[i]);
    }
    
    ll comb(ll a, ll b) {
        if (a < b || b < 0) return 0;
        return mul(mul(fac[a],ifac[b]),ifac[a-b]);
    }
};

Combo<MX> C;

ll po (ll b, ll p) { return !p?1:po(b*b%MOD,p/2)*(p&1?b:1)%MOD; }
ll inv (ll b) { return po(b,MOD-2); }

int ad(int a, int b) { return (a+b)%MOD; }
int sub(int a, int b) { return (a-b+MOD)%MOD; }
int mul(int a, int b) { return (ll)a*b%MOD; }

int N,K;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> K; K --;
    ll ans = 0;
    F0R(i,K+1) {
        ll pro = mul(po(K+1-i,N),C.comb(N+1,i));
        if (i&1) ans = sub(ans,pro);
        else ans = ad(ans,pro);
        // ans += (-1)^i*(K+1-i)^N*(N+1)Ci
    }
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	1148 KB	Output is correct
2	Correct	35 ms	1256 KB	Output is correct
3	Correct	36 ms	1312 KB	Output is correct
4	Correct	34 ms	1312 KB	Output is correct
5	Correct	35 ms	1312 KB	Output is correct
6	Correct	36 ms	1416 KB	Output is correct
7	Correct	34 ms	1416 KB	Output is correct
8	Correct	35 ms	1416 KB	Output is correct
9	Correct	39 ms	1416 KB	Output is correct
10	Correct	36 ms	1416 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	1148 KB	Output is correct
2	Correct	35 ms	1256 KB	Output is correct
3	Correct	36 ms	1312 KB	Output is correct
4	Correct	34 ms	1312 KB	Output is correct
5	Correct	35 ms	1312 KB	Output is correct
6	Correct	36 ms	1416 KB	Output is correct
7	Correct	34 ms	1416 KB	Output is correct
8	Correct	35 ms	1416 KB	Output is correct
9	Correct	39 ms	1416 KB	Output is correct
10	Correct	36 ms	1416 KB	Output is correct
11	Correct	35 ms	1416 KB	Output is correct
12	Correct	37 ms	1416 KB	Output is correct
13	Correct	36 ms	1416 KB	Output is correct
14	Correct	35 ms	1416 KB	Output is correct
15	Correct	37 ms	1512 KB	Output is correct
16	Correct	35 ms	1512 KB	Output is correct
17	Correct	36 ms	1512 KB	Output is correct
18	Correct	37 ms	1512 KB	Output is correct
19	Correct	38 ms	1512 KB	Output is correct
20	Correct	37 ms	1512 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	1148 KB	Output is correct
2	Correct	35 ms	1256 KB	Output is correct
3	Correct	36 ms	1312 KB	Output is correct
4	Correct	34 ms	1312 KB	Output is correct
5	Correct	35 ms	1312 KB	Output is correct
6	Correct	36 ms	1416 KB	Output is correct
7	Correct	34 ms	1416 KB	Output is correct
8	Correct	35 ms	1416 KB	Output is correct
9	Correct	39 ms	1416 KB	Output is correct
10	Correct	36 ms	1416 KB	Output is correct
11	Correct	35 ms	1416 KB	Output is correct
12	Correct	37 ms	1416 KB	Output is correct
13	Correct	36 ms	1416 KB	Output is correct
14	Correct	35 ms	1416 KB	Output is correct
15	Correct	37 ms	1512 KB	Output is correct
16	Correct	35 ms	1512 KB	Output is correct
17	Correct	36 ms	1512 KB	Output is correct
18	Correct	37 ms	1512 KB	Output is correct
19	Correct	38 ms	1512 KB	Output is correct
20	Correct	37 ms	1512 KB	Output is correct
21	Correct	36 ms	1512 KB	Output is correct
22	Correct	36 ms	1512 KB	Output is correct
23	Correct	36 ms	1512 KB	Output is correct
24	Correct	35 ms	1512 KB	Output is correct
25	Correct	35 ms	1512 KB	Output is correct
26	Correct	37 ms	1512 KB	Output is correct
27	Correct	35 ms	1512 KB	Output is correct
28	Correct	36 ms	1512 KB	Output is correct
29	Correct	35 ms	1512 KB	Output is correct
30	Correct	34 ms	1512 KB	Output is correct

Subtask #4
51.0 / 51.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	1148 KB	Output is correct
2	Correct	35 ms	1256 KB	Output is correct
3	Correct	36 ms	1312 KB	Output is correct
4	Correct	34 ms	1312 KB	Output is correct
5	Correct	35 ms	1312 KB	Output is correct
6	Correct	36 ms	1416 KB	Output is correct
7	Correct	34 ms	1416 KB	Output is correct
8	Correct	35 ms	1416 KB	Output is correct
9	Correct	39 ms	1416 KB	Output is correct
10	Correct	36 ms	1416 KB	Output is correct
11	Correct	35 ms	1416 KB	Output is correct
12	Correct	37 ms	1416 KB	Output is correct
13	Correct	36 ms	1416 KB	Output is correct
14	Correct	35 ms	1416 KB	Output is correct
15	Correct	37 ms	1512 KB	Output is correct
16	Correct	35 ms	1512 KB	Output is correct
17	Correct	36 ms	1512 KB	Output is correct
18	Correct	37 ms	1512 KB	Output is correct
19	Correct	38 ms	1512 KB	Output is correct
20	Correct	37 ms	1512 KB	Output is correct
21	Correct	36 ms	1512 KB	Output is correct
22	Correct	36 ms	1512 KB	Output is correct
23	Correct	36 ms	1512 KB	Output is correct
24	Correct	35 ms	1512 KB	Output is correct
25	Correct	35 ms	1512 KB	Output is correct
26	Correct	37 ms	1512 KB	Output is correct
27	Correct	35 ms	1512 KB	Output is correct
28	Correct	36 ms	1512 KB	Output is correct
29	Correct	35 ms	1512 KB	Output is correct
30	Correct	34 ms	1512 KB	Output is correct
31	Correct	35 ms	1512 KB	Output is correct
32	Correct	35 ms	1512 KB	Output is correct
33	Correct	36 ms	1512 KB	Output is correct
34	Correct	38 ms	1512 KB	Output is correct
35	Correct	51 ms	1512 KB	Output is correct
36	Correct	58 ms	1512 KB	Output is correct
37	Correct	58 ms	1536 KB	Output is correct
38	Correct	38 ms	1536 KB	Output is correct
39	Correct	45 ms	1536 KB	Output is correct
40	Correct	45 ms	1536 KB	Output is correct

답안 #61422

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