Submission #36669200

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
int H, W;
vector<string> graph;
struct UnionFind {
    vector<int> par; // par[i]:iの親の番号　(例) par[3] = 2 : 3の親が2

    UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
        for (int i = 0; i < N; i++) par[i] = i;
    }

    int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }

    void unite(int x, int y) { // xとyの木を併合
        int rx = root(x); //xの根をrx
        int ry = root(y); //yの根をry
        if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
        par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
    }

    bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
};

int main() {

  
    cin >> H >> W;
    pair<int, int> start;
    UnionFind join(H * W + 10);
    graph = vector<string>(H);
    for (int i = 0; i < H; i++) {
        cin >> graph[i];
        for (int j = 0; j < W; j++) {
            if (graph[i][j] == 'S')start = make_pair(i, j);
        }
    }
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W-1; j++) {
            
            if (graph[i][j] == '.' && graph[i][j+1] == '.') {
                join.unite(i * W + j, i * W + j+1);
            }
        }
    }
    for (int i = 0; i < H - 1; i++) {
        for (int j = 0; j < W ; j++) {
            if (graph[i][j] == '.' && graph[i + 1][j] == '.') {
                join.unite(i * W + j, (i + 1) * W + j);
            }
            
        }
    }

    int origin,north, east, west, south;
    origin = start.first * W + start.second;
    north = (start.first-1) * W + start.second;
    south = (start.first+1) * W + start.second;
    east = start.first * W + start.second + 1;
    west = start.first * W + start.second - 1;
        if (start.first==0)north = H*W+2;
        if (start.first == H)south = H * W + 3;
        if (start.second == 0)west = H * W + 4;
        if (start.second == W)east = H * W + 5;

    if (join.same(north,east)||
    join.same(north,west)||
    join.same(north,south)||
    join.same(west,east)||
    join.same(west,south)||
    join.same(east,south)
        ){
        cout << "Yes" << endl;
    }



    else {
        cout << "No" << endl;
    }

	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:65:9: warning: variable ‘origin’ set but not used [-Wunused-but-set-variable]
   65 |     int origin,north, east, west, south;
      |         ^~~~~~

Judge Result