제출 #1266154

#제출 시각아이디문제언어결과실행 시간메모리
1266154PlayVoltzHomework (CEOI22_homework)C++20
100 / 100
51 ms38840 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second int n, i=0; string s; pii calc(){ pii l, r; if (s[i]=='?')return mp(1ll, n); char c=s[i+1]; i+=4; l=calc(); i+=2; r=calc(); ++i; if (c=='i')return mp(min(l.fi, r.fi), l.se+r.se-n-1); return mp(l.fi+r.fi, max(l.se, r.se)); } int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>s; n=count(s.begin(), s.end(), '?'); pii ans=calc(); cout<<ans.se-ans.fi+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...