110305 Automated Judge Script


#include <stdio.h>
#include <iostream>
#include <string.h>
#include <vector>

using namespace std;

#define MAX_LINES 100
#define MAX_CHARS_IN_LINE (100 + 2)

enum ComparisonResult_t
{
	ACCEPTED = 0,
	PRESENTATION_ERROR,
	WRONG_ANSWER
};

static char* s_Results[] = {
	"Accepted", "Presentation Error", "Wrong Answer"
};

static int MergeMultipleInputLinesToOneLine(char* dest, int lines)
{
	fgets(dest, MAX_LINES * MAX_CHARS_IN_LINE, stdin); // Consume the '\n' after the count of lines

	int len = MAX_LINES * MAX_CHARS_IN_LINE, offset = 0;
	for (int i = 0; i < lines; ++i)
	{
		fgets(dest + offset, len, stdin);
		int tempLen = strlen(dest + offset);
		len -= tempLen;
		offset += tempLen;
	}

	return offset;
}

static bool IsNum(char ch)
{
	if ((ch >= '0') && (ch <= '9'))
		return true;
	return false;
}

static ComparisonResult_t CompareNums(const vector<char>& numsInCorrect, const vector<char>& numsInPlayer)
{
	int cnt = numsInCorrect.size();
	if (cnt != numsInPlayer.size())
		return WRONG_ANSWER;

	for (int i = 0; i < cnt; ++i)
	{
		if (numsInCorrect[i] != numsInPlayer[i])
			return WRONG_ANSWER;
	}

	return PRESENTATION_ERROR;
}

static void GetNumsFromLine(const char* line, vector<char>& nums)
{
	int i = 0;
	while(true)
	{
		if (line[i] == '\0')
			break;

		if (IsNum(line[i]))
			nums.push_back(line[i]);
		++i;
	}
}

static ComparisonResult_t CompareRepliesByNumOnly(const char* correctReply, const char* playerReply)
{
	vector<char> numsInCorrect, numsInPlayer;

	GetNumsFromLine(correctReply, numsInCorrect);
	GetNumsFromLine(playerReply, numsInPlayer);

	return CompareNums(numsInCorrect, numsInPlayer);
}

static ComparisonResult_t CompareSameLenReplies(const char* correctReply, const char* playerReply)
{
	vector<char> numsInCorrect, numsInPlayer;
	bool same = true;
	int i = 0;
	while(true)
	{
		if (correctReply[i] == '\0')
			break;

		if (IsNum(correctReply[i]))
			numsInCorrect.push_back(correctReply[i]);
		if (IsNum(playerReply[i]))
			numsInPlayer.push_back(playerReply[i]);

		if (correctReply[i] != playerReply[i])
			same = false;
		++i;
	}

	if (same)
		return ACCEPTED;
	else
		return CompareNums(numsInCorrect, numsInPlayer);
}

ComparisonResult_t CompareReplies(const char* correctReply, int correctLen, const char* playerReply, int playerLen)
{
	if (correctLen != playerLen)
		return CompareRepliesByNumOnly(correctReply, playerReply);

	return CompareSameLenReplies(correctReply, playerReply);
}

static void DoTest(int correctReplyLines, int index)
{
	static char s_CorrectReply[MAX_LINES * MAX_CHARS_IN_LINE];
	static char s_PlayerReply[MAX_LINES * MAX_CHARS_IN_LINE];

	int correctLen = MergeMultipleInputLinesToOneLine(s_CorrectReply, correctReplyLines);

	int playerReplyLines;
	cin >> playerReplyLines;

	int playerLen = MergeMultipleInputLinesToOneLine(s_PlayerReply, playerReplyLines);

	ComparisonResult_t result = (correctReplyLines == playerReplyLines) ? 
		CompareReplies(s_CorrectReply, correctLen, s_PlayerReply, playerLen) :
		CompareRepliesByNumOnly(s_CorrectReply, s_PlayerReply);
	cout << "Run #" << index << ": " << s_Results[result] << endl;
}

static void RunTests()
{
	int correctReplyLines;
	int i = 0;
	while (true)
	{
		++i;

		if ((!(cin >> correctReplyLines)) || (correctReplyLines <= 0))
			return;

		DoTest(correctReplyLines, i);
	}
}

int main(int argc, char* argv[])
{
	RunTests();
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值