제출 #838236

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
838236		bachhoangxuan	Homework (CEOI22_homework)	C++17	100 / 100	52 ms	46916 KiB

Main

// 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=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
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;
struct dd{
    int id,l,r,sz;
};
void solve(){
    string s;cin >> s;
    stack<dd> st;
    int lans=-1,rans=-1;
    for(int i=0;i<(int)s.length();i++){
        if(s[i]=='m'){
            int t=(s[i+1]=='i'?0:1);
            st.push({t,-1,-1,-1});
        }
        else if(s[i]=='?'){
            int l=1,r=1,sz=1;
            while(!st.empty() && st.top().sz!=-1){
                int lt=st.top().l,rt=st.top().r,szt=st.top().sz;
                int nr,nl,nsz,id=st.top().id;st.pop();
                nsz=sz+szt;
                if(id) nl=l+lt,nr=nsz-min(sz-r,szt-rt);
                else nl=min(l,lt),nr=r+rt-1;
                l=nl;r=nr;sz=nsz;
            }
            if(st.empty()) lans=l,rans=r;
            else{
                st.top().l=l;st.top().r=r;
                st.top().sz=sz;
            }
        }
    }
    cout << rans-lans+1 << '\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: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 13 / 13
• Subtask 4: 30 / 30
• Subtask 5: 34 / 34