input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#
# abc165 c
#
from itertools import combinations_with_replacement as cwr
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(100000)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin... | #
# abc165 c
#
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(100000)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
s... | p02695 |
#
# abc165 c
#
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(100000)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
s... | #
# abc165 c
#
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(100000)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
s... | p02695 |
n, m, q = 0, 0, 0
ABCD = []
ans = 0
def dfs(ns):
global ans
A = [int(c) for c in ns.split()]
if len(A) == n:
s = 0
for qi in range(q):
a, b, c, d = ABCD[qi]
if A[b - 1] - A[a - 1] == c:
s += d
ans = max(s, ans)
retu... | n, m, q = 0, 0, 0
ABCD = []
ans = 0
def dfs(A):
global ans
if len(A) == n:
s = 0
for qi in range(q):
a, b, c, d = ABCD[qi]
if A[b - 1] - A[a - 1] == c:
s += d
ans = max(s, ans)
return
for i in range(A[-1], m + 1):... | p02695 |
# https://atcoder.jp/contests/abc165/tasks/abc165_c
# C - Many Requirements
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m, q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(q)]
# 数列Aのスコアを返す
... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
res = 0
def resolve():
def dfs(v, A):
global res
if len(A) == n:
total = 0
for a, b, c, d in query:
if A[b - 1] - A[a - 1] == c:
total += d
... | p02695 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p02695 |
N,M,Q=list(map(int,input().split()))
L = []
for i in range(Q):
L.append(list(map(int, input().split())))
L[i][0]-=1
L[i][1]-=1
import itertools
l =list(range(1,M+1))
ans=0
v=list(itertools.combinations_with_replacement(l,N))
for arr in v:
score=0
for a,b,c,d in L:
if (arr[b] - arr[a])... | '''ika tako
制約条件を見て、戦略を決める（制約が戦略を決める）
配列の添え字を、なるべくシンプルにする（KISS）
広義単調増加（同じ数もOK）なので、重複順列（仕切り板で分ける）
求める数列の候補である 重複順列を列挙し、重複順列毎にscoreを求め、
そのscoreの最大値が答（数列を求めるのではなく、数列を点検する）
入力は空のリストにappendで追加
入力の際、0-indexとなるように、引く1をする（後で考えるのはメンドウ）
重複順列毎に回し、更に、クエリ毎に条件式で得点を求める、二重ループ
scoreは、答の候補である重複順列毎の得点
求めるansは、そのscoreの最大値
この二つを... | p02695 |
from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcdn = [tuple(map(int, input().split())) for _ in range(Q)]
mx = 0
for AN in combinations_with_replacement(list(range(1, M+1)), N):
score = 0
for a, b, c, d in abcdn:
score += d if AN[b-1] - AN[a-1] == c else 0... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcdn = [tuple(map(int, input().split())) for _ in range(Q)]
print((max([sum(d if AN[b-1] - AN[a-1] == c else 0 for a, b, c, d in abcdn) for AN in combinations_with_replacement(list(range(1, M+1)), N)]))) | p02695 |
from itertools import combinations_with_replacement as c
N, M, Q = list(map(int, input().split()))
L = [tuple(map(int, input().split())) for _ in range(Q)]
print((max([sum(d if S[b-1] - S[a-1] == c else 0 for a, b, c, d in L) for S in c(list(range(1, M+1)), N)]))) | from itertools import combinations_with_replacement as R
N,M,Q = list(map(int, input().split()))
L = [tuple(map(int, input().split())) for _ in range(Q)]
print((max([sum((d if S[b-1] - S[a-1] == c else 0) for a,b,c,d in L) for S in R(list(range(1, M+1)), N)]))) | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
answer = 0
nums=[]
for i in range(1, M+1):
nums.append(i)
for balls in itertools.combinations_with_replacement(nums, N):
score = 0
for i in range(Q):
test = sorted(... | import itertools
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
answer = 0
nums=[]
for i in range(1, M+1):
nums.append(i)
for balls in itertools.combinations_with_replacement(nums, N):
score = 0
for i in range(Q):
test = list(ba... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
answer = 0
nums=[]
for i in range(1, M+1):
nums.append(i)
for balls in itertools.combinations_with_replacement(nums, N):
score = 0
for i in range(Q):
test = list(ba... | import itertools
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
answer = 0
nums=[]
for i in range(1, M+1):
nums.append(i)
for balls in itertools.combinations_with_replacement(nums, N):
score = 0
test = list(balls)
for i in range(Q):... | p02695 |
import copy
N, M, Q = list(map(int, input().split()))
A = []
B = []
C = []
D = []
ans = 0
def dfs(l):
if len(l) == N+1:
global ans
now = 0
for i in range(Q):
if(l[B[i]] - l[A[i]] == C[i]):
now += D[i]
ans = max(ans, now)
else:
t... | import sys
sys.setrecursionlimit(10**9)
N, M, Q = list(map(int, input().split()))
A = []
B = []
C = []
D = []
ans = 0
def dfs(l):
if len(l) == N+1:
global ans
now = 0
for i in range(Q):
if(l[B[i]] - l[A[i]] == C[i]):
now += D[i]
ans = max(an... | p02695 |
#dfs試す
n,m,q=list(map(int, input().split( )))
qs=tuple(tuple(map(int, input().split( ))) for _ in range(q))
def dfs(ll):
if len(ll)==n+1:
sm=0
for ai,bi,ci,di in qs:
if ll[bi]-ll[ai]==ci:
sm+=di
return sm
res=[]
for i in range(ll[-1],m):#+1
... | #dfs試す
n,m,q=list(map(int, input().split( )))
qs=tuple(tuple(map(int, input().split( ))) for _ in range(q))
ans=0
def dfs(ll):
global ans
if len(ll)==n+1:
sm=0
for ai,bi,ci,di in qs:
if ll[bi]-ll[ai]==ci:
sm+=di
ans=max(ans,sm)
else:
... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
Q_list = []
for _ in range(Q):
q = list(map(int, input().split()))
Q_list.append(q)
A_list = []
for a in itertools.combinations_with_replacement(list(range(1, M+1)), N):
A_list.append(a)
answer = 0
score_list = []
for A in A_list:... | import itertools
N, M, Q = list(map(int, input().split()))
Q_list = []
for _ in range(Q):
a, b, c, d = list(map(int, input().split()))
Q_list.append((a, b, c, d))
A_list = []
for a in itertools.combinations_with_replacement(list(range(1, M+1)), N):
A_list.append(a)
answer = 0
score_list = ... | p02695 |
from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
cond = []
for _ in range(q):
a, b, c, d = list(map(int, input().split()))
a -= 1
b -= 1
cond.append((a, b, c, d))
def calc(l):
score = 0
for a, b, c, d in cond:
if l[b] - l[a] =... | from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
cond = []
for _ in range(q):
a, b, c, d = list(map(int, input().split()))
a -= 1
b -= 1
cond.append((a, b, c, d))
def calc(l):
score = 0
for a, b, c, d in cond:
if l[b] - l[a] =... | p02695 |
import copy
n,m,q=[int(_) for _ in input().split()]
lista=[[int(i) for i in input().split()] for j in range(q)]
v=list() #0,0,0,0,0....,0
def make(a,b,c): #a=list b=maxlen c=max
global v
if len(a)==b:
v.append(a)
else:
for i in range(a[-1],c+1):
k=copy.copy(a)
... | import copy
n,m,q=[int(_) for _ in input().split()]
lista=[[int(i) for i in input().split()] for j in range(q)]
v=list() #0,0,0,0,0....,0
def make(a,b,c): #a=list b=maxlen c=max
global v
if len(a)==b:
v.append(a)
else:
for i in range(a[-1],c+1):
make(a+[i],b,c)
for t ... | p02695 |
import math
from collections import deque
n,m,q=[int(_) for _ in input().split()]
lista=[[int(i) for i in input().split()] for j in range(q)]
v=deque() #0,0,0,0,0....,0
def make(a,b,c): #a=list b=maxlen c=max
global v
if len(a)==b:
v.append(a)
else:
for i in range(a[-1],c+1):
... | from collections import deque
n,m,q=[int(_) for _ in input().split()]
lista=[[int(i) for i in input().split()] for j in range(q)]
v=deque() #0,0,0,0,0....,0
def make(a,b,c): #a=list b=maxlen c=max
global v
if len(a)==b:
v.append(a)
else:
for i in range(a[-1],c+1):
make... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
ABCD = [[int(x) for x in input().split()] for i in range(Q)]
ans=0
for A in itertools.combinations_with_replacement([m for m in range(1,M+1)], N):
ans2=0
for (a,b,c,d) in ABCD:
if A[b-1]-A[a-1]==c:
ans2+=d
ans=max(ans, ans2)
print(... | import itertools
N, M, Q = list(map(int, input().split()))
ABCD = [[int(x) for x in input().split()] for i in range(Q)]
ans=0
t=[m for m in range(1,M+1)]
for A in itertools.combinations_with_replacement(t, N):
ans2=0
for (a,b,c,d) in ABCD:
if A[b-1]-A[a-1]==c:
ans2+=d
ans=max(ans, ans2)
p... | p02695 |
n, m, q = list(map(int, input().split()))
l = []
for i in range(q):
l1, l2, l3, l4 = list(map(int, input().split()))
l.append([l1, l2, l3, l4])
B = []
for a in range(1, m + 1):
for b in range(a, m + 1):
for c in range(b, m + 1):
for d in range(c, m + 1):
for e i... | def main():
n, m, q = list(map(int, input().split()))
l = []
for i in range(q):
l1, l2, l3, l4 = list(map(int, input().split()))
l.append([l1, l2, l3, l4])
B = []
for a in range(1, m + 1):
for b in range(a, m + 1):
for c in range(b, m + 1):
... | p02695 |
N,M,Q = list(map(int,input().split()))
abcd = [list(map(int,input().split())) for i in range(Q)]
ans = 0
for a in range(1,M+1):
for b in range(a,M+1):
for c in range(b,M+1):
for d in range(c,M+1):
for e in range(d,M+1):
for f in range(e,M+1):
... | N,M,Q = list(map(int,input().split()))
abcd = [list(map(int,input().split())) for i in range(Q)]
ans = 0
def dfs(n,A,now):
global ans
if n == 0:
ansi = 0
for a,b,c,d in abcd:
if A[b-1]-A[a-1]==c:
ansi+=d
ans = max(ans,ansi)
else:
for i ... | p02695 |
def main():
n,m,q = list(map(int,input().split()))
Q = []
for _ in range(q):
a,b,c,d = list(map(int,input().split()))
Q.append([a,b,c,d])
ans = 0
for a in range(1,11):
for b in range(a,11):
for c in range(b,11):
for d in range(c,11):
... | def main():
import itertools
n,m,q = list(map(int,input().split()))
Q = []
for i in range(q):
Q.append(list(map(int,input().split())))
cmb = [i for i in range(1,m+1)]
ans = 0
for que in itertools.combinations_with_replacement(cmb,n):
m = 0
for i in range(q):... | p02695 |
import copy
N, M, Q = [eval(v) for v in input().strip().split(" ")]
a_list, b_list, c_list, d_list = [], [], [], []
for k in range(Q):
a, b, c, d = [eval(v) for v in input().strip().split(" ")]
a_list.append(a)
b_list.append(b)
c_list.append(c)
d_list.append(d)
max_value = 0
def ca... | # import copy
N, M, Q = [eval(v) for v in input().strip().split(" ")]
a_list, b_list, c_list, d_list = [], [], [], []
for k in range(Q):
a, b, c, d = [eval(v) for v in input().strip().split(" ")]
a_list.append(a)
b_list.append(b)
c_list.append(c)
d_list.append(d)
max_value = 0
def ... | p02695 |
n,m,q=list(map(int,input().split()))
abcd=[[0]*4 for i in range(q)]
for i in range(q):
abcd[i]=list(map(int,input().split()))
def dfs(nn,anni,vmax):
if nn==n:
qsum=0
for j in range(q):
# print(j,abcd[j][1],abcd[j][0])
if a[abcd[j][1]-1]-a[abcd[j][0]-1]==abcd[j][... | from itertools import combinations_with_replacement
n,m,q=list(map(int,input().split()))
abcd=[]
for i in range(q):
abcd.append(list(map(int,input().split())))
ans=0
for A in combinations_with_replacement(list(range(1,m+1)),n):
# print(A)
asum=0
for a,b,c,d in abcd:
if A[b-1]-A[a-1]... | p02695 |
import itertools
from operator import mul
from functools import reduce
def combinations_count(n, r):
r = min(r, n - r)
numer = reduce(mul, list(range(n, n - r, -1)), 1)
denom = reduce(mul, list(range(1, r + 1)), 1)
return numer // denom
N,M,Q=list(map(int,input().split()))
a=[0]*Q;b=[0]*Q... | import itertools
N,M,Q=list(map(int,input().split()))
a=[0]*Q;b=[0]*Q;c=[0]*Q;d=[0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i]=list(map(int,input().split()))
l=list(range(1,M+1))
i=0;D=[]
for v in itertools.combinations_with_replacement(l, N):
D.append(0)
for j in range(Q):
if v[b[j]-1]-v[a[j]-1]==c... | p02695 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M, Q = lr()
ABCD = [lr() for _ in range(Q)]
A = [1] * N
ABCD.sort(key=lambda x: x[3], reverse=True)
ABCD.sort(key=lambda x: x[0])
answer = 0
for a in [1]:
for b i... | # coding: utf-8
import sys
from itertools import combinations_with_replacement
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M, Q = lr()
ABCD = [lr() for _ in range(Q)]
answer = 0
for x in combinations_with_replacement(list(range(1, M+1)), N)... | p02695 |
from sys import stdin
from itertools import combinations_with_replacement
input = stdin.readline
N,M,Q = list(map(int, input().split()))
numlist = [i for i in range(1,M+1)]
A = [0]*(Q+1)
B = [0]*(Q+1)
C = [0]*(Q+1)
D = [0]*(Q+1)
for q in range(1,Q+1):
A[q],B[q],C[q],D[q] = list(map(int, input().split())... | from itertools import combinations_with_replacement
from sys import stdin
input = stdin.readline
N,M,Q = list(map(int, input().split()))
A = [0]*Q
B = [0]*Q
C = [0]*Q
D = [0]*Q
for i in range(Q):
A[i],B[i],C[i],D[i] = list(map(int, input().split()))
ans = 0
X = [i for i in range(1,M+1)]
for tup in c... | p02695 |
N, M, Q = list(map(int, input().split())) #数字
Q = [list(map(int, input().split())) for i in range(Q)] #数字複数列、複数行
A = []
for i in range(1,M+1):
A.append(i)
B = []
import itertools
for i in itertools.combinations_with_replacement(A,N):
B.append(i)
C = []
for i in range(len(B)):
score = 0
... | N, M, Q = list(map(int, input().split())) #数字
Q = [list(map(int, input().split())) for i in range(Q)] #数字複数列、複数行
import itertools
A = []
for i in itertools.combinations_with_replacement(list(range(M)),N):
score = 0
for j in range(len(Q)):
if i[Q[j][1]-1] - i[Q[j][0]-1] == Q[j][2]:
... | p02695 |
N, M, Q = list(map(int, input().split())) #数字
Q = [list(map(int, input().split())) for i in range(Q)] #数字複数列、複数行
import itertools
A = []
for i in itertools.combinations_with_replacement(list(range(M)),N):
score = 0
for j in range(len(Q)):
if i[Q[j][1]-1] - i[Q[j][0]-1] == Q[j][2]:
... | N, M, Q = list(map(int, input().split())) #数字
Q = [list(map(int, input().split())) for i in range(Q)] #数字複数列、複数行
import itertools
A = 0
for i in itertools.combinations_with_replacement(list(range(M)),N):
score = 0
for j in range(len(Q)):
if i[Q[j][1]-1] - i[Q[j][0]-1] == Q[j][2]:
... | p02695 |
# -*- coding: utf-8 -*-
import sys
from collections import deque
import copy
N,M,Q=list(map(int, sys.stdin.readline().split()))
X=[ list(map(int, sys.stdin.readline().split())) for _ in range(Q) ]
qq=deque()
for m in range(1,M+1):
q=deque()
q.append([m])
while q:
if N<len(q[0]):
... | # -*- coding: utf-8 -*-
import sys
from collections import deque
N,M,Q=list(map(int, sys.stdin.readline().split()))
X=[ list(map(int, sys.stdin.readline().split())) for _ in range(Q) ]
qq=deque()
for m in range(1,M+1):
q=deque()
q.append([m])
while q:
if N<len(q[0]):
qq+=q... | p02695 |
from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
s_l = []
for i in range(q):
s = list(map(int, input().split()))
s_l.append(s)
A = []
for v in combinations_with_replacement(list(range(1,m+1)), n):
A.append(v)
ans = 0
for a in A:
cnt = 0
fo... | from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
s_l = []
for i in range(q):
s = list(map(int, input().split()))
s_l.append(s)
ans = 0
for v in combinations_with_replacement(list(range(1, m+1)), n):
cnt = 0
for i in range(q):
if v[s_l[i][1... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
l = []
for _ in range(Q):
l.append(tuple(map(int, input().split())))
c = list(itertools.combinations(list(range(1, M+1))*Q, N))
max = 0
for i in c:
i = list(i)
i.sort()
sum = 0
for j in l:
if i[j[1]-1] - i[j[0]-1]... | import itertools
N, M, Q = list(map(int, input().split()))
l = []
for _ in range(Q):
l.append(tuple(map(int, input().split())))
c = list(itertools.combinations_with_replacement(list(range(1, M+1)), N))
m = 0
for i in c:
flag = True
sum = 0
for j in l:
if i[j[1]-1] - i[j[0]-1] ... | p02695 |
import itertools
n,m,q=list(map(int, input().split()))
tmp = 0
max = 0
c = []
for i in range(q):
c.append([int(j) for j in input().split()])
nums = list(range(1, m + 1))
for retsu in itertools.combinations_with_replacement(nums, n):
for i in range(q):
if int(retsu[c[i][1]-1]) - int(r... | import itertools
n,m,q=list(map(int, input().split()))
tmp = 0
max = 0
a = []
b = []
c = []
d = []
for i in range(q):
A, B, C, D = list(map(int, input().split()))
a.append(A)
b.append(B)
c.append(C)
d.append(D)
nums = list(range(1, m + 1))
for retsu in itertools.combinations_with_re... | p02695 |
n, m, q = list(map(int, input().split()))
abcdList = []
for _ in range(q):
abcd = list(map(int, input().split()))
abcdList.append(abcd)
aList = []
def createA(tempA, x, t):
if x!=0:
tempA.append(t)
if x == n:
abc = []
for item in tempA:
abc.append(item)
aList.append(ab... | n, m, q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
from itertools import combinations_with_replacement as cwr
AList = list(cwr(list(range(1, m+1)), n))
maxPoint = 0
for A in AList:
point = 0
for abc in abcd:
a = abc[0]
b = abc[1]
c = abc[... | p02695 |
N,M,Q=list(map(int,input().split()))
from itertools import combinations_with_replacement
a=[i for i in range(1,M+1)]
A=list(combinations_with_replacement(a,N))
#print(A)
ans=[]
for i in range(Q):
W,X,Y,Z=list(map(int,input().split()))
#print(X,W)
for j in A:
if j[X-1]-j[W-1]==Y:
... | from itertools import permutations, combinations,combinations_with_replacement,product
N,M,Q=list(map(int,input().split()))
a=[i for i in range(1,M+1)]
A=list(combinations_with_replacement(a,N))
B=[list(map(int,input().split())) for i in range(Q)]
ans=[]
for i in A:
tmp=0
#print(i)
for j in B:
... | p02695 |
from collections import deque
from itertools import combinations_with_replacement as combi
N, M, Q = list(map(int, input().split()))
road = deque([input().split() for i in range(Q)])
l = [i+1 for i in range(M)]
point = 0
for v in combi(l, N):
tmp = 0
for j in range(Q):
a, b, c, d = list(map(i... | from itertools import combinations_with_replacement as combi
N, M, Q = list(map(int, input().split()))
a = [0] * Q
b = [0] * Q
c = [0] * Q
d = [0] * Q
l = [i+1 for i in range(M)]
point = 0
for i in range(Q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
for v in combi(l, N):
tmp = 0
... | p02695 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _... | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
#======================================================#
def main():
n, m, q = MII()
query = [MII() for _ in range(q)]
def calc_point(lst):
sumv ... | p02695 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
#======================================================#
def main():
n, m, q = MII()
query = [MII() for _ in range(q)]
def calc_point(lst):
sumv ... | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
#======================================================#
def main():
n, m, q = MII()
query = [MII() for _ in range(q)]
def calc_point(lst):
sumv ... | p02695 |
from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for x in combinations_with_replacement(list(range(1, M+1)), N):
point = 0
for a, b, c, d in abcd:
if x[b-1] - x[a-1] == c:
... | from itertools import combinations_with_replacement
def main():
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for x in combinations_with_replacement(list(range(1, M+1)), N):
point = 0
for a, b, c, d in abcd:
... | p02695 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(m... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | p02695 |
def solve():
N,M,Q = list(map(int,input().split()))
req = []
for i in range(Q):
a,b,c,d = list(map(int,input().split()))
a -= 1
b -= 1
req.append([a,b,c,d])
res = []
dfs(list(), res,M,N)
mx = 0
for p in res:
point = 0
for a,b,c... | def solve():
N,M,Q = list(map(int,input().split()))
global info
info = []
for _ in range(Q):
a,b,c,d = list(map(int,input().split()))
a -= 1
b -= 1
info.append([a,b,c,d])
print((dfs(list(),M,N)))
def dfs(A,M,N):
if len(A) == N:
return calcP... | p02695 |
from itertools import combinations
import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(20000000)
n, m, q = list(map(int, input().split()))
abcd = []
for i in range(q):
a, b, c, d = list(map(int, input().split()))
abcd.append([a-1, b-1, c, d])
# def check(Q):
# A = [1... | from itertools import combinations
import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(20000000)
n, m, q = list(map(int, input().split()))
abcd = []
for i in range(q):
a, b, c, d = list(map(int, input().split()))
abcd.append([a-1, b-1, c, d])
def dfs(A, depth, max_a):
... | p02695 |
import sys,itertools
input = sys.stdin.readline
n,m,q = list(map(int,input().split()))
seq = list(range(n+m-1))
p = list(itertools.combinations(seq,n))
a = [0]*q
b = [0]*q
c = [0]*q
d = [0]*q
for i in range(q):
a[i],b[i],c[i],d[i] = list(map(int,input().split()))
res = 0
for i in range(len(p)):
... | import itertools
n, m, q = list(map(int,input().split()))
seq = list(range(n+m-1))
p = list(itertools.combinations(seq, n))
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int,input().split()))
res = 0
for i in range(len(p)):
t = [0] * n
... | p02695 |
# 重複組み合わせの全列挙
import itertools
# n+m-1個からn個を選ぶ組み合わせ
n, m, q = list(map(int, input().split()))
seq = list(range(n+m-1))
p = list(itertools.combinations(seq, n))
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
res = 0
f... | # 重複組み合わせの全列挙
import itertools
# n+m-1個からn個を選ぶ組み合わせ
n, m, q = list(map(int, input().split()))
seq = list(range(n+m-1))
p = list(itertools.combinations(seq, n))
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
res = 0
f... | p02695 |
import itertools
n,m,q =list(map(int,input().split()))
a =[0]*q
b =[0]*q
c =[0]*q
d =[0]*q
for i in range(q):
a[i],b[i],c[i],d[i]= list(map(int,input().split()))
A=list(itertools.combinations_with_replacement([i for i in range(1,m+1)],n))
g=[]
for v in A:
e=0
for i in range(q):
... | from itertools import combinations_with_replacement
n,m,q =list(map(int,input().split()))
summa=[]
res=[]
for i in range(q):
a=[int(i) for i in input().split()]
summa.append(a)
for i in combinations_with_replacement(list(range(1,m+1)),n):
cnt=0
for j in summa:
if i[j[1]-1]-... | p02695 |
from itertools import*
n,m,q,*L=list(map(int,open(0).read().split()))
print((max(sum(d*(x[b-1]-x[a-1]==c)for a,b,c,d in zip(*[iter(L)]*4))for x in combinations_with_replacement(list(range(m)),n)))) | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.buffer.readline
n,m,q=list(map(int,input().split()))
Q=[list(map(int,input().split())) for _ in range(q)]
ans=0
def dfs(i,tab,ma):
global ans
if i==n:
t=0
for a,b,c,d in Q:
if tab[b-1]-tab[a-1]==c:
t+=d
if t>ans:
ans=t
return
... | p02695 |
from itertools import combinations_with_replacement
N, M, Q = list(map(int,input().split()))
x = [_ for _ in range(1, M+1)]
#y = list(combinations(x, N))
y = list(combinations_with_replacement(x, N))
l = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
z = 0
for i in range(len(y)):
for... | from itertools import combinations_with_replacement
N, M, Q = list(map(int,input().split()))
x = [_ for _ in range(1, M+1)]
y = list(combinations_with_replacement(x, N))
l = [list(map(int, input().split())) for _ in range(Q)]
ans = []
z = 0
for i in range(len(y)):
for j in range(Q):
if y[i][l[j... | p02695 |
from itertools import combinations_with_replacement
N, M, Q = list(map(int,input().split()))
x = [_ for _ in range(1, M+1)]
y = list(combinations_with_replacement(x, N))
l = [tuple(map(int, input().split())) for _ in range(Q)]
ans = 0
z = 0
for i in range(len(y)):
for j in range(Q):
if y[i][l[j... | from itertools import combinations_with_replacement
N, M, Q = list(map(int,input().split()))
x = [_ for _ in range(1, M+1)]
y = list(combinations_with_replacement(x, N))
l = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
z = 0
for i in range(len(y)):
for j in range(Q):
if y[i][l[j]... | p02695 |
#実験
# -*- coding: utf-8 -*-
n, m, q = list(map(int, input().split()))
integer_set = [list(map(int, input().split())) for _ in range(q)]
a = [1]
score = 0
# 深さ優先探索(Depth First Search)
def dfs(seq):
if len(seq) == n:
global score
tmp_score = 0
for a, b, c, d in integer_set:
... | N,M,Q=list(map(int,input().split()))
R=[list(map(int,input().split())) for i in range(Q)]
S=[1]*N#1がNこ入った配列
def dfs(d):
if d==N-1:
t=0
for a,b,c,d in R:
if S[b-1]-S[a-1]==c:
t+=d
return t
else:
m=0
for i in range(S[d],M+1):
... | p02695 |
import sys
input = sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log
from heapq import heapify, heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisec... | import sys
input = sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log
from heapq import heapify, heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisec... | p02695 |
N,M,Q = list(map(int,input().split()))
abcd = [list(map(int,input().split())) for i in range(Q)]
import itertools
tmp = []
for i in range(1,M+1):
tmp.append(i)
A = list(itertools.combinations_with_replacement(tmp,N))
tmp2 = []
for i in range(len(A)):
B = list(A[i])
B.sort()
tmp2.append(B)... | N,M,Q = list(map(int,input().split()))
abcd = [list(map(int,input().split())) for i in range(Q)]
import itertools
A = list(itertools.combinations_with_replacement(list(range(1,M+1)),N))
answer = 0
for i in range(len(A)):
ans = 0
for j in range(Q):
if A[i][ abcd[j][1]-1 ] - A[i][ abcd[j][0]... | p02695 |
def comb(n,r):
r=min(r,n-r)
c=1
for i in range(r):
c=c*(n-i)/(r-i)
return int(c)
N,M,Q=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(Q)]
npat=comb(N+M,M)
A=[1 for _ in range(N)]
ans=0
for i in range(npat):
temp=0
for j in range(Q):
... | def dfs(A):
if len(A)==N:
temp=0
for j in range(Q):
if A[a[j][1]-1]-A[a[j][0]-1]==a[j][2]:
temp+=a[j][3]
ans.append(temp)
return
else:
if len(A)>0:
m=A[-1]
else:
m=1
for i in range(m,M+1):
... | p02695 |
n,m,q=list(map(int,input().split()))
abcd=[list(map(int,input().split())) for _ in range(q)]
all_a=[]
def make_a(t):
ret=[]
todo=[t]
while todo:
i=todo.pop()
if len(i)==n:
ret.append(i)
continue
for j in range(i[-1],m+1):
todo.append(i+[j])
return ret
for i in range(1... | n,m,q=list(map(int,input().split()))
abcd=[list(map(int,input().split())) for _ in range(q)]
all_a=[]
def make_a():
ret=[]
todo=[[]]
while todo:
i=todo.pop()
if len(i)==n:
ret.append(i)
continue
l=i[-1] if len(i)>0 else 1
for j in range(l,m+1):
todo.append(i+[j])
... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
buff = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for A in itertools.combinations_with_replacement(list(range(1, M+1)), N):
score = 0
for a, b, c, d in buff:
if A[b-1] - A[a-1] == c:
score += d
ans = m... | # coding: utf-8
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def dfs(A):
# 再代入のため、グローバル宣言
global ans
# N桁なら計算
if len(A) == N:
score = 0
for a, b, c, d in buff:
if A[b-1] - A[a-1] == c:
score += d
ans = max(a... | p02695 |
import sys
from copy import deepcopy
sys.setrecursionlimit(10**7)
def dfs(now):
global ans
if len(now) == N:
tmp_ans = 0
for a, b, c, d in query:
a -= 1
b -= 1
if now[b] - now[a] == c:
tmp_ans += d
ans = max(tmp_ans, ans... | # 全探索で行う
N, M, Q = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]
A = [1]
def dfs(now):
if len(now) == N:
global ans
tmp_ans = 0
for a, b, c, d in query:
a -= 1
b -= 1
if now[b] - now[a] == c:
... | p02695 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
INF = 10**10
MOD = 10**9 + 7
N, M, Q = list(map(int,input().split()))
query = []
for q in range(Q):
a,b,c,d = list(map(int,input().split()))
a-=1
b-=1
query.append((a,b,c,d))
old = []
for i in rang... | import itertools
N, M, Q = list(map(int,input().split()))
query = []
for q in range(Q):
a,b,c,d = list(map(int,input().split()))
a-=1
b-=1
query.append((a,b,c,d))
mx = 0
for comb in itertools.combinations_with_replacement([i for i in range(1,M+1)],N):
score = 0
for a,b,c,d in query:
... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
m = list()
res = -100
for i in range(Q):
n = list(map(int, input().split()))
m.append(n)
l = list()
for i in range(M):
l.append(i + 1)
p = itertools.combinations_with_replacement(l, N)
for p in p:
total = 0
for i in range(Q):
... | import itertools
N, M, Q = list(map(int, input().split()))
m = list()
res = -100
for i in range(Q):
n = list(map(int, input().split()))
m.append(n)
l = [x for x in range(1, M + 1)]
p = itertools.combinations_with_replacement(l, N)
for p in p:
total = 0
for i in range(Q):
num = 0
... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
m = list()
res = -100
for i in range(Q):
n = list(map(int, input().split()))
m.append(n)
l = [x for x in range(1, M + 1)]
p = itertools.combinations_with_replacement(l, N)
for p in p:
total = 0
for i in range(Q):
num = 0
... | import itertools
N, M, Q = list(map(int, input().split()))
m = list()
res = -100
for i in range(Q):
n = list(map(int, input().split()))
m.append(n)
l = [x for x in range(1, M + 1)]
p = itertools.combinations_with_replacement(l, N)
for p in p:
total = 0
for i in range(Q):
a = m[i][0]
... | p02695 |
from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for i in range(Q)]
ans = 0
for x in combinations_with_replacement(list(range(M)), N):
temp = 0
for i in range(Q):
if x[ABCD[i][1]-1]+1 == x[ABCD[i][0]-1]+1 + A... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for i in range(Q)]
ans = 0
for A in combinations_with_replacement(list(range(M)), N):
temp = 0
for abcd in ABCD:
if A[abcd[1]-1]+1 == A[abcd[0]-1]+1 + abcd[2]:... | p02695 |
from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for i in range(Q)]
ans = 0
for A in combinations_with_replacement(list(range(M)), N):
temp = 0
for abcd in ABCD:
if A[abcd[1]-1]+1 == A[abcd[0]-1]+1 + abcd[2]:... | from itertools import combinations_with_replacement
def main():
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for i in range(Q)]
ans = 0
for A in combinations_with_replacement(list(range(M)), N):
temp = 0
for abcd in ABCD:
if A[... | p02695 |
n, m, q = list(map(int, input().split()))
A, B, C, D = [], [], [], []
for i in range(q):
a, b, c, d = list(map(int, input().split()))
A.append(a - 1)
B.append(b - 1)
C.append(c)
D.append(d)
L = []
def f(l):
if len(l) == n:
L.append(l)
return
for i in range(l[... | n, m, q = list(map(int, input().split()))
A, B, C, D = [], [], [], []
for i in range(q):
a, b, c, d = list(map(int, input().split()))
A.append(a - 1)
B.append(b - 1)
C.append(c)
D.append(d)
L = []
def f(l):
if len(l) == n:
L.append(l)
return
for i in range(l[... | p02695 |
n, m, q = list(map(int, input().split()))
A, B, C, D = [], [], [], []
for i in range(q):
a, b, c, d = list(map(int, input().split()))
A.append(a - 1)
B.append(b - 1)
C.append(c)
D.append(d)
L = []
def f(l):
if len(l) == n:
L.append(l)
return
for i in range(l[... | n, m, q = list(map(int, input().split()))
T = []
for i in range(q):
a, b, c, d = list(map(int, input().split()))
T.append((a - 1, b - 1, c, d))
L = []
def f(l):
if len(l) == n + 1:
L.append(l[1:])
return
for i in range(l[-1], m + 1):
f(l + [i])
f([1])
print((max(... | p02695 |
def dfs(A):
if len(A) == n+1:
p = 0
for i in range(q):
if A[b[i]]-A[a[i]] == c[i]:
p += d[i]
global ans
if p > ans:
ans = p
return
num = A[-1]
global m
while num <= m:
dfs(A[:]+[num])
num += 1
... | def dfs(A):
if len(A) == n+1:
p = 0
global ans
for i in range(q):
if A[b[i]]-A[a[i]] == c[i]:
p += d[i]
if p > ans:
ans = p
return
num = A[-1]
while num <= m:
dfs(A[:]+[num])
num += 1
if __name_... | p02695 |
N, M, Q = [int(n) for n in input().split()]
a, b, c, d = [list(x) for x in zip(*[[int(n) for n in input().split()] for _ in range(Q)])]
ans = 0
def dfs(A):
global ans
if len(A) == N+1:
now = 0
for i in range(Q):
if A[b[i]] - A[a[i]] == c[i]:
now += d[i]
... | N, M, Q = [int(n) for n in input().split()]
a, b, c, d = [list(x) for x in zip(*[[int(n) for n in input().split()] for _ in range(Q)])]
ans = 0
def dfs(A):
global ans
if len(A) == N:
now = 0
for i in range(Q):
if A[b[i]-1] - A[a[i]-1] == c[i]: now += d[i]
ans = max... | p02695 |
# import numpy as np
# import queue
# import heapq
from itertools import combinations_with_replacement
def main():
N, M, Q = list(map(int, input().split()))
queries = [list(map(int, input().split())) for _ in range(Q)]
As = combinations_with_replacement(list(range(1, M+1)), N)
max_tota... | from itertools import combinations_with_replacement
def main():
n_ints, max_int, n_queries = list(map(int, input().split()))
queries = [list(map(int, input().split())) for _ in range(n_queries)]
possible_sequences = combinations_with_replacement(list(range(1, max_int+1)), n_ints)
max_scor... | p02695 |
import itertools
n,m,q=list(map(int,input().split()))
Q=[]
for i in range(q):
a,b,c,d=list(map(int,input().split()))
Q.append([a-1,b-1,c,d])
ans=0
for i in range(m):
L=[i for i in range(1,n+i-1)]
C=itertools.combinations(L,n-2)
for c in C:
#print(c)
cnt=0
A=[... | import copy
n,m,q=list(map(int,input().split()))
Q=[]
for i in range(q):
a,b,c,d=list(map(int,input().split()))
Q.append([a-1,b-1,c,d])
B=[]
def dfs(A,l):
if l==n:
B.append(A)
else:
for i in range(A[-1],m+1):
nA=copy.copy(A)
nA.append(i)
... | p02695 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
ans = 0
def main():
N, M, Q = list(map(int, readline().split()))
query = []
for _ in range(Q):
a, b, c, d = list(map(int, readline().split()))... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(1000000)
ans = 0
def main():
N, M, Q = list(map(int, readline().split()))
query = []
for _ in range(Q):
a, b, c, d = list(map(int, readline().split()))... | p02695 |
N, M, Q = list(map(int, input().split()))
ans = 0
zenbu = []
def tukuru(cur, last):
if len(cur) == N:
zenbu.append(cur)
return
for j in range(last, M+1):
tukuru(cur+[j], j)
tukuru([], 1)
D = [0]*len(zenbu)
for i in range(Q):
a, b, c, d = list(map(int, input().split()))
... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
a = list()
b = list()
c = list()
d = list()
for _ in range(Q):
_a, _b, _c, _d = list(map(int, input().split()))
a.append(_a-1)
b.append(_b-1)
c.append(_c)
d.append(_d)
ans = 0
for A in comb... | p02695 |
N,M,Q=list(map(int, input().split()))
a_ls=[]
b_ls=[]
c_ls=[]
d_ls=[]
for vnwrjvnwakn in range(Q):
abcd=list(map(int, input().split()))
a_ls+=[abcd[0]]
b_ls+=[abcd[1]]
c_ls+=[abcd[2]]
d_ls+=[abcd[3]]
import itertools
As=itertools.combinations_with_replacement(list(range(1,M+1)),N)
ans=0
for... | N,M,Q=list(map(int, input().split()))
a_ls=[]
b_ls=[]
c_ls=[]
d_ls=[]
for vnwrjvnwakn in range(Q):
abcd=list(map(int, input().split()))
a_ls+=[abcd[0]]
b_ls+=[abcd[1]]
c_ls+=[abcd[2]]
d_ls+=[abcd[3]]
import itertools
As=itertools.combinations_with_replacement(list(range(1,M+1)),N)
ans=0
for... | p02695 |
n, m, q = list(map(int, input().split()))
abcd = [tuple(map(int, input().split()))for _ in range(q)]
ls = []
def dfs(x, s):
if len(s) == n:
ls.append(s)
return 0
else:
for y in range(x, m):
dfs(y, s+str(y))
dfs(0, "")
ans = 0
for x in ls:
x = tuple([i... | from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
abcd = [tuple(map(int, input().split()))for _ in range(q)]
ans = 0
for x in combinations_with_replacement(list(range(1, m+1)), n):
cnt = 0
for a, b, c, d in abcd:
if x[b-1]-x[a-1] == c:
cnt ... | p02695 |
def resolve():
import itertools
n, m, q = list(map(int, input().split()))
cond = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for i in list(itertools.combinations_with_replacement(list(range(1, m+1)), n)):
point = 0
for j in range(q):
if i[cond[j][1... | def resolve():
import itertools
n, m, q = list(map(int, input().split()))
cond = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for i in itertools.combinations_with_replacement(list(range(1, m+1)), n):
point = 0
for j in range(q):
if i[cond[j][1]-1] -... | p02695 |
n, m, q = list(map(int, input().split()))
abcd = []
for i in range(q):
abcd.append(list(map(int, input().split())))
A = []
def dfs(num):
if len(num) == n:
A.append(num)
else:
now = num[-1]
for i in range(now, m + 1):
dfs(num + [i])
for i in range(1, ... | n, m, q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(q)]
A = []
def dfs(num):
if len(num) == n:
A.append(num)
else:
now = num[-1]
for i in range(now, m + 1):
dfs(num + [i])
for i in range(1, 10):
dfs([i])
... | p02695 |
import copy
def dfs(A):
global ans
if len(A) == N:
score = 0
for a, b, c, d in buff:
if A[b - 1] - A[a - 1] == c:
score += d
ans = max(ans, score)
return
A.append(A[-1])
while A[-1] <= M:
dfs(copy.copy(A))
A[-... | def dfs(A):
global ans
if len(A) == N:
score = 0
for a, b, c, d in buff:
if A[b - 1] - A[a - 1] == c:
score += d
ans = max(ans, score)
return
A.append(A[-1])
while A[-1] <= M:
dfs(A[:])
A[-1] += 1
N, M, Q = li... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
abcd_list = []
for q in range(Q):
abcd_list.append(list(map(int, input().split())))
#print(abcd_list)
list_tmp = []
for i in range(1, M + 1):
list_tmp.append(i)
comb_A = list(itertools.combinations_with_replacement(list_tmp, N))
ma... | import itertools
N, M, Q = list(map(int, input().split()))
abcd_list = []
for q in range(Q):
abcd_list.append(list(map(int, input().split())))
#print(abcd_list)
list_tmp = []
for i in range(1, M + 1):
list_tmp.append(i)
comb_A = list(itertools.combinations_with_replacement(list_tmp, N))
ma... | p02695 |
N, M, Q = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for a in range(1, M+1):
for b in range(a, M+1):
for c in range(b, M+1):
for d in range(c, M+1):
for e in range(d, M+1):
for f in range(e, M+1)... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for i in combinations_with_replacement(list(range(1, M+1)), N):
tmp = 0
for a, b, c, d in A:
if i[b-1] - i[a-1] == c:
tm... | p02695 |
N, M, Q = list(map(int, input().split()))
l = []
for i in range(Q):
l.append(list(map(int, input().split())))
A_N = [[i] for i in range(1, M+1)]
for i in range(N-1):
a = []
for j in range(len(A_N)):
last = A_N[j][-1]
for k in range(last, M+1):
a.append(A_N[j] + [k])
A_N = a
high_sc... | N, M, Q = list(map(int, input().split()))
l = []
for i in range(Q):
l.append(list(map(int, input().split())))
A_N = [[i] for i in range(1, M+1)]
for i in range(N-1):
a = []
for j in range(len(A_N)):
last = A_N[j][-1]
for k in range(last, M+1):
a.append(A_N[j] + [k])
A_N = a
high_sc... | p02695 |
import copy
n, m, q = list(map(int, input().split()))
a = [0]*q
b = [0]*q
c = [0]*q
d = [0]*q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
A = [1]
ans = 0
def dfs(lis):
if len(lis) == n+1:
now = 0
for i in range(q):
if lis[b[i]] - lis[a[i]... | import itertools
n, m, q = list(map(int, input().split()))
a = [0]*q
b = [0]*q
c = [0]*q
d = [0]*q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
ans = 0
for A in itertools.combinations_with_replacement(list(range(1, m+1)), n):
now = 0
for i in range(q):
if A... | p02695 |
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
def check(arr):
ans = 0
for A in arr:
score = 0
for a, b, c, d in abcd:
if A[b-1] - A[a-1] == c:
score += d
if ans < score:
ans = score... | N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
from itertools import combinations_with_replacement as com
ans = 0
for A in com(list(range(1, M+1)), N):
score = 0
for a, b, c, d in abcd:
if A[b-1] - A[a-1] == c:
score += d
i... | p02695 |
import itertools
N,M,Q=list(map(int,input().split()))
all=[]
for i in range(Q):
all.append(list(map(int,input().split())))
#print(all)
#print(len(all))
#print(all[0][1])
x=sorted([i for i in range(1,M+1)])
maxdsum=0
for A in itertools.combinations_with_replacement(x, N):
dsum=0
#print("... | import itertools
N,M,Q=list(map(int,input().split()))
all=[]
for i in range(Q):
all.append(list(map(int,input().split())))
x=[i for i in range(1,M+1)]
maxdsum=0
for A in itertools.combinations_with_replacement(x, N):
dsum=0
for num in range(Q):
if A[all[num][1]-1]-A[all[num][0]-1]==all[num]... | p02695 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
pairs = [0] * q
for i in range(q):
pairs[i] = list(map(int, input().split()))
from collections import deque
def dfs(min_val, length):
if length == 0:
return list([deque()])
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield tuple(seq)
return
if len(seq) == 0:
start =... | p02695 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield tuple(seq)
return
if len(seq) == 0:
start =... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield seq
return
if len(seq) == 0:
_max = 1
... | p02695 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield seq
return
if not seq:
_max = 1
else:
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield seq
return
if len(seq) == 0:
_max = 1
... | p02695 |
from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for pat in combinations_with_replacement(list(range(1, m + 1)), n):
sm = 0
for a, b, c, d in abcd:
a -= 1
b -= 1
i... | from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for pat in combinations_with_replacement(list(range(1, m + 1)), n):
score = 0
for a, b, c, d in abcd:
a -= 1
b -= 1
... | p02695 |
def dfs(A):
if len(A) > n:
total = 0
for i in range(q):
if A[b[i]]-A[a[i]] == c[i]:
total += d[i]
global ans
if total > ans:
ans = total
return
A.append(A[-1])
while A[-1] <= m:
dfs(A[:])
A[-1] += 1
... |
def dfs(A):
if len(A) == n+1:
global ans
total = 0
for i in range(q):
if A[b[i]]-A[a[i]] == c[i]:
total += d[i]
if total > ans:
ans = total
return
num = A[-1]
while num <= m:
dfs(A[:]+[num])
num ... | p02695 |
import itertools
n,m,q=(int(i) for i in input().split())
l=[]
r=[i+1 for i in range(m)]
point=0
def checker(x,l):
p=0
for i in range(len(l)):
a,b,c,d=(l[i][j] for j in range(4))
if x[b]-x[a]==c:
p+=d
return p
for i in range(q):
a,b,c,d=(int(i) for i in input().split())
a-=1
b-=1... | import itertools
n,m,q=(int(i) for i in input().split())
l=[]
r=[i+1 for i in range(m)]
point=0
def checker(x,l):
p=0
for i in range(len(l)):
if x[l[i][1]]-x[l[i][0]]==l[i][2]:
p+=l[i][3]
return p
for i in range(q):
a,b,c,d=(int(i) for i in input().split())
a-=1
b-=1
l.append([a,b... | p02695 |
import itertools
n, m, q = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(q)]
ls = list(range(n + m - 1))
mx = 0
for l in itertools.combinations(ls, m - 1):
a = [0]
idx = 0
val = 1
for i in range(n + m - 1):
if idx < m - 1 and i == l[idx]:
... | import sys
sys.setrecursionlimit(10**7)
n, m, q = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(q)]
def dfs(k, x):
global mx
if k == n:
v = 0
for line in query:
a, b, c, d = line
if x[b] - x[a] == c: v += d
... | p02695 |
n, m, q = list(map(int, input().split()))
queries = [tuple(map(int, input().split())) for _ in range(q)]
arr = []
def f(p):
if len(p) == n+1:
arr.append(p[:-1])
return
while p[-1] <= m:
f(p + [p[-1]])
p[-1] += 1
f([1])
ans = 0
for p in arr:
score = 0
f... | n, m, q = list(map(int, input().split()))
queries = [tuple(map(int, input().split())) for _ in range(q)]
ans = 0
def calc_score(p):
score = 0
for a, b, c, d in queries:
if p[b-1] - p[a-1] == c:
score += d
return score
def f(p):
if len(p) == n+1:
global ans
... | p02695 |
n, m, q = list(map(int, input().split()))
queries = [tuple(map(int, input().split())) for _ in range(q)]
ans = 0
def calc_score(p):
score = 0
for a, b, c, d in queries:
if p[b-1] - p[a-1] == c:
score += d
return score
def f(p):
if len(p) == n:
global ans
... | from itertools import combinations_with_replacement as comb
n, m, q = list(map(int, input().split()))
queries = [tuple(map(int, input().split())) for _ in range(q)]
ans = 0
def calc_score(p):
score = 0
for a, b, c, d in queries:
if p[b-1] - p[a-1] == c:
score += d
return sco... | p02695 |
n, m, q = list(map(int, input().split()))
queries = [tuple(map(int, input().split())) for _ in range(q)]
def calc_score(p):
score = 0
for a, b, c, d in queries:
if p[b-1] - p[a-1] == c:
score += d
return score
def f(p):
if len(p) == n:
return calc_score(p)
... | n, m, q = list(map(int, input().split()))
queries = [tuple(map(int, input().split())) for _ in range(q)]
ans = 0
def calc_score(p):
score = 0
for a, b, c, d in queries:
if p[b-1] - p[a-1] == c:
score += d
return score
def f(p):
if len(p) == n:
global ans
... | p02695 |
import sys
from itertools import combinations_with_replacement
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N, M, Q = list(map(int, input().split()))
abcd = [None] * Q
for i in range(Q):
abcd[i] = tuple(map(int, input().split()))
ans = 0
for A in co... | import sys
from itertools import combinations_with_replacement
input = sys.stdin.readline
def main():
N, M, Q = list(map(int, input().split()))
abcd = [None] * Q
for i in range(Q):
abcd[i] = list(map(int, input().split()))
abcd[i][0] -= 1
abcd[i][1] -= 1
ans = 0... | p02695 |
N,M,Q = list(map(int,input().split()))
# 10個の数列で、A_i <= A_i+1となる組み合わせ（最大10）は
# [1,1,1,1,1,1,1,1,1,1]のどこに10個のUPを入れるかの組み合わせであり
# 20C10 = 184756
# この組み合わせに対して最大50のクエリを試すと、9237800通り
# 全探索する
query = [None] * Q
for i in range(Q):
query[i] = list(map(int,input().split()))
stack = []
for i in range(1,M + 1):
... | N,M,Q = list(map(int,input().split()))
query = [None] * Q
for i in range(Q):
query[i] = list(map(int,input().split()))
def calc(arr,query):
res = 0
for a,b,c,d in query:
if arr[b-1] - arr[a-1] == c:
res += d
return res
ans = 0
import itertools
for arr in itertools.combinations_with... | p02695 |
#標準入力
N, M, Q = list(map(int, input().split()))
abcd = []
for _ in range(Q):
tmp = list(map(int, input().split()))
abcd.append(tmp)
#実装
import itertools as it
A_candidate = list(it.combinations_with_replacement(list(range(1, M + 1)), N))
ans = 0
for i in range(len(A_candidate)):
tmp = 0
fo... | #標準入力
N, M, Q = list(map(int, input().split()))
abcd = []
for _ in range(Q):
tmp = list(map(int, input().split()))
abcd.append(tmp)
#実装
import itertools as it
A_candidate = list(it.combinations_with_replacement(list(range(1, M + 1)), N))
ans = 0
for i in range(len(A_candidate)):
tmp = 0
fo... | p02695 |
N,M,Q=list(map(int,input().split()))
from copy import copy
stack=[[1]]
A=[]
while stack:
temp=stack.pop()
if len(temp)==N:
A.append(temp)
else:
x=temp[-1]
for i in range(x,M+1):
temp.append(i)
stack.append(copy(temp))
temp.pop()
q=[... | N,M,Q=list(map(int,input().split()))
from copy import copy
A=[]
def DFS(n,s):
if len(s)==n:
A.append(copy(s))
return
ss=s[-1]
for i in range(ss,M+1):
s.append(i)
DFS(n,s)
s.pop()
DFS(N,[1])
q=[]
for i in range(Q):
a,b,c,d=list(map(int,input().sp... | p02695 |
from sys import stdin
def input():
return stdin.readline().strip()
def main():
N, M, Q = list(map(int, input().split()))
a, b, c, d = [0] * Q, [0] * Q, [0] * Q, [0] * Q
for i in range(Q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
a[i] -= 1
b[i] -= ... | from sys import stdin
def input():
return stdin.readline().strip()
def main():
N, M, Q = list(map(int, input().split()))
a, b, c, d = [0] * Q, [0] * Q, [0] * Q, [0] * Q
for i in range(Q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
a[i] -= 1
b[i] -= ... | p02695 |
from sys import stdin
def input():
return stdin.readline().strip()
def main():
N, M, Q = list(map(int, input().split()))
a, b, c, d = [0] * Q, [0] * Q, [0] * Q, [0] * Q
for i in range(Q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
a[i] -= 1
b[i] -= ... | from sys import stdin
def input():
return stdin.readline().strip()
def main():
N, M, Q = list(map(int, input().split()))
a, b, c, d = [0] * Q, [0] * Q, [0] * Q, [0] * Q
for i in range(Q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
a[i] -= 1
b[i] -= ... | p02695 |
def cwrlp(data,r):
if r <= 0:
return []
result = []
_cwrlp(data, r, 0, [], result)
return result
def _cwrlp(data, r, start, progress, result):
if r == 0:
result.append(progress)
return
for i in range(start, len(data)):
_cwrlp(data, r-1, i, progress + [data[i]], result)
n,m,q = list(m... | def cwrlp(data,r):
if r <= 0:
return []
result = []
_cwrlp(data, r, 0, [], result)
return result
def _cwrlp(data, r, start, progress, result):
if r == 0:
result.append(progress)
return
for i in range(start, len(data)):
_cwrlp(data, r-1, i, progress + [data[i]], result)
n,m,q = list(m... | p02695 |
import sys
readline = sys.stdin.readline
from collections import deque
def main():
N, M, Q = list(map(int, readline().rstrip().split()))
P = [tuple(map(int, readline().rstrip().split())) for _ in range(Q)]
ans = 0
l = [[i] for i in range(1, M+1)]
que = deque(l)
for i in range(N):
... | import sys
readline = sys.stdin.readline
from itertools import combinations_with_replacement
def main():
N, M, Q = list(map(int, readline().rstrip().split()))
P = [tuple(map(int, readline().rstrip().split())) for _ in range(Q)]
ans = 0
for pair in combinations_with_replacement([i for i in r... | p02695 |
import itertools
N,M,Q=list(map(int,input().split()))
ABCD=[list(map(int,input().split())) for _ in range(Q)]
tl=[]
for i in range(1,M+1):
tl.append([i])
for i in range(N):
t=[]
for l in tl:
for j in range(1,M+1):
if l[-1]<=j:
t.append(l+[j])
tl=t[:]
ans=... | import itertools
N,M,Q=list(map(int,input().split()))
ABCD=[list(map(int,input().split())) for _ in range(Q)]
tl=itertools.combinations_with_replacement(list(range(1,M+1)),N)
ans=0
for l in tl:
t=0
for a,b,c,d in ABCD:
if l[b-1]-l[a-1]==c:
t+=d
ans=max(ans,t)
print(ans) | p02695 |
# -*- coding: utf-8 -*-
def input_one_number():
return int(eval(input()))
def input_multiple_number():
return list(map(int, input().split()))
def input_multiple_number_as_list():
return list(map(int, input().split()))
N,M,Q = input_multiple_number()
lists = []
for i in range(Q):
lis... | # -*- coding: utf-8 -*-
def input_one_number():
return int(eval(input()))
def input_multiple_number():
return list(map(int, input().split()))
def input_multiple_number_as_list():
return list(map(int, input().split()))
N,M,Q = input_multiple_number()
lists = []
for i in range(Q):
lis... | p02695 |
n,m,q=list(map(int,input().split()))
Q=[list(map(int,input().split())) for i in range(q)]
ans=0
#めっちゃfor文あるならdfs
R=[list(range(i,m)) for i in range(m)]
def dfs(d,s,l):
global n,m,Q,ans
if d==n:
ans_=0
for k in Q:
a,b,c,e=k
if int(s[b-1])-int(s[a-1])==c:
... | from itertools import combinations_with_replacement
n,m,q=list(map(int,input().split()))
Q=[list(map(int,input().split())) for i in range(q)]
ans=0
for s in combinations_with_replacement(list(range(1,m+1)),n):
ans_=0
for k in Q:
a,b,c,d=k
if s[b-1]-s[a-1]==c:
ans_+=d
an... | p02695 |
import itertools
n, m, q = list(map(int, input().split()))
l = []
ans = 0
ref = 0
for i in range(q):
abcd = list(map(int, input().split()))
l.append(abcd)
for i in itertools.combinations_with_replacement(list(range(1, m + 1)), n):
for j in range(q):
if i[l[j][1] - 1] - i[l[j][0] - 1]... | import itertools
n, m, q = list(map(int, input().split()))
l = []
ans = 0
ref = 0
for i in range(q):
abcd = list(map(int, input().split()))
l.append(abcd)
for i in itertools.combinations_with_replacement(list(range(1, m + 1)), n):
for a, b, c, d in l:
if i[b - 1] - i[a - 1] == c:
... | p02695 |
import sys
N = int(sys.stdin.readline())
S = [sys.stdin.readline() for i in range(N)]
M = int(sys.stdin.readline())
T = [sys.stdin.readline() for j in range(M)]
ans = 0
for s in S:
money = S.count(s) + T.count(s) * -1
ans = max(ans, money)
print(ans) | import sys
N = int(sys.stdin.readline())
s = [sys.stdin.readline().rstrip() for i in range(N)]
M = int(sys.stdin.readline())
t = [sys.stdin.readline().rstrip() for i in range(M)]
ans = 0
p = 0
m = 0
for i in s:
p = s.count(i)
m = t.count(i)
ans = max(ans, p - m)
print(ans) | p03408 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.