| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1307565 | kahar | Arranging Tickets (JOI17_arranging_tickets) | Pypy 3 | 137 ms | 48400 KiB |
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
diff = [0] * (N + 2)
S = 0
def add_cw(a, b, c):
if a < b:
diff[a] += c
diff[b] -= c
else:
diff[a] += c
diff[N + 1] -= c
diff[1] += c
diff[b] -= c
for _ in range(M):
A, B, C = map(int, input().split())
S += C
add_cw(A, B, C)
A = [0] * (N + 1)
cur = 0
ans = 0
for i in range(1, N + 1):
cur += diff[i]
ans = max(ans, max(cur, S - cur))
print((ans + 1) // 2)
Compilation message (stdout)
| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
