oj.uz

Submission #333783

# Submission time Handle Problem Language Result Execution time Memory
333783 2020-12-07T18:52:41 Z ignaciocanta Asceticism (JOI18_asceticism) C++14
49 / 100
 54 ms 25252 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define forsn(i, s, n) for(int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define trav(a, x) for(auto& a : x)
 
using vi = vector<int>;
using vl = vector<tint>;
using vb = vector<bool>;
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
#define esta(x,c) ((c).find(x) != (c).end())
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7;
const tint mod = 998244353;
const int MX = 2e5+5; 
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-8;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redonde p abajo
 
void NACHO(string name = "cardgame"){
    ios_base::sync_with_stdio(0); cin.tie(0);
   // freopen((name+".in").c_str(), "r", stdin);
   // freopen((name+".out").c_str(), "w", stdout);
}

tint A[3001][3002];

int main(){
    NACHO();
    int n, k; cin >> n >> k;
    forn(i, n+1) A[i][0] = 1;
    forsn(i, 1, n+1){
		forsn(j, 1, k+2){	
			A[i][j] = A[i-1][j]*(j+1) % MOD+A[i-1][j-1]*(i-j) % MOD;
			A[i][j] = ((A[i][j] % MOD)+MOD)%MOD;
		}
	}
	cout << A[n][k-1] << "\n";
}
//OVERFLOW!
//COTAS?
//CHEQUEA LAS CUENTAS

Subtask #1
4.0 / 4.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 368 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 1516 KB Output is correct
13 Correct 1 ms 1516 KB Output is correct
14 Correct 2 ms 1900 KB Output is correct
15 Correct 3 ms 2284 KB Output is correct
16 Correct 2 ms 2284 KB Output is correct
17 Correct 1 ms 1132 KB Output is correct
18 Correct 1 ms 1644 KB Output is correct
19 Correct 1 ms 1004 KB Output is correct
20 Correct 1 ms 364 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 368 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 1516 KB Output is correct
13 Correct 1 ms 1516 KB Output is correct
14 Correct 2 ms 1900 KB Output is correct
15 Correct 3 ms 2284 KB Output is correct
16 Correct 2 ms 2284 KB Output is correct
17 Correct 1 ms 1132 KB Output is correct
18 Correct 1 ms 1644 KB Output is correct
19 Correct 1 ms 1004 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 4460 KB Output is correct
22 Correct 3 ms 4460 KB Output is correct
23 Correct 8 ms 7936 KB Output is correct
24 Correct 8 ms 8300 KB Output is correct
25 Correct 14 ms 11884 KB Output is correct
26 Correct 14 ms 12140 KB Output is correct
27 Correct 14 ms 12140 KB Output is correct
28 Correct 5 ms 5356 KB Output is correct
29 Correct 1 ms 1280 KB Output is correct
30 Correct 14 ms 11884 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 368 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 1516 KB Output is correct
13 Correct 1 ms 1516 KB Output is correct
14 Correct 2 ms 1900 KB Output is correct
15 Correct 3 ms 2284 KB Output is correct
16 Correct 2 ms 2284 KB Output is correct
17 Correct 1 ms 1132 KB Output is correct
18 Correct 1 ms 1644 KB Output is correct
19 Correct 1 ms 1004 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 4460 KB Output is correct
22 Correct 3 ms 4460 KB Output is correct
23 Correct 8 ms 7936 KB Output is correct
24 Correct 8 ms 8300 KB Output is correct
25 Correct 14 ms 11884 KB Output is correct
26 Correct 14 ms 12140 KB Output is correct
27 Correct 14 ms 12140 KB Output is correct
28 Correct 5 ms 5356 KB Output is correct
29 Correct 1 ms 1280 KB Output is correct
30 Correct 14 ms 11884 KB Output is correct
31 Runtime error 54 ms 25252 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -