Submission #32131263
Source Code Expand
parseint() = parse(Int, readline())
parseints() = parse.(Int, split(readline()))
function solve(n, as)
s = sum(as) ÷ 2
res = zeros(Int, n)
m = n ÷ 2
x = sum(@view as[2:2:end])
for i in 1:m
res[2*i-1] = s - x
x += as[2*i-1] - as[2*i]
end
res[2*m+1] = s - x
x = sum(@view as[3:2:end])
for i in 1:m
res[2*i] = s - x
x += as[2*i] - as[2*i+1]
end
2 .* res
end
function main()
n = parseint()
as = parseints()
println(join(solve(n, as), " "))
end
main()
Submission Info
| Submission Time | |
|---|---|
| Task | D - Rain Flows into Dams |
| User | matsueushi |
| Language | Julia (1.4.0) |
| Score | 400 |
| Code Size | 568 Byte |
| Status | AC |
| Exec Time | 462 ms |
| Memory | 224968 KiB |
Judge Result
| Set Name | All | Sample | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 400 / 400 | 0 / 0 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| All | sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15 |
| Sample | sample_01, sample_02, sample_03 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01 | AC | 431 ms | 210168 KiB |
| sample_02 | AC | 409 ms | 210052 KiB |
| sample_03 | AC | 408 ms | 210316 KiB |
| testcase_01 | AC | 440 ms | 217848 KiB |
| testcase_02 | AC | 453 ms | 220500 KiB |
| testcase_03 | AC | 462 ms | 224516 KiB |
| testcase_04 | AC | 415 ms | 210424 KiB |
| testcase_05 | AC | 447 ms | 224408 KiB |
| testcase_06 | AC | 449 ms | 223524 KiB |
| testcase_07 | AC | 425 ms | 215564 KiB |
| testcase_08 | AC | 446 ms | 223324 KiB |
| testcase_09 | AC | 428 ms | 215924 KiB |
| testcase_10 | AC | 411 ms | 209904 KiB |
| testcase_11 | AC | 453 ms | 224672 KiB |
| testcase_12 | AC | 452 ms | 224204 KiB |
| testcase_13 | AC | 454 ms | 224968 KiB |
| testcase_14 | AC | 413 ms | 210016 KiB |
| testcase_15 | AC | 439 ms | 221888 KiB |