oj.uz

Submission #1036899

# Submission time Handle Problem Language Result Execution time Memory
1036899 2024-07-27T19:19:44 Z Marco_Escandon Homework (CEOI22_homework) C++11
0 / 100
 1000 ms 8676 KB 
#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')
    {
        return {min(o1.x,o2.x),min(o1.y,o2.y)-1+(o1.y!=o2.y)};
    }
    else
    {
        return {max(o1.x,o2.x)+1-(o1.x!=o2.x),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);
    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 8676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

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

Subtask #5
0 / 34.0

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