oj.uz

답안 #417248

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417248 2021-06-03T13:57:39 Z MarcoMeijer Asceticism (JOI18_asceticism) C++14
49 / 100
 182 ms 143372 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//

// mod library
ll MOD=1e9+7;

inline ll mod(ll x_) {
    return (x_)%MOD;
}
ll modpow(ll x_, ll N_) {
    if(N_ == 0) return 1;
    ll a = modpow(x_,N_/2);
    a = (a*a)%MOD;
    if(N_%2) a = (a*x_)%MOD;
    return a;
}
ll inv(ll x_) {
    return modpow(x_, MOD-2);
}
class mi {
public:
    mi(ll v=0) {value = v;}
    mi  operator+ (ll rs) {return mod(value+rs);}
    mi  operator- (ll rs) {return mod(value-rs+MOD);}
    mi  operator* (ll rs) {return mod(value*rs);}
    mi  operator/ (ll rs) {return mod(value*inv(rs));}
    mi& operator+=(ll rs) {*this = (*this)+rs; return *this;}
    mi& operator-=(ll rs) {*this = (*this)-rs; return *this;}
    mi& operator*=(ll rs) {*this = (*this)*rs; return *this;}
    mi& operator/=(ll rs) {*this = (*this)/rs; return *this;}
    operator ll&() {return value;}

    ll value;
};
typedef vector<mi> vmi;

const int MX = 3001;
const int N = (1<<20);

int n, k;
mi dp[MX][MX];

void program() {
    IN(n,k);

    RE(x,MX) RE(y,x+1) {
        if(x) dp[x][y] = mi(y)*dp[x-1][y];
        if(x && y) dp[x][y] += mi(x-y+1)*dp[x-1][y-1];
        if(y == 0) dp[x][y] = 0;
        if(y == 1) dp[x][y] = 1;
    }

    OUTL((ll)dp[n][k]);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 70724 KB Output is correct
2 Correct 115 ms 70796 KB Output is correct
3 Correct 115 ms 70856 KB Output is correct
4 Correct 114 ms 70796 KB Output is correct
5 Correct 114 ms 70780 KB Output is correct
6 Correct 114 ms 70756 KB Output is correct
7 Correct 116 ms 70792 KB Output is correct
8 Correct 115 ms 70792 KB Output is correct
9 Correct 115 ms 70716 KB Output is correct
10 Correct 115 ms 70776 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 70724 KB Output is correct
2 Correct 115 ms 70796 KB Output is correct
3 Correct 115 ms 70856 KB Output is correct
4 Correct 114 ms 70796 KB Output is correct
5 Correct 114 ms 70780 KB Output is correct
6 Correct 114 ms 70756 KB Output is correct
7 Correct 116 ms 70792 KB Output is correct
8 Correct 115 ms 70792 KB Output is correct
9 Correct 115 ms 70716 KB Output is correct
10 Correct 115 ms 70776 KB Output is correct
11 Correct 115 ms 70700 KB Output is correct
12 Correct 115 ms 70852 KB Output is correct
13 Correct 119 ms 70788 KB Output is correct
14 Correct 115 ms 70732 KB Output is correct
15 Correct 116 ms 70732 KB Output is correct
16 Correct 116 ms 70692 KB Output is correct
17 Correct 114 ms 70808 KB Output is correct
18 Correct 114 ms 70796 KB Output is correct
19 Correct 114 ms 70732 KB Output is correct
20 Correct 114 ms 70796 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 70724 KB Output is correct
2 Correct 115 ms 70796 KB Output is correct
3 Correct 115 ms 70856 KB Output is correct
4 Correct 114 ms 70796 KB Output is correct
5 Correct 114 ms 70780 KB Output is correct
6 Correct 114 ms 70756 KB Output is correct
7 Correct 116 ms 70792 KB Output is correct
8 Correct 115 ms 70792 KB Output is correct
9 Correct 115 ms 70716 KB Output is correct
10 Correct 115 ms 70776 KB Output is correct
11 Correct 115 ms 70700 KB Output is correct
12 Correct 115 ms 70852 KB Output is correct
13 Correct 119 ms 70788 KB Output is correct
14 Correct 115 ms 70732 KB Output is correct
15 Correct 116 ms 70732 KB Output is correct
16 Correct 116 ms 70692 KB Output is correct
17 Correct 114 ms 70808 KB Output is correct
18 Correct 114 ms 70796 KB Output is correct
19 Correct 114 ms 70732 KB Output is correct
20 Correct 114 ms 70796 KB Output is correct
21 Correct 114 ms 70812 KB Output is correct
22 Correct 114 ms 70724 KB Output is correct
23 Correct 115 ms 70792 KB Output is correct
24 Correct 115 ms 70696 KB Output is correct
25 Correct 116 ms 70780 KB Output is correct
26 Correct 115 ms 70792 KB Output is correct
27 Correct 114 ms 70808 KB Output is correct
28 Correct 114 ms 70792 KB Output is correct
29 Correct 114 ms 70832 KB Output is correct
30 Correct 114 ms 70724 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 70724 KB Output is correct
2 Correct 115 ms 70796 KB Output is correct
3 Correct 115 ms 70856 KB Output is correct
4 Correct 114 ms 70796 KB Output is correct
5 Correct 114 ms 70780 KB Output is correct
6 Correct 114 ms 70756 KB Output is correct
7 Correct 116 ms 70792 KB Output is correct
8 Correct 115 ms 70792 KB Output is correct
9 Correct 115 ms 70716 KB Output is correct
10 Correct 115 ms 70776 KB Output is correct
11 Correct 115 ms 70700 KB Output is correct
12 Correct 115 ms 70852 KB Output is correct
13 Correct 119 ms 70788 KB Output is correct
14 Correct 115 ms 70732 KB Output is correct
15 Correct 116 ms 70732 KB Output is correct
16 Correct 116 ms 70692 KB Output is correct
17 Correct 114 ms 70808 KB Output is correct
18 Correct 114 ms 70796 KB Output is correct
19 Correct 114 ms 70732 KB Output is correct
20 Correct 114 ms 70796 KB Output is correct
21 Correct 114 ms 70812 KB Output is correct
22 Correct 114 ms 70724 KB Output is correct
23 Correct 115 ms 70792 KB Output is correct
24 Correct 115 ms 70696 KB Output is correct
25 Correct 116 ms 70780 KB Output is correct
26 Correct 115 ms 70792 KB Output is correct
27 Correct 114 ms 70808 KB Output is correct
28 Correct 114 ms 70792 KB Output is correct
29 Correct 114 ms 70832 KB Output is correct
30 Correct 114 ms 70724 KB Output is correct
31 Runtime error 182 ms 143372 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -