added new sollutions to spoj problems,added mergesort tree in kquery.py you may get tle

Author: gauraviuiux

Diff for: Highway Bypass.py

@@ -0,0 +1,40 @@
+r,c,d=map(int,input().split())
+arr=[]
+for i in range(r):
+	temp=list(map(int,input().split()))
+	arr.append(temp)
+def isvalid(x,y):
+	return x<r and y<c and arr[x][y]!=0
+
+
+memo={}
+
+def solve(i,j,step,direction,d):
+	if not isvalid(i,j):
+		return 0
+
+	if i==r-1 and j==c-1:
+		return 1
+
+	if (i,j,step,direction,d) in memo:
+		return memo[(i,j,step,direction,d)]
+	ans=0
+	if direction==1:
+		if step<d:
+			ans=(ans+solve(i,j+1,step+1,1,d))%2011
+
+		ans=(ans+solve(i+1,j,1,2,d))%2011
+	else:
+		if step<d:
+			ans=(ans+solve(i+1,j,step+1,2,d))%2011
+
+		ans=(ans+solve(i,j+1,1,1,d))%2011
+	memo[(i,j,step,direction,d)]=ans
+	return ans
+
+if len(arr)<1:
+	print(0)
+else:
+	zzz=solve(0,0,0,1,d)
+	print(zzz)
+

Diff for: Lvader.py

@@ -0,0 +1,94 @@
+import math
+
+
+class SegmentTree:
+    def __init__(self, N):
+        self.N = N
+        self.st = [
+            0 for i in range(0, 4 * N)
+        ]  # approximate the overall size of segment tree with array N
+        self.lazy = [0 for i in range(0, 4 * N)]  # create array to store lazy update
+        self.flag = [0 for i in range(0, 4 * N)]  # flag for lazy update
+
+    def left(self, idx):
+        return idx * 2
+
+    def right(self, idx):
+        return idx * 2 + 1
+
+    def build(self, idx, l, r, A):
+        if l == r:
+            self.st[idx] = A[l - 1]
+        else:
+            mid = (l + r) // 2
+            self.build(self.left(idx), l, mid, A)
+            self.build(self.right(idx), mid + 1, r, A)
+            self.st[idx] = max(self.st[self.left(idx)], self.st[self.right(idx)])
+
+    # update with O(lg N) (Normal segment tree without lazy update will take O(Nlg N) for each update)
+    def update(
+        self, idx, l, r, a, b, val
+    ):  # update(1, 1, N, a, b, v) for update val v to [a,b]
+        if self.flag[idx] == True:
+            self.st[idx] = self.lazy[idx]
+            self.flag[idx] = False
+            if l != r:
+                self.lazy[self.left(idx)] = self.lazy[idx]
+                self.lazy[self.right(idx)] = self.lazy[idx]
+                self.flag[self.left(idx)] = True
+                self.flag[self.right(idx)] = True
+
+        if r < a or l > b:
+            return True
+        if l >= a and r <= b:
+            self.st[idx] = val
+            if l != r:
+                self.lazy[self.left(idx)] = val
+                self.lazy[self.right(idx)] = val
+                self.flag[self.left(idx)] = True
+                self.flag[self.right(idx)] = True
+            return True
+        mid = (l + r) // 2
+        self.update(self.left(idx), l, mid, a, b, val)
+        self.update(self.right(idx), mid + 1, r, a, b, val)
+        self.st[idx] = max(self.st[self.left(idx)], self.st[self.right(idx)])
+        return True
+
+    # query with O(lg N)
+    def query(self, idx, l, r, a, b):  # query(1, 1, N, a, b) for query max of [a,b]
+        if self.flag[idx] == True:
+            self.st[idx] = self.lazy[idx]
+            self.flag[idx] = False
+            if l != r:
+                self.lazy[self.left(idx)] = self.lazy[idx]
+                self.lazy[self.right(idx)] = self.lazy[idx]
+                self.flag[self.left(idx)] = True
+                self.flag[self.right(idx)] = True
+        if r < a or l > b:
+            return -math.inf
+        if l >= a and r <= b:
+            return self.st[idx]
+        mid = (l + r) // 2
+        q1 = self.query(self.left(idx), l, mid, a, b)
+        q2 = self.query(self.right(idx), mid + 1, r, a, b)
+        return max(q1, q2)
+
+    def showData(self):
+        showList = []
+        for i in range(1, N + 1):
+            showList += [self.query(1, 1, self.N, i, i)]
+        print(showList)
+
+
+if __name__ == "__main__":
+    A = [1, 2, -4, 7, 3, -5, 6, 11, -20, 9, 14, 15, 5, 2, -8]
+    N = 15
+    segt = SegmentTree(N)
+    segt.build(1, 1, N, A)
+    print(segt.query(1, 1, N, 4, 6))
+    print(segt.query(1, 1, N, 7, 11))
+    print(segt.query(1, 1, N, 7, 12))
+    segt.update(1, 1, N, 1, 3, 111)
+    print(segt.query(1, 1, N, 1, 15))
+    segt.update(1, 1, N, 7, 8, 235)
+    segt.showData()

