| Task: | Ruudukko | 
| Sender: | sveti404 | 
| Submission time: | 2022-11-08 09:44:26 +0200 | 
| Language: | Python3 (CPython3) | 
| Status: | READY | 
| Result: | 28 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 28 | 
| #2 | TIME LIMIT EXCEEDED | 0 | 
| #3 | TIME LIMIT EXCEEDED | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.02 s | 1, 2, 3 | details | 
| #3 | ACCEPTED | 0.02 s | 1, 2, 3 | details | 
| #4 | ACCEPTED | 0.56 s | 2, 3 | details | 
| #5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Code
n = int(input())
modulo = 10**9+7
answer = n*n
ruudukko = [[0]*n for i in range(n)]
for i in range(0, n):
    ruudukko[i] = [int(x) for x in input().split()]
def get_available_positions(position):
    x, y = position
    available_positions = []
    for i in range(n):
        available_positions.append([x, i])
        available_positions.append([i, y])
    return get_smaller_positions(available_positions, get_position([x,y]))
def get_smaller_positions(positions, value):
    result = []
    for position in positions:
        if get_position(position) < value:
            result.append(position)
    return result
def get_position(position):
    x, y = position
    return ruudukko[y][x]
def solve_positions(positions):
    global answer
    next_positions = []
    if len(positions) > 0:
        for position in positions:
            if get_position(position) == 1:
                answer += 1
            else:
                answer += 1
                next_positions.append(position)
    if len(next_positions) > 0:
        for next_pos in next_positions:
            solve_positions(get_available_positions(next_pos))
    
for i in range(n):
    for j in range(n):
        available_positions = get_available_positions([i, j])
        solve_positions(available_positions)
print(answer%modulo)Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 1 1 1 1 1 1 1 1 1  | 
| correct output | 
|---|
| 9 | 
| user output | 
|---|
| 9 | 
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 1 2 3 6 5 4 7 8 9  | 
| correct output | 
|---|
| 135 | 
| user output | 
|---|
| 135 | 
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 7 8 1 4 5 4 3 9 6  | 
| correct output | 
|---|
| 57 | 
| user output | 
|---|
| 57 | 
Test 4
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 10000 | 
| user output | 
|---|
| 10000 | 
Test 5
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 187458477 | 
| user output | 
|---|
| (empty) | 
Test 6
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| (empty) | 
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 1000000 | 
| user output | 
|---|
| (empty) | 
Test 8
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 229147081 | 
| user output | 
|---|
| (empty) | 
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 520283 805991 492643 75254 527...  | 
| correct output | 
|---|
| 951147313 | 
| user output | 
|---|
| (empty) | 
