Submission #1036921

#	Time	Username	Problem	Language	Result	Execution time	Memory
1036921		vjudge1	Homework (CEOI22_homework)	C++17	0 / 100	1006 ms	14256 KiB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define x first
#define y second
string s;
ll n=0;
pair<ll,ll> sol(ll a, ll b)
{
    if(a==b) return {1,n};
    ll temp=a+4;
    ll pl=true;ll c1=0;
    while(pl)
    {
        c1+=(s[temp]=='(');
        c1-=(s[temp]==')');
        if(c1==0&&s[temp]==',') break;
        temp++;
    }
    pair<ll,ll> o1=sol(a+4,temp-1);
    pair<ll,ll> o2=sol(temp+1,b-1);
    if(s[a+2]=='n')
    {
        ll temp1=0;
        if(s[a+4]!='?'&&s[a+6]=='n'&&s[temp+1]!='?'&&s[temp+3]=='n') temp1++;
        return {min(o1.x,o2.x),min(o1.y,o2.y)-1-temp1};
    }
    else
    {
        ll temp1=0;
        if(s[a+4]!='?'&&s[a+6]=='x'&&s[temp+1]!='?'&&s[temp+3]=='x') temp1++;
        return {max(o1.x,o2.x)+1+temp1,max(o1.y,o2.y)};
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>s;
    for(auto i:s)n+=(i=='?');
    cout<<(sol(0,s.size()-1).y-sol(0,s.size()-1).x+1);
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 13
• Subtask 4: 0 / 30
• Subtask 5: 0 / 34