Submission #1793729


Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
using namespace std;

#define mp make_pair
#define ll long long

int main() {
        int k;
        scanf("%d", &k);
        string s;
        cin >> s;
        set<pair<ll, ll>> used;
        map<pair<pair<ll, ll>, char>, pair<ll, ll>> go; //from, dir -> to
        long long x = 0, y = 0;
        used.insert(mp(x, y));
        for (int i = 0; i < k; i ++) {
                int dy = 0, dx = 0;
                if (s[i] == 'L') dx --;
                if (s[i] == 'R') dx ++;
                if (s[i] == 'D') dy --;
                if (s[i] == 'U') dy ++;
                long long fromx = x, fromy = y;
                for (;;) {
                        if (!used.count(mp(x, y))) break;
                        if (go.count(mp(mp(x, y), s[i]))) {
                                int nx = go[mp(mp(x, y), s[i])].first;
                                int ny = go[mp(mp(x, y), s[i])].second;
                                x = nx, y = ny;
                        }
                        x += dx, y += dy;
                }
                used.insert(mp(x, y));
                go[mp(mp(fromx, fromy), s[i])] = mp(x, y);
        }
        printf("%lld %lld\n", x, y);
        return 0;
}

Submission Info

Submission Time
Task C - 幼稚園児高橋君
User KokiYmgch
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1361 Byte
Status AC
Exec Time 343 ms
Memory 28548 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &k);
                        ^

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 291 ms 28548 KB
subtask1_08.txt AC 301 ms 28548 KB
subtask1_09.txt AC 324 ms 28548 KB
subtask1_10.txt AC 274 ms 28548 KB
subtask1_11.txt AC 306 ms 28548 KB
subtask1_12.txt AC 319 ms 28548 KB
subtask1_13.txt AC 320 ms 28548 KB
subtask1_14.txt AC 204 ms 28548 KB
subtask1_15.txt AC 217 ms 28548 KB
subtask1_16.txt AC 220 ms 28548 KB
subtask1_17.txt AC 164 ms 28548 KB
subtask1_18.txt AC 323 ms 28548 KB
subtask1_19.txt AC 248 ms 28548 KB
subtask1_20.txt AC 233 ms 28548 KB
subtask1_21.txt AC 343 ms 28548 KB