글 읽기 - 이거 어느 부분이 틀린 것인 지 봐주실 수 있으신가요?

rucellant 7년 전 0

런타임 에러까지는 다 잡고 이것저것 실행해보면서 안되는 케이스 찾고 있는데 잘 안되네요..

#include<iostream>
#include<cstdlib>
using namespace std;

typedef char Data;
typedef struct _node
{
	Data data;
	struct _node * next;
	struct _node * prev;
} Node;

typedef struct _dbDLinkedList
{
	Node * head;
	Node * tail;
	Node * cur;
} DBDLinkedList;

typedef DBDLinkedList List;

void ListInit(List * plist)
{
	plist->head = new Node;
	plist->tail = new Node;
	plist->cur = plist->head;

	plist->head->prev = NULL;
	plist->head->data = NULL;
	plist->head->next = plist->tail;

	plist->tail->next = NULL;
	plist->tail->data = NULL;
	plist->tail->prev = plist->head;
}

void InsertNode(List * plist, Data data)
{
	Node * newNode = new Node;
	newNode->data = data;

	if ((plist->cur == plist->head && plist->cur->next == plist->tail) || 
		(plist->cur == plist->tail && plist->cur->prev == plist->head))
	{
		if (newNode->data == '<' || newNode->data == '>' || newNode->data == '-')
		{
			free(newNode);
			return;
		}
	}

	switch (newNode->data)
	{
	case '<':
		if (plist->head == plist->cur)
			return;
		plist->cur = plist->cur->prev;
		free(newNode); return;
	case '>':
		if (plist->tail == plist->cur)
			return;
		plist->cur = plist->cur->next;
		free(newNode); return;
	case '-':
		if (plist->head == plist->cur || plist->tail == plist->cur)
		{
			free(newNode);
			return;
		}
		else
		{
			Node *delNode;
			delNode = plist->cur;
			plist->cur->prev->next = plist->cur->next;
			plist->cur->next->prev = plist->cur->prev;
			plist->cur = plist->cur->prev;
			free(delNode);
			return;
		}
	default: break;
	}

	if (plist->cur == plist->tail)
	{
		newNode->prev = plist->cur->prev;
		plist->cur->prev->next = newNode;
		plist->cur->prev = newNode;
		newNode->next = plist->cur;
		plist->cur = newNode;
	}
	else
	{
		newNode->next = plist->cur->next;
		plist->cur->next->prev = newNode;
		newNode->prev = plist->cur;
		plist->cur->next = newNode;
		plist->cur = newNode;
	}
}

void InputDataNode(List * plist, Data * p)
{
	for (int idx = 0; p[idx] != NULL; idx++)
		InsertNode(plist, p[idx]);
}

void ShowData(List * plist)
{
	if (plist->head->next == plist->tail)
		return;
	else
	{
		plist->cur = plist->head->next;
		while (plist->cur != plist->tail)
		{
			cout << plist->cur->data;
			plist->cur = plist->cur->next;
		}
		if (plist->head->next == plist->tail)
			return;
		else
			cout << endl;
	}
}

void DeleteData(List * plist)
{
	plist->cur = plist->head;
	for (; plist->cur != plist->tail;)
	{
		Node*delNode = plist->cur;
		plist->cur = plist->cur->next;
		free(delNode);
	}
	free(plist->tail);
}

int main(void)
{
	Data Input[1000000];
	List list;
	int testcase;
	cin >> testcase;
	cin.ignore();
	for (int i = 0; i < testcase; i++)
	{
		cin.getline(Input, 1000000);
		ListInit(&list);
		InputDataNode(&list, Input);
		ShowData(&list);
		DeleteData(&list);
	}
	return 0;
}

sgchoi5 7년 전 1

>>qbd>- 가 입력이면 qb 가 답인데, qbd 로 나오네요.

rucellant 7년 전 0

ㄴ감사합니ㅏㄷ!

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

이거 어느 부분이 틀린 것인 지 봐주실 수 있으신가요?

rucellant 7년 전 0

sgchoi5 7년 전 1

rucellant 7년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말