Submission #995032
Source Code Expand
import std.stdio; import std.string; import std.conv; import std.typecons; import std.algorithm; import std.functional; import std.bigint; import std.numeric; import std.array; import std.math; import std.range; import std.container; import std.ascii; void times(alias pred)(int n) { foreach(i; 0..n) pred(); } auto rep(alias pred, T = typeof(pred()))(int n) { T[] res = new T[n]; foreach(ref e; res) e = pred(); return res; } void main() { int N = readln.chomp.to!int; int[] a = readln.split.to!(int[]); int M = readln.chomp.to!int; if (M > 1) return; a ~= readln.chomp.to!int; a ~= 0; int[] ary = new int[N-1]; int maxV = -int.max; int[] index = new int[N]; int maxI = -1; ary.back = 0; for(int i=N-3; i>=0; i--) { int v = a[i+2]-ary[i+1]; if (v > maxV) { maxV = v; maxI = i; ary[i] = maxV; } else { ary[i] = maxV; } index[i] = maxI; } writeln(ary[0]-ary[1]); int i = 0; int j=0; int num1, num2; int po = 0; while(abs(i-j)==1 && (i==N-1 || j==N-1)) { if (po%2==0) { num1 = ary[i]; num2 = a[i..index[i]-1].sum; i = index[i]; j = i-1; } else { num2 = ary[j]; num1 = a[j..index[j]-1].sum; j = index[j]; i = j-1; } po++; } (num1-num2).writeln; }
Submission Info
Submission Time | |
---|---|
Task | H - Tokaido |
User | arkark |
Language | D (DMD64 v2.070.1) |
Score | 0 |
Code Size | 1376 Byte |
Status | WA |
Exec Time | 28 ms |
Memory | 7916 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | 0 / 900 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt |
dataset1 | sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt |
dataset2 | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | WA | 27 ms | 7916 KB |
01-02.txt | WA | 2 ms | 256 KB |
01-03.txt | WA | 2 ms | 380 KB |
01-04.txt | WA | 15 ms | 3708 KB |
01-05.txt | WA | 27 ms | 7916 KB |
01-06.txt | WA | 28 ms | 7916 KB |
01-07.txt | WA | 10 ms | 2684 KB |
01-08.txt | WA | 28 ms | 7900 KB |
01-09.txt | WA | 28 ms | 7900 KB |
01-10.txt | WA | 2 ms | 256 KB |
01-11.txt | WA | 7 ms | 1788 KB |
01-12.txt | WA | 26 ms | 7556 KB |
01-13.txt | WA | 27 ms | 7796 KB |
01-14.txt | WA | 27 ms | 7800 KB |
01-15.txt | WA | 27 ms | 7796 KB |
01-16.txt | WA | 27 ms | 7796 KB |
01-17.txt | WA | 27 ms | 7796 KB |
01-18.txt | WA | 27 ms | 7796 KB |
01-19.txt | WA | 27 ms | 7796 KB |
02-01.txt | WA | 6 ms | 1148 KB |
02-02.txt | WA | 24 ms | 4716 KB |
02-03.txt | WA | 24 ms | 4716 KB |
02-04.txt | WA | 24 ms | 4716 KB |
02-05.txt | WA | 2 ms | 380 KB |
02-06.txt | WA | 25 ms | 4700 KB |
02-07.txt | WA | 25 ms | 4700 KB |
02-08.txt | WA | 2 ms | 256 KB |
02-09.txt | WA | 2 ms | 380 KB |
02-10.txt | WA | 12 ms | 2684 KB |
02-11.txt | WA | 24 ms | 4724 KB |
02-12.txt | WA | 24 ms | 4604 KB |
02-13.txt | WA | 24 ms | 4724 KB |
02-14.txt | WA | 24 ms | 4724 KB |
02-15.txt | WA | 24 ms | 4724 KB |
02-16.txt | WA | 24 ms | 4724 KB |
sample-01.txt | WA | 2 ms | 256 KB |
sample-02.txt | WA | 2 ms | 256 KB |