# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
149981 | | usa1+samsung2 (#200) | HicCup (FXCUP4_hiccup) | C++17 | | 21 ms | 3328 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "hiccup.h"
#include <iostream>
using namespace std;
int HicCup(std::string S) {
int N = S.size();
int h = (S[0]=='H' ? 1 : 0);
int c = 0;
int x = 0;
char ex = S[0];
if (S[0] != 'H') return -1;
for(int i=1;i<N;i++){
if(S[i] == 'H') h++;
if(S[i] == '!') x++;
if(S[i] == 'C') c++;
switch(ex) {
case 'H':
if(S[i]=='!') {
//cout << "H->!" << endl;
return -1;
}
break;
case 'C':
/*
if(S[i]=='C') {
cout << "C->C" << endl;
return -1;
}*/
break;
case '!':
break;
default:
return -1;
break;
}
ex = S[i];
}
if(h!=c) return -1;
return (x/h);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |