제출 #220171

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
220171		patrikpavic2	Asceticism (JOI18_asceticism)	C++17	4 / 100	1082 ms	36864 KiB

asceticism

#include <cstdio>
#include <cstring>
#include <vector>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair < int , int > pii;
typedef vector < int > vi;

const int N = 3e3 + 50;
const int MOD = 1e9 + 7;

inline int add(int A,int B){
	if(A + B >= MOD) return A + B - MOD;
	return A + B;
}

inline int mul(int A,int B){
	return (ll)A * B % MOD;
}

inline int sub(int A,int B){
	if(A - B < 0) return A - B + MOD;
	return A - B;
}

int dp[N][N], n, k;

int f(int x,int y,int lst){
	if(x == n) return (y == k);
	if(dp[x][y] != -1) return dp[x][y];
	int ret = 0;
	for(int nxt = 0;nxt <= x;nxt++){
		ret = add(ret, f(x + 1, y + (nxt <= lst), nxt));
	}
	return ret;
}

int main(){
	memset(dp, -1, sizeof(dp));
	scanf("%d%d", &n, &k);
	printf("%d\n", f(0, 0, 0));
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

asceticism.cpp: In function 'int main()':
asceticism.cpp:46: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 / 4
• Subtask 2: 0 / 20
• Subtask 3: 0 / 25
• Subtask 4: 0 / 51