mirror of
https://gitcode.com/Zengtudor/alg2025.git
synced 2025-11-09 16:12:21 +00:00
feat: 添加P3879题目解答实现
实现一个基于map和set的字符串索引系统,用于快速查询包含特定字符串的文档ID。通过同步输入输出流提高性能,适用于大规模数据处理场景。
This commit is contained in:
parent
eb1f6031d1
commit
63a72b5f14
35
src/10/12/P3879.cpp
Normal file
35
src/10/12/P3879.cpp
Normal file
@ -0,0 +1,35 @@
|
|||||||
|
#include <cstdint>
|
||||||
|
#include <iostream>
|
||||||
|
#include <istream>
|
||||||
|
#include <map>
|
||||||
|
#include <set>
|
||||||
|
#include <string>
|
||||||
|
using ll = int64_t;
|
||||||
|
|
||||||
|
ll n,m,l;
|
||||||
|
std::map<std::string,std::set<ll>> s;
|
||||||
|
std::string tmp;
|
||||||
|
|
||||||
|
int main(){
|
||||||
|
std::iostream::sync_with_stdio(false);
|
||||||
|
std::cin.tie(nullptr);
|
||||||
|
|
||||||
|
std::cin>>n;
|
||||||
|
for(ll i=1;i<=n;i++){
|
||||||
|
std::cin>>l;
|
||||||
|
for(ll j=1;j<=l;j++){
|
||||||
|
std::cin>>tmp;
|
||||||
|
s[tmp].insert(i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
std::cin>>m;
|
||||||
|
while(m--){
|
||||||
|
std::cin>>tmp;
|
||||||
|
if(const auto p = s.find(tmp);p!=s.end()){
|
||||||
|
for(const ll i:p->second){
|
||||||
|
std::cout<<i<<" ";
|
||||||
|
}
|
||||||
|
}
|
||||||
|
std::cout<<"\n";
|
||||||
|
}
|
||||||
|
}
|
||||||
Loading…
Reference in New Issue
Block a user