Submission #1186894
Source Code Expand
#include <iostream> #include <vector> #include <string> #include <algorithm> #include <unordered_map> #include <array> #include <random> #include <stdio.h> #include <string.h> using namespace std; struct Hash { static constexpr unsigned int N = 1 << 16; Hash() { mt19937_64 mt; for (int i = 0; i < N; i++) r[i] = mt(); } size_t operator()(const array<int, 2>& key) const { size_t s = 0; for (int i = 0; i < 2; i++) { unsigned int t = key[i]; s ^= r[t & N - 1]; s ^= r[t >> 16]; } return s; } static array<size_t, N> r; }; array<size_t, Hash::N> Hash::r; 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 }; array<int, 4> a = { p[0] - 1, p[0] + 1, p[1] - 1, p[1] + 1 }; for (int i = 0; i < k; i++) { auto i0 = h.insert({ p, a }).first; auto i1 = i0; int v = u[s[i]]; do { p[v / 2] = i1->second[v]; } while ((i1 = h.find(p)) != h.end()); a = { p[0] - 1, p[0] + 1, p[1] - 1, p[1] + 1 }; i0->second[v] = a[v]; a[v ^ 1] = i0->second[v ^ 1]; } 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 | 1415 Byte |
Status | AC |
Exec Time | 76 ms |
Memory | 12364 KB |
Judge Result
Set Name | Sample | Subtask1 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 2 ms | 768 KB |
subtask0_sample_02.txt | AC | 2 ms | 768 KB |
subtask0_sample_03.txt | AC | 2 ms | 768 KB |
subtask1_01.txt | AC | 2 ms | 768 KB |
subtask1_02.txt | AC | 2 ms | 768 KB |
subtask1_03.txt | AC | 2 ms | 768 KB |
subtask1_04.txt | AC | 2 ms | 768 KB |
subtask1_05.txt | AC | 2 ms | 768 KB |
subtask1_06.txt | AC | 2 ms | 768 KB |
subtask1_07.txt | AC | 65 ms | 12364 KB |
subtask1_08.txt | AC | 76 ms | 12364 KB |
subtask1_09.txt | AC | 72 ms | 12364 KB |
subtask1_10.txt | AC | 73 ms | 12364 KB |
subtask1_11.txt | AC | 71 ms | 12364 KB |
subtask1_12.txt | AC | 69 ms | 12364 KB |
subtask1_13.txt | AC | 68 ms | 12364 KB |
subtask1_14.txt | AC | 59 ms | 12364 KB |
subtask1_15.txt | AC | 53 ms | 12364 KB |
subtask1_16.txt | AC | 58 ms | 12364 KB |
subtask1_17.txt | AC | 54 ms | 12364 KB |
subtask1_18.txt | AC | 56 ms | 12364 KB |
subtask1_19.txt | AC | 55 ms | 12364 KB |
subtask1_20.txt | AC | 54 ms | 12364 KB |
subtask1_21.txt | AC | 55 ms | 12364 KB |