제출 #175744

#제출 시각아이디문제언어결과실행 시간메모리
175744Ruxandra985괄호 문자열 (CEOI16_match)C++14
0 / 100
2 ms404 KiB
/// oare cat de bine merge in practica? #include <bits/stdc++.h> using namespace std; int s[100010]; char sol[100010]; int ok; int stk[100010]; int match (int st , int dr){ int i , elem = 0; for (i=st;i<=dr;i++){ if (elem && stk[elem] == s[i]) elem--; else stk[++elem] = s[i]; } return (elem == 0); } void solve (int st , int dr){ int i; if (st > dr) return; if (!ok) /// nu mai are rost return; /// stii ca pe st pui ( , gaseste i match ul for (i = dr; i >= st + 1 ; i--){ if (match(st + 1 , i - 1) && match(i + 1 , dr)) break; } if (i < st + 1){ ok = 0; return; } else { sol[st] = '('; sol[i] = ')'; solve(st + 1 , i - 1); solve (i + 1 , dr); } } int main() { FILE *fin = stdin; FILE *fout = stdout; int n , i; char c; c=fgetc(fin); n = 0; while ( 'a' <= c && c <= 'z' ){ s[++n] = c-'a'; c=fgetc(fin); } ok = 1; solve (1 , n); if (ok == -1){ fprintf (fout,"%d\n",ok); } else { for (i=1;i<=n;i++) fputc(sol[i],fout); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...