zoukankan      html  css  js  c++  java
  • <poj1028> Web Navigation

    Web Navigation
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 23618   Accepted: 10534

    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

    Source

     
    AC code:
    #include <iostream>
    #include <stack>
    #include <string>
    using namespace std;
    int main()
    {
        stack<string>sf,sb;//sf:stack of forward,sb:stack of backward
        string com,cp="http://www.acm.org/";//com:command,cp:current page
        while(cin>>com)
        {
            if(com[0]=='V')//faster than if(com=="VISIT")
            {
                sb.push(cp);
                cin>>cp;
                cout<<cp<<endl;
                while(!sf.empty()) sf.pop();//clear sf
            }
            else if(com[0]=='B')
            {
                if(!sb.empty())
                {
                    sf.push(cp);
                    cp=sb.top();
                    sb.pop();
                    cout<<cp<<endl;
                }
                else
                {
                    cout<<"Ignored"<<endl;
                }
            }
            else if(com[0]=='F')
            {
                if(!sf.empty())
                {
                    sb.push(cp);
                    cp=sf.top();
                    sf.pop();
                    cout<<cp<<endl;
                }
                else
                {
                    cout<<"Ignored"<<endl;
                }
            }
            else
            {
                break;
            }
        }
        return 0;
    }
    

  • 相关阅读:
    synchronized介绍
    volatile介绍
    docker开启远程访问
    docker时间同步解决办法
    spring boot集成docker
    vue踩坑-Error: listen EADDRNOTAVAIL 192.168.1.122:8081
    大前端(全栈)学习路线指南
    做前端技术方案选型的时候,你是怎么做决策的?
    小程序源码丢失了怎么在微信平台反编译找回
    做前端技术方案选型的时候,你是怎么做决策的?
  • 原文地址:https://www.cnblogs.com/cszlg/p/2910597.html
Copyright © 2011-2022 走看看