oj.uz

Submission #128239

# Submission time Handle Problem Language Result Execution time Memory
128239 2019-07-10T14:58:51 Z RockyB Asceticism (JOI18_asceticism) C++17
49 / 100
 100 ms 56824 KB 
#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back

#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()

#define rep(a, b, c) for (int a = (b); (a) <= (c); ++a)
#define per(a, b, c) for (int a = (b); (a) >= (c); --a) 

#define nl '\n'
#define ioi exit(0);

using namespace std;

typedef long long ll;

const int MAX_N = (int)3e3 + 7;
const int mod = (int)1e9 + 7;


int n, k;

int c[MAX_N][MAX_N];

int bp(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = res * 1ll * x % mod;
    x = x * 1ll * x % mod, y >>= 1;
  }
  return res;
}

int main() {
  #ifdef IOI
    freopen ("in.txt", "r", stdin);
  #endif
  cin >> n >> k;
  rep(i, 0, n + 1) {
    c[i][0] = 1;
    rep(j, 1, i) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
    }
  }
  int ans = 0;
  k--;
  rep(i, 0, k) {
    int x = bp(-1, i) * 1ll * c[n + 1][i] % mod;
    x = x * 1ll * bp(k - i + 1, n) % mod;
    ans += x;
    ans %= mod;
    ans += mod;
    ans %= mod;
  }
  cout << ans;
    //cout << dp[n][k];
  ioi
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 2 ms 380 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 9 ms 376 KB Output is correct
2 Correct 2 ms 380 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 760 KB Output is correct
12 Correct 3 ms 1784 KB Output is correct
13 Correct 3 ms 1784 KB Output is correct
14 Correct 3 ms 1784 KB Output is correct
15 Correct 3 ms 1784 KB Output is correct
16 Correct 3 ms 1784 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1528 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 3 ms 376 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 2 ms 380 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 760 KB Output is correct
12 Correct 3 ms 1784 KB Output is correct
13 Correct 3 ms 1784 KB Output is correct
14 Correct 3 ms 1784 KB Output is correct
15 Correct 3 ms 1784 KB Output is correct
16 Correct 3 ms 1784 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1528 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 9 ms 6392 KB Output is correct
22 Correct 8 ms 6392 KB Output is correct
23 Correct 9 ms 6392 KB Output is correct
24 Correct 8 ms 6392 KB Output is correct
25 Correct 8 ms 6392 KB Output is correct
26 Correct 9 ms 6392 KB Output is correct
27 Correct 8 ms 6392 KB Output is correct
28 Correct 5 ms 3576 KB Output is correct
29 Correct 3 ms 1272 KB Output is correct
30 Correct 8 ms 6392 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 2 ms 380 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 760 KB Output is correct
12 Correct 3 ms 1784 KB Output is correct
13 Correct 3 ms 1784 KB Output is correct
14 Correct 3 ms 1784 KB Output is correct
15 Correct 3 ms 1784 KB Output is correct
16 Correct 3 ms 1784 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1528 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 9 ms 6392 KB Output is correct
22 Correct 8 ms 6392 KB Output is correct
23 Correct 9 ms 6392 KB Output is correct
24 Correct 8 ms 6392 KB Output is correct
25 Correct 8 ms 6392 KB Output is correct
26 Correct 9 ms 6392 KB Output is correct
27 Correct 8 ms 6392 KB Output is correct
28 Correct 5 ms 3576 KB Output is correct
29 Correct 3 ms 1272 KB Output is correct
30 Correct 8 ms 6392 KB Output is correct
31 Runtime error 100 ms 56824 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -