oj.uz

Submission #1087248

# Submission time Handle Problem Language Result Execution time Memory
1087248 2024-09-12T11:27:08 Z akim9905 Toilets (JOI16_toilets) C++17
0 / 100
 0 ms 344 KB 

#include <bits/stdc++.h>
using namespace std;

#define fileio() freopen("input.txt","r",stdin); freopen("output.txt","w",stdout)
#define fio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define allr(x) x.rbegin(), x.rend()
#define cmprs(x) sort(all(x)),x.erase(unique(all(x)),x.end())
#define endl "\n"
#define sp " "
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define rz resize
#define sz(a) (int)(a.size())
#define clr(a) a.clear()

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef tuple<int, int, int> tpi;
typedef tuple<ll, ll, ll> tpl;
typedef pair<double, ll> pdl;
typedef pair<double, int> pdi;

const int dx[] = {1,-1,0,0,1,1,-1,-1};
const int dy[] = {0,0,1,-1,1,-1,1,-1};
const ll MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MAX = 202020; // PLZ CHK!

ll N,M,K;
int usd[MAX];
string S;
vector<int> FI;

int main() {
    fio();
    cin>>N>>M;
    for (int i=0; i<M; i++) {
        string t; ll k;
        cin>>t>>k;
        S+=t;
    }

    S=' '+S;
    for (int i=1; i<=2*N; i++) {
        if (S[i]=='F') FI.pb(i);
    }

    ll m=0,f=0;
    int ans=0;
    for (int i=2*N; i>=1; i--) {
        if (usd[i]) continue;
        if (S[i]=='M') m++;
        else {
            FI.pop_back();
            f++;
        }

        if (m>=f+2) {
            if (FI.empty()) {
                cout<<-1;
                return 0;
            }

            int j=FI.back(); FI.pop_back();
            usd[j]=1; f++;
            ans=max(ans,i-j);
        }
    }

    cout<<ans;
    
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 64.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -