message stringlengths 2 23.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 97 109k | cluster float64 0 0 | __index_level_0__ int64 194 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1').
In one move you can swap two adjacent characters of the string. What is the lexicographically ... | instruction | 0 | 43,061 | 0 | 86,122 |
Yes | output | 1 | 43,061 | 0 | 86,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1').
In one move you can swap two adjacent characters of the string. What is the lexicographically ... | instruction | 0 | 43,062 | 0 | 86,124 |
Yes | output | 1 | 43,062 | 0 | 86,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1').
In one move you can swap two adjacent characters of the string. What is the lexicographically ... | instruction | 0 | 43,063 | 0 | 86,126 |
Yes | output | 1 | 43,063 | 0 | 86,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1').
In one move you can swap two adjacent characters of the string. What is the lexicographically ... | instruction | 0 | 43,064 | 0 | 86,128 |
Yes | output | 1 | 43,064 | 0 | 86,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1').
In one move you can swap two adjacent characters of the string. What is the lexicographically ... | instruction | 0 | 43,065 | 0 | 86,130 |
No | output | 1 | 43,065 | 0 | 86,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1').
In one move you can swap two adjacent characters of the string. What is the lexicographically ... | instruction | 0 | 43,066 | 0 | 86,132 |
No | output | 1 | 43,066 | 0 | 86,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1').
In one move you can swap two adjacent characters of the string. What is the lexicographically ... | instruction | 0 | 43,067 | 0 | 86,134 |
No | output | 1 | 43,067 | 0 | 86,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1').
In one move you can swap two adjacent characters of the string. What is the lexicographically ... | instruction | 0 | 43,068 | 0 | 86,136 |
No | output | 1 | 43,068 | 0 | 86,137 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little later they found a string s, carved on a rock below... | instruction | 0 | 43,072 | 0 | 86,144 |
Tags: binary search, dp, hashing, string suffix structures, strings
Correct Solution:
```
from typing import Tuple
def comp_z(s: str) -> Tuple[int]:
"""Computes the z-array for a given string s.
z[i] := the length of the longest substring of s, starting at index i, which is also a prefix of s.
0 ... | output | 1 | 43,072 | 0 | 86,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little late... | instruction | 0 | 43,077 | 0 | 86,154 |
Yes | output | 1 | 43,077 | 0 | 86,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little late... | instruction | 0 | 43,078 | 0 | 86,156 |
Yes | output | 1 | 43,078 | 0 | 86,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little late... | instruction | 0 | 43,079 | 0 | 86,158 |
Yes | output | 1 | 43,079 | 0 | 86,159 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little late... | instruction | 0 | 43,080 | 0 | 86,160 |
Yes | output | 1 | 43,080 | 0 | 86,161 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little late... | instruction | 0 | 43,081 | 0 | 86,162 |
No | output | 1 | 43,081 | 0 | 86,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little late... | instruction | 0 | 43,082 | 0 | 86,164 |
No | output | 1 | 43,082 | 0 | 86,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little late... | instruction | 0 | 43,083 | 0 | 86,166 |
No | output | 1 | 43,083 | 0 | 86,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.
A little late... | instruction | 0 | 43,084 | 0 | 86,168 |
No | output | 1 | 43,084 | 0 | 86,169 |
Provide a correct Python 3 solution for this coding contest problem.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit). Then, you must replace all characters from the... | instruction | 0 | 43,544 | 0 | 87,088 |
"Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
MOD = 998244353
INF = 2 * 10**18
in_n = lambda: int(input())
in_nn = lambda: map(int, input().split())
in_s = lambda: input().rstrip().decode('utf-8')
in_map = lambda: [s == ord('.') for s in input() if s != ord('\n')]
# ----- seg tree設定 ----- #
e... | output | 1 | 43,544 | 0 | 87,089 |
Provide a correct Python 3 solution for this coding contest problem.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit). Then, you must replace all characters from the... | instruction | 0 | 43,545 | 0 | 87,090 |
"Correct Solution:
```
#!/usr/bin/env python3
import sys
def input(): return sys.stdin.readline().rstrip()
# ライブラリ参照https://atcoder.jp/contests/practice2/submissions/16579094
class LazySegmentTree():
def __init__(self, init, unitX, unitA, f, g, h):
self.f = f # (X, X) -> X
self.g = g # (X, A, s... | output | 1 | 43,545 | 0 | 87,091 |
Provide a correct Python 3 solution for this coding contest problem.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit). Then, you must replace all characters from the... | instruction | 0 | 43,546 | 0 | 87,092 |
"Correct Solution:
```
MOD = 998244353
class LazySegmentTree: # from https://atcoder.jp/contests/practice2/submissions/16598122
__slots__ = ["n", "data", "lazy", "me", "oe", "fmm", "fmo", "foo"]
def __init__(self, monoid_data, monoid_identity, operator_identity, func_monoid_monoid, func_monoid_operator,
... | output | 1 | 43,546 | 0 | 87,093 |
Provide a correct Python 3 solution for this coding contest problem.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit). Then, you must replace all characters from the... | instruction | 0 | 43,547 | 0 | 87,094 |
"Correct Solution:
```
class LazySegmentTree():
def __init__(self, n, f, g, h, ef, eh):
"""
:param n: 配列の要素数
:param f: 取得半群の元同士の積を定義
:param g: 更新半群の元 xh が配列上の実際の値にどのように作用するかを定義
:param h: 更新半群の元同士の積を定義 （更新半群の元を xh と表記）
:param x: 配列の各要素の値。treeの葉以外は xf(x1,x2,...)
... | output | 1 | 43,547 | 0 | 87,095 |
Provide a correct Python 3 solution for this coding contest problem.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit). Then, you must replace all characters from the... | instruction | 0 | 43,548 | 0 | 87,096 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
class LazySegmentTree():
def __init__(self, n, op, e, mapping, composition, id):
self.n = n
self.op = op
self.e = e
self.mapping = mapping
self.composition = composition
self.id = id
self.log =... | output | 1 | 43,548 | 0 | 87,097 |
Provide a correct Python 3 solution for this coding contest problem.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit). Then, you must replace all characters from the... | instruction | 0 | 43,549 | 0 | 87,098 |
"Correct Solution:
```
class LazySegmentTree():
def __init__(self, array, f, g, h, ti, ei):
self.f = f
self.g = g
self.h = h
self.ti = ti
self.ei = ei
self.height = height = len(array).bit_length()
self.n = n = 2**height
self.dat = dat = [ti] * n + arr... | output | 1 | 43,549 | 0 | 87,099 |
Provide a correct Python 3 solution for this coding contest problem.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit). Then, you must replace all characters from the... | instruction | 0 | 43,550 | 0 | 87,100 |
"Correct Solution:
```
class LazySegmentTree():
__slots__ = ["merge","merge_unit","operate","merge_operate","operate_unit","n","data","lazy"]
def __init__(self,n,init,merge,merge_unit,operate,merge_operate,operate_unit):
self.merge=merge
self.merge_unit=merge_unit
self.operate=operate
... | output | 1 | 43,550 | 0 | 87,101 |
Provide a correct Python 3 solution for this coding contest problem.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit). Then, you must replace all characters from the... | instruction | 0 | 43,551 | 0 | 87,102 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N,Q = map(int,input().split())
LRD = [tuple(map(int,input().split())) for i in range(Q)]
MOD = 998244353
class LazySegTree:
def __init__(self, op, e, mapping, composition, _id, arr=[]):
self.op = op
self.e = e
self.mapping = mappi... | output | 1 | 43,551 | 0 | 87,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is ... | instruction | 0 | 43,552 | 0 | 87,104 |
Yes | output | 1 | 43,552 | 0 | 87,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is ... | instruction | 0 | 43,554 | 0 | 87,108 |
Yes | output | 1 | 43,554 | 0 | 87,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is ... | instruction | 0 | 43,555 | 0 | 87,110 |
Yes | output | 1 | 43,555 | 0 | 87,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is ... | instruction | 0 | 43,557 | 0 | 87,114 |
No | output | 1 | 43,557 | 0 | 87,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is ... | instruction | 0 | 43,558 | 0 | 87,116 |
No | output | 1 | 43,558 | 0 | 87,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string S of length N. Initially, all characters in S are `1`s.
You will perform queries Q times. In the i-th query, you are given two integers L_i, R_i and a character D_i (which is ... | instruction | 0 | 43,559 | 0 | 87,118 |
No | output | 1 | 43,559 | 0 | 87,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of... | instruction | 0 | 43,978 | 0 | 87,956 |
Tags: hashing, string suffix structures, strings
Correct Solution:
```
import sys
input = sys.stdin.readline
t = int(input())
for testcase in range(t):
s = list(input())
n = len(s)-1
c = [0]*(n+1)
for i in range(n):
for j in range(min(n-i,i+1)):
if s[i-j] != s[i+j]:
... | output | 1 | 43,978 | 0 | 87,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of... | instruction | 0 | 43,979 | 0 | 87,958 |
Tags: hashing, string suffix structures, strings
Correct Solution:
```
for _ in range(int(input())):
s = input()
n = len(s)
i = 0
a = ""
b = ""
while s[i] == s[n - 1 - i] and i < n - i - 1:
a += s[i]
b = s[i] + b
i += 1
ans1 = a + b
ans2 = a + b
c = a
for ... | output | 1 | 43,979 | 0 | 87,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of... | instruction | 0 | 43,980 | 0 | 87,960 |
Tags: hashing, string suffix structures, strings
Correct Solution:
```
t=int(input())
for query in range(t):
s=list(input())
n=len(s)
c=0
while s[c]==s[n-c-1] and n/2>c+1:
c=c+1
e=1
f=1
for b in range (c,n-c):
for d in range(c,b+1):
if s[d]!=s[b-d+c]:
e=0
if e:
f=b-c+1
... | output | 1 | 43,980 | 0 | 87,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of... | instruction | 0 | 43,981 | 0 | 87,962 |
Tags: hashing, string suffix structures, strings
Correct Solution:
```
def isPalindrome(s):
for i in range(len(s)//2):
if s[i]!=s[-i-1]:
return 0
return 1
for _ in range(int(input())):
s=input()
k1=-1
k2=len(s)-1
for i in range(len(s)//2):
if s[i]!=s[-i-1]:
k1=i
k2=len(s)-i-1
break
if k1==-1:
... | output | 1 | 43,981 | 0 | 87,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of... | instruction | 0 | 43,982 | 0 | 87,964 |
Tags: hashing, string suffix structures, strings
Correct Solution:
```
''' Prefix-Suffix Palindrome (Easy version)
'''
def checkpalindrome(string):
strlen = len(string)
half = ((strlen) + 1) // 2
palindrome = True
for n in range(half):
if string[n] != string[strlen - 1 - n]:
palindr... | output | 1 | 43,982 | 0 | 87,965 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of... | instruction | 0 | 43,983 | 0 | 87,966 |
Tags: hashing, string suffix structures, strings
Correct Solution:
```
tc = int(input())
mod = 10 ** 9 + 7
cur_p = 1
p = [cur_p]
for i in range(10 ** 5):
cur_p *= 26
cur_p %= mod
p.append(cur_p)
def get_hashes(s):
hl = [0] * len(s)
h = 0
for i, ch in enumerate(s):
h += ch * p[len(s) ... | output | 1 | 43,983 | 0 | 87,967 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of... | instruction | 0 | 43,984 | 0 | 87,968 |
Tags: hashing, string suffix structures, strings
Correct Solution:
```
from sys import stdin
input=stdin.readline
def calc(a):
p=a+"#"+a[::-1]
pi=[0]*len(p)
j=0
for i in range(1,len(p)):
while j!=0 and p[j]!=p[i]:
j=pi[j-1]
if p[i]==p[j]:
j+=1
pi[i]=j
return a[:j]
t=int(input())
for _ ... | output | 1 | 43,984 | 0 | 87,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of... | instruction | 0 | 43,985 | 0 | 87,970 |
Tags: hashing, string suffix structures, strings
Correct Solution:
```
t = int(input())
while t:
t += -1
s = input()
ln = len(s)
i = 0
j = ln - 1
a = ""
aa = ""
while 1:
if i >= j: break
if s[i] == s[j]: a += s[i]
else: break
i -= -1
j += -1
if... | output | 1 | 43,985 | 0 | 87,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this... | instruction | 0 | 43,986 | 0 | 87,972 |
Yes | output | 1 | 43,986 | 0 | 87,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this... | instruction | 0 | 43,987 | 0 | 87,974 |
Yes | output | 1 | 43,987 | 0 | 87,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this... | instruction | 0 | 43,988 | 0 | 87,976 |
Yes | output | 1 | 43,988 | 0 | 87,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this... | instruction | 0 | 43,989 | 0 | 87,978 |
Yes | output | 1 | 43,989 | 0 | 87,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this... | instruction | 0 | 43,990 | 0 | 87,980 |
No | output | 1 | 43,990 | 0 | 87,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this... | instruction | 0 | 43,991 | 0 | 87,982 |
No | output | 1 | 43,991 | 0 | 87,983 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this... | instruction | 0 | 43,992 | 0 | 87,984 |
No | output | 1 | 43,992 | 0 | 87,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this... | instruction | 0 | 43,993 | 0 | 87,986 |
No | output | 1 | 43,993 | 0 | 87,987 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n patterns p_1, p_2, ..., p_n and m strings s_1, s_2, ..., s_m. Each pattern p_i consists of k characters that are either lowercase Latin letters or wildcard characters (denoted by underscores). All patterns are pairwise distin... | instruction | 0 | 44,051 | 0 | 88,102 |
Tags: bitmasks, data structures, dfs and similar, graphs, hashing, sortings, strings
Correct Solution:
```
import sys
I=sys.stdin.readlines()
N,M,K=map(int,I[0].split())
S=[I[i+1][:-1] for i in range(N)]
D=dict()
for i in range(N):
D[S[i]]=i
T=[I[i+N+1].split() for i in range(M)]
for i in range(M):
T[i][1]=int(T[i]... | output | 1 | 44,051 | 0 | 88,103 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n patterns p_1, p_2, ..., p_n and m strings s_1, s_2, ..., s_m. Each pattern p_i consists of k characters that are either lowercase Latin letters or wildcard characters (denoted by underscores). All patterns are pairwise distin... | instruction | 0 | 44,052 | 0 | 88,104 |
Tags: bitmasks, data structures, dfs and similar, graphs, hashing, sortings, strings
Correct Solution:
```
import sys
from enum import Enum
class flag(Enum):
UNVISITED = -1
EXPLORED = -2
VISITED = -3
def match(p, s):
for i in range(len(p)):
if p[i] != "_" and p[i] != s[i]:
return F... | output | 1 | 44,052 | 0 | 88,105 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n patterns p_1, p_2, ..., p_n and m strings s_1, s_2, ..., s_m. Each pattern p_i consists of k characters that are either lowercase Latin letters or wildcard characters (denoted by underscores). All patterns are pairwise distin... | instruction | 0 | 44,053 | 0 | 88,106 |
Tags: bitmasks, data structures, dfs and similar, graphs, hashing, sortings, strings
Correct Solution:
```
from collections import defaultdict
from itertools import accumulate
import sys
input = sys.stdin.readline
'''
for CASES in range(int(input())):
n, m = map(int, input().split())
n = int(input())
A = list(map(int, ... | output | 1 | 44,053 | 0 | 88,107 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.