UVALive2356 ZOJ1061 Web Navigation【堆栈+模拟】
2017-06-14 08:21
330 查看
Web Navigation
Time Limit: 2 Seconds Memory Limit: 65536 KB
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 <url>: 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/
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
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
1
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
Source: East Central North America 2001
Regionals 2001 >> North America - East Central NA
问题链接:UVALive2356 ZOJ1061 Web Navigation。
题意简述:(略)
问题分析:这个是有关浏览器操作的问题,直接模拟。
程序说明:需要使用两个堆栈存储访问履历,以备操作使用。使用堆栈是因为操作过程与堆栈是相似的。
AC的C++语言程序如下:
Time Limit: 2 Seconds Memory Limit: 65536 KB
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 <url>: 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/
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
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
1
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
Source: East Central North America 2001
Regionals 2001 >> North America - East Central NA
问题链接:UVALive2356 ZOJ1061 Web Navigation。
题意简述:(略)
问题分析:这个是有关浏览器操作的问题,直接模拟。
程序说明:需要使用两个堆栈存储访问履历,以备操作使用。使用堆栈是因为操作过程与堆栈是相似的。
AC的C++语言程序如下:
/* UVALive2356 ZOJ1061 Web Navigation */ #include <iostream> #include <string> #include <stack> using namespace std; int main() { int n; cin >> n; while(n--) { stack<string> ss, st; string cmd, url; ss.push("http://www.acm.org/"); while(cin >> cmd) { if(cmd[0] == 'Q') // QUIT break; else if(cmd[0] == 'V') { // VISIT cin >> url; ss.push(url); cout << url << endl; // 清空:一旦输入一个新的URL,就不能再做FORWARD了 while(!st.empty()) st.pop(); } else if(cmd[0] == 'B') { // BACK if(ss.size() > 1) { st.push(ss.top()); ss.pop(); cout << ss.top() << endl; } else cout << "Ignored" << endl; } else if(cmd[0] == 'F') { // FORWARD if(!st.empty()) { ss.push(st.top()); cout << st.top() << endl; st.pop(); } else cout << "Ignored" << endl; } } if(n) cout << endl; } return 0; }
相关文章推荐
- HDU1334 ZOJ1331 UVA386 UVALive5303 Perfect Cubes【暴力】
- POJ1083 HDU1050 ZOJ1029 UVALive2326 Moving Tables【序列+最值】
- POJ1003 UVALive2294 HDU1056 ZOJ1045 Hangover【数学计算+水题】
- POJ 2296 Map Labeler / ZOJ 2493 Map Labeler / HIT 2369 Map Labeler / UVAlive 2973 Map Labeler(2-sat 二分)
- UVALive2389 ZOJ1078 Palindrom Numbers
- UVALive3093 POJ2105 ZOJ2482 IP Address【进制】
- zoj 1061 &&poj 0128 Web Navigation(STL 栈~~水)
- ZOJ1159 UVA755 UVALive5420 487-3279【查表】
- HDU1012 POJ1517 ZOJ1113 UVALive2083 u Calculate e【水题】
- POJ 1459 Power Network / HIT 1228 Power Network / UVAlive 2760 Power Network / ZOJ 1734 Power Network / FZU 1161 (网络流,最大流)
- UVALive2701 UVA1189 POJ1426 ZOJ1530 Find The Multiple【BFS】
- HDU1014 POJ1597 UVALive5492 UVA408 ZOJ1314 Uniform Generator【随机函数+水题】
- UVALive2362 POJ1004 HDU1064 ZOJ1048 Financial Management【数学计算+水题】
- POJ1555 ZOJ1720 UVA392 UVALive5309 Polynomial Showdown题解
- POJ 1502 MPI Maelstrom / UVA 432 MPI Maelstrom / SCU 1068 MPI Maelstrom / UVALive 5398 MPI Maelstrom /ZOJ 1291 MPI Maelstrom (最短路径)
- HDU1018 POJ1423 UVALive2697 UVA1185 ZOJ1526 Big Number【阶乘位数】
- POJ1060 HDU1343 ZOJ1026 UVALive2323 Modular multiplication of polynomials题解
- zoj1061 Web Navigation (栈——基础练习)
- UVALive5389 UVA414 POJ1493 ZOJ1339 Machined Surfaces【输入输出+水题】
- UVALive2953 POJ1775 ZOJ2358 Sum of Factorials【打表+暴力+水题】