AtCoder Regular Contest 005

Submission #1090770

Source codeソースコード

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  int x, y;
  string w;
  cin >> x >> y >> w;
  x -= 1;
  y -= 1;
  vvi c(9, vi(9));
  char tmp;
  rep (i, 9) {
    rep (j, 9) {
      scanf(" %c", &tmp);
      c[j][i] = (tmp - '0');
    }
  }
  int dx, dy;
  dx = 0;
  dy = 0;
  int len = w.length();
  if (w.find_first_of('R') < (size_t)len) {
    dx = 1;
  }
  if (w.find_first_of('L') < (size_t)len) {
    dx = -1;
  }
  if (w.find_first_of('D') < (size_t)len) {
    dy = 1;
  }
  if (w.find_first_of('U') < (size_t)len) {
    dy = -1;
  }

  int cur_x = x;
  int cur_y = y;
  rep (i, 4) {
    printf("%d", c[cur_x][cur_y]);
    int next_x = cur_x + dx;
    if (next_x < 0 || next_x >= 9) {
      dx *= (-1);
      next_x = cur_x + dx;
    }
    int next_y = cur_y + dy;
    if (next_y < 0 || next_y >= 9) {
      dy *= (-1);
      next_y = cur_y + dy;
    }
    cur_x = next_x;
    cur_y = next_y;
  }
  printf("\n");

  return 0;
}

Submission

Task問題 B - P-CASカードと高橋君
User nameユーザ名 mu
Created time投稿日時
Language言語 C++11 (GCC 4.8.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 1918 Byte
File nameファイル名
Exec time実行時間 20 ms
Memory usageメモリ使用量 984 KB

Compiler messageコンパイルメッセージ

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

Test case

Set

Set name Score得点 / Max score Cases
All 100 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_sample_01.txt AC 20 ms 924 KB
00_sample_02.txt AC 19 ms 796 KB
00_sample_03.txt AC 17 ms 920 KB
00_sample_04.txt AC 19 ms 800 KB
00_sample_05.txt AC 19 ms 928 KB
01_rnd_00.txt AC 19 ms 800 KB
01_rnd_01.txt AC 19 ms 924 KB
01_rnd_02.txt AC 18 ms 796 KB
01_rnd_03.txt AC 19 ms 920 KB
01_rnd_04.txt AC 17 ms 972 KB
01_rnd_05.txt AC 20 ms 872 KB
01_rnd_06.txt AC 19 ms 928 KB
01_rnd_07.txt AC 19 ms 796 KB
01_rnd_08.txt AC 19 ms 924 KB
01_rnd_09.txt AC 19 ms 796 KB
01_rnd_10.txt AC 19 ms 924 KB
01_rnd_11.txt AC 18 ms 920 KB
01_rnd_12.txt AC 19 ms 800 KB
01_rnd_13.txt AC 19 ms 928 KB
01_rnd_14.txt AC 18 ms 800 KB
01_rnd_15.txt AC 19 ms 928 KB
01_rnd_16.txt AC 20 ms 796 KB
01_rnd_17.txt AC 19 ms 800 KB
01_rnd_18.txt AC 19 ms 800 KB
01_rnd_19.txt AC 20 ms 860 KB
01_rnd_20.txt AC 17 ms 796 KB
01_rnd_21.txt AC 18 ms 788 KB
01_rnd_22.txt AC 19 ms 928 KB
01_rnd_23.txt AC 19 ms 984 KB
01_rnd_24.txt AC 20 ms 924 KB
01_rnd_25.txt AC 19 ms 928 KB
01_rnd_26.txt AC 19 ms 796 KB
01_rnd_27.txt AC 19 ms 796 KB
01_rnd_28.txt AC 17 ms 796 KB
01_rnd_29.txt AC 19 ms 796 KB
01_rnd_30.txt AC 19 ms 800 KB
01_rnd_31.txt AC 20 ms 860 KB
02_cornerrnd_00.txt AC 18 ms 800 KB
02_cornerrnd_01.txt AC 18 ms 800 KB
02_cornerrnd_02.txt AC 19 ms 916 KB
02_cornerrnd_03.txt AC 20 ms 800 KB
02_cornerrnd_04.txt AC 19 ms 972 KB
02_cornerrnd_05.txt AC 17 ms 800 KB
02_cornerrnd_06.txt AC 17 ms 924 KB
02_cornerrnd_07.txt AC 20 ms 796 KB
02_cornerrnd_08.txt AC 18 ms 796 KB
02_cornerrnd_09.txt AC 19 ms 924 KB
02_cornerrnd_10.txt AC 19 ms 800 KB
02_cornerrnd_11.txt AC 18 ms 924 KB
02_cornerrnd_12.txt AC 19 ms 788 KB
02_cornerrnd_13.txt AC 18 ms 796 KB
02_cornerrnd_14.txt AC 19 ms 928 KB
02_cornerrnd_15.txt AC 17 ms 796 KB
02_cornerrnd_16.txt AC 19 ms 796 KB
02_cornerrnd_17.txt AC 19 ms 800 KB
02_cornerrnd_18.txt AC 20 ms 796 KB
02_cornerrnd_19.txt AC 19 ms 924 KB
02_cornerrnd_20.txt AC 17 ms 844 KB
02_cornerrnd_21.txt AC 19 ms 928 KB
02_cornerrnd_22.txt AC 19 ms 928 KB
02_cornerrnd_23.txt AC 17 ms 924 KB
02_cornerrnd_24.txt AC 19 ms 800 KB
02_cornerrnd_25.txt AC 18 ms 800 KB
02_cornerrnd_26.txt AC 17 ms 796 KB
02_cornerrnd_27.txt AC 19 ms 928 KB
02_cornerrnd_28.txt AC 19 ms 796 KB
02_cornerrnd_29.txt AC 19 ms 796 KB
02_cornerrnd_30.txt AC 18 ms 800 KB
02_cornerrnd_31.txt AC 17 ms 800 KB