# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
448224 | cpp219 | 마스코트 (JOI13_mascots) | C++14 | 360 ms | 213276 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 3e3 + 3;
const ll mod = 1e9 + 7;
ll R,C,n,x,y,dp[N][N],c[N][N];
ll maxx,maxy,minx = mod,miny = mod;
ll fac[N*N],lim_ngang,lim_doc,pel;
ll g(ll k,ll n){
if (k == 0) return 1;
if (k > n) return 0;
if (k == n) return 1;
if (k == 1) return n;
if (c[k][n] != -1) return c[k][n];
return c[k][n] = (g(k,n - 1) + g(k - 1,n - 1))%mod;
}
ll f(ll cnt1,ll cnt2){
if (cnt1 == R&&cnt2 == C) return 1;
if (dp[cnt1][cnt2] != -1) return dp[cnt1][cnt2];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |