POJ 1028:Web Navigation

原创 2015年07月11日 10:05:08

Web Navigation
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 30828   Accepted: 13821

Description

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
BACK
BACK
FORWARD
VISIT http://www.ibm.com/
BACK
BACK
FORWARD
FORWARD
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

水题,题意就是模拟访问网页,看当前网页到了哪里。

代码:

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
using namespace std;

map <int,string> web;

int main()
{	
	//freopen("input.txt","r",stdin);
	//freopen("out.txt","w",stdout);

	string operate;
	string website;

	int cur=1,zong=1;
	web[1]="http://www.acm.org/";

	while(cin>>operate)
	{
		if(operate=="QUIT")
			break;
		if(operate=="VISIT")
		{
			cin>>website;
			web[++cur]=website;
			zong=cur;
			cout<<website<<endl;
		}
		if(operate=="BACK")
		{
			if(cur==1)
			{
				cout<<"Ignored"<<endl;
			}
			else
			{
				cur--;
				cout<<web[cur]<<endl;
			}
		}
		if(operate=="FORWARD")
		{
			if(cur==zong)
			{
				cout<<"Ignored"<<endl;
			}
			else
			{
				cur++;
				cout<<web[cur]<<endl;
			}
		}
	}

	//system("pause");
	return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

POJ 1028 Web Navigation

注释代码: /* * Problem ID : POJ 1028 Web Navigation * Author : Lirx.t.Una * Language...

poj 1028 Web Navigation(模拟)

题目:http://poj.org/problem?id=1028 Web Navigation Time Limit: 1000MS   Memory Limit: ...

POJ 1028 Web Navigation(面向对象栈的封装)

这道题的题干已经将这道题的解法解释的很清楚了。维护两个栈,一个forward栈和一个backward栈,然后就是各个命令对应的具体的操作。 首先起始阶段是访问:http://www.acm.org/...

poj1028Web Navigation(stack)

Web Navigation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 27368  ...

poj1028_Web Navigation

题目详情 思路:题目提示要用两个栈,一个backword回退栈,一个forward向前栈,再定义一个变量表示当前网址就可以了。自己开始做的时候有一个点没有注意,就是在back和forward时先把当前...

<poj1028> Web Navigation

Web Navigation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 23618  ...
  • cs_zlg
  • cs_zlg
  • 2012-07-14 10:32
  • 1366

poj 1028-Web Navigation

仿真题。。。 其实题目里已经把实现方法介绍了,我没仔细审题,虽然实现了s_back和s_forward两个栈,但是漏考虑了新页面打开要清理s_forward栈的情况,考虑不周。 另外,我把s_ba...

POJ 1028 / East Central North America 2001 Web Navigation (栈)

Web Navigation http://poj.org/problem?id=1028 Time Limit: 1000MS Memory Limit: 10000K Descri...

poj算法题1028——Web Navigation

Web NavigationDescriptionStandard web browsers contain features to move backward and forward among t...

POJ - 1028 Web Navigation

栈的应用
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)