# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420478 | ACmachine | Security Gate (JOI18_security_gate) | C++17 | 5041 ms | 296 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 FOR(i, j, k, l) for(int i = (j); i < (k); i += (l))
#define FORD(i, j, k, l) for(int i = (j); i >= (k); i-=(l))
#define REP(i, n) FOR(i, 0, n, 1)
#define REPD(i, n) FORD(i, n, 0, 1)
typedef long long ll;
const int mod = (int)1e9 + 7;
int main(){
int n; cin >> n;
string s; cin >> s;
int m = 0;
REP(i, s.length()){
if(s[i] == 'x')
m++;
}
int ans = 0;
string ns;
vector<int> min_suf(n + 1);
vector<int> bal_suf(n + 1);
auto check = [&](string s){
int bal = 0;
min_suf[n] = bal_suf[n] = 0;
REPD(i, n - 1){
if(s[i] == '(')
bal++;
else
bal--;
bal_suf[i] = bal;
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... |