uva 1597 Searching the Web
The word "search engine" may not be strange to you. Generally speaking, a search engine searches the web pages available in the Internet, extracts and organizes the information and responds to users' queries with the most relevant pages. World famous search engines, like GOOGLE, have become very important tools for us to use when we visit the web. Such conversations are now common in our daily life:
"What does the word like ****** mean?" "Um... I am not sure, just google it."
In this problem, you are required to construct a small search engine. Sounds impossible, does it? Don't worry, here is a tutorial teaching you how to organize large collection of texts efficiently and respond to queries quickly step by step. You don't need to worry about the fetching process of web pages, all the web pages are provided to you in text format as the input data. Besides, a lot of queries are also provided to validate your system. Modern search engines use a technique called inversion for dealing with very large sets of documents. The method relies on the construction of a data structure, called an inverted index,which associates terms (words) to their occurrences in the collection of documents. The set of terms of interest is called the vocabulary, denoted as V. In its simplest form, an inverted index is a dictionary where each search key is a term ω∈V. The associated value b(ω) is a pointer to an additional intermediate data structure, called a bucket. The bucket associated with a certain term ω is essentially a list of pointers marking all the occurrences of ω in the text collection. Each entry in each bucket simply consists of the document identifier (DID), the ordinal number of the document within the collection and the ordinal line number of the term's occurrence within the document. Let's take Figure-1 for an example, which describes the general structure. Assuming that we only have three documents to handle, shown at the right part in Figure-1; first we need to tokenize the text for words (blank, punctuations and other non-alphabetic characters are used to separate words) and construct our vocabulary from terms occurring in the documents. For simplicity, we don't need to consider any phrases, only a single word as a term. Furthermore, the terms are case-insensitive (e.g. we consider "book" and "Book" to be the same term) and we don't consider any morphological variants (e.g. we consider "books" and "book", "protected" and "protect" to be different terms) and hyphenated words (e.g. "middle-class" is not a single term, but separated into 2 terms "middle" and "class" by the hyphen). The vocabulary is shown at the left part in Figure-1.Each term of the vocabulary has a pointer to its bucket. The collection of the buckets is shown at the middle part in Figure-1. Each item in a bucket records the DID of the term's occurrence. After constructing the whole inverted index structure, we may apply it to the queries. The query is in any of the following formats: term term AND term term OR term NOT term A single term can be combined by Boolean operators: AND, OR and NOT ("term1 AND term2" means to query the documents including term1 and term2; "term1 OR term2" means to query the documents including term1 or term2; "NOT term1" means to query the documents not including term1). Terms are single words as defined above. You are guaranteed that no non-alphabetic characters appear in a term, and all the terms are in lowercase. Furthermore, some meaningless stop words (common words such as articles, prepositions, and adverbs, specified to be "the, a, to, and, or, not" in our problem) will not appear in the query, either. For each query, the engine based on the constructed inverted index searches the term in the vocabulary, compares the terms' bucket information, and then gives the result to user. Now can you construct the engine?
Input
Output
Sample Input
4
A manufacturer, importer, or seller of
digital media devices may not (1) sell,
or offer for sale, in interstate commerce,
or (2) cause to be transported in, or in a
manner affecting, interstate commerce,
a digital media device unless the device
includes and utilizes standard security
technologies that adhere to the security
system standards.
**********
Of course, Lisa did not necessarily
intend to read his books. She might
want the computer only to write her
midterm. But Dan knew she came from
a middle-class family and could hardly
afford the tuition, let alone her reading
fees. Books might be the only way she
could graduate
**********
Research in analysis (i.e., the evaluation
of the strengths and weaknesses of
computer system) is essential to the
development of effective security, both
for works protected by copyright law
and for information in general. Such
research can progress only through the
open publication and exchange of
complete scientific results
**********
I am very very very happy!
What about you?
**********
6
computer
books AND computer
books OR protected
NOT security
very
slick
Sample Output
want the computer only to write her
----------
computer system) is essential to the
==========
intend to read his books. She might
want the computer only to write her
fees. Books might be the only way she
==========
intend to read his books. She might
fees. Books might be the only way she
----------
for works protected by copyright law
==========
Of course, Lisa did not necessarily
intend to read his books. She might
want the computer only to write her
midterm. But Dan knew she came from
a middle-class family and could hardly
afford the tuition, let alone her reading
fees. Books might be the only way she
could graduate
----------
I am very very very happy!
What about you?
==========
I am very very very happy!
==========
Sorry, I found nothing.
========== 代码超时，改进后仍然超时，以下是交了两次后的超时代码
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <sstream>
#include <stdio.h> using namespace std; vector<string>lines[][]; //共不超过100篇文章,每篇文章不超过1500行
vector<string>::iterator t;
int line_num[], N; //line_num每篇文章的行数,N bool strCmp(const string a , const string b) //将a ,b都转化为大写字母比较，若相同返回true
{
int aLen = a.length();
int bLen = b.length();
bool flag = true; int p = ;
if(!isalpha(b[]))p = ;
//cout << a<<"a b--"<<b<<endl;
for(int i = ;i < aLen;i++){
if(tolower(a[i]) != tolower(b[p++])){
flag = false;
break;
}
} if(flag && p < bLen){
if(isalpha(b[p]))flag = false;
}
return flag;
} bool deal_find(string a,int p, int q) //在一行中查找a，若存在返回true
{
for(t = lines[p][q].begin();t != lines[p][q].end();t++){
if(strCmp(a,*t))return true;
}
return false;
} void output(int i,int j)
{
for(t = lines[i][j].begin();t != lines[i][j].end();t++){
if( t == lines[i][j].begin())cout<<*t;
else cout<<" "<<*t;
}
cout<<endl;
} bool WORD(string a, int k)
{
bool flag = false, re = false; for(int i = ; i < N; i++){
for(int j = ; j < line_num[i]; j++){ if(deal_find(a,i,j)){
re = true;
if(flag&&k)cout<<"----------"<<endl;
flag = true;
output(i,j);
} } }
return re;
} bool AND(string a, string b)
{
bool flag = false, re = false;
for(int i = ; i < N; i++){
int a0 = ,b0 = ; //分别记录在文章中有没有查找到字符串a或b
set<int> and_line;
for(int j = ; j < line_num[i]; j++){
if(deal_find(a,i,j)){
a0 = ;
and_line.insert(j);
}
if(deal_find(b,i,j)){
b0 = ;
and_line.insert(j);
}
}
if(a0 && b0){
re = true;
if(flag)cout<<"----------"<<endl;
flag = true;
set<int>::iterator iter;
for(iter=and_line.begin();iter!=and_line.end();iter++)output(i,*iter);
}
}
return re;
} bool NOT(string a)
{
bool flag , re = false, k = false;
for(int i = ; i < N; i++){
flag = false;
for(int j = ; j < line_num[i]; j++){
if(deal_find(a,i,j)){
flag = true;
break;
}
}
if(flag)continue;
else{
re = true;
if(k)cout<<"----------"<<endl;
k = true;
for(int j = ;j < line_num[i]; j++)output(i,j);
}
}
return re;
} int main()
{
int num1 = , M;
cin >> N;
int n = N;
while(n--){ //n篇文章输入
int num2 = ;
string line; while((getline(cin,line)) != NULL){
bool flag = true;
stringstream ss(line);
string word; while(ss >> word){
if( word[] == '*' ){
flag = false;
break;
}
lines[num1][num2].push_back(word);
} if(!flag)break;
num2++; }
line_num[num1] = num2;
num1++;
} cin >> M;
bool re1,re2;
string com;
getchar();
while(M--){
getline(cin, com);
if(com.find("AND") != string::npos){
re1 = AND(com.substr(,com.find_first_of(' ')), com.substr(com.find_last_of(' ')+));
if(!re1)cout << "Sorry, I found nothing."<<endl;
}
else if(com.find("OR") != string::npos){
re1 = WORD(com.substr(,com.find_first_of(' ')) ,);
cout<<"----------"<<endl;
re2 = WORD(com.substr(com.find_last_of(' ')+) ,);
if(!re1&&!re2)cout << "Sorry, I found nothing."<<endl;
}
else if(com.find("NOT")!= string::npos){
re1 = NOT(com.substr(com.find_last_of(' ')+));
if(!re1)cout << "Sorry, I found nothing."<<endl;
}
else {
re1 = WORD(com, );
if(!re1)cout << "Sorry, I found nothing."<<endl;
} cout << "==========" << endl;
} //system("pause");
return ;
}
最后分别在VS，CB上运行，发现主函数的返回值有问题，程序已经运行结束，然而程序仍没有退出。出现以下情况
需要再点一次回车
然后
程序内部的错误吧........越来越不懂计算机了....T_T
接下来又继续改，已经没有上面的问题了，而且感觉结果正确，但是！！！！！还是超时了！！！！
#include <iostream>
#include <fstream>
#include <string>
#include <map>
#include <vector>
#include <sstream>
#include <set>
#include <algorithm>
#include <iterator> using namespace std; vector<string>lines[][]; //共不超过100篇文章,每篇文章不超过1500行
vector<string>::iterator t;
int line_num[], N; #define FILE bool deal_find(string a,int p, int q) //在一行中查找a，若存在返回true
{
for(t = lines[p][q].begin();t != lines[p][q].end();t++){
int aLen = a.length(), bLen = (*t).length();
bool flag = true;
int p = ;
if(!isalpha((*t)[]))p = ;
for(int i = ;i < aLen;i++){
if(tolower(a[i]) != tolower((*t)[p++])){
flag = false;
break;
}
} if(flag && p < bLen){
if(isalpha((*t)[p]))flag = false;
}
if(flag)return true;
}
return false;
} void output(int i,int j)
{
for(t = lines[i][j].begin();t != lines[i][j].end();t++){
if( t == lines[i][j].begin())cout<<*t;
else cout<<" "<<*t;
}
cout<<endl;
} bool WORD(string a)
{
bool flag = false, re = false; for(int i = ; i < N; i++){ flag = false;int k = ;
for(int j = ; j < line_num[i]; j++){ if(deal_find(a,i,j)){
if(re)flag = true; //falg = true 说明前已有文章的片段输出
re = true;
if(flag && re && !k)cout<<"----------"<<endl;
k = ;
output(i,j);
} } }
return re;
} bool AND(string a, string b)
{
bool flag = false, re = false;
for(int i = ; i < N; i++){
int a0 = ,b0 = ; //分别记录在文章中有没有查找到字符串a或b
set<int> and_line;
for(int j = ; j < line_num[i]; j++){
if(deal_find(a,i,j)){
a0 = ;
and_line.insert(j);
}
if(deal_find(b,i,j)){
b0 = ;
and_line.insert(j);
}
}
if(a0 && b0){
re = true;
if(flag)cout<<"----------"<<endl;
flag = true;
set<int>::iterator iter;
for(iter=and_line.begin();iter!=and_line.end();iter++)output(i,*iter);
}
}
return re;
} bool OR(string a, string b)
{
bool flag = false, re = false;
for(int i = ; i < N; i++){
flag = true;
int k = ;
for(int j = ; j < line_num[i]; j++){
if(deal_find(a,i,j)){
if(flag&&k&&re){
cout<<"----------"<<endl;
k = ;
}
flag = false;
re = true;
output(i,j);
}
if(deal_find(b,i,j)) {
if(flag&&k&&re){
cout<<"----------"<<endl;
k = ;
}
flag = false;
re = true;
output(i,j);
}
}
}
return re;
}
bool NOT(string a)
{
bool flag , re = false, k = false;
for(int i = ; i < N; i++){
flag = false;
for(int j = ; j < line_num[i]; j++){
if(deal_find(a,i,j)){
flag = true;
break;
}
}
if(flag)continue;
else{
re = true;
if(k)cout<<"----------"<<endl;
k = true;
for(int j = ;j < line_num[i]; j++){
output(i,j);
}
}
}
return re;
} int main(int argc, char* argv[])
{
int M, num1 = ,num2 = ;
string line;
cin >> N;
cin.get(); for(int i = ; i <N; i++){
num2 = ;
while((getline(cin,line)) != NULL){
if(line == "**********") break; stringstream ss(line);
string word; while(ss >> word)lines[num1][num2].push_back(word);
num2++;
}
line_num[num1] = num2;
num1++;
} cin >> M;
bool re1,re2;
string com;
cin.get();
for(int i=;i<M;i++)
{
getline(cin,com);
if(com[]=='N')
{
re1 = NOT(com.substr(com.find_last_of(' ')+));
if(!re1)cout << "Sorry, I found nothing."<<endl;
}
else if(com.find("AND")!=string::npos)
{
re1 = AND(com.substr(,com.find_first_of(' ')), com.substr(com.find_last_of(' ')+));
if(!re1)cout << "Sorry, I found nothing."<<endl;
}
else if(com.find("OR")!=string::npos)
{
re1 = OR(com.substr(,com.find_first_of(' ')),com.substr(com.find_last_of(' ')+));
if(!re1)cout << "Sorry, I found nothing."<<endl;
}
else
{
re1 = WORD(com);
if(!re1)cout << "Sorry, I found nothing."<<endl;
}
cout<<"=========="<<endl;
}
//system("pause");
return ;
}
醉了，这下足以说明是思路的问题了，思路不正确导致超时。
uva 1597 Searching the Web的更多相关文章
- [刷题]算法竞赛入门经典(第2版) 5-10/UVa1597 - Searching the Web
题意:不难理解,照搬题意的解法. 代码:(Accepted,0.190s) //UVa1597 - Searching the Web //#define _XIENAOBAN_ #include&l ...
- STL --- UVA 123 Searching Quickly
UVA - 123 Searching Quickly Problem's Link: http://acm.hust.edu.cn/vjudge/problem/viewProblem.acti ...
- Searching the Web论文阅读
Searching the Web (Arvind Arasu etc.) 1. 概述 2000年,23%网页每天更新,.com域内网页40%每天更新.网页生存半衰期是10天.描述方法可用Pois ...
- Searching the Web UVA - 1597
The word "search engine" may not be strange to you. Generally speaking, a search engine ...
- UVa 12505 Searching in sqrt(n)
传送门 一开始在vjudge上看到这题时,标的来源是CSU 1120,第八届湖南省赛D题“平方根大搜索”.今天交题时CSU突然跪了,后来查了一下看哪家OJ还挂了这道题,竟然发现这题是出自UVA的,而且 ...
- uva 123 Searching Quickly
Searching Quickly Background Searching and sorting are part of the theory and practice of computer ...
- 湖南省第八届大学生程序设计大赛原题 D - 平方根大搜索 UVA 12505 - Searching in sqrt(n)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=30746#problem/D D - 平方根大搜索 UVA12505 - Searchin ...
- POJ 2050 Searching the Web
题意简述:做一个极其简单的搜索系统,对以下四种输入进行分析与搜索: 1. 只有一个单词:如 term, 只需找到含有这个单词的document,然后把这个document的含有这个单词term的那些行 ...
- 【习题 5-10 UVA-1597】Searching the Web
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 用map < string,vector < int > >mmap[100];来记录每一个数据段某个字符串 ...
随机推荐
- ci 的控制器文件夹下开加子文件夹
在一个比较大的项目中,希望controllers下再细分子文件夹.例如:controllers/pj,controllers/xxk等. 做法是: 1.在controllers下添加相关的子文件夹,例 ...
- 移动web前端的一些硬技能（一）关于移动设备
移动端web其实也就是小尺寸触摸屏设备的web,其中包含了两个词——1.小尺寸设备:2.触摸屏.能把这两个问题给解决掉,就已经是一个基本合格的移动web前端开发工程师了.对于前端工程师来说,前路漫漫, ...
- [Mugeda HTML5技术教程之12]制作跨屏互动应用
mugeda动画平台还可以用来制作跨屏互动的动画应用,比如在PC端的大屏幕上显示动画的主界面,同时会显示出供手机扫描的二维码,手机扫描后会在手机上显示手机端动画界面.通过手机就可以和PC端的显示界面跨 ...
- python安装——Windows平台
刚刚申请博客,第一次写随笔,记录下自己最近的学习情况,希望自己能够不断的学习,不断的丰富自己~ 最近刚开始学python,记录一下,希望大家相互学习,批评指正~ 1.下载python:https:// ...
- 库函数 Math
int abs( int num ); double fabs( double arg ); long labs( long num ); 函数返回num的绝对值 #include <mat ...
- 正则匹配<img src="xxxxxx" alt="" />标签的相关写法
1.(<img\ssrc[^>]*>) 2.content.replace(/<img [^>]*src=['"]([^'"]+)[^>]*&g ...
- linux安装xunsearch
首先要确保ubuntu安装了gcc g++ make sudo apt-get install make gcc g++ 然后安装zlib,用来解压的: apt-get install zlib1g- ...
- 为什么ASCII是7位（导致各家编码的128～256字符都不同，给我带来很多困惑）——在标准ASCII中，其最高位(b7)用作奇偶校验位，附ASCII每个控制符的中文解释
ASCII编码 ASCII是基于拉丁字母的一套电脑编码系统.它主要用于显示现代英语和其他西欧语言.它是现今最通用的单字节编码系统,并等同于国际标准ISO/IEC 646. 请注意,ASCII是Amer ...
- checkbox全选和反选
$("#CheckBox").click(function () { if (this.checked) { ...
- 【实用技术】DreamWeaver常用快捷键
文件菜单 新建文档 Ctrl+N 打开一个HTML文件 Ctrl+O 或者将文件从[文件管理器]或[站点]窗口拖动到[文档]窗口中 在框架中打开 Ctrl+Shift+O 关闭 Ctrl+W 保存 C ...