POJ 1028:Web Navigation
2015-07-11 10:05
387 查看
Web Navigation
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
Sample Output
水题,题意就是模拟访问网页,看当前网页到了哪里。
代码:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 30828 | Accepted: 13821 |
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; }
相关文章推荐
- hdu 1166 敌兵布阵【线段树Or树状数组】
- Leetcode|Reverse Integer(string转char*总结)
- ffmpeg和opencv 播放视频文件和显示器
- POJ 1028:Web Navigation
- Java经典问题:传值与传引用?
- php常见的面试题目
- webstorm快捷键
- 多线程面试题
- 使用Genymotion调试出现错误INSTALL_FAILED_CPU_ABI_INCOMPATIBLE解决办法
- day24--多线程案例源码
- linux yum源的配置及使用
- Ubuntu 64 + IntelliJ IDEA + Genymotion 搭建Android开发环境
- CSS鼠标样式整理
- Ubuntu下NAO环境配置
- GridView点击空白地方事件扩展
- Android动画进阶—使用开源动画库nineoldandroids
- Activity 时间监听机制---OnclickListener
- Xcode插件(一)-规范注释生成器VVDocumenter
- POJ 2528 Mayor's posters(线段树+离散化)
- python基础课程_学习笔记20:标准库:有些收藏夹——os