abeaumont/competitive-programming

Solutions to problems from various online judges / contest sites.

competitive-programming's Issues

greetingcard.cc

I have a very similar Pythonic solution to greeting card (https://open.kattis.com/problems/greetingcard) by hardcoding the only possible situations where pairs of points are exactly 2018 units apart. However, my solution failed with a "TLE" message failing on the 5/11 test case and I just couldn't figure out why.

Is your solution able to successful pass all the test cases on Kattis?

T = int(input())

lattice = []
for _ in range(T):
    x, y = map(int, input().split())
    lattice.append((x, y))

count = 0
for index in range(len(lattice)):
    cur_x = lattice[index][0] 
    cur_y = lattice[index][1]
    for jndex in range(index, len(lattice)):
        
        nex_x = lattice[jndex][0]
        nex_y = lattice[jndex][1]
        
        if ((cur_x + 2018 == nex_x and cur_y == nex_y) or
        (cur_x - 2018 == nex_x and cur_y == nex_y) or
        (cur_x == nex_x and cur_y + 2018 == nex_y) or
        (cur_x == nex_x and cur_y - 2018 == nex_y) or
        # more
        (cur_x + 1118 == nex_x and cur_y + 1680 == nex_y) or
        (cur_x + 1118 == nex_x and cur_y - 1680 == nex_y) or
        (cur_x - 1118 == nex_x and cur_y + 1680 == nex_y) or
        (cur_x - 1118 == nex_x and cur_y - 1680 == nex_y) or
        # more
        (cur_x + 1680 == nex_x and cur_y + 1118 == nex_y) or
        (cur_x + 1680 == nex_x and cur_y - 1118 == nex_y) or
        (cur_x - 1680 == nex_x and cur_y + 1118 == nex_y) or
        (cur_x - 1680 == nex_x and cur_y - 1118 == nex_y)):
            count += 1
print(count)

Help wanted

CAn you please explain why this matrix was constructed in such a way

competitive-programming/cses/1096.cc

Line 38 in 1cc6c64

for (int i = 0; i < 5; i++) a[i][i+1] = 1;

I know that later part will be solved by matrix exponentiation. But facing some difficulties in building the base matrix

/cses/1081.cc

I submitted the same solution you provided but it gives time limit exceeded
please recheck the solution of Common Divisors

Wrong Answer in 1628 - Meet in the Middle

The solution given for 1628 - Meet in the Middle gives Wrong Answer on the last test case. Kindly check the code.

[Solution request]New Flight Routes

https://cses.fi/problemset/task/1685