oj.uz

Submission #379767

# Submission time Handle Problem Language Result Execution time Memory
379767 2021-03-19T09:16:17 Z farhan132 Asceticism (JOI18_asceticism) C++17
49 / 100
 149 ms 144236 KB 
/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < ll , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const ll N = 3005;

ll dp[N][N];

void solve(){
  
  ll n , k;
  cin >> n >> k;
  mem(dp, 0);
  for(ll i = 1; i <= n; i++){
    dp[i][1] = 1;
    for(ll j = 2; j <= i; j++){
      dp[i][j] = (dp[i-1][j] * j + dp[i-1][j-1] * (i - j + 1)) % mod;
    }
  }
  cout << dp[n][k] << '\n';
  return;
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
      ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //mem(cnt , 0);
    //mem(dp, 0);
    ll T = 1;
   // cin >> T; 
   // ll CT = 0;
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        solve();
    }
 
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 71020 KB Output is correct
2 Correct 41 ms 71148 KB Output is correct
3 Correct 46 ms 71020 KB Output is correct
4 Correct 39 ms 71020 KB Output is correct
5 Correct 40 ms 71020 KB Output is correct
6 Correct 40 ms 71020 KB Output is correct
7 Correct 40 ms 71020 KB Output is correct
8 Correct 42 ms 71020 KB Output is correct
9 Correct 41 ms 71052 KB Output is correct
10 Correct 39 ms 71020 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 71020 KB Output is correct
2 Correct 41 ms 71148 KB Output is correct
3 Correct 46 ms 71020 KB Output is correct
4 Correct 39 ms 71020 KB Output is correct
5 Correct 40 ms 71020 KB Output is correct
6 Correct 40 ms 71020 KB Output is correct
7 Correct 40 ms 71020 KB Output is correct
8 Correct 42 ms 71020 KB Output is correct
9 Correct 41 ms 71052 KB Output is correct
10 Correct 39 ms 71020 KB Output is correct
11 Correct 39 ms 71020 KB Output is correct
12 Correct 42 ms 71004 KB Output is correct
13 Correct 39 ms 71020 KB Output is correct
14 Correct 40 ms 71020 KB Output is correct
15 Correct 40 ms 71040 KB Output is correct
16 Correct 40 ms 71020 KB Output is correct
17 Correct 40 ms 71020 KB Output is correct
18 Correct 40 ms 71020 KB Output is correct
19 Correct 40 ms 71020 KB Output is correct
20 Correct 39 ms 71020 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 71020 KB Output is correct
2 Correct 41 ms 71148 KB Output is correct
3 Correct 46 ms 71020 KB Output is correct
4 Correct 39 ms 71020 KB Output is correct
5 Correct 40 ms 71020 KB Output is correct
6 Correct 40 ms 71020 KB Output is correct
7 Correct 40 ms 71020 KB Output is correct
8 Correct 42 ms 71020 KB Output is correct
9 Correct 41 ms 71052 KB Output is correct
10 Correct 39 ms 71020 KB Output is correct
11 Correct 39 ms 71020 KB Output is correct
12 Correct 42 ms 71004 KB Output is correct
13 Correct 39 ms 71020 KB Output is correct
14 Correct 40 ms 71020 KB Output is correct
15 Correct 40 ms 71040 KB Output is correct
16 Correct 40 ms 71020 KB Output is correct
17 Correct 40 ms 71020 KB Output is correct
18 Correct 40 ms 71020 KB Output is correct
19 Correct 40 ms 71020 KB Output is correct
20 Correct 39 ms 71020 KB Output is correct
21 Correct 42 ms 71020 KB Output is correct
22 Correct 42 ms 71148 KB Output is correct
23 Correct 41 ms 71020 KB Output is correct
24 Correct 41 ms 71040 KB Output is correct
25 Correct 40 ms 71020 KB Output is correct
26 Correct 41 ms 71020 KB Output is correct
27 Correct 47 ms 71020 KB Output is correct
28 Correct 40 ms 71040 KB Output is correct
29 Correct 39 ms 71020 KB Output is correct
30 Correct 47 ms 71020 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 71020 KB Output is correct
2 Correct 41 ms 71148 KB Output is correct
3 Correct 46 ms 71020 KB Output is correct
4 Correct 39 ms 71020 KB Output is correct
5 Correct 40 ms 71020 KB Output is correct
6 Correct 40 ms 71020 KB Output is correct
7 Correct 40 ms 71020 KB Output is correct
8 Correct 42 ms 71020 KB Output is correct
9 Correct 41 ms 71052 KB Output is correct
10 Correct 39 ms 71020 KB Output is correct
11 Correct 39 ms 71020 KB Output is correct
12 Correct 42 ms 71004 KB Output is correct
13 Correct 39 ms 71020 KB Output is correct
14 Correct 40 ms 71020 KB Output is correct
15 Correct 40 ms 71040 KB Output is correct
16 Correct 40 ms 71020 KB Output is correct
17 Correct 40 ms 71020 KB Output is correct
18 Correct 40 ms 71020 KB Output is correct
19 Correct 40 ms 71020 KB Output is correct
20 Correct 39 ms 71020 KB Output is correct
21 Correct 42 ms 71020 KB Output is correct
22 Correct 42 ms 71148 KB Output is correct
23 Correct 41 ms 71020 KB Output is correct
24 Correct 41 ms 71040 KB Output is correct
25 Correct 40 ms 71020 KB Output is correct
26 Correct 41 ms 71020 KB Output is correct
27 Correct 47 ms 71020 KB Output is correct
28 Correct 40 ms 71040 KB Output is correct
29 Correct 39 ms 71020 KB Output is correct
30 Correct 47 ms 71020 KB Output is correct
31 Runtime error 149 ms 144236 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -