fork download
copy 
  1. //#include <ext/pb_ds/assoc_container.hpp> 
  2. //#include <ext/pb_ds/tree_policy.hpp> 
  3. //using namespace __gnu_pbds; 
  4. //#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
  5. #include <bits/stdc++.h>
  6. using namespace std;
  7. #define int long long
  8. #define dd double
  9. #define ld long double
  10. #define ull unsigned long long
  11. #define yes cout << "YES\n"
  12. #define no cout << "NO\n"
  13. #define el "\n"
  14. #define Arwa ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  15. #define fix(x) cout << fixed << setprecision(x)
  16. #define all(v) v.begin(),v.end()
  17. void file() 
  18. {
  19.     #ifndef ONLINE_JUDGE
  20.         freopen("input.txt", "r", stdin);
  21.         freopen("output.txt", "w", stdout);
  22.     #endif
  23. }
  24. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
  25. int lcm(int a, int b) { return a / gcd(a, b) * b; }
  26. bool prime(int n) {
  27.     if (n == 2) return true;
  28.     if (n % 2 == 0 || n == 1) return false;
  29.     for (int i = 3; i * i <= n; i += 2)
  30.         if (n % i == 0) return false;
  31.     return true;
  32. }
  33. //Here We Go Again
  34. int32_t main() 
  35. {
  36.     Arwa
  37.     //file();
  38.     int t=1;
  39.     //cin>>t;
  40.     while(t--) 
  41.     {
  42.       stack<char>mx;
  43.       bool f=0,f2=0;
  44.       int maxlength=0,count=0,maxx=0;
  45.       string s;
  46.       cin>>s;
  47.       for(int i=0;i<s.length();i++)
  48.       {
  49.         if(s[i]=='('||s[i]=='<'||s[i]=='{'||s[i]=='[')
  50.         {
  51.         mx.push(s[i]);
  52.         f=1;
  53.         }
  54.         else if(!mx.empty())
  55.         {
  56.         if(s[i]=='}'&&mx.top()=='{')
  57.         {
  58.         mx.pop();
  59.         if(mx.empty())
  60.         f2=1;
  61.         }
  62.         else if(s[i]==')'&&mx.top()=='(')
  63.         {
  64.         mx.pop();
  65.         if(mx.empty())
  66.         f2=1;
  67.         }
  68.         else if(s[i]=='>'&&mx.top()=='<')
  69.         {
  70.         mx.pop();
  71.         if(mx.empty())
  72.         f2=1;
  73.         }
  74.         else if(s[i]==']'&&mx.top()=='[')
  75.         {
  76.         mx.pop();
  77.         if(mx.empty())
  78.         f2=1;
  79.         }
  80.         else 
  81.         {
  82.         maxlength=0;
  83.         f2=0;
  84.         }
  85.         }
  86.         if(mx.empty()&&f&&f2)
  87.         {
  88.         count++;
  89.         if(maxx<maxlength)
  90.         maxx=maxlength;
  91.         }
  92.         maxlength=max(maxlength,(int)mx.size()*2);
  93.         //cout<<maxx<<' '<<count<<el;
  94.       }
  95.     if(maxx==0&&count==0)
  96.     cout<<"0 1";
  97.     else cout<<maxx<<' '<<count<<el;
  98.     }
  99.     return 0;
  100. }
  101.  
Success #stdin #stdout 0s 5276KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0 1
https://ideone.com/tAIOQB
language:
C++ (gcc 8.3)
created:
10 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!