Submission #1108599


Source Code Expand

import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, core.stdc.stdio, std.bitmanip;

alias Tuple!(int, "x", int, "y") Point;
int[Point] up;
int[Point] down;
int[Point] right;
int[Point] left;

void main() {
    auto K = readln.chomp.to!int;
    auto S = readln.chomp;

    Point p = Point(0, 0);
    up[p] = 1;
    down[p] = -1;
    right[p] = 1;
    left[p] = -1;

    foreach (i; 0..K) {
        auto np = p;
    
        if (S[i] == 'U')      np.y = up[p];
        else if (S[i] == 'D') np.y = down[p];
        else if (S[i] == 'R') np.x = right[p];
        else if (S[i] == 'L') np.x = left[p];
        else assert(true);

        Point u = Point(np.x, np.y+1);
        Point d = Point(np.x, np.y-1);
        Point r = Point(np.x+1, np.y);
        Point l = Point(np.x-1, np.y);
        int nu = (u in up)    ? up[u]    : np.y + 1;
        int nd = (d in down)  ? down[d]  : np.y - 1;
        int nr = (r in right) ? right[r] : np.x + 1;
        int nl = (l in left)  ? left[l]  : np.x - 1;

        up[Point(np.x, nd+1)] = nu;
        down[Point(np.x, nu-1)] = nd;
        right[Point(nl+1, np.y)] = nr;
        left[Point(nr-1, np.y)] = nl;

        up[np] = nu;
        down[np] = nd;
        right[np] = nr;
        left[np] = nl;
        
        p = np;
    }

    writeln(p[0], " ", p[1]);
}

Submission Info

Submission Time
Task C - 幼稚園児高橋君
User nebukuro09
Language D (DMD 2.066.1)
Score 0
Code Size 1482 Byte
Status TLE
Exec Time 4035 ms
Memory 56612 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 21
TLE × 3
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 19 ms 916 KB
subtask0_sample_02.txt AC 17 ms 920 KB
subtask0_sample_03.txt AC 18 ms 784 KB
subtask1_01.txt AC 18 ms 924 KB
subtask1_02.txt AC 17 ms 800 KB
subtask1_03.txt AC 18 ms 920 KB
subtask1_04.txt AC 18 ms 928 KB
subtask1_05.txt AC 18 ms 924 KB
subtask1_06.txt AC 18 ms 920 KB
subtask1_07.txt AC 2408 ms 56608 KB
subtask1_08.txt AC 2621 ms 56604 KB
subtask1_09.txt AC 2973 ms 56604 KB
subtask1_10.txt TLE 4035 ms 51824 KB
subtask1_11.txt AC 2927 ms 56608 KB
subtask1_12.txt AC 2708 ms 56604 KB
subtask1_13.txt TLE 4035 ms 53408 KB
subtask1_14.txt AC 352 ms 56612 KB
subtask1_15.txt AC 350 ms 56560 KB
subtask1_16.txt TLE 4028 ms 5024 KB
subtask1_17.txt AC 400 ms 56604 KB
subtask1_18.txt AC 412 ms 56608 KB
subtask1_19.txt AC 414 ms 56560 KB
subtask1_20.txt AC 402 ms 56608 KB
subtask1_21.txt AC 405 ms 56608 KB