oj.uz

Submission #237183

# Submission time Handle Problem Language Result Execution time Memory
237183 2020-06-05T06:25:18 Z shashwatchandra Asceticism (JOI18_asceticism) C++17
49 / 100
 49 ms 25088 KB 
/*input
3 2
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

const int N = 3001;
int dp[N][N];
int n,k;

void solve(){
    cin >> n >> k;
    dp[1][1] = 1;
    for(int i= 2;i <= n;i++){    
      RE(j,k){
        if(i < j)break;
        dp[i][j] = dp[i-1][j]*j+dp[i-1][j-1]*(i-(j-1));
        dp[i][j] %= MOD;
      }
    }
    cout << dp[n][k];
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 768 KB Output is correct
12 Correct 5 ms 1536 KB Output is correct
13 Correct 5 ms 1536 KB Output is correct
14 Correct 5 ms 1792 KB Output is correct
15 Correct 5 ms 1920 KB Output is correct
16 Correct 6 ms 1920 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1664 KB Output is correct
19 Correct 5 ms 896 KB Output is correct
20 Correct 5 ms 384 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 768 KB Output is correct
12 Correct 5 ms 1536 KB Output is correct
13 Correct 5 ms 1536 KB Output is correct
14 Correct 5 ms 1792 KB Output is correct
15 Correct 5 ms 1920 KB Output is correct
16 Correct 6 ms 1920 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1664 KB Output is correct
19 Correct 5 ms 896 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 7 ms 4480 KB Output is correct
22 Correct 7 ms 4352 KB Output is correct
23 Correct 10 ms 7168 KB Output is correct
24 Correct 8 ms 7296 KB Output is correct
25 Correct 9 ms 8320 KB Output is correct
26 Correct 9 ms 8448 KB Output is correct
27 Correct 9 ms 8320 KB Output is correct
28 Correct 7 ms 4224 KB Output is correct
29 Correct 5 ms 1280 KB Output is correct
30 Correct 9 ms 8192 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 768 KB Output is correct
12 Correct 5 ms 1536 KB Output is correct
13 Correct 5 ms 1536 KB Output is correct
14 Correct 5 ms 1792 KB Output is correct
15 Correct 5 ms 1920 KB Output is correct
16 Correct 6 ms 1920 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1664 KB Output is correct
19 Correct 5 ms 896 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 7 ms 4480 KB Output is correct
22 Correct 7 ms 4352 KB Output is correct
23 Correct 10 ms 7168 KB Output is correct
24 Correct 8 ms 7296 KB Output is correct
25 Correct 9 ms 8320 KB Output is correct
26 Correct 9 ms 8448 KB Output is correct
27 Correct 9 ms 8320 KB Output is correct
28 Correct 7 ms 4224 KB Output is correct
29 Correct 5 ms 1280 KB Output is correct
30 Correct 9 ms 8192 KB Output is correct
31 Runtime error 49 ms 25088 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -