73452024-01-08 08:11:48anonDNScpp17Wrong answer 38/4017ms12988 KiB
#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long long ll;
int main() {
    FastIO;
    bool m;
    ll i, j, cntr, ans;
    string dns;
    cin >> dns;
    ans = 1;
    for(i = 0; i < 4; i++) {
        vector<ll> same(dns.size() * 2 + 1, -1);
        vector<ll> acc(dns.size());
        cntr = dns.size();
        for(j = 0; j < dns.size(); j++) {
            m = (dns[j] == "ACGT"[i]);
            cntr += m * 2 - 1;
            acc[j] = (j ? acc[j - 1] : 0) + m;
            if(same[cntr] == -1)
                same[cntr] = j;
            else
                ans = max(ans, min(((ll) dns.size()), (acc[j] - acc[same[cntr]]) * 2));
        }
    }
    cout << ans << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base38/40
1Accepted0/03ms1832 KiB
2Accepted0/017ms12100 KiB
3Accepted2/23ms2280 KiB
4Accepted2/23ms2524 KiB
5Accepted2/23ms2612 KiB
6Wrong answer0/23ms2712 KiB
7Accepted2/23ms2928 KiB
8Accepted4/46ms5376 KiB
9Accepted4/48ms7100 KiB
10Accepted4/48ms8040 KiB
11Accepted4/49ms9540 KiB
12Accepted4/410ms10240 KiB
13Accepted5/513ms12056 KiB
14Accepted5/514ms12988 KiB