Submission #2251538


Source Code Expand

import std.stdio : readln, writeln;
import std.conv : to;
import std.string : chomp;
import std.range : front, back, repeat, split, zip, array;
import std.algorithm : map, all;
import std.math : abs;
import std.functional : pipe;

void main() {
    ([0L, 0L, 0L] ~ (() => readln.split.to!(long[])).repeat(readln.chomp.to!long).map!"a()".array).pipe!(
        as => zip(as[0..$-1], as[1..$])
    ).map!(
        a => zip(a[0], a[1]).map!(
            b => abs(b[1]-b[0])
        )
    ).all!(
        as => as[0] >= as[1]+as[2] && as[0]%2 == (as[1]+as[2])%2
    ).pipe!(
        a => a ? "Yes" : "No"
    ).writeln;
}

Submission Info

Submission Time
Task ABC086C - Traveling
User arkark
Language D (DMD64 v2.070.1)
Score 300
Code Size 638 Byte
Status AC
Exec Time 129 ms
Memory 19708 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 13
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 129 ms 19068 KB
1_005.txt AC 116 ms 19708 KB
1_006.txt AC 123 ms 18940 KB
1_007.txt AC 20 ms 4732 KB
1_008.txt AC 1 ms 256 KB
1_009.txt AC 24 ms 4988 KB
1_010.txt AC 1 ms 256 KB
1_011.txt AC 16 ms 2812 KB
1_012.txt AC 1 ms 256 KB