Submission #2873084
Source Code Expand
using System; using System.Collections.Generic; using System.Linq; using static System.Console; namespace AtCorder { public class Program { public static void Main() { int n = int.Parse(ReadLine()); var list = ReadLine().Split().Select(x => int.Parse(x)) .ToList(); // 累積和を使う var sum = new List<double>(); sum.Add(list[0]); for (int i = 1; i < n; i++) { sum.Add(sum[i - 1] + list[i]); } var ans = double.MaxValue; var list2 = new double[4]; // 中央の区切りは全探索 for (int i = 1; i < n - 2; i++) { // 左区間の区切り int left = 0; while (left < i && // sum[left + 1] - (sum[i] - sum[left + 1]) = 2 * sum[left + 1] - sum[i] // sum[left] - (sum[i] - sum[left]) = sum[left] - sum[i] + sum[left] = 2 * sum[left] - sum[i] // 境界を求める。一つ先が減っているなら、次へ移動する。 Math.Abs(2 * sum[left + 1] - sum[i]) < Math.Abs(2 * sum[left] - sum[i])) { left++; } // 右区間の区切り int right = i + 1; while (right < n && // (sum[right] - sum[i]) - (sum[n-1] - sum[right]) = sum[right] - sum[i] - sum[n-1] - sum[right] = 2 * sum[right] - sum[i] - sum[n-1] Math.Abs(2 * sum[right + 1] - sum[i] - sum[n - 1]) < Math.Abs(2 * sum[right] - sum[i] - sum[n - 1])) { right++; } list2[0] = sum[left]; list2[1] = sum[i] - sum[left]; list2[2] = sum[right] - sum[i]; list2[3] = sum[n - 1] - sum[right]; ans = Math.Min(ans, list2.Max() - list2.Min()); } WriteLine(ans); } } }
Submission Info
Submission Time | |
---|---|
Task | D - Equal Cut |
User | ayyubid |
Language | C# (Mono 4.6.2.0) |
Score | 0 |
Code Size | 1651 Byte |
Status | TLE |
Exec Time | 2109 ms |
Memory | 36620 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 600 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 25 ms | 9428 KB |
sample_02.txt | AC | 24 ms | 11348 KB |
sample_03.txt | AC | 24 ms | 9300 KB |
subtask_1_01.txt | AC | 24 ms | 13396 KB |
subtask_1_02.txt | TLE | 2109 ms | 36620 KB |
subtask_1_03.txt | TLE | 2108 ms | 22624 KB |
subtask_1_04.txt | TLE | 2108 ms | 25564 KB |
subtask_1_05.txt | AC | 24 ms | 9300 KB |
subtask_1_06.txt | TLE | 2108 ms | 12512 KB |
subtask_1_07.txt | TLE | 2108 ms | 17632 KB |
subtask_1_08.txt | TLE | 2108 ms | 15584 KB |
subtask_1_09.txt | TLE | 2108 ms | 22260 KB |
subtask_1_10.txt | TLE | 2109 ms | 30684 KB |
subtask_1_11.txt | TLE | 2108 ms | 26972 KB |
subtask_1_12.txt | TLE | 2108 ms | 20320 KB |
subtask_1_13.txt | TLE | 2108 ms | 23648 KB |
subtask_1_14.txt | TLE | 2108 ms | 14048 KB |
subtask_1_15.txt | TLE | 2108 ms | 10720 KB |
subtask_1_16.txt | TLE | 2108 ms | 20192 KB |
subtask_1_17.txt | TLE | 2108 ms | 17760 KB |
subtask_1_18.txt | AC | 329 ms | 9440 KB |
subtask_1_19.txt | TLE | 2108 ms | 28380 KB |
subtask_1_20.txt | TLE | 2108 ms | 31580 KB |
subtask_1_21.txt | TLE | 2108 ms | 20832 KB |
subtask_1_22.txt | TLE | 2108 ms | 17376 KB |
subtask_1_23.txt | TLE | 2108 ms | 34180 KB |
subtask_1_24.txt | TLE | 2108 ms | 32220 KB |
subtask_1_25.txt | TLE | 2109 ms | 28380 KB |
subtask_1_26.txt | TLE | 2108 ms | 30428 KB |
subtask_1_27.txt | TLE | 2108 ms | 30428 KB |
subtask_1_28.txt | TLE | 2108 ms | 32220 KB |
subtask_1_29.txt | TLE | 2108 ms | 32220 KB |
subtask_1_30.txt | TLE | 2108 ms | 32476 KB |
subtask_1_31.txt | TLE | 2108 ms | 30428 KB |
subtask_1_32.txt | TLE | 2108 ms | 30172 KB |
subtask_1_33.txt | TLE | 2109 ms | 36316 KB |
subtask_1_34.txt | TLE | 2108 ms | 32860 KB |
subtask_1_35.txt | TLE | 2108 ms | 31324 KB |
subtask_1_36.txt | TLE | 2108 ms | 32860 KB |
subtask_1_37.txt | TLE | 2109 ms | 28764 KB |