浙大在线评测 1061 Web Navigation

王朝other·作者佚名  2006-01-09
窄屏简体版  字體: |||超大  

Question:

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

Solution:

// 声明:本代码仅供学习之用,请不要作为个人的成绩提交。

// http://blog.csdn.net/mskia

// email: skianet@yahoo.com.cn

#include <iostream>

#include <vector>

#include <string>

using namespace std;

int main( void ) {

int cases;

cin >> cases;

for ( int i = 0; i < cases; ++i ) {

vector< string > history;

history.push_back( "http://www.acm.org/" );

int index = 0;

if ( i != 0 ) {

cout << endl;

}

for ( ; ; ) {

string cmd;

cin >> cmd;

if ( cmd == "QUIT" ) {

break;

}

if ( cmd == "VISIT" ) {

string url;

cin >> url;

if ( index == history.size( ) - 1 ) {

history.push_back( url );

++index;

} else {

history[ ++index ] = url;

while ( index != history.size( ) - 1 ) {

history.pop_back( );

}

}

cout << url << endl;

} else if ( cmd == "BACK" ) {

if ( index == 0 ) {

cout << "Ignored" << endl;

} else {

cout << history[ --index ] << endl;

}

} else if ( cmd == "FORWARD" ) {

if ( index == history.size( ) - 1 ) {

cout << "Ignored" << endl;

} else {

cout << history[ ++index ] << endl;

}

}

}

}

return 0;

}

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
 
 
© 2005- 王朝網路 版權所有 導航