Submission #1221435

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221435		12345678	Toilets (JOI16_toilets)	C++20	36 / 100	4 ms	2772 KiB

toilets

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll nx=2e5+5;

ll n, m, t, sf[nx], skip, cur, ans;
string s;
queue<int> q;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>s>>t;
    n=2*n;
    for (int i=n-1; i>=0; i--) 
    {
        sf[i]=(sf[i+1]+(s[i]=='M'));
        if (s[i]=='F') q.push(i);
    }
    if (sf[0]>n/2) return cout<<-1, 0;
    for (int i=n-1; i>=0; i--)
    {
        if (s[i]=='M')
        {
            if (cur-1<-1)
            {
                ans=max(ans, sf[q.front()]-skip);
            }
            else cur--, skip++;
        }
        else
        {
            if (q.front()==i) q.pop(), cur++;
        }
    }
    cout<<ans;
}

• Subtask 1: 14 / 14
• Subtask 2: 22 / 22
• Subtask 3: 0 / 64