[hihoCoder太阁最新面经算法竞赛9] 题目一：Browser Caching （LRU缓存）

时间限制: 10000ms

单点时限: 1000ms

内存限制: 256MB

描述

When you browse the Internet, browser usually caches some documents to reduce the time cost of fetching them from remote servers. Let's consider a simplified caching problem. Assume the size of browser's cache can store M pages. When user visits some URL, browser will search it in the cache first. If the page is already cached browser will fetch it from the cache, otherwise browser will fetch it from the Internet and store it in the cache. When the cache is full and browser need to store a new page, the least recently visited page will be discarded.

Now, given a user's browsing history please tell us where did browser fetch the pages, from the cache or the Internet? At the beginning browser's cache is empty.

输入

Line 1: Two integers N(1 <= N <= 20000) and M(1 <= M <= 5000). N is the number of pages visited and M is the cache size.

Line 2~N+1: Each line contains a string consisting of no more than 30 lower letters, digits and dots('.') which is the URL of the page. Different URLs always lead to different pages. For example www.bing.com and bing.com are considered as different pages by browser.

输出

Line 1~N: For each URL in the input, output "Cache" or "Internet".

提示

Pages in the cache before visiting 1st URL [null, null]

Pages in the cache before visiting 2nd URL [www.bing.com(1), null]

Pages in the cache before visiting 3rd URL [www.bing.com(1), www.microsoft.com(2)]

Pages in the cache before visiting 4th URL [www.bing.com(1), www.microsoft.com(3)]

Pages in the cache before visiting 5th URL [windows.microsoft.com(4), www.microsoft.com(3)]

The number in parentheses is the last visiting timestamp of the page.

样例输入

5 2
www.bing.com
www.microsoft.com
www.microsoft.com
windows.microsoft.com
www.bing.com

样例输出

Internet
Internet
Cache
Internet
Internet

题解：LRU缓存算法实现，可用链表。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <list>
using namespace std;
struct node {
    string url;
    node(string req) {
        url=req;
    }
};
int main()
{
    int n,m;
    cin>>n>>m;
    list<node> List;
    unordered_map<string,list<node>::iterator> cache;
    for(int i=0;i<n;i++) {
        string request;
        cin>>request;
        node nex=node(request);
        if(cache.find(request)==cache.end()) {
            cout<<"Internet"<<endl;
            if(cache.size()==m) {
                node head=*List.begin();
                cache.erase(head.url);
                List.erase(List.begin());
            }
        }
        else {
            cout<<"Cache"<<endl;
            List.erase(cache[request]);
        }
        List.push_back(nex);
        cache[request]=--List.end();
    }
    return 0;
}