UVa 1597 - Searching the Web(模拟) 发表于 2015-03-23 | 分类于 AOAPC II , Chapter 05. C++ and STL | 模拟网页搜索,直接遍历查找会超时,需要使用映射或指针一类的简化查找。直接用STL写的,原本准备超时之后再用指针重写,没想到2.595s过了,就懒得改了。123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106#include<iostream>#include<algorithm>#include<string>#include<cstring>#include<sstream>#include<vector>#include<set>#include<map>using namespace std;struct inc{ set<int> doc,line[110];};map<string,inc> dict;vector<string> a[110];void pre(string s,int a,int l){ for(int i=0;i<s.length();++i) if(isalpha(s[i])) s[i]=tolower(s[i]); else s[i]=' '; stringstream ss(s); while(ss>>s){ if(!dict.count(s)) dict[s]=inc(); dict[s].doc.insert(a); dict[s].line[a].insert(l); } return;}int main(){ ios::sync_with_stdio(false); //freopen("in_1.txt","w",stdout); int n,m,cnt; cin>>n;cin.get(); for(int i=0;i<n;++i){ cnt=0; string s; while(getline(cin,s),s!="**********"){ pre(s,i,cnt++); a[i].push_back(s); } } cin>>m;cin.get(); for(int i=0;i<m;++i){ bool flag=true; string s; getline(cin,s); if(s.find(" AND ")!=s.npos){ stringstream ss(s); string s1,s2; ss>>s1>>s2>>s2; for(int i=0;i<n;++i){ if(dict[s1].doc.count(i)&&dict[s2].doc.count(i)){ if(flag) flag=false; else cout<<"----------\n"; set<int> k; for(set<int>::iterator it=dict[s1].line[i].begin();it!=dict[s1].line[i].end();++it) k.insert(*it); for(set<int>::iterator it=dict[s2].line[i].begin();it!=dict[s2].line[i].end();++it) k.insert(*it); for(set<int>::iterator it=k.begin();it!=k.end();++it) cout<<a[i][*it]<<endl; } } } else if(s.find(" OR ")!=s.npos){ stringstream ss(s); string s1,s2; ss>>s1>>s2>>s2; for(int i=0;i<n;++i){ if(dict[s1].doc.count(i)||dict[s2].doc.count(i)){ if(flag) flag=false; else cout<<"----------\n"; set<int> k; for(set<int>::iterator it=dict[s1].line[i].begin();it!=dict[s1].line[i].end();++it) k.insert(*it); for(set<int>::iterator it=dict[s2].line[i].begin();it!=dict[s2].line[i].end();++it) k.insert(*it); for(set<int>::iterator it=k.begin();it!=k.end();++it) cout<<a[i][*it]<<endl; } } } else if(s.find("NOT ")!=s.npos){ string s0=s.substr(4); for(int i=0;i<n;++i){ if(!dict[s0].doc.count(i)){ if(flag) flag=false; else cout<<"----------\n"; for(int j=0;j<a[i].size();++j) cout<<a[i][j]<<endl; } } } else{ for(int i=0;i<n;++i){ if(dict[s].doc.count(i)){ if(flag) flag=false; else cout<<"----------\n"; for(set<int>::iterator it=dict[s].line[i].begin();it!=dict[s].line[i].end();++it) cout<<a[i][*it]<<endl; } } } if(flag) cout<<"Sorry, I found nothing.\n"; cout<<"==========\n"; } return 0;}本文迁移自我的 CSDN博客 ,格式可能有所偏差。