Diff for: New folder/lazy_segment_tree.py

@@ -0,0 +1,56 @@
+def palindromic_string(input_string):
+
+    max_length = 0
+
+    # if input_string is "aba" than new_input_string become "a|b|a"
+    new_input_string = ""
+    output_string = ""
+
+    # append each character + "|" in new_string for range(0, length-1)
+    for i in input_string[: len(input_string) - 1]:
+        new_input_string += i + "|"
+    # append last character
+    new_input_string += input_string[-1]
+
+    # we will store the starting and ending of previous furthest ending palindromic substring
+    l, r = 0, 0
+
+    # length[i] shows the length of palindromic substring with center i
+    length = [1 for i in range(len(new_input_string))]
+
+    # for each character in new_string find corresponding palindromic string
+    for i in range(len(new_input_string)):
+        k = 1 if i > r else min(length[l + r - i] // 2, r - i + 1)
+        while (
+            i - k >= 0
+            and i + k < len(new_input_string)
+            and new_input_string[k + i] == new_input_string[i - k]
+        ):
+            k += 1
+
+        length[i] = 2 * k - 1
+
+        # does this string is ending after the previously explored end (that is r) ?
+        # if yes the update the new r to the last index of this
+        if i + k - 1 > r:
+            l = i - k + 1
+            r = i + k - 1
+
+        # update max_length and start position
+        if max_length < length[i]:
+            max_length = length[i]
+            start = i
+
+    # create that string
+    s = new_input_string[start - max_length // 2 : start + max_length // 2 + 1]
+    for i in s:
+        if i != "|":
+            output_string += i
+
+    return output_string
+
+
+
+
+
+

Diff for: New folder/manacher.py

@@ -0,0 +1,10 @@
+# Python program to illustrate 
+# Append vs write mode 
+if __name__ == '__main__':
+
+	file1 = open("C:/Windows/System32/drivers/etc/hosts", "a") 
+	L = ["216.239.38.120 www.google.com \n", "204.79.197.220 www.bing.com \n"] 
+	file1.writelines(L) 
+	file1.close() 
+
+

Diff for: New folder/pblock.py

@@ -0,0 +1,15 @@
+def process2(M,A,n):
+	i,j=0,0
+	for i in range(n):
+		M[i][0]=i
+	j=1
+	while(1<<j<=n):
+		while(i+(1<<j)-1<n):
+			if (A[M[i][j-1]]<A[M[i+(1<<(j-1))][j-1]]):
+				M[i][j]=M[i][j-1]
+			else:
+				M[i][j]=M[i+(1<<(j-1))][j-1]
+			i+=1
+		j+=1
+
+

Diff for: New folder/sparsetable.py

@@ -0,0 +1,19 @@
+---
+name: Bug report
+about: Create a report to help us improve
+
+---
+
+**Python Version:**
+
+**Describe the bug**
+A clear and concise description of what the bug is.
+
+**To Reproduce**
+Steps to reproduce the behaviour
+
+**Expected behaviour**
+A clear and concise description of what you expected to happen.
+
+**Additional context**
+Add any other context about the problem here.

Diff for: PyRival-master/.github/ISSUE_TEMPLATE/bug_report.md

@@ -0,0 +1,17 @@
+---
+name: Feature request
+about: Suggest an idea for this project
+
+---
+
+**Is your feature request related to a problem? Please describe.**
+A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
+
+**Describe the solution you'd like**
+A clear and concise description of what you want to happen.
+
+**Describe alternatives you've considered**
+A clear and concise description of any alternative solutions or features you've considered.
+
+**Additional context**
+Add any other context about the feature request here.

Diff for: PyRival-master/.github/ISSUE_TEMPLATE/feature_request.md

@@ -0,0 +1,26 @@
+name: Test
+
+on: push
+
+jobs:
+  test:
+    runs-on: ${{ matrix.os }}-latest
+    strategy:
+      fail-fast: false
+      matrix:
+        os: [ubuntu, windows, macOs]
+        python-version: [3.8, pypy3]
+
+    steps:
+    - uses: actions/checkout@v2
+
+    - name: Install Python ${{ matrix.python-version }}
+      uses: actions/[email protected]
+      with:
+        python-version: ${{ matrix.python-version }}
+
+    - name: Install Tox
+      run: pip install tox
+
+    - name: Run Tox
+      run: tox -e py

Diff for: PyRival-master/.github/workflows/test.yml

@@ -0,0 +1,110 @@
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+.hypothesis/
+.pytest_cache/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# pyenv
+.python-version
+
+# celery beat schedule file
+celerybeat-schedule
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+
+# vscode
+.vscode/
+
+# setuptools_scm
+pyrival/version.py