Submission #20,684

20684

2026-01-08 17:33:49

cpp17

Wrong answer 38/40

287ms

10676 KiB

// UUID: 8a330ac7-e461-4347-bf61-8c694ff08887
#include <bits/stdc++.h>
using namespace std;

int main() {
	string s; cin >> s;
	int n=s.size();
	int ans=0;
	for(char c : {'A', 'C', 'G', 'T'}){
		vector<int> pref(n+1);
		map<int, int> pos;
		pos[0]=-1;
		for(int i=0;i<n;i++){
			pref[i+1]=pref[i]+(2*(c==s[i])-1);
			if(pos.count(pref[i+1])==0) pos[pref[i+1]]=i;
			else{
				//printf("%d-%d (%c)\n", i, pos[pref[i+1]], c);
				ans=max(ans, i-pos[pref[i+1]]);
			}
		}
	}
	cout << ans;
}

	Sum	Test	Verdict		Time	Memory
base	38/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	287ms	7364 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	508 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Wrong answer	0/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	4/4	46ms	2148 KiB
		9	Accepted	4/4	85ms	3124 KiB
		10	Accepted	4/4	111ms	3712 KiB
		11	Accepted	4/4	155ms	4804 KiB
		12	Accepted	4/4	149ms	8056 KiB
		13	Accepted	5/5	178ms	9732 KiB
		14	Accepted	5/5	208ms	10676 KiB