poj1028

maksyuki 发表于 oj 分类，标签: 基础算法-模拟

15 9月 2015

Web Navigation

Standard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be reached by moving backward and forward. In this problem, you are asked to implement this.The following commands need to be supported:

BACK: Push the current page on the top of the forward stack. Pop the page from the top of the backward stack, making it the new current page. If the backward stack is empty, the command is ignored.
FORWARD: Push the current page on the top of the backward stack. Pop the page from the top of the forward stack, making it the new current page. If the forward stack is empty, the command is ignored.
VISIT : Push the current page on the top of the backward stack, and make the URL specified the new current page. The forward stack is emptied.
QUIT: Quit the browser.
Assume that the browser initially loads the web page at the URL http://www.acm.org/

Input

Input is a sequence of commands. The command keywords BACK, FORWARD, VISIT, and QUIT are all in uppercase. URLs have no whitespace and have at most 70 characters. You may assume that no problem instance requires more than 100 elements in each stack at any time. The end of input is indicated by the QUIT command.

Output

For each command other than QUIT, print the URL of the current page after the command is executed if the command is not ignored. Otherwise, print "Ignored". The output for each command should be printed on its own line. No output is produced for the QUIT command.

Sample Input

VISIT http://acm.ashland.edu/

VISIT http://acm.baylor.edu/acmicpc/

BACK

FORWARD

VISIT http://www.ibm.com/

BACK

FORWARD

QUIT

Sample Output

http://acm.ashland.edu/

http://acm.baylor.edu/

acmicpc/http://acm.ashland.edu/

http://www.acm.org/

Ignored

http://acm.ashland.edu/

http://www.ibm.com/

http://acm.ashland.edu/

http://www.acm.org/

http://acm.ashland.edu/

http://www.ibm.com/

Ignored

Source

East Central North America 2001

题目类型：模拟

算法分析：按照题目的要求直接模拟即可。注意“VISIT“命令要将栈forw清空

#include <cstdio>
#include <iostream>
#include <fstream>
#include <string>
#include <stack>
using namespace std;

stack <string> forw, backw;
string current = "http://www.acm.org/";

int main()
{
    string com;
    //ifstream cin ("aaa.txt");

    while (cin >> com)
	{
        if (com == "QUIT")
			break;

		if (com == "VISIT")
		{
			string URL;
			cin >> URL;

            backw.push (current);
			current = URL;

			while (!forw.empty ())
				forw.pop ();

			cout << current << endl;
		}

		if (com == "BACK")
		{


            if (!backw.empty ())
			{
			    forw.push (current);
                string temp = backw.top ();
                backw.pop ();
                current = temp;

                cout << current << endl;
			}

			else
				cout << "Ignored" << endl;
		}

		if (com == "FORWARD")
		{
             if (!forw.empty ())
			 {
			 	 backw.push (current);
                string temp = forw.top ();
                forw.pop ();
                current = temp;

                cout << current << endl;
			 }

			 else
				cout << "Ignored" << endl;
		}
	}

	return 0;
}

#include <cstdio>

#include <iostream>

#include <fstream>

#include <string>

#include <stack>

using namespace std;

stack <string> forw, backw;

string current = "http://www.acm.org/";

int main()

{

string com;

//ifstream cin ("aaa.txt");

while (cin >> com)

{

if (com == "QUIT")

break;

if (com == "VISIT")

{

string URL;

cin >> URL;

backw.push (current);

current = URL;

while (!forw.empty ())

forw.pop ();

cout << current << endl;

}

if (com == "BACK")

{

if (!backw.empty ())

{

forw.push (current);

string temp = backw.top ();

backw.pop ();

current = temp;

cout << current << endl;

}

else

cout << "Ignored" << endl;

}

if (com == "FORWARD")

{

if (!forw.empty ())

{

backw.push (current);

string temp = forw.top ();

forw.pop ();

current = temp;

cout << current << endl;

}

else

cout << "Ignored" << endl;

}

return 0;

}

poj1011

poj1045

一	二	三	四	五	六	日
« 6月
						1
2	3	4	5	6	7	8
9	10	11	12	13	14	15
16	17	18	19	20	21	22
23	24	25	26	27	28	29
30	31

超客的水墨烟雨

poj1028

分类目录

标签云

书签

近期评论