| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1112021 | vjudge1 | Art Exhibition (JOI18_art) | Cpython 3 | 1067 ms | 2980 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
from itertools import combinations as c
N=int(input())
a=[list(map(int,input().split()))for _ in range(N)]
print(max(sum(x[1] for x in s)-(max(x[0] for x in s)-min(x[0] for x in s)) for r in range(1,N+1) for s in c(a,r)))
# Brute force T-T| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
