#include <bits/stdc++.h>
using namespace std;
#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a) cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"
#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) { bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }
void cio(){
ios::sync_with_stdio(false);
cin.tie(NULL);
}
#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)
#define endl '\n'
typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("-1\n"); exit(0);}
int xx[4] = {1,-1,0,0}, yy[4] = {0,0,1,-1};
#include "hiccup.h"
string s;
vector<int> V;
int N;
bool chk(int X){
vector<int> v;
for (int i = 0; i < sz(V); i++) {
if( V[i] < 0 ){
v.push_back(V[i]);
}
else if( sz(v) >= 1 && v.back() >= 0 && V[i] >= 0 ){
v[sz(v)-1] += V[i];
}
else { v.push_back(V[i]); }
while( sz(v) >= 3 && v[sz(v)-1] >= 0 && v[sz(v)-2] == -1 && v[sz(v)-3] == -2 ){
if( v[sz(v)-1] < X ) break;
if( sz(v) == 3 ) {
rep(i,3) v.pop_back();
continue;
}
if( v[sz(v)-4] == -2 ) {
rep(i,3) v.pop_back();
}
else if( v[sz(v)-4] == -1 ){
int t = v[sz(v)-1] - X;
rep(i,3) v.pop_back();
v.push_back(t);
}
else if( v[sz(v)-4] >= 0 ){
int t = v[sz(v)-1] - X;
rep(i,3) v.pop_back();
v[sz(v)-1] += t;
}
}
}
return sz(v) == 0;
}
int HicCup(std::string S) {
N = S.size();
s = S;
for (int i = 0; i < N; i++) {
int t;
if( S[i] == 'H' ) t = -2;
if( S[i] == 'C' ) t = -1;
if( S[i] == '!' ) t = 1;
if( sz(V) == 0 ) {
V.pb(t); continue;
}
if( t < 0 ) V.pb(t);
else{
if( V.back() >= 0 ) V[sz(V)-1]++;
else V.push_back(1);
}
}
int low = 0, high = sz(S), ans = -1;
while( low <= high ){
int mid = (low+high)/2;
if( chk(mid) ){
ans = mid; low = mid+1;
}
else high = mid-1;
}
if( ans == -1 ){
vector<int> v;
bool ok = true;
for(auto e : S) if( e == '!' ) ok = false;
for(auto e : S){
if( e == 'H' ) v.push_back(-2);
if( e == 'C' ) v.push_back(-1);
while( sz(v) >= 2 && v[sz(v)-1] == -1 && v[sz(v)-2] == -2 ) {
v.pop_back(); v.pop_back();
}
}
if( ok && sz(v) == 0 ) ans = 0;
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
11 ms |
1144 KB |
Output is correct |
| 5 |
Correct |
170 ms |
16380 KB |
Output is correct |
| 6 |
Correct |
150 ms |
16356 KB |
Output is correct |
| 7 |
Correct |
157 ms |
16368 KB |
Output is correct |
| 8 |
Correct |
167 ms |
16340 KB |
Output is correct |
| 9 |
Correct |
161 ms |
16356 KB |
Output is correct |
| 10 |
Correct |
173 ms |
16340 KB |
Output is correct |
| 11 |
Correct |
6 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
11 ms |
1144 KB |
Output is correct |
| 5 |
Correct |
170 ms |
16380 KB |
Output is correct |
| 6 |
Correct |
150 ms |
16356 KB |
Output is correct |
| 7 |
Correct |
157 ms |
16368 KB |
Output is correct |
| 8 |
Correct |
167 ms |
16340 KB |
Output is correct |
| 9 |
Correct |
161 ms |
16356 KB |
Output is correct |
| 10 |
Correct |
173 ms |
16340 KB |
Output is correct |
| 11 |
Correct |
208 ms |
15632 KB |
Output is correct |
| 12 |
Correct |
79 ms |
8776 KB |
Output is correct |
| 13 |
Correct |
22 ms |
4352 KB |
Output is correct |
| 14 |
Correct |
5 ms |
384 KB |
Output is correct |
| 15 |
Correct |
25 ms |
4736 KB |
Output is correct |
| 16 |
Correct |
6 ms |
384 KB |
Output is correct |
| 17 |
Correct |
6 ms |
384 KB |
Output is correct |
| 18 |
Correct |
7 ms |
768 KB |
Output is correct |
| 19 |
Correct |
20 ms |
4480 KB |
Output is correct |
| 20 |
Correct |
23 ms |
4868 KB |
Output is correct |
| 21 |
Correct |
18 ms |
4352 KB |
Output is correct |
| 22 |
Correct |
18 ms |
4096 KB |
Output is correct |
| 23 |
Correct |
19 ms |
4352 KB |
Output is correct |
| 24 |
Correct |
27 ms |
5080 KB |
Output is correct |
| 25 |
Incorrect |
213 ms |
15632 KB |
Output isn't correct |
| 26 |
Halted |
0 ms |
0 KB |
- |
