oj.uz

Submission #528801

# Submission time Handle Problem Language Result Execution time Memory
528801 2022-02-21T13:29:52 Z NaimSS Asceticism (JOI18_asceticism) C++14
49 / 100
 81 ms 146116 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
  b%=m;
  ll ans = 1;
  for (; e; b = b * b % m, e /= 2)
      if (e & 1) ans = ans * b % m;
  return ans;
}

// debug:
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ 
  cerr << ' ' << H; 
  dbg_out(T...); 
}
#ifdef LOCAL
#define dbg(...) cerr<<"(" << #__VA_ARGS__<<"):" , dbg_out(__VA_ARGS__) , cerr << endl
#else
#define dbg(...) 42
#endif
//

const int N = 3030;
ll dp[N][N];
const ll M = 1e9 + 7;



ll solve(int n,int k){
  ll &x = dp[n][k];
  if(x!=-1)return x;
  if(n==1){
    return x=(k==1); 
  }
  x = (solve(n-1,k) * (ll)k + (n-k+1) * (ll)solve(n-1,k-1))%M;
  return x;
}


int32_t main(){
  fastio;
  int nn,kk;
  ms(dp,-1);
  cin >> nn >> kk;
  cout << solve(nn,kk) << endl;

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 72152 KB Output is correct
2 Correct 27 ms 72140 KB Output is correct
3 Correct 27 ms 72128 KB Output is correct
4 Correct 27 ms 72044 KB Output is correct
5 Correct 28 ms 72140 KB Output is correct
6 Correct 28 ms 72096 KB Output is correct
7 Correct 32 ms 72084 KB Output is correct
8 Correct 28 ms 72080 KB Output is correct
9 Correct 28 ms 72148 KB Output is correct
10 Correct 28 ms 72116 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 72152 KB Output is correct
2 Correct 27 ms 72140 KB Output is correct
3 Correct 27 ms 72128 KB Output is correct
4 Correct 27 ms 72044 KB Output is correct
5 Correct 28 ms 72140 KB Output is correct
6 Correct 28 ms 72096 KB Output is correct
7 Correct 32 ms 72084 KB Output is correct
8 Correct 28 ms 72080 KB Output is correct
9 Correct 28 ms 72148 KB Output is correct
10 Correct 28 ms 72116 KB Output is correct
11 Correct 28 ms 72140 KB Output is correct
12 Correct 28 ms 72140 KB Output is correct
13 Correct 28 ms 72140 KB Output is correct
14 Correct 29 ms 72176 KB Output is correct
15 Correct 30 ms 72116 KB Output is correct
16 Correct 32 ms 72172 KB Output is correct
17 Correct 32 ms 72140 KB Output is correct
18 Correct 27 ms 72132 KB Output is correct
19 Correct 27 ms 72140 KB Output is correct
20 Correct 27 ms 72184 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 72152 KB Output is correct
2 Correct 27 ms 72140 KB Output is correct
3 Correct 27 ms 72128 KB Output is correct
4 Correct 27 ms 72044 KB Output is correct
5 Correct 28 ms 72140 KB Output is correct
6 Correct 28 ms 72096 KB Output is correct
7 Correct 32 ms 72084 KB Output is correct
8 Correct 28 ms 72080 KB Output is correct
9 Correct 28 ms 72148 KB Output is correct
10 Correct 28 ms 72116 KB Output is correct
11 Correct 28 ms 72140 KB Output is correct
12 Correct 28 ms 72140 KB Output is correct
13 Correct 28 ms 72140 KB Output is correct
14 Correct 29 ms 72176 KB Output is correct
15 Correct 30 ms 72116 KB Output is correct
16 Correct 32 ms 72172 KB Output is correct
17 Correct 32 ms 72140 KB Output is correct
18 Correct 27 ms 72132 KB Output is correct
19 Correct 27 ms 72140 KB Output is correct
20 Correct 27 ms 72184 KB Output is correct
21 Correct 36 ms 72216 KB Output is correct
22 Correct 35 ms 72236 KB Output is correct
23 Correct 39 ms 72112 KB Output is correct
24 Correct 36 ms 72224 KB Output is correct
25 Correct 37 ms 72200 KB Output is correct
26 Correct 37 ms 72112 KB Output is correct
27 Correct 37 ms 72140 KB Output is correct
28 Correct 31 ms 72136 KB Output is correct
29 Correct 28 ms 72116 KB Output is correct
30 Correct 36 ms 72100 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 72152 KB Output is correct
2 Correct 27 ms 72140 KB Output is correct
3 Correct 27 ms 72128 KB Output is correct
4 Correct 27 ms 72044 KB Output is correct
5 Correct 28 ms 72140 KB Output is correct
6 Correct 28 ms 72096 KB Output is correct
7 Correct 32 ms 72084 KB Output is correct
8 Correct 28 ms 72080 KB Output is correct
9 Correct 28 ms 72148 KB Output is correct
10 Correct 28 ms 72116 KB Output is correct
11 Correct 28 ms 72140 KB Output is correct
12 Correct 28 ms 72140 KB Output is correct
13 Correct 28 ms 72140 KB Output is correct
14 Correct 29 ms 72176 KB Output is correct
15 Correct 30 ms 72116 KB Output is correct
16 Correct 32 ms 72172 KB Output is correct
17 Correct 32 ms 72140 KB Output is correct
18 Correct 27 ms 72132 KB Output is correct
19 Correct 27 ms 72140 KB Output is correct
20 Correct 27 ms 72184 KB Output is correct
21 Correct 36 ms 72216 KB Output is correct
22 Correct 35 ms 72236 KB Output is correct
23 Correct 39 ms 72112 KB Output is correct
24 Correct 36 ms 72224 KB Output is correct
25 Correct 37 ms 72200 KB Output is correct
26 Correct 37 ms 72112 KB Output is correct
27 Correct 37 ms 72140 KB Output is correct
28 Correct 31 ms 72136 KB Output is correct
29 Correct 28 ms 72116 KB Output is correct
30 Correct 36 ms 72100 KB Output is correct
31 Runtime error 81 ms 146116 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -