제출 #785663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
785663		bachhoangxuan	Toilets (JOI16_toilets)	C++17	0 / 100	1 ms	212 KiB

toilets

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,m;cin >> n >> m;
    auto f = [&](pii a,pii b){return mpp(max(a.fi,a.se+b.fi),a.se+b.se);};
    pii cur={0,0};
    for(int i=1;i<=m;i++){
        string s;int k;cin >> s >> k;
        int sum=0,Max=0;
        for(char c:s){
            sum+=(c=='M'?-1:1);
            Max=max(Max,sum);
        }
        pii p={Max,sum};
        for(int j=0;j<=60;j++){
            if(k&(1LL<<j)) cur=f(cur,p);
            p=f(p,p);
        }
    }
    if(cur.se<0) cout << -1 << '\n';
    else cout << (cur.fi+1)/2-cur.se << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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