Submission #20191654


Source Code Expand

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = 3.14159265359;
const ll INF = 1LL << 60;

int h, w;

// 0: not determined, 1: First win, -1: Second win.
int dp[100][100];

vector<string> g;

int judge(int y, int x){
  if (dp[y][x] != 0) return dp[y][x];

  vector<int> dx { 0, 1, 1};
  vector<int> dy { 1, 1, 0};
  for (int i = 0; i < 3; i++){
    int yy = y + dy[i];
    int xx = x + dx[i];
    dp[y][x] = 0;
    if (yy < h && xx < w && g[yy][xx] != '#'){
      int r =judge(yy, xx);
      if (r == 0) return (dp[y][x] = 1);
    }
  }
  return dp[y][x];
}

int main()
{
  cin >> h >> w;
  g.resize(h);
  for (string& t : g) cin >> t;

  int ans = judge(0, 0);
  if (ans == 1){
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
  return 0;
}

Submission Info

Submission Time
Task B - マス目と駒
User unnohideyuki
Language C++ (GCC 9.2.1)
Score 100
Code Size 898 Byte
Status AC
Exec Time 7 ms
Memory 3748 KiB

Judge Result

Set Name Sample Dataset1 Dataset2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 17
AC × 36
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
Dataset1 sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt
Dataset2 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 7 ms 3672 KiB
01-02.txt AC 2 ms 3576 KiB
01-03.txt AC 2 ms 3524 KiB
01-04.txt AC 3 ms 3548 KiB
01-05.txt AC 2 ms 3584 KiB
01-06.txt AC 2 ms 3540 KiB
01-07.txt AC 2 ms 3520 KiB
01-08.txt AC 3 ms 3452 KiB
01-09.txt AC 2 ms 3444 KiB
01-10.txt AC 2 ms 3584 KiB
01-11.txt AC 2 ms 3524 KiB
01-12.txt AC 3 ms 3472 KiB
01-13.txt AC 2 ms 3524 KiB
01-14.txt AC 2 ms 3672 KiB
01-15.txt AC 2 ms 3540 KiB
02-01.txt AC 5 ms 3748 KiB
02-02.txt AC 2 ms 3540 KiB
02-03.txt AC 2 ms 3636 KiB
02-04.txt AC 2 ms 3540 KiB
02-05.txt AC 3 ms 3556 KiB
02-06.txt AC 4 ms 3580 KiB
02-07.txt AC 3 ms 3676 KiB
02-08.txt AC 4 ms 3656 KiB
02-09.txt AC 4 ms 3604 KiB
02-10.txt AC 4 ms 3560 KiB
02-11.txt AC 2 ms 3744 KiB
02-12.txt AC 2 ms 3700 KiB
02-13.txt AC 3 ms 3520 KiB
02-14.txt AC 2 ms 3620 KiB
02-15.txt AC 2 ms 3596 KiB
sample-01.txt AC 2 ms 3580 KiB
sample-02.txt AC 1 ms 3520 KiB
sample-03.txt AC 2 ms 3608 KiB