제출 #53515

#제출 시각아이디문제언어결과실행 시간메모리
53515baactreeMatch (CEOI16_match)C++17
10 / 100
5 ms3620 KiB
#include <bits/stdc++.h> using namespace std; int n; char str[100005]; vector<int> p[256][256]; int s[100005]; void solve(int le, int ri) { if (le > ri)return; auto it = upper_bound(p[s[le - 1]][str[le]].begin(), p[s[le - 1]][str[le]].end(), ri); int i = *(--it); str[le] = '('; str[i] = ')'; solve(le + 1, i - 1); solve(i + 1, ri); return; } int main() { scanf("%s", str + 1); n = strlen(str + 1); stack<int> st; for (int i = 1; i <= n; i++) { if (!st.empty() && st.top() == str[i])st.pop(); else st.push(str[i]); } if (!st.empty())return !printf("-1\n"); st.push(0); p[0][0].push_back(0); s[0] = 0; for (int i = 1; i <= n; i++) { if (st.top() == str[i])st.pop(); else st.push(str[i]); p[st.top()][str[i]].push_back(i); s[i] = st.top(); } solve(1, n); printf("%s\n", str + 1); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

match.cpp: In function 'void solve(int, int)':
match.cpp:9:44: warning: array subscript has type 'char' [-Wchar-subscripts]
  auto it = upper_bound(p[s[le - 1]][str[le]].begin(), p[s[le - 1]][str[le]].end(), ri);
                                            ^
match.cpp:9:75: warning: array subscript has type 'char' [-Wchar-subscripts]
  auto it = upper_bound(p[s[le - 1]][str[le]].begin(), p[s[le - 1]][str[le]].end(), ri);
                                                                           ^
match.cpp: In function 'int main()':
match.cpp:32:21: warning: array subscript has type 'char' [-Wchar-subscripts]
   p[st.top()][str[i]].push_back(i);
                     ^
match.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", str + 1);
  ~~~~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...