# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
861865 | iskhakkutbilim | parentrises (BOI18_parentrises) | C++17 | 1064 ms | 262144 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 ff first
#define ss second
#define all(a) a.begin(), a.end()
const int mod = 1e9 + 7;
int P;
int readable(string &s){
int n = s.size();
map<pair<int, int>, bool> dp[n];
if(s[0] == ')' or s[n-1] == '('){
return 0;
}
dp[0][{0, 1}] = 1, dp[0][{1, 0}] = 1;
dp[0][{1, 1}] = 1;
for(int i = 1;i < n; i++){
for(auto [pp, y] : dp[i-1]){
int x1 = pp.ff, x2 = pp.ss;
int ok = 0;
int c = s[i]==')' ? -1 : 1;
if(x2 + c >= 0){
ok++;
dp[i][{x1, x2 + c}] = 1;
}
if(x1 + c >= 0){
ok++;
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... |
# | 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... |