oj.uz

Submission #1050349

# Submission time Handle Problem Language Result Execution time Memory
1050349 2024-08-09T08:51:57 Z vjudge1 Art Exhibition (JOI18_art) Python 3
0 / 100
 10 ms 2908 KB 
def maximize_exhibition_value(N, artworks):
    artworks.sort()

    max_value = float('-inf')
    current_sum = 0
    left = 0

    for right in range(N):
        current_sum += artworks[right][1]

        A_max = artworks[right][0]
        A_min = artworks[left][0]
        current_value = current_sum - (A_max - A_min)

        max_value = max(max_value, current_value)

        while left < right and (current_sum - artworks[left][1]) - (artworks[right][0] - artworks[left + 1][0]) >= current_value:
            current_sum -= artworks[left][1]
            left += 1
            A_min = artworks[left][0]
            current_value = current_sum - (A_max - A_min)
            max_value = max(max_value, current_value)

    return max_value

N = int(input())
artworks = []
for _ in range(N):
    A, B = map(int, input().split())
    artworks.append((A, B))

result = maximize_exhibition_value(N, artworks)
print(result)

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2908 KB Output is correct
2 Correct 8 ms 2908 KB Output is correct
3 Incorrect 8 ms 2908 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2908 KB Output is correct
2 Correct 8 ms 2908 KB Output is correct
3 Incorrect 8 ms 2908 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2908 KB Output is correct
2 Correct 8 ms 2908 KB Output is correct
3 Incorrect 8 ms 2908 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2908 KB Output is correct
2 Correct 8 ms 2908 KB Output is correct
3 Incorrect 8 ms 2908 KB Output isn't correct
4 Halted 0 ms 0 KB -