# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
814919 | andecaandeci | Tents (JOI18_tents) | C++17 | 616 ms | 524288 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.
#include <bits/stdc++.h>
#define int long long
#define REP(i,o,n) for(int i=o;i<n;i++)
#define pb push_back
#define fi first
#define se second
#define FORI(v) for(auto i:v)
#define FORJ(v) for(auto j:v)
#define SETIO cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
using namespace std;
using pii = pair<int, int>;
const int mod = 1e9+7;
const int mi2 = (mod+1)/2;
int memo[400][400][400];
// int memo2[4000][4000];
// R-e-m---i-s---d-e-p-e-n-d-e-n-t---o-n---z-e-r-o---a-n-d---o-n-e-?-?-?-?-?-
int dp(int zero, int one, int rem) {
if(zero<0)return 0;
if(one<0)return 0;
if(rem<0)return 0;
if(rem==0){
int a = 1;
REP(i,0,one)a*=4,a%=mod;
return a;
}
int &ans=memo[zero][one][rem];
if(ans!=-1)return ans;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |