oj.uz

Submission #61421

# Submission time Handle Problem Language Result Execution time Memory
61421 2018-07-25T22:21:51 Z Benq Asceticism (JOI18_asceticism) C++11
49 / 100
 600 ms 1196 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int ad(int a, int b) { return (a+b)%MOD; }
int sub(int a, int b) { return (a-b+MOD)%MOD; }
int mul(int a, int b) { return (ll)a*b%MOD; }

int N,K;

vi tra(vi cur) {
    vi CUR(sz(cur)+1);
    F0R(i,sz(cur)) {
        CUR[i] = ad(CUR[i],mul(i+1,cur[i]));
        CUR[i+1] = ad(CUR[i+1],mul(sz(cur)-i,cur[i]));
    }
    return CUR;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> K; 
    vi cur = {1};
    FOR(i,2,N+1) cur = tra(cur);
    // for (int i: cur) cout << i << " ";
    cout << cur[K-1];
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 776 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 776 KB Output is correct
11 Correct 3 ms 776 KB Output is correct
12 Correct 3 ms 812 KB Output is correct
13 Correct 3 ms 812 KB Output is correct
14 Correct 3 ms 812 KB Output is correct
15 Correct 4 ms 812 KB Output is correct
16 Correct 3 ms 812 KB Output is correct
17 Correct 3 ms 812 KB Output is correct
18 Correct 3 ms 812 KB Output is correct
19 Correct 3 ms 812 KB Output is correct
20 Correct 3 ms 812 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 776 KB Output is correct
11 Correct 3 ms 776 KB Output is correct
12 Correct 3 ms 812 KB Output is correct
13 Correct 3 ms 812 KB Output is correct
14 Correct 3 ms 812 KB Output is correct
15 Correct 4 ms 812 KB Output is correct
16 Correct 3 ms 812 KB Output is correct
17 Correct 3 ms 812 KB Output is correct
18 Correct 3 ms 812 KB Output is correct
19 Correct 3 ms 812 KB Output is correct
20 Correct 3 ms 812 KB Output is correct
21 Correct 8 ms 812 KB Output is correct
22 Correct 7 ms 812 KB Output is correct
23 Correct 7 ms 812 KB Output is correct
24 Correct 9 ms 812 KB Output is correct
25 Correct 7 ms 812 KB Output is correct
26 Correct 8 ms 812 KB Output is correct
27 Correct 10 ms 812 KB Output is correct
28 Correct 4 ms 812 KB Output is correct
29 Correct 4 ms 812 KB Output is correct
30 Correct 7 ms 860 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 776 KB Output is correct
11 Correct 3 ms 776 KB Output is correct
12 Correct 3 ms 812 KB Output is correct
13 Correct 3 ms 812 KB Output is correct
14 Correct 3 ms 812 KB Output is correct
15 Correct 4 ms 812 KB Output is correct
16 Correct 3 ms 812 KB Output is correct
17 Correct 3 ms 812 KB Output is correct
18 Correct 3 ms 812 KB Output is correct
19 Correct 3 ms 812 KB Output is correct
20 Correct 3 ms 812 KB Output is correct
21 Correct 8 ms 812 KB Output is correct
22 Correct 7 ms 812 KB Output is correct
23 Correct 7 ms 812 KB Output is correct
24 Correct 9 ms 812 KB Output is correct
25 Correct 7 ms 812 KB Output is correct
26 Correct 8 ms 812 KB Output is correct
27 Correct 10 ms 812 KB Output is correct
28 Correct 4 ms 812 KB Output is correct
29 Correct 4 ms 812 KB Output is correct
30 Correct 7 ms 860 KB Output is correct
31 Execution timed out 1068 ms 1196 KB Time limit exceeded
32 Halted 0 ms 0 KB -