Loading...
Submission
# When Author Problem Language CPU Memory
4488 2022-03-25 21:59:11 The_crawler Min Substring C++ 17 2 ms 3472 kb Wrong Answer - 6
Test Cases
# CPU Memory Points
1 2 ms 3384 kb 1 Accepted
2 2 ms 3320 kb 1 Accepted
3 2 ms 3280 kb 1 Accepted
4 2 ms 3384 kb 1 Accepted
5 2 ms 3472 kb 1 Accepted
6 2 ms 3440 kb 0 Wrong Answer
7 0 ms 0 kb 0 Skipped
8 0 ms 0 kb 0 Skipped
9 0 ms 0 kb 0 Skipped
10 0 ms 0 kb 0 Skipped
11 0 ms 0 kb 0 Skipped
12 0 ms 0 kb 0 Skipped
13 0 ms 0 kb 0 Skipped
14 0 ms 0 kb 0 Skipped
15 0 ms 0 kb 0 Skipped
16 0 ms 0 kb 0 Skipped
17 0 ms 0 kb 0 Skipped
18 0 ms 0 kb 0 Skipped
Source Code
  1. /* Author: Tazim(The_crawler) */
  2. #include<bits/stdc++.h>
  3. #define ll long long int
  4. #define dec greater<int>()
  5. #define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower);
  6. #define upper(s) transform(s.begin(), s.end(), s.begin(), ::toupper);
  7. #define prow(n) for(auto i:n)cout<<i<<" ";cout<<endl;
  8. #define pcol(n) for(auto i:n)cout<<i<<endl;
  9. #define yes cout<<"YES"<<endl;
  10. #define no cout<<"NO"<<endl;
  11. #define debug(x) cout<<#x<<" = ";_print(x); cout<<endl; /// Debug function
  12. using namespace std; ///****
  13. bool sortbysec(const pair<int, int>& a, const pair<int, int>& b) { return (a.second < b.second); }
  14. template<class T> void _print(T x) { cout << x; }
  15. template<class T> void _print(vector<T>x) { cout << "[ ";for (T i : x)cout << i << " ";cout << "]"; }
  16. template<class T> void _print(set<T>x) { cout << "[ ";for (T i : x)cout << i << " ";cout << "]"; }
  17. template<class T, class V> void _print(pair<T, V>x) { cout << "{" << x.first << "," << x.second << "} "; }
  18. template<class T, class V> void _print(map<T, V>x) { cout << "[ ";for (auto i : x)_print(i);cout << "]"; }
  19. template<class T> void _print(multiset<T>x) { cout << "[ ";for (T i : x)cout << i << " ";cout << "]"; }
  20. /* Hack my code. It's Easy to Read */
  21.  
  22.  
  23. int main() {
  24. ios_base::sync_with_stdio(false);
  25. cin.tie(NULL);
  26. // start
  27. string s;
  28. cin >> s;
  29. int n = s.length();
  30. map <char, int > mp;
  31. for (int i = 0; i < n; i++) {
  32. mp[s[i]]++;
  33. }
  34. for (int i = 0; i < s.length(); i++) {
  35. if (mp[s[i]] - 1 > 0) {
  36. mp[s[i]]--;
  37. n--;
  38. }
  39. else break;
  40. }
  41. for (int i = s.length() - 1; i >= 0; i--) {
  42. if (mp[s[i]] - 1 > 0) {
  43. mp[s[i]]--;
  44. n--;
  45. }
  46. else break;
  47. }
  48. cout << n << endl;
  49.  
  50.  
  51.  
  52. return 0;
  53. }
  54.