Submission #41045172


Source Code Expand

// difine

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define rep(i, n) for(int i=0;i<(n);i++)
#define rep2(i, s, n) for(int i=(s);i<(n);i++)
#define rep3(i, s, n, d) for(int i=(s);i<(n);i+=d)
#define reps(i, n) for(int i=1;i<=(n);i++)
#define rrep(i, n) for(int i=(n)-1;i>=0;i--)
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define erauni(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#define pb push_back
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define Game(n) cout << ((n) ? "First" : "Second"  ) << endl
#define out0(x) cout << endl
#define out(x) cout << (x) << endl
#define out2(x, y) cout << (x) << ' ' << (y) << endl

template <typename T>
T square(T x) {
  return x * x;
}

template <typename T>
bool chmax(T &a, const T& b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T>
bool chmin(T &a, const T& b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

int main () {
  int h, w;cin>>h>>w;
  bool ans = false;
  vs a(h);
  rep(i, h){
    string tmp;
    cin>>tmp;
    a[i] = tmp;
  }
  vs b(h);
  rep(i, h){
    string tmp;
    cin>>tmp;
    b[i] = tmp;
  }
  vs prea(h);
  vs preb(h);
  preb = a;
  rep(i, h){
    rep(k, h){
      if(k+i < h){
        prea[k+i] = a[k];
      }else{
        prea[k+i-h] = a[k];
      }
    }
    rep(j,w){
      rep(k, h){
        rep(l, w){
          if(l+j < w){
            preb[k].at(l+j) = prea[k].at(l);
          }else{
            preb[k].at(l+j-w) = prea[k].at(l);
          }
        }
      }
      if(b == preb){
            out("Yes");
            return 0;
      }
    }
  }
  out("No");
}

Submission Info

Submission Time
Task B - Same Map in the RPG World
User ry_ml24
Language C++ (GCC 9.2.1)
Score 200
Code Size 2265 Byte
Status AC
Exec Time 7 ms
Memory 3556 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:63:8: warning: unused variable ‘ans’ [-Wunused-variable]
   63 |   bool ans = false;
      |        ^~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 38
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 02_h_eq_2_w_eq_2_00.txt, 02_h_eq_2_w_eq_2_01.txt, 02_h_eq_2_w_eq_2_02.txt, 02_h_eq_2_w_eq_2_03.txt, 02_h_eq_2_w_eq_2_04.txt, 02_h_eq_2_w_eq_2_05.txt, 02_h_eq_2_w_eq_2_06.txt, 02_h_eq_2_w_eq_2_07.txt, 02_h_eq_2_w_eq_2_08.txt, 02_h_eq_2_w_eq_2_09.txt, 02_h_eq_2_w_eq_2_10.txt, 02_h_eq_2_w_eq_2_11.txt, 02_h_eq_2_w_eq_2_12.txt, 02_h_eq_2_w_eq_2_13.txt, 02_h_eq_2_w_eq_2_14.txt, 02_h_eq_2_w_eq_2_15.txt, 03_corner1_00.txt, 03_corner1_01.txt, 03_corner1_02.txt, 03_corner1_03.txt, 03_corner1_04.txt, 03_corner1_05.txt, 03_corner1_06.txt, 04_corner2_00.txt, 04_corner2_01.txt, 04_corner2_02.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 7 ms 3428 KiB
00_sample_01.txt AC 2 ms 3444 KiB
00_sample_02.txt AC 2 ms 3532 KiB
00_sample_03.txt AC 1 ms 3556 KiB
01_random_00.txt AC 2 ms 3540 KiB
01_random_01.txt AC 2 ms 3468 KiB
01_random_02.txt AC 2 ms 3508 KiB
01_random_03.txt AC 2 ms 3500 KiB
01_random_04.txt AC 2 ms 3412 KiB
01_random_05.txt AC 3 ms 3516 KiB
01_random_06.txt AC 2 ms 3416 KiB
01_random_07.txt AC 2 ms 3500 KiB
02_h_eq_2_w_eq_2_00.txt AC 2 ms 3440 KiB
02_h_eq_2_w_eq_2_01.txt AC 2 ms 3412 KiB
02_h_eq_2_w_eq_2_02.txt AC 2 ms 3440 KiB
02_h_eq_2_w_eq_2_03.txt AC 2 ms 3500 KiB
02_h_eq_2_w_eq_2_04.txt AC 2 ms 3348 KiB
02_h_eq_2_w_eq_2_05.txt AC 2 ms 3508 KiB
02_h_eq_2_w_eq_2_06.txt AC 3 ms 3412 KiB
02_h_eq_2_w_eq_2_07.txt AC 2 ms 3460 KiB
02_h_eq_2_w_eq_2_08.txt AC 3 ms 3444 KiB
02_h_eq_2_w_eq_2_09.txt AC 2 ms 3500 KiB
02_h_eq_2_w_eq_2_10.txt AC 2 ms 3504 KiB
02_h_eq_2_w_eq_2_11.txt AC 2 ms 3500 KiB
02_h_eq_2_w_eq_2_12.txt AC 2 ms 3496 KiB
02_h_eq_2_w_eq_2_13.txt AC 2 ms 3520 KiB
02_h_eq_2_w_eq_2_14.txt AC 2 ms 3332 KiB
02_h_eq_2_w_eq_2_15.txt AC 2 ms 3504 KiB
03_corner1_00.txt AC 2 ms 3532 KiB
03_corner1_01.txt AC 2 ms 3528 KiB
03_corner1_02.txt AC 3 ms 3508 KiB
03_corner1_03.txt AC 2 ms 3448 KiB
03_corner1_04.txt AC 2 ms 3500 KiB
03_corner1_05.txt AC 2 ms 3484 KiB
03_corner1_06.txt AC 2 ms 3352 KiB
04_corner2_00.txt AC 2 ms 3416 KiB
04_corner2_01.txt AC 2 ms 3516 KiB
04_corner2_02.txt AC 1 ms 3512 KiB