Submission #152301

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
152301	2019-09-07T10:43:34 Z	cheetose	Asceticism (JOI18_asceticism)	C++11	49 / 100	159 ms	143124 KB

asceticism

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

ll d[3001][3001];
int n,k;
ll go(int N,int K)
{
	if(K==1 || K==N)return 1;
	ll &ret=d[N][K];
	if(~ret)return ret;
	return ret=(go(N-1,K)*K+go(N-1,K-1)*(N-K+1))%MOD;
}
int main() {
	MEM_1(d);
	scanf("%d%d",&n,&k);
	printf("%lld",go(n,k));
}

Compilation message

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

Subtask #1
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	70904 KB	Output is correct
2	Correct	60 ms	70776 KB	Output is correct
3	Correct	60 ms	70776 KB	Output is correct
4	Correct	59 ms	70904 KB	Output is correct
5	Correct	60 ms	70776 KB	Output is correct
6	Correct	60 ms	70876 KB	Output is correct
7	Correct	59 ms	70892 KB	Output is correct
8	Correct	60 ms	70748 KB	Output is correct
9	Correct	70 ms	70780 KB	Output is correct
10	Correct	60 ms	70776 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	70904 KB	Output is correct
2	Correct	60 ms	70776 KB	Output is correct
3	Correct	60 ms	70776 KB	Output is correct
4	Correct	59 ms	70904 KB	Output is correct
5	Correct	60 ms	70776 KB	Output is correct
6	Correct	60 ms	70876 KB	Output is correct
7	Correct	59 ms	70892 KB	Output is correct
8	Correct	60 ms	70748 KB	Output is correct
9	Correct	70 ms	70780 KB	Output is correct
10	Correct	60 ms	70776 KB	Output is correct
11	Correct	59 ms	70776 KB	Output is correct
12	Correct	60 ms	70772 KB	Output is correct
13	Correct	59 ms	70880 KB	Output is correct
14	Correct	62 ms	70776 KB	Output is correct
15	Correct	60 ms	70776 KB	Output is correct
16	Correct	59 ms	70828 KB	Output is correct
17	Correct	60 ms	70788 KB	Output is correct
18	Correct	60 ms	70900 KB	Output is correct
19	Correct	59 ms	70748 KB	Output is correct
20	Correct	59 ms	70944 KB	Output is correct

Subtask #3
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	70904 KB	Output is correct
2	Correct	60 ms	70776 KB	Output is correct
3	Correct	60 ms	70776 KB	Output is correct
4	Correct	59 ms	70904 KB	Output is correct
5	Correct	60 ms	70776 KB	Output is correct
6	Correct	60 ms	70876 KB	Output is correct
7	Correct	59 ms	70892 KB	Output is correct
8	Correct	60 ms	70748 KB	Output is correct
9	Correct	70 ms	70780 KB	Output is correct
10	Correct	60 ms	70776 KB	Output is correct
11	Correct	59 ms	70776 KB	Output is correct
12	Correct	60 ms	70772 KB	Output is correct
13	Correct	59 ms	70880 KB	Output is correct
14	Correct	62 ms	70776 KB	Output is correct
15	Correct	60 ms	70776 KB	Output is correct
16	Correct	59 ms	70828 KB	Output is correct
17	Correct	60 ms	70788 KB	Output is correct
18	Correct	60 ms	70900 KB	Output is correct
19	Correct	59 ms	70748 KB	Output is correct
20	Correct	59 ms	70944 KB	Output is correct
21	Correct	67 ms	70860 KB	Output is correct
22	Correct	60 ms	70816 KB	Output is correct
23	Correct	67 ms	70888 KB	Output is correct
24	Correct	67 ms	70904 KB	Output is correct
25	Correct	66 ms	70776 KB	Output is correct
26	Correct	60 ms	70904 KB	Output is correct
27	Correct	59 ms	70784 KB	Output is correct
28	Correct	61 ms	70908 KB	Output is correct
29	Correct	60 ms	70796 KB	Output is correct
30	Correct	61 ms	70904 KB	Output is correct

Subtask #4
0 / 51.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	70904 KB	Output is correct
2	Correct	60 ms	70776 KB	Output is correct
3	Correct	60 ms	70776 KB	Output is correct
4	Correct	59 ms	70904 KB	Output is correct
5	Correct	60 ms	70776 KB	Output is correct
6	Correct	60 ms	70876 KB	Output is correct
7	Correct	59 ms	70892 KB	Output is correct
8	Correct	60 ms	70748 KB	Output is correct
9	Correct	70 ms	70780 KB	Output is correct
10	Correct	60 ms	70776 KB	Output is correct
11	Correct	59 ms	70776 KB	Output is correct
12	Correct	60 ms	70772 KB	Output is correct
13	Correct	59 ms	70880 KB	Output is correct
14	Correct	62 ms	70776 KB	Output is correct
15	Correct	60 ms	70776 KB	Output is correct
16	Correct	59 ms	70828 KB	Output is correct
17	Correct	60 ms	70788 KB	Output is correct
18	Correct	60 ms	70900 KB	Output is correct
19	Correct	59 ms	70748 KB	Output is correct
20	Correct	59 ms	70944 KB	Output is correct
21	Correct	67 ms	70860 KB	Output is correct
22	Correct	60 ms	70816 KB	Output is correct
23	Correct	67 ms	70888 KB	Output is correct
24	Correct	67 ms	70904 KB	Output is correct
25	Correct	66 ms	70776 KB	Output is correct
26	Correct	60 ms	70904 KB	Output is correct
27	Correct	59 ms	70784 KB	Output is correct
28	Correct	61 ms	70908 KB	Output is correct
29	Correct	60 ms	70796 KB	Output is correct
30	Correct	61 ms	70904 KB	Output is correct
31	Correct	60 ms	70812 KB	Output is correct
32	Runtime error	159 ms	143124 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
33	Halted	0 ms	0 KB	-

Submission #152301

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 20.0 / 20.0

Subtask #3 25.0 / 25.0

Subtask #4 0 / 51.0

Subtask #1
4.0 / 4.0

Subtask #2
20.0 / 20.0

Subtask #3
25.0 / 25.0

Subtask #4
0 / 51.0