# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
874873 | 2023-11-18T02:46:58 Z | Muhammad_Aneeq | 괄호 문자열 (CEOI16_match) | C++17 | 0 ms | 348 KB |
/* بسم الله الرحمن الرحيم Author: (:Muhammad Aneeq:) */ #pragma GCC optimize("O2") #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") #include <iostream> #include <map> #include <vector> #include <algorithm> using namespace std; inline void solve() { string x; cin>>x; int n=x.size(); map<char,vector<int>>d; for (int i=0;i<n;i++) d[x[i]].push_back(i); for (auto i:d) { if (i.second.size()%2) { cout<<-1<<endl;return; } } string ans=string(n,' '); for (auto i:d) { vector<int>x,y; for (auto j:i.second) if (j%2) x.push_back(j); else y.push_back(j); if (x.size()!=y.size()) { cout<<-1<<endl;return; } if (x[0]>y[0]) swap(x,y); reverse(y.begin(), y.end()); for (int i=0;i<x.size();i++) { int z=min(x[i],y[i]); ans[z]='('; ans[y[i]+x[i]-z]=')'; } } cout<<ans<<endl; } int main() { ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); solve(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |