Submission #379767

#	Time	Username	Problem	Language	Result	Execution time	Memory
379767		farhan132	Asceticism (JOI18_asceticism)	C++17	49 / 100	149 ms	144236 KiB

asceticism

/***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 / 4
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 0 / 51