Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
5579 | 2022-08-19 18:31:51 | ShajibEwuCse19 | Min Substring | C++ 17 | 1114 ms | 3544 kb | Time Limit Exceeded - 10 |
Test Cases
# | CPU | Memory | Points | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 3 ms | 3544 kb | 1 | Accepted | |||||||
2 | 3 ms | 3492 kb | 1 | Accepted | |||||||
3 | 3 ms | 3464 kb | 1 | Accepted | |||||||
4 | 3 ms | 3292 kb | 1 | Accepted | |||||||
5 | 3 ms | 3300 kb | 1 | Accepted | |||||||
6 | 23 ms | 3376 kb | 1 | Accepted | |||||||
7 | 4 ms | 3388 kb | 1 | Accepted | |||||||
8 | 5 ms | 3304 kb | 1 | Accepted | |||||||
9 | 22 ms | 3448 kb | 1 | Accepted | |||||||
10 | 1114 ms | 628 kb | 0 | Time Limit Exceeded | |||||||
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
//Md. Shajibul Islam.. //East West University, CSE Department'19 #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<vi> vvi; typedef vector<vl> vvl; typedef pair<int,int> pii; typedef pair<double, double> pdd; typedef pair<ll, ll> pll; typedef vector<pii> vii; typedef vector<pll> vll; typedef vector<int>::iterator vit; typedef set<int>::iterator sit; #define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define endl '\n' #define loop(i,n) for(int i=0;i<n;i++) #define CASE_PRINT cout<<"Case "<<C<<": " #define CASE_PRINT2 cout<<"Case "<<C<<":"<<endl #define ll long long #define ld long double #define Pi 2*acos(0.0) // acos(-1.0) #define err 1e-9 #define PB push_back #define F first #define S second #define MP make_pair #define all(a) (a).begin(),(a).end() #define mid(l,r) ((r+l)/2) #define left(node) (node*2) #define right(node) (node*2+1) #define mx_int_prime 999999937 #define mem(a,b) memset(a, b, sizeof(a) ) #define gcd(a,b) __gcd(a,b) #define sqr(a) ((a) * (a)) template < typename F, typename S > ostream& operator << ( ostream& os, const pair< F, S > & p ) { return os << "(" << p.first << ", " << p.second << ")"; } template < typename T > ostream &operator << ( ostream & os, const vector< T > &v ) { os << "{"; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; } template < typename T > ostream &operator << ( ostream & os, const set< T > &v ) { os << "["; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << ", "; os << *it; } return os << "]"; } template < typename T > ostream &operator << ( ostream & os, const multiset< T > &v ) { os << "["; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << ", "; os << *it; } return os << "]"; } template < typename F, typename S > ostream &operator << ( ostream & os, const map< F, S > &v ) { os << "["; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << ", "; os << it -> first << " = " << it -> second ; } return os << "]"; } #define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0) void faltu () { cerr << endl; } template <typename T> void faltu( T a[], int n ) { for(int i = 0; i < n; ++i) cerr << a[i] << ' '; cerr << endl; } template <typename T, typename ... hello> void faltu( T arg, const hello &... rest) { cerr << arg << ' '; faltu(rest...); } const double eps = 1e-9; const int inf = 2000000000; const ll infLL = 9000000000000000000; #define MOD 1000000007 int dx[] = {0, 0, +1, -1, +1, +1, -1, -1}; int dy[] = {+1, -1, 0, 0, +1, -1, +1, -1}; const int mx = 1e5+123; int main() { string s;cin>>s; /// aaacccabac set<char>st; for(auto i : s)st.insert(i); int total = st.size();///dbg(total); int l=0, r=0, len=1e9; st.clear(); { if(s[l] == s[i] and i==l+1){l++;r++;st.insert(s[i]);} else { r++; st.insert(s[i]); } if(st.size() == total) { len = min(len,(r-l+1));///dbg(l,r,len,s[l],s[r]); l = l+1; r = l-1; i = l-1; st.clear(); st.insert(s[l]); }///dbg(l,r,st.size()); } if(len==1e9)cout<<total<<endl; else cout<<len<<endl; }