Submission #1117819

#TimeUsernameProblemLanguageResultExecution timeMemory
1117819vjudge1괄호 문자열 (CEOI16_match)C++17
0 / 100
1 ms336 KiB
#include "bits/stdc++.h" using namespace std; const int mxN = 100005; const int mxAl = 26; set<int> pos[mxAl]; char ans[mxN]; int main() { string S; cin >> S; int N = S.size(); for (int i = 0; i < N; i ++) { int c = S[i] - 'a'; if (!pos[c].empty()) { int last = *pos[c].rbegin(); if (~(i - last) & 1) { cout << -1 << endl; return 0; } } pos[c].insert(i); } for (int i = 0; i < mxAl; i ++) { if ((int)pos[i].size() & 1) { cout << -1 << endl; return 0; } } int sz = N; while (sz) { for (int i = 0; i < mxAl; i ++) { if (!pos[i].empty()) { ans[*pos[i].begin()] = '('; ans[*pos[i].rbegin()] = ')'; pos[i].erase(pos[i].begin()); pos[i].erase(--pos[i].end()); sz -= 2; } } } int balance = 0; for (int i = 0; i < N; i ++) { if ('(' == ans[i]) { balance ++; } else { balance --; } if (0 > balance) { cout << -1 << endl; return 0; } } if (balance) { cout << -1 << endl; return 0; } for (int i = 0; i < N; i ++) { cout << ans[i]; } cout << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...