oj.uz

Submission #220171

# Submission time Handle Problem Language Result Execution time Memory
220171 2020-04-07T07:46:15 Z patrikpavic2 Asceticism (JOI18_asceticism) C++17
4 / 100
 600 ms 36864 KB 
#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;
}

Compilation message

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.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 36736 KB Output is correct
2 Correct 34 ms 36736 KB Output is correct
3 Correct 33 ms 36736 KB Output is correct
4 Correct 34 ms 36736 KB Output is correct
5 Correct 33 ms 36736 KB Output is correct
6 Correct 22 ms 36728 KB Output is correct
7 Correct 23 ms 36736 KB Output is correct
8 Correct 22 ms 36864 KB Output is correct
9 Correct 22 ms 36736 KB Output is correct
10 Correct 22 ms 36736 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 36736 KB Output is correct
2 Correct 34 ms 36736 KB Output is correct
3 Correct 33 ms 36736 KB Output is correct
4 Correct 34 ms 36736 KB Output is correct
5 Correct 33 ms 36736 KB Output is correct
6 Correct 22 ms 36728 KB Output is correct
7 Correct 23 ms 36736 KB Output is correct
8 Correct 22 ms 36864 KB Output is correct
9 Correct 22 ms 36736 KB Output is correct
10 Correct 22 ms 36736 KB Output is correct
11 Execution timed out 1082 ms 36736 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 36736 KB Output is correct
2 Correct 34 ms 36736 KB Output is correct
3 Correct 33 ms 36736 KB Output is correct
4 Correct 34 ms 36736 KB Output is correct
5 Correct 33 ms 36736 KB Output is correct
6 Correct 22 ms 36728 KB Output is correct
7 Correct 23 ms 36736 KB Output is correct
8 Correct 22 ms 36864 KB Output is correct
9 Correct 22 ms 36736 KB Output is correct
10 Correct 22 ms 36736 KB Output is correct
11 Execution timed out 1082 ms 36736 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 36736 KB Output is correct
2 Correct 34 ms 36736 KB Output is correct
3 Correct 33 ms 36736 KB Output is correct
4 Correct 34 ms 36736 KB Output is correct
5 Correct 33 ms 36736 KB Output is correct
6 Correct 22 ms 36728 KB Output is correct
7 Correct 23 ms 36736 KB Output is correct
8 Correct 22 ms 36864 KB Output is correct
9 Correct 22 ms 36736 KB Output is correct
10 Correct 22 ms 36736 KB Output is correct
11 Execution timed out 1082 ms 36736 KB Time limit exceeded
12 Halted 0 ms 0 KB -