Submission #343876

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
343876	2021-01-04T16:33:29 Z	ignaciocanta	Asceticism (JOI18_asceticism)	C++14	100 / 100	33 ms	1280 KB

asceticism

#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <utility>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
using pi = pair<tint,tint>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;

#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert

#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7;
const int mod = 998244353;
const int MX = 1005; 
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-8;
 
const int dx[4] = {0, 0, -1, 1};
const int dy[4] = {1, -1, 0, 0};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redonde p abajo
 
void NACHO(string name = "lightson"){
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen((name+".in").c_str(), "r", stdin);
    //freopen((name+".out").c_str(), "w", stdout);
}

tint fact[100005];

void fill(){
	fact[0] = 1LL;
	FOR(i, 1, 100002){
		fact[i] = (fact[i-1] * i % MOD) % MOD;
	}
}

tint bexp(tint a, tint b){
	a %= MOD;
	tint ret = 1;
	while(b > 0){
		if(b & 1) ret = ret * a % MOD;
		a = a * a % MOD; 
		b >>= 1;
	}
	return ret;
}

tint inv(tint a){
	return bexp(a, MOD-2);
}

tint binom(tint a, tint b){
	tint u = fact[a];
	tint d = (fact[b] * fact[a-b]) % MOD;
	return (u * inv(d)) % MOD;
}

int main(){
	NACHO();
	tint a, b; cin >> a >> b;
	b = a-b;
	fill();
	tint ret = 0;
	F0R(i, b+1){
		ret += (bexp(-1, i) * binom(a+1, i) % MOD * bexp(b + 1 - i, a) % MOD) % MOD;
	}
	cout << ((ret % MOD) + MOD) % MOD<< endl;
}

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	1132 KB	Output is correct
3	Correct	2 ms	1132 KB	Output is correct
4	Correct	1 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	1 ms	1132 KB	Output is correct
8	Correct	2 ms	1132 KB	Output is correct
9	Correct	2 ms	1132 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	1132 KB	Output is correct
3	Correct	2 ms	1132 KB	Output is correct
4	Correct	1 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	1 ms	1132 KB	Output is correct
8	Correct	2 ms	1132 KB	Output is correct
9	Correct	2 ms	1132 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	1152 KB	Output is correct
13	Correct	2 ms	1132 KB	Output is correct
14	Correct	2 ms	1152 KB	Output is correct
15	Correct	1 ms	1132 KB	Output is correct
16	Correct	1 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	1132 KB	Output is correct
3	Correct	2 ms	1132 KB	Output is correct
4	Correct	1 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	1 ms	1132 KB	Output is correct
8	Correct	2 ms	1132 KB	Output is correct
9	Correct	2 ms	1132 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	1152 KB	Output is correct
13	Correct	2 ms	1132 KB	Output is correct
14	Correct	2 ms	1152 KB	Output is correct
15	Correct	1 ms	1132 KB	Output is correct
16	Correct	1 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	1280 KB	Output is correct
22	Correct	2 ms	1132 KB	Output is correct
23	Correct	2 ms	1132 KB	Output is correct
24	Correct	2 ms	1152 KB	Output is correct
25	Correct	2 ms	1132 KB	Output is correct
26	Correct	2 ms	1132 KB	Output is correct
27	Correct	2 ms	1132 KB	Output is correct
28	Correct	2 ms	1132 KB	Output is correct
29	Correct	2 ms	1132 KB	Output is correct
30	Correct	2 ms	1152 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	1132 KB	Output is correct
3	Correct	2 ms	1132 KB	Output is correct
4	Correct	1 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	1 ms	1132 KB	Output is correct
8	Correct	2 ms	1132 KB	Output is correct
9	Correct	2 ms	1132 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	1152 KB	Output is correct
13	Correct	2 ms	1132 KB	Output is correct
14	Correct	2 ms	1152 KB	Output is correct
15	Correct	1 ms	1132 KB	Output is correct
16	Correct	1 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	1280 KB	Output is correct
22	Correct	2 ms	1132 KB	Output is correct
23	Correct	2 ms	1132 KB	Output is correct
24	Correct	2 ms	1152 KB	Output is correct
25	Correct	2 ms	1132 KB	Output is correct
26	Correct	2 ms	1132 KB	Output is correct
27	Correct	2 ms	1132 KB	Output is correct
28	Correct	2 ms	1132 KB	Output is correct
29	Correct	2 ms	1132 KB	Output is correct
30	Correct	2 ms	1152 KB	Output is correct
31	Correct	31 ms	1132 KB	Output is correct
32	Correct	33 ms	1132 KB	Output is correct
33	Correct	29 ms	1132 KB	Output is correct
34	Correct	27 ms	1132 KB	Output is correct
35	Correct	6 ms	1132 KB	Output is correct
36	Correct	3 ms	1132 KB	Output is correct
37	Correct	2 ms	1132 KB	Output is correct
38	Correct	2 ms	1132 KB	Output is correct
39	Correct	13 ms	1132 KB	Output is correct
40	Correct	18 ms	1132 KB	Output is correct

Submission #343876

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