Submission #3433149


Source Code Expand

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;

#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int table[10][10];
    int x, y;
    string W;
    
    cin>>x>>y>>W;
    x--; y--;
    rep(i,9)rep(j,9){
        char c;cin>>c;
        table[i][j] = c-'0';
    }
    
    int r=0, u=0;
    if(W.find("R")!=string::npos) r++;
    if(W.find("L")!=string::npos) r--;
    if(W.find("U")!=string::npos) u--;
    if(W.find("D")!=string::npos) u++;
    
    rep(i,4){
        cout<<table[y][x];
        if((x<=0 && r<0)||(x>=8 && r>0))r=-r;
        if((y<=0 && u<0)||(y>=8 && u>0))u=-u;
        x += r;
        y += u;
    }
    cout<<endl;
}

Submission Info

Submission Time
Task B - P-CASカードと高橋君
User mensan_fukuhara
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1528 Byte
Status AC
Exec Time 3 ms
Memory 384 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 69
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt, 01_rnd_30.txt, 01_rnd_31.txt, 02_cornerrnd_00.txt, 02_cornerrnd_01.txt, 02_cornerrnd_02.txt, 02_cornerrnd_03.txt, 02_cornerrnd_04.txt, 02_cornerrnd_05.txt, 02_cornerrnd_06.txt, 02_cornerrnd_07.txt, 02_cornerrnd_08.txt, 02_cornerrnd_09.txt, 02_cornerrnd_10.txt, 02_cornerrnd_11.txt, 02_cornerrnd_12.txt, 02_cornerrnd_13.txt, 02_cornerrnd_14.txt, 02_cornerrnd_15.txt, 02_cornerrnd_16.txt, 02_cornerrnd_17.txt, 02_cornerrnd_18.txt, 02_cornerrnd_19.txt, 02_cornerrnd_20.txt, 02_cornerrnd_21.txt, 02_cornerrnd_22.txt, 02_cornerrnd_23.txt, 02_cornerrnd_24.txt, 02_cornerrnd_25.txt, 02_cornerrnd_26.txt, 02_cornerrnd_27.txt, 02_cornerrnd_28.txt, 02_cornerrnd_29.txt, 02_cornerrnd_30.txt, 02_cornerrnd_31.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 1 ms 256 KB
01_rnd_01.txt AC 1 ms 256 KB
01_rnd_02.txt AC 1 ms 256 KB
01_rnd_03.txt AC 1 ms 256 KB
01_rnd_04.txt AC 1 ms 256 KB
01_rnd_05.txt AC 1 ms 256 KB
01_rnd_06.txt AC 1 ms 256 KB
01_rnd_07.txt AC 1 ms 256 KB
01_rnd_08.txt AC 1 ms 256 KB
01_rnd_09.txt AC 1 ms 256 KB
01_rnd_10.txt AC 1 ms 256 KB
01_rnd_11.txt AC 1 ms 256 KB
01_rnd_12.txt AC 1 ms 256 KB
01_rnd_13.txt AC 1 ms 256 KB
01_rnd_14.txt AC 1 ms 256 KB
01_rnd_15.txt AC 1 ms 256 KB
01_rnd_16.txt AC 1 ms 256 KB
01_rnd_17.txt AC 1 ms 256 KB
01_rnd_18.txt AC 1 ms 256 KB
01_rnd_19.txt AC 1 ms 256 KB
01_rnd_20.txt AC 1 ms 256 KB
01_rnd_21.txt AC 1 ms 256 KB
01_rnd_22.txt AC 1 ms 256 KB
01_rnd_23.txt AC 1 ms 256 KB
01_rnd_24.txt AC 1 ms 256 KB
01_rnd_25.txt AC 1 ms 256 KB
01_rnd_26.txt AC 2 ms 256 KB
01_rnd_27.txt AC 1 ms 256 KB
01_rnd_28.txt AC 1 ms 256 KB
01_rnd_29.txt AC 1 ms 256 KB
01_rnd_30.txt AC 1 ms 256 KB
01_rnd_31.txt AC 1 ms 256 KB
02_cornerrnd_00.txt AC 1 ms 256 KB
02_cornerrnd_01.txt AC 1 ms 256 KB
02_cornerrnd_02.txt AC 1 ms 256 KB
02_cornerrnd_03.txt AC 1 ms 256 KB
02_cornerrnd_04.txt AC 1 ms 256 KB
02_cornerrnd_05.txt AC 1 ms 256 KB
02_cornerrnd_06.txt AC 1 ms 256 KB
02_cornerrnd_07.txt AC 1 ms 256 KB
02_cornerrnd_08.txt AC 1 ms 256 KB
02_cornerrnd_09.txt AC 1 ms 256 KB
02_cornerrnd_10.txt AC 1 ms 256 KB
02_cornerrnd_11.txt AC 1 ms 256 KB
02_cornerrnd_12.txt AC 1 ms 256 KB
02_cornerrnd_13.txt AC 1 ms 256 KB
02_cornerrnd_14.txt AC 1 ms 256 KB
02_cornerrnd_15.txt AC 1 ms 256 KB
02_cornerrnd_16.txt AC 3 ms 384 KB
02_cornerrnd_17.txt AC 1 ms 256 KB
02_cornerrnd_18.txt AC 1 ms 256 KB
02_cornerrnd_19.txt AC 1 ms 256 KB
02_cornerrnd_20.txt AC 1 ms 256 KB
02_cornerrnd_21.txt AC 1 ms 256 KB
02_cornerrnd_22.txt AC 1 ms 256 KB
02_cornerrnd_23.txt AC 1 ms 256 KB
02_cornerrnd_24.txt AC 1 ms 256 KB
02_cornerrnd_25.txt AC 1 ms 256 KB
02_cornerrnd_26.txt AC 1 ms 256 KB
02_cornerrnd_27.txt AC 2 ms 384 KB
02_cornerrnd_28.txt AC 1 ms 256 KB
02_cornerrnd_29.txt AC 1 ms 256 KB
02_cornerrnd_30.txt AC 1 ms 256 KB
02_cornerrnd_31.txt AC 1 ms 256 KB