oj.uz

Submission #148464

# Submission time Handle Problem Language Result Execution time Memory
148464 2019-09-01T04:29:01 Z graneli(#3789, toloraia) HicCup (FXCUP4_hiccup) C++17
24 / 100
 29 ms 4352 KB 
#include "hiccup.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
//#define ll __int128
#define ll long long
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define y1 y122
using namespace std;

const int N = 1000005;

int n;
int x, y, z;
int num;
string s;

stack < int > St;


int HicCup(string S) {
	int n = (int)S.size();
	int x = 0, y = 0, z = 0;
	S = "#" + S;
	for (int i = 1; i <= n; i++){
        if (S[i] == 'H')
            x++;
        else if (S[i] == 'C')
            y++;
        else
            z++;
	}
	if (x != y)
        return -1;
    if (z % x != 0)
        return -1;
    num = z / x;
    s = "#HC";
    for (int i = 0; i < num; i++)
        s += "!";
    int m = num + 2;
    for (int i = 1; i <= n; i++){
        if (S[i] == 'H'){
            St.push (1);
            continue;
        }
        if (St.size() == 0)
            return -1;
        x = St.top() + 1;
        if (S[i] != s[x])
            return -1;
        St.pop();
        if (x < m)
            St.push (x);
    }
    if (St.size() == 0)
        return num;
    return -1;
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 128 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 27 ms 4352 KB Output is correct
6 Correct 21 ms 4352 KB Output is correct
7 Correct 20 ms 4352 KB Output is correct
8 Correct 29 ms 4352 KB Output is correct
9 Correct 29 ms 4352 KB Output is correct
10 Correct 20 ms 4352 KB Output is correct
11 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 128 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 27 ms 4352 KB Output is correct
6 Correct 21 ms 4352 KB Output is correct
7 Correct 20 ms 4352 KB Output is correct
8 Correct 29 ms 4352 KB Output is correct
9 Correct 29 ms 4352 KB Output is correct
10 Correct 20 ms 4352 KB Output is correct
11 Correct 20 ms 4352 KB Output is correct
12 Correct 17 ms 4352 KB Output is correct
13 Correct 15 ms 4224 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 15 ms 4352 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Incorrect 15 ms 4352 KB Output isn't correct
20 Halted 0 ms 0 KB -