Submission #1273579


Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

string s;
map<char, int> m;

int main()
{
	cin >> s;
	for (int i = 0; i < s.size(); i++)
		m[s[i]]++;

	for (int i = 0; i < s.size(); i++) {
		if (m[s[i]] >= 2) {
			m[s[i]]--;
			int a = 1;
			int str_size = 1;
			for (int j = i+1; j < s.size(); j++) {
				str_size++;
				if (s[i] == s[j]) {
					m[s[j]]--;
					a++;
				}
				if (str_size-a > a)break;
				else if (a > str_size-a) {
					cout << i+1 << " " << j+1 << endl;
					return 0;
				}
			}
		}
	}
	cout << "-1 -1" << endl;
 	return 0;
}

Submission Info

Submission Time
Task D - Unbalanced
User jj
Language C++14 (GCC 5.4.1)
Score 400
Code Size 824 Byte
Status AC
Exec Time 11 ms
Memory 512 KB

Judge Result

Set Name Sample Sub1 Sub2
Score / Max Score 0 / 0 200 / 200 200 / 200
Status
AC × 2
AC × 14
AC × 24
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 AC 8 ms 512 KB
2_16 AC 10 ms 512 KB
2_17 AC 10 ms 512 KB
2_18 AC 10 ms 512 KB
2_19 AC 7 ms 512 KB
2_20 AC 8 ms 512 KB
2_21 AC 7 ms 512 KB
2_22 AC 6 ms 512 KB
2_23 AC 10 ms 512 KB
2_24 AC 11 ms 512 KB