Submission #2151626
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" #include <random> using namespace std; //呪文 #define DUMPOUT cerr #define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA_ARGS__) typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss; template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; } template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; } template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; } namespace aux { // print tuple template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } }; template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } }; } template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; } template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); } void dump_func() { DUMPOUT << endl; } template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); } #define PI 3.14159265358979323846 #define EPS 1e-11 #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define all(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define fake false const int di[] = { 0, -1, 0, 1 }; const int dj[] = { 1, 0, -1, 0 }; int main() { //clock_t start, end; //start = clock(); cin.tie(0); ios::sync_with_stdio(false); int H, W; cin >> H >> W; vector<string> c(H); cin >> c; pii s, g; REP(i, H) REP(j, W) { if (c[i][j] == 's') s = pii(i, j); else if (c[i][j] == 'g') g = pii(i, j); } queue<pii> qu; qu.push(s); while (!qu.empty()) { pii p = qu.front(); qu.pop(); int i = p.first, j = p.second; if (c[i][j] == 'g') { cout << "Yes" << endl; return 0; } if (c[i][j] == '#') continue; c[i][j] = '#'; for (int d = 0; d < 4; d++) { int ni = i + di[d], nj = j + dj[d]; if (ni < 0 || H <= ni || nj < 0 || W <= nj) continue; if (c[ni][nj] == '#') continue; qu.push(pii(ni, nj)); } } cout << "No" << endl; //end = clock(); //printf("%d msec.\n", end - start); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 深さ優先探索 |
User | komori3 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 4339 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt |
All | 00_min_01.txt, 00_min_02.txt, 00_min_03.txt, 00_min_04.txt, 00_min_05.txt, 00_min_06.txt, 00_min_07.txt, 00_min_08.txt, 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, 02_rndhard_00.txt, 02_rndhard_01.txt, 02_rndhard_02.txt, 02_rndhard_03.txt, 02_rndhard_04.txt, 02_rndhard_05.txt, 02_rndhard_06.txt, 02_rndhard_07.txt, 02_rndhard_08.txt, 02_rndhard_09.txt, 02_rndhard_10.txt, 02_rndhard_11.txt, 02_rndhard_12.txt, 02_rndhard_13.txt, 02_rndhard_14.txt, 02_rndhard_15.txt, 02_rndhard_16.txt, 02_rndhard_17.txt, 02_rndhard_18.txt, 02_rndhard_19.txt, 02_rndhard_20.txt, 02_rndhard_21.txt, 02_rndhard_22.txt, 02_rndhard_23.txt, 02_rndhard_24.txt, 02_rndhard_25.txt, 02_rndhard_26.txt, 02_rndhard_27.txt, 02_rndhard_28.txt, 02_rndhard_29.txt, 02_rndhard_30.txt, 02_rndhard_31.txt, 02_rndhard_32.txt, 02_rndhard_33.txt, 02_rndhard_34.txt, 02_rndhard_35.txt, 02_rndhard_36.txt, 02_rndhard_37.txt, 02_rndhard_38.txt, 02_rndhard_39.txt, 03_rndhardsmall_00.txt, 03_rndhardsmall_01.txt, 03_rndhardsmall_02.txt, 03_rndhardsmall_03.txt, 03_rndhardsmall_04.txt, 03_rndhardsmall_05.txt, 03_rndhardsmall_06.txt, 03_rndhardsmall_07.txt, 03_rndhardsmall_08.txt, 03_rndhardsmall_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_min_01.txt | AC | 1 ms | 256 KB |
00_min_02.txt | AC | 1 ms | 256 KB |
00_min_03.txt | AC | 1 ms | 256 KB |
00_min_04.txt | AC | 1 ms | 256 KB |
00_min_05.txt | AC | 1 ms | 256 KB |
00_min_06.txt | AC | 1 ms | 256 KB |
00_min_07.txt | AC | 1 ms | 256 KB |
00_min_08.txt | AC | 1 ms | 256 KB |
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 | 2 ms | 512 KB |
01_rnd_01.txt | AC | 3 ms | 512 KB |
01_rnd_02.txt | AC | 4 ms | 512 KB |
01_rnd_03.txt | AC | 6 ms | 512 KB |
01_rnd_04.txt | AC | 5 ms | 512 KB |
01_rnd_05.txt | AC | 2 ms | 512 KB |
01_rnd_06.txt | AC | 6 ms | 512 KB |
01_rnd_07.txt | AC | 6 ms | 512 KB |
01_rnd_08.txt | AC | 2 ms | 512 KB |
01_rnd_09.txt | AC | 2 ms | 512 KB |
01_rnd_10.txt | AC | 6 ms | 512 KB |
01_rnd_11.txt | AC | 2 ms | 512 KB |
01_rnd_12.txt | AC | 7 ms | 512 KB |
01_rnd_13.txt | AC | 2 ms | 512 KB |
01_rnd_14.txt | AC | 2 ms | 512 KB |
01_rnd_15.txt | AC | 5 ms | 512 KB |
01_rnd_16.txt | AC | 2 ms | 512 KB |
01_rnd_17.txt | AC | 7 ms | 512 KB |
01_rnd_18.txt | AC | 2 ms | 512 KB |
01_rnd_19.txt | AC | 4 ms | 512 KB |
02_rndhard_00.txt | AC | 2 ms | 512 KB |
02_rndhard_01.txt | AC | 2 ms | 512 KB |
02_rndhard_02.txt | AC | 3 ms | 512 KB |
02_rndhard_03.txt | AC | 3 ms | 512 KB |
02_rndhard_04.txt | AC | 2 ms | 512 KB |
02_rndhard_05.txt | AC | 2 ms | 512 KB |
02_rndhard_06.txt | AC | 2 ms | 512 KB |
02_rndhard_07.txt | AC | 2 ms | 512 KB |
02_rndhard_08.txt | AC | 2 ms | 512 KB |
02_rndhard_09.txt | AC | 2 ms | 512 KB |
02_rndhard_10.txt | AC | 2 ms | 512 KB |
02_rndhard_11.txt | AC | 2 ms | 512 KB |
02_rndhard_12.txt | AC | 2 ms | 512 KB |
02_rndhard_13.txt | AC | 2 ms | 512 KB |
02_rndhard_14.txt | AC | 2 ms | 512 KB |
02_rndhard_15.txt | AC | 2 ms | 512 KB |
02_rndhard_16.txt | AC | 2 ms | 512 KB |
02_rndhard_17.txt | AC | 2 ms | 512 KB |
02_rndhard_18.txt | AC | 2 ms | 512 KB |
02_rndhard_19.txt | AC | 2 ms | 512 KB |
02_rndhard_20.txt | AC | 2 ms | 512 KB |
02_rndhard_21.txt | AC | 2 ms | 512 KB |
02_rndhard_22.txt | AC | 2 ms | 512 KB |
02_rndhard_23.txt | AC | 2 ms | 512 KB |
02_rndhard_24.txt | AC | 2 ms | 512 KB |
02_rndhard_25.txt | AC | 2 ms | 512 KB |
02_rndhard_26.txt | AC | 2 ms | 512 KB |
02_rndhard_27.txt | AC | 2 ms | 512 KB |
02_rndhard_28.txt | AC | 2 ms | 512 KB |
02_rndhard_29.txt | AC | 2 ms | 512 KB |
02_rndhard_30.txt | AC | 2 ms | 512 KB |
02_rndhard_31.txt | AC | 2 ms | 512 KB |
02_rndhard_32.txt | AC | 2 ms | 512 KB |
02_rndhard_33.txt | AC | 2 ms | 512 KB |
02_rndhard_34.txt | AC | 2 ms | 512 KB |
02_rndhard_35.txt | AC | 2 ms | 512 KB |
02_rndhard_36.txt | AC | 2 ms | 512 KB |
02_rndhard_37.txt | AC | 2 ms | 512 KB |
02_rndhard_38.txt | AC | 2 ms | 512 KB |
02_rndhard_39.txt | AC | 2 ms | 512 KB |
03_rndhardsmall_00.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_01.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_02.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_03.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_04.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_05.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_06.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_07.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_08.txt | AC | 1 ms | 256 KB |
03_rndhardsmall_09.txt | AC | 1 ms | 256 KB |