oj.uz

답안 #149272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149272 2019-09-01T06:06:21 Z 20190901(#3597, tongnamuu, jf297, upple1) HicCup (FXCUP4_hiccup) C++17
24 / 100
 450 ms 20420 KB 
#include "hiccup.h"
#include <vector>

using namespace std;


bool Check(string str, int mid)
{
	vector<pair<char, int>> stk;

	int hCnt = 0;
	int cCnt = 0;
	bool isMake = false;
	for (int i = 0; i < str.size(); i++)
	{
		if (str[i] == 'H')
		{
			stk.push_back({ 'H', -1 });
			hCnt++;
		}
		else if (str[i] == 'C')
		{
			if (hCnt > cCnt)
				stk.push_back({ 'C', 0 });
			else
				return false;
			cCnt++;
		}
		else
		{
			if (stk.empty())
			{
				if (isMake)
					continue;
				else
					return false;
			}
			if (stk.back().first == 'H')
			{
				if (isMake)
					continue;
				else
					return false;
			}

			stk.push_back({ '!', stk.back().second + 1 });
		}

		if (stk.back().second == mid)
		{
			for (int i = 0; i < mid + 2; i++)
			{
				if (stk.empty())
					return false;

				if (stk.back().first == 'C')
					cCnt--;
				else if (stk.back().first == 'H')
					hCnt--;
				stk.pop_back();
			}
			isMake = true;
		}
	}

	for (int i = 0; i < stk.size(); i++)
	{
		if (stk[i].first != '!')
			return false;
	}
	return true;
}

int HicCup(string S)
{
	int lo = -1;
	int hi = (int)S.size();


	while (lo + 1 < hi)
	{
		int mid = (lo + hi) >> 1;
		if (Check(S, mid))
		{
			lo = mid;
		}
		else
		{
			hi = mid;
		}
	}

	return lo;
}

Compilation message

hiccup.cpp: In function 'bool Check(std::__cxx11::string, int)':
hiccup.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < str.size(); i++)
                  ~~^~~~~~~~~~~~
hiccup.cpp:66:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < stk.size(); i++)
                  ~~^~~~~~~~~~~~

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 18 ms 1392 KB Output is correct
5 Correct 450 ms 20388 KB Output is correct
6 Correct 16 ms 4268 KB Output is correct
7 Correct 16 ms 4352 KB Output is correct
8 Correct 445 ms 20380 KB Output is correct
9 Correct 431 ms 20420 KB Output is correct
10 Correct 16 ms 4352 KB Output is correct
11 Correct 6 ms 384 KB Output is correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 18 ms 1392 KB Output is correct
5 Correct 450 ms 20388 KB Output is correct
6 Correct 16 ms 4268 KB Output is correct
7 Correct 16 ms 4352 KB Output is correct
8 Correct 445 ms 20380 KB Output is correct
9 Correct 431 ms 20420 KB Output is correct
10 Correct 16 ms 4352 KB Output is correct
11 Correct 136 ms 18240 KB Output is correct
12 Correct 197 ms 17772 KB Output is correct
13 Correct 40 ms 6012 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Incorrect 100 ms 13500 KB Output isn't correct
16 Halted 0 ms 0 KB -