Submission #1186296


Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <unordered_map>
#include <array>
#include <stdio.h>
#include <string.h>
using namespace std;

struct Hash {
    size_t operator()(const array<int, 2>& key) const {
        return hash<int64_t>()(*(int64_t *)&key[0]);
    }
};

int main() {
    int k;
    string s;
    cin >> k >> s;

    int u[256];
    for (int i = 0; i < 4; i++) u["LRDU"[i]] = i;

    unordered_map<array<int, 2>, array<int, 4>, Hash> h;
    array<int, 2> p = { 0, 0 };
    h.insert({ p, { p[0] - 1, p[0] + 1, p[1] - 1, p[1] + 1 } });

    for (int i = 0; i < k; i++) {
        array<int, 4> d = h[p];
        for (int j = 0; j < 4; j++) {
            array<int, 2> q = p;
            q[j / 2] = d[j];
            auto it = h.find(q);
            if (it == h.end()) it = h.insert({ q, { q[0] - 1, q[0] + 1, q[1] - 1, q[1] + 1 } }).first;
            it->second[j ^ 1] = d[j ^ 1];
        }
        int v = u[s[i]];
        p[v / 2] = d[v];
    }

    cout << p[0] << ' ' << p[1] << endl;

    return 0;
}

Submission Info

Submission Time
Task C - 幼稚園児高橋君
User merom686
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1107 Byte
Status AC
Exec Time 125 ms
Memory 37112 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 24
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 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 80 ms 13516 KB
subtask1_08.txt AC 82 ms 13516 KB
subtask1_09.txt AC 81 ms 13260 KB
subtask1_10.txt AC 83 ms 13900 KB
subtask1_11.txt AC 79 ms 13388 KB
subtask1_12.txt AC 83 ms 13260 KB
subtask1_13.txt AC 86 ms 13516 KB
subtask1_14.txt AC 123 ms 37112 KB
subtask1_15.txt AC 122 ms 37112 KB
subtask1_16.txt AC 94 ms 18552 KB
subtask1_17.txt AC 125 ms 37112 KB
subtask1_18.txt AC 122 ms 37112 KB
subtask1_19.txt AC 118 ms 24184 KB
subtask1_20.txt AC 92 ms 23672 KB
subtask1_21.txt AC 98 ms 23288 KB