/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Accepted 2ms 540.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 1ms 560.0 KiB
#5 Accepted 1ms 584.0 KiB
#6 Accepted 1ms 540.0 KiB
#7 Accepted 1ms 540.0 KiB
#8 Accepted 1ms 556.0 KiB
#9 Accepted 1ms 552.0 KiB
#10 Accepted 2ms 540.0 KiB
#11 Accepted 1ms 540.0 KiB
#12 Accepted 22ms 1.27 MiB
#13 Accepted 2ms 768.0 KiB
#14 Accepted 287ms 9.316 MiB
#15 Accepted 1ms 328.0 KiB

Code

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int n;
    cin >> n;
    if(n & 1) return 0;

    auto rec = [&](auto&& self, int i, int open1, int close1, int open2, int close2, string &s1) -> void{
        if(i == n) {
            if(open1 == close1 && open2 == close2) cout << s1 << endl;
            return;
        }
        if(open1 < (n >> 1)) {
            s1 += '(';
            self(self, i + 1, open1 + 1, close1, open2, close2, s1);
            s1.pop_back();
        }
        if(open1 > close1) {
            s1 += ')';
            self(self, i + 1, open1, close1 + 1, open2, close2, s1);
            s1.pop_back();
        }

        if(open2 < (n >> 1)) {
            s1 += '[';
            self(self, i + 1, open1, close1, open2 + 1, close2, s1);
            s1.pop_back();
        }
        if(open2 > close2) {
            s1 += ']';
            self(self, i + 1, open1, close1, open2, close2 + 1, s1);
            s1.pop_back();
        }
    };
    string s1 = "";
    rec(rec, 0, 0, 0, 0, 0, s1);
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1170 Regular bracket sequence
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-24 18:32:03
Judged At
2025-02-24 18:32:03
Judged By
Score
100
Total Time
287ms
Peak Memory
9.316 MiB