Submission #528799

#	Time	Username	Problem	Language	Result	Execution time	Memory
528799		LucaDantas	Asceticism (JOI18_asceticism)	C++17	49 / 100	1078 ms	336 KiB

asceticism

#pragma optimize("unroll-for-loops")
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 1e5 + 10, mod = 1000000007;

int dp[2][maxn];

int main() {
	int n, k; scanf("%d %d", &n, &k);
	dp[0][0] = 1; --k; // já gasto um dia naturalmente que não conta
	for(int i = 0; i < n; i++) {
		for(int down = 0; down <= k; down++) {
			dp[1][down+1] += 1ll * (i - down) * dp[0][down] % mod;
			if(dp[1][down+1] >= mod) dp[1][down+1] -= mod;

			dp[1][down] += 1ll * (down + 1) * dp[0][down] % mod;
			if(dp[1][down] >= mod) dp[1][down] -= mod;
		}

		for(int down = 0; down <= k; down++)
			dp[0][down] = dp[1][down], dp[1][down] = 0;
	}
	printf("%d\n", dp[0][k]);
}

Compilation message (stderr)

asceticism.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("unroll-for-loops")
      | 
asceticism.cpp: In function 'int main()':
asceticism.cpp:10:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  int n, k; scanf("%d %d", &n, &k);
      |            ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 0 / 51