# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1020138 | bachhoangxuan | Security Gate (JOI18_security_gate) | C++17 | 1184 ms | 227668 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>
using namespace std;
#define int long long
const int mod=1e9+7;
const int maxn = 305;
int n,ans;
char s[maxn];
int f[maxn][maxn][maxn],g[maxn][2*maxn][3];
int F[maxn][maxn];
bool ok(int i,int x){
if(s[i]=='(' && x==-1) return false;
if(s[i]==')' && x==1) return false;
return true;
};
void dp1(){
F[0][0]=1;
for(int i=1;i<=n;i++){
for(int j=0;j<i;j++) for(int x:{-1,1}){
if(!ok(i,x)) continue;
int nj=j+x;
if(nj>=0) F[i][nj]=(F[i][nj]+F[i-1][j])%mod;
}
}
ans=(ans+F[n][0])%mod;
//cout << ans << '\n';
}
void dp2(){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |