Problem:


Score : 300 points

Problem Statement

Given are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).

Consider a sequence A satisfying the following conditions:

A is a sequence of N positive integers.

1 \leq A_1 \leq A_2 \le \cdots \leq A_N \leq M.

Let us define a score of this sequence as follows:

The score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)

Find the maximum possible score of A.

Constraints

All values in input are integers.

2 ≤ N ≤ 10

1 \leq M \leq 10

1 \leq Q \leq 50

1 \leq a_i < b_i \leq N ( i = 1, 2, ..., Q )

0 \leq c_i \leq M - 1 ( i = 1, 2, ..., Q )

(a_i, b_i, c_i) \neq (a_j, b_j, c_j) (where i \neq j)

1 \leq d_i \leq 10^5 ( i = 1, 2, ..., Q )

Input

Input is given from Standard Input in the following format:

N M Q
a_1 b_1 c_1 d_1
:
a_Q b_Q c_Q d_Q

Output

Print the maximum possible score of A.

Sample Input 1

3 4 3
1 3 3 100
1 2 2 10
2 3 2 10

Sample Output 1

110

When A = \{1, 3, 4\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.

Sample Input 2

4 6 10
2 4 1 86568
1 4 0 90629
2 3 0 90310
3 4 1 29211
3 4 3 78537
3 4 2 8580
1 2 1 96263
1 4 2 2156
1 2 0 94325
1 4 3 94328

Sample Output 2

357500

Sample Input 3

10 10 1
1 10 9 1

Sample Output 3

1



Sample input:
3 4 3
1 3 3 100
1 2 2 10
2 3 2 10


Sample output:
110

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main
    #%%
    import itertools
    N, M, Q = R()
    ABCD = [R() for i in range(Q)]
    ans = 0
    for i in set(itertools.combinations_with_replacement(range(1, M+1), N)):
        tmp = 0
        for a, b, c, d in ABCD:
            if i[b-1] - i[a-1] == c:
                tmp += d
        ans = max(tmp, ans)
    print(ans)
    
    #%%
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N, M, Q = map(int, input().split())
a = []
b = []
c = []
d = []
for _ in range(Q):
    w,x,y,z = map(int, input().split())
    w -= 1
    x -= 1
    a.append(w)
    b.append(x)
    c.append(y)
    d.append(z)
def dfs(A_, k):
    if k == N-1:
        res = 0
        for i in range(Q):
            if A_[b[i]] - A_[a[i]] == c[i]:
                res += d[i]
        return res
    x = A_[k]
    res = 0
    for i in range(x, M+1):
        A_[k+1] = i
        res = max(res, dfs(A_, k+1))
    return res

ans = 0
A = [1]*N
for i in range(1, M+1):
    A[0] = i
    ans = max(ans, dfs(A, 0))
print(ans)

Submission status: Accepted

Solution code:
import math
import itertools
n,m,q=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]=map(int,input().split())
l = [i for i in range(1,m+1)]
ans=0
for v in itertools.combinations_with_replacement(l,n):
  a=0
  for i in range(q):
    if v[B[i]-1]-v[A[i]-1]==C[i]:
      a=a+D[i]
  if a>ans:
    ans=a
print(ans)

Submission status: Accepted

Solution code:
import sys, itertools
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    N, M, Q = LI()
    abcd = [LI() for _ in range(Q)]

    ans = 0
    for i in itertools.combinations_with_replacement(range(1, M+1), N):
        # print(i)
        score = 0
        for j in abcd:
            a = j[0]-1
            b = j[1]-1
            c = j[2]
            d = j[3]
            if i[b]-i[a]==c:
                score += d
        ans = max(score, ans)

    print(ans)


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
list1 = []
for i in range(Q):
    l = list(map(int, input().split()))
    list1.append(l)
ans = 0
list2 = [i for i in range(1, M+1)]
for l in combinations_with_replacement(list2, N):
    tmp = 0
    for i in range(Q):
        if l[list1[i][1]-1]-l[list1[i][0]-1]==list1[i][2]:
            tmp += list1[i][3]
    if tmp >= ans:
        ans = tmp
print(ans)

Submission status: Accepted

Solution code:
import sys
from itertools import permutations, combinations, combinations_with_replacement
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

N, M, Q = map(int, readline().split())
abcd = [list(map(int, readline().split())) for _ in range(Q)]
l = [i for i in range(1, M + 1)]

ans = 0
for v in combinations_with_replacement(l, N):
    acc = 0
    for a, b, c, d in abcd:
        if v[b - 1] - v[a - 1] == c:
            acc += d
    ans = max(ans, acc)

print(ans)

Submission status: Accepted

Solution code:
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
#     combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def readInt():
    return list(map(int,input().split()))

def func():
    global a,q,ans
    res = 0
    for x in q:
        if a[x[1]-1]-a[x[0]-1]==x[2]:
            res += x[3]
    ans = max(ans,res)
    return

def dfs(pos):
    global a,n,m
    if pos==n:
        return func()
    for i in range(max(1,a[pos-1]),m+1):
        a[pos] = i
        dfs(pos+1)

def main():
    global a,n,m,Q,q,ans
    n,m,Q = readInt()
    q = []
    for i in range(Q):
        q.append(readInt())
    ans = 0
    a = [0 for i in range(n)]
    dfs(0)
    print(ans)
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
from functools import lru_cache
import itertools

sys.setrecursionlimit(10 ** 8)

M = 10 ** 9 + 7
INF = 10 ** 17


def f(start, end, n):
    if n == 1:
        for i in range(start, end + 1):
            yield [i]
        return
    for i in range(start, end + 1):
        for nn in f(i, end, n - 1):
            yield [i] + nn


def main():
    # N = int(input())
    N, M, Q = [int(a) for a in input().split()]
    abcd = [
        [int(a) for a in input().split()]
        for _ in range(Q)
    ]


    res = 0
    for v in f(1, M, N):

        total = 0
        for a, b, c, d in abcd:
            if v[b - 1] - v[a - 1] == c:
                total += d

        res = max(res, total)
    print(res)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n, m, q = map(int, input().split())
queries = []
for _ in range(q):
    a, b, c, d = map(int, input().split())
    queries.append([a-1, b-1, c, d])

patterns = []

todo = ['0']
while todo:
    num = todo.pop()
    if len(num) == n:
        patterns.append(num)
        continue

    last = int(num[-1])
    for new_num in range(last, m):
        new = num + str(new_num)
        todo.append(new)

candidates = []
for pattern in patterns:
    res = 0
    for a, b, c, d in queries:
        if int(pattern[b]) - int(pattern[a]) == c:
            res += d

    candidates.append(res)

print(max(candidates))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)

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()))

def saiki(i, last, list):
    if(i == N):
        sum = 0
        for q in range(Q):
            if(list[b[q]-1] - list[a[q]-1] == c[q]):
                sum += d[q]
        return sum
    res = 0
    for x in range(last, M+1):
        list.append(x)
        res = max(res, saiki(i+1, x, list))
        list.pop(-1)
    return res

all = saiki(0, 1, [])
print(all)

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

N, M, Q = map(int, readline().split())
q_kumi = []
for _ in range(Q):
    q_kumi.append(list(map(int, readline().split())))

import itertools
AL = itertools.combinations_with_replacement(range(1, M+1), N)

ans = 0
for A in AL:
    tmp_ans = 0
    for kumi in q_kumi:
        if A[kumi[1]-1] - A[kumi[0]-1] == kumi[2]:
            tmp_ans += kumi[3]
    ans = max(ans, tmp_ans)


print(ans)

Submission status: Accepted

Solution code:
from itertools import combinations_with_replacement
def main():
    n, m, q = map(int, input().split())
    query = []
    for _ in range(q):
        a, b, c, d = map(int, input().split())
        query.append([a, b, c, d])
    
    ele = [i for i in range(1, m+1)]
    
    ans = -1
    for comb in combinations_with_replacement(ele, n):
        comb = sorted(comb)
        tmp = 0
        for qu in query:
            if comb[qu[1]-1] - comb[qu[0]-1] == qu[2]:
                tmp += qu[3]
            else:
                continue
        if tmp > ans:
            ans = tmp
    print(ans)
    
main()

Submission status: Accepted

Solution code:
import itertools

N, M, Q = map(int, input().split())

L = []
for _ in range(Q):
    L.append(list(map(int, input().split())))

C = itertools.combinations_with_replacement(range(1, M + 1), N)
ans = 0

for c in C:
    tmp = 0
    for l in L:
        if c[l[1] - 1] - c[l[0] - 1] == l[2]:
           tmp += l[3]
    ans = max(ans, tmp)
print(ans)

Submission status: Accepted

Solution code:
import itertools

n,m,q = list(map(int, input().split()))
lst = [None for i in range(q)]
for i in range(q):
    a,b,c,d = list(map(int, input().split()))
    lst[i] = (a,b,c,d)

numlst = [i+1 for i in range(m)]
comb = list(itertools.combinations_with_replacement(numlst,n))

ans = 0
for i in comb:
    # print("i",i)
    koho = 0
    for Q in range(q):
        # print("Q", Q)
        # print("lst[Q]",lst[Q])
        if i[lst[Q][1]-1]-i[lst[Q][0]-1]==lst[Q][2]:
            koho+=lst[Q][3]
            # print("o")
    # print(koho)
    ans = max(ans, koho)

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# sys.setrecursionlimit(100000)
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)

def slv(N, M, Q, ABCD):

    def dfs(a, n):
        r = 0
        if n == N:
            t = 0
            for abcd in ABCD:
                A, B, C, D = abcd
                if a[B] - a[A] == C:
                    t += D
            return t
        b = a[-1]
        for c in range(b, M+1):
            a.append(c)
            r = max(r, dfs(a, n+1))
            a.pop()
        return r
    return dfs([1], 0)


