Find Many Patterns in Text

For each requested pattern, decide whether it appears as a contiguous substring anywhere in the shared text. Patterns may overlap and may repeat. Return results in the original query order. The limits require an approach that can handle many patterns efficiently.

Implement find_many_patterns(text, patterns).

Input

text: The text searched by every query.

patterns: The patterns, in query order.

Output

Return YES for each occurring pattern and NO for each absent one.

เงื่อนไข

1…100,000 text characters. 1…100,000 nonempty patterns, with total length at most 500,000. All characters are lowercase a–z.

ตัวอย่าง

อินพุต:
text = "bananas"
patterns = ["ana", "apple", "nas"]

ผลลัพธ์ที่คาดหวัง:
expected = ["YES", "NO", "YES"]

อินพุต:
std::string text = "bananas";
std::vector<std::string> patterns = {"ana", "apple", "nas"};

ผลลัพธ์ที่คาดหวัง:
std::vector<std::string> expected = {"YES", "NO", "YES"};

อินพุต:
string text = "bananas";
string[] patterns = new string[] {"ana", "apple", "nas"};

ผลลัพธ์ที่คาดหวัง:
string[] expected = new string[] {"YES", "NO", "YES"};

อินพุต:
text = "aaaa"
patterns = ["aa", "aaaaa", "aa"]

ผลลัพธ์ที่คาดหวัง:
expected = ["YES", "NO", "YES"]

อินพุต:
std::string text = "aaaa";
std::vector<std::string> patterns = {"aa", "aaaaa", "aa"};

ผลลัพธ์ที่คาดหวัง:
std::vector<std::string> expected = {"YES", "NO", "YES"};

อินพุต:
string text = "aaaa";
string[] patterns = new string[] {"aa", "aaaaa", "aa"};

ผลลัพธ์ที่คาดหวัง:
string[] expected = new string[] {"YES", "NO", "YES"};

แหล่งอ้างอิง

โจทย์นี้ปรับให้เหมาะกับ CodeUtility กรุณาทำตามคำชี้แจงและข้อจำกัดด้านบน

• CSES: Finding Patterns