oj.uz

답안 #699785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699785 2023-02-18T02:41:49 Z cig32 Asceticism (JOI18_asceticism) C++17
49 / 100
 104 ms 262144 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }

void solve(int tc) {
  // Wtf eulerian numbers
  // Is this gen fun or am I dumb
  int n;
  cin >> n;

  int A[n+1][n+1];
  A[1][0] = 1;
  A[1][1] = 0;
  for(int i=2; i<=n; i++) {
    for(int j=0; j<i; j++) {
      if(j == 0) A[i][j] = 1;
      else A[i][j] = ((i-j) * A[i-1][j-1] + (j+1) * A[i-1][j]) % MOD;
    }
    A[i][i] = 0;
  }
  int k;
  cin >> k;
  cout << A[n][k-1] << "\n";
}

int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 968 KB Output is correct
17 Correct 0 ms 596 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 968 KB Output is correct
17 Correct 0 ms 596 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 5 ms 8148 KB Output is correct
22 Correct 6 ms 8148 KB Output is correct
23 Correct 4 ms 8148 KB Output is correct
24 Correct 5 ms 8164 KB Output is correct
25 Correct 5 ms 8148 KB Output is correct
26 Correct 4 ms 8148 KB Output is correct
27 Correct 5 ms 8132 KB Output is correct
28 Correct 2 ms 3156 KB Output is correct
29 Correct 1 ms 588 KB Output is correct
30 Correct 4 ms 8020 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 968 KB Output is correct
17 Correct 0 ms 596 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 5 ms 8148 KB Output is correct
22 Correct 6 ms 8148 KB Output is correct
23 Correct 4 ms 8148 KB Output is correct
24 Correct 5 ms 8164 KB Output is correct
25 Correct 5 ms 8148 KB Output is correct
26 Correct 4 ms 8148 KB Output is correct
27 Correct 5 ms 8132 KB Output is correct
28 Correct 2 ms 3156 KB Output is correct
29 Correct 1 ms 588 KB Output is correct
30 Correct 4 ms 8020 KB Output is correct
31 Runtime error 104 ms 262144 KB Execution killed with signal 9
32 Halted 0 ms 0 KB -