def main():
    N, M, Q = read_int_n()
    ABCD = [read_int_n() for _ in range(Q)]
    print(slv(N, M, Q, ABCD))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
L = list(range(1, M+1))

D = [list(map(int, input().split())) for _ in range(Q)]
ans = []

for p in combinations_with_replacement(L, N):
    tmp = 0
    for a, b, c, d in D:
        if p[b-1]-p[a-1] == c:
            tmp += d
    ans.append(tmp)

print(max(ans))

Submission status: Accepted

Solution code:
from itertools import combinations
N, M, Q = map(int, input().split())
qs = []
for _ in range(Q):
    qs.append(tuple(map(int, input().split())))

ans = 0
for cs in combinations(range(N+M-1), M-1):
    cs = set(cs)
    arr = []
    tmp = 0
    i = 0
    for k in range(N+M-1):
        if k in cs:
            tmp += 1
        else:
            arr.append(tmp)
            i += 1
        if i >= N:
            break
    score = 0
    for a, b, c, d in qs:
        if arr[b-1] - arr[a-1] == c:
            score += d
    ans = ans if ans > score else score
print(ans)

Submission status: Accepted

Solution code:
from itertools import combinations_with_replacement
N, M, Q = [int(x) for x in input().split()]
lst = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for seq in combinations_with_replacement(range(1, M+1), N):
    tmp = 0
    for a, b, c, d in lst:
        if (seq[b-1] - seq[a-1] == c):
            tmp += d
    ans = max(ans, tmp)
print(ans)

Submission status: Accepted

Solution code:
import os
from functools import reduce
from operator import mul

import itertools
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


# MOD = 998244353


def ncr(n, r, mod=None):
    """
    組み合わせの数 nCr
    :param int n:
    :param int r:
    :param int mod: 3 以上の素数であること
    :rtype: int
    """
    if n < r:
        return 0

    # 何度も呼ぶ場合は combination.py をつかう
    r = min(n - r, r)
    if r == 0:
        return 1
    if mod:
        return reduce(mul, range(n, n - r, -1)) * mod_inv(reduce(mul, range(r, 0, -1)), mod) % mod
    else:
        # math.factorial よりこっちのが速い
        # https://atcoder.jp/contests/abc110/submissions?f.Task=&f.Language=&f.Status=&f.User=nohtaray
        return reduce(mul, range(n, n - r, -1)) // reduce(mul, range(r, 0, -1))


def nhr(n, r, mod=None):
    """
    重複組み合わせの総数 nHr
    :param int n:
    :param int r:
    :param int mod:
    """
    return ncr(n + r - 1, r, mod)


def cumsum(it):
    """
    累積和
    :param collections.Iterable it:
    """
    cs = 0
    ret = []
    for v in it:
        cs += v
        ret.append(cs)
    return ret


# a = nhr(10, 10)
N, M, Q = list(map(int, sys.stdin.buffer.readline().split()))
ABCD = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(Q)]

ans = 0
for r in range(M):
    for idx in itertools.combinations_with_replacement(range(1, N + 1), r=r):
        a = [0] * (N + 10)
        a[1] = 1
        for i in idx:
            a[i] += 1
        cum = cumsum(a)
        # print(idx, cum[1: N + 1])
        pt = 0
        for a, b, c, d in ABCD:
            if cum[b] - cum[a] == c:
                pt += d
        ans = max(ans, pt)
print(ans)

Submission status: Accepted

Solution code:
N, M, Q = map(int, input().split())
L = []
for i in range(Q):
    ai, bi, ci, di = map(int, input().split())
    ai -= 1
    bi -= 1
    L.append((ai, bi, ci, di))


def dfs(A):
    if len(A) == N:
        r = 0
        for Li in L:
            if A[Li[1]] - A[Li[0]] == Li[2]:
                r += Li[3]
        return r
    r = 0
    for i in range(A[-1], M + 1):
        r = max(r, dfs(A + [i]))
    return r


print(dfs([1]))

Submission status: Accepted

Solution code:
n, m, q = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(q)]

ans = 0

from itertools import combinations_with_replacement

for _x in combinations_with_replacement(range(1,m+1), n):
    _ans = 0
    for (a, b, c, d) in X:
        if _x[b-1] - _x[a-1] == c:
            _ans += d
    ans = max(ans, _ans)

print(ans)

Submission status: Accepted

Solution code:
import itertools

N, M, Q = map(int, input().split())
q_list = []
for i in range(Q):
    q = list(map(int, input().split()))
    q_list.append(q)
l = []
for i in range(1,M+1):
    l.append(i)
A_list = list(itertools.combinations_with_replacement(l, N))
ans = 0

for A in A_list:
    s = 0
    for q in q_list:
        if A[q[1]-1] - A[q[0]-1] == q[2]:
            s += q[3]
    if s > ans:
        ans = s

print(ans)