Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
6989 | 2023-02-26 21:12:21 | S4MI | Min Substring | C++ 17 | 4 ms | 3556 kb | Wrong Answer - 6 |
Test Cases
# | CPU | Memory | Points | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 3 ms | 3384 kb | 1 | Accepted | |||||||
2 | 3 ms | 3556 kb | 1 | Accepted | |||||||
3 | 3 ms | 3388 kb | 1 | Accepted | |||||||
4 | 3 ms | 3376 kb | 1 | Accepted | |||||||
5 | 2 ms | 3468 kb | 1 | Accepted | |||||||
6 | 4 ms | 3316 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
#include <bits/stdc++.h> using namespace std; #define endl '\n' int main() { // Simple is BEAST string s; cin >> s; int n = s.size(); map<char, int>mp; for(auto c : s) mp[c]++; int i = 0, j = n-1; while(i < j){ if(mp[s[i]] > 1)mp[s[i]]--, i++; else if(mp[s[j]] > 1)mp[s[j]]--, j--; else if(mp[s[i]] == 1 and mp[s[j]] == 1)break; } cout << j-i+1 << endl; return 0; }