Submission #1609670
Source Code Expand
#include "bits/stdc++.h"
#include <unordered_set>
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
const int inf = 1000000001;
const ll INF = 1e16;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<<fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
int main() {
string s;
cin >> s;
int n = s.size(), i, j, k;
if (n == 1) {
cout << -1 << " " << -1 << endl;
return 0;
}
for (i = 0; i < 26; i++) {
vi dp(n + 1,0);
for (j = 0; j < n; j++) {
if (s[j] == 'a' + i) {
dp[j + 1] = dp[j] + 1;
}
else {
dp[j + 1] = dp[j];
}
}
for (j = 2; j <= n; j++) {
for (k = 0; k <= j - 2; k++) {
if ((dp[j] - dp[k]) * 2 > j - k) {
cout << k + 1 << " " << j << endl;
return 0;
}
}
}
}
cout << -1 << " " << -1 << endl;
}
Submission Info
Submission Time |
|
Task |
D - Unbalanced |
User |
fuppy0716 |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1317 Byte |
Status |
TLE |
Exec Time |
2103 ms |
Memory |
896 KB |
Judge Result
Set Name |
Sample |
Sub1 |
Sub2 |
Score / Max Score |
0 / 0 |
200 / 200 |
0 / 200 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
0_01, 0_02 |
Sub1 |
0_01, 0_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14 |
Sub2 |
0_01, 0_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 2_15, 2_16, 2_17, 2_18, 2_19, 2_20, 2_21, 2_22, 2_23, 2_24 |
Case Name |
Status |
Exec Time |
Memory |
0_01 |
AC |
1 ms |
256 KB |
0_02 |
AC |
1 ms |
256 KB |
1_03 |
AC |
1 ms |
256 KB |
1_04 |
AC |
1 ms |
256 KB |
1_05 |
AC |
1 ms |
256 KB |
1_06 |
AC |
1 ms |
256 KB |
1_07 |
AC |
1 ms |
256 KB |
1_08 |
AC |
1 ms |
256 KB |
1_09 |
AC |
1 ms |
256 KB |
1_10 |
AC |
1 ms |
256 KB |
1_11 |
AC |
1 ms |
256 KB |
1_12 |
AC |
1 ms |
256 KB |
1_13 |
AC |
1 ms |
256 KB |
1_14 |
AC |
1 ms |
256 KB |
2_15 |
TLE |
2103 ms |
896 KB |
2_16 |
TLE |
2103 ms |
896 KB |
2_17 |
TLE |
2103 ms |
896 KB |
2_18 |
TLE |
2103 ms |
896 KB |
2_19 |
TLE |
2103 ms |
896 KB |
2_20 |
TLE |
2103 ms |
896 KB |
2_21 |
AC |
5 ms |
896 KB |
2_22 |
TLE |
2103 ms |
896 KB |
2_23 |
TLE |
2103 ms |
896 KB |
2_24 |
TLE |
2103 ms |
896 KB |