oj.uz

Submission #94533

# Submission time Handle Problem Language Result Execution time Memory
94533 2019-01-20T01:27:21 Z tincamatei Asceticism (JOI18_asceticism) C++14
49 / 100
 600 ms 71068 KB 
#include <bits/stdc++.h>

const int MAX_N = 3000;
const int MOD = 1000000007;
int dp[1+MAX_N][1+MAX_N];

int main() {
  int n, k;
  scanf("%d%d", &n, &k);

  dp[0][0] = 1;
  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= n; ++j) {
      dp[i][j] = ((long long)dp[i - 1][j] * j + (long long)dp[i - 1][j - 1] * (i - j + 1)) % MOD;
    }
  printf("%d", dp[n][k]);
  return 0;
}

Compilation message

asceticism.cpp: In function 'int main()':
asceticism.cpp:9:8: 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 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 764 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Correct 3 ms 1912 KB Output is correct
14 Correct 3 ms 1912 KB Output is correct
15 Correct 3 ms 1912 KB Output is correct
16 Correct 3 ms 1912 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1656 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 2 ms 376 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 764 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Correct 3 ms 1912 KB Output is correct
14 Correct 3 ms 1912 KB Output is correct
15 Correct 3 ms 1912 KB Output is correct
16 Correct 3 ms 1912 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1656 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 8 ms 8312 KB Output is correct
23 Correct 10 ms 8312 KB Output is correct
24 Correct 10 ms 8184 KB Output is correct
25 Correct 9 ms 8184 KB Output is correct
26 Correct 10 ms 8184 KB Output is correct
27 Correct 9 ms 8188 KB Output is correct
28 Correct 5 ms 4216 KB Output is correct
29 Correct 2 ms 1272 KB Output is correct
30 Correct 8 ms 8184 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 764 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Correct 3 ms 1912 KB Output is correct
14 Correct 3 ms 1912 KB Output is correct
15 Correct 3 ms 1912 KB Output is correct
16 Correct 3 ms 1912 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1656 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 8 ms 8312 KB Output is correct
23 Correct 10 ms 8312 KB Output is correct
24 Correct 10 ms 8184 KB Output is correct
25 Correct 9 ms 8184 KB Output is correct
26 Correct 10 ms 8184 KB Output is correct
27 Correct 9 ms 8188 KB Output is correct
28 Correct 5 ms 4216 KB Output is correct
29 Correct 2 ms 1272 KB Output is correct
30 Correct 8 ms 8184 KB Output is correct
31 Runtime error 670 ms 71068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -