From 87f0224af5f7ce2f0934bb1bc3cd5a20d69b6282 Mon Sep 17 00:00:00 2001 From: sh0723 Date: Mon, 7 Sep 2026 17:36:59 +0900 Subject: [PATCH 1/2] =?UTF-8?q?1695=20:=20=EB=8B=A8=EC=A7=80=EB=B2=88?= =?UTF-8?q?=ED=98=B8=EB=B6=99=EC=9D=B4=EA=B8=B0=20solve?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/JungOl/JO1695/JO1695_V1.cpp | 59 +++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 src/JungOl/JO1695/JO1695_V1.cpp diff --git a/src/JungOl/JO1695/JO1695_V1.cpp b/src/JungOl/JO1695/JO1695_V1.cpp new file mode 100644 index 0000000..bc269cb --- /dev/null +++ b/src/JungOl/JO1695/JO1695_V1.cpp @@ -0,0 +1,59 @@ +#include +using namespace std; +int N; +int inp[25][25]; +int used[25][25]; +int dy[4] = {0,0,1,-1}; +int dx[4] = {1,-1,0,0}; +int cnt; +void dfs(int y, int x) { + int ret = 0; + for (int i=0; i<4; i++) { + int ny = y + dy[i]; + int nx = x + dx[i]; + + if (ny >= N || nx >= N || ny < 0 || nx < 0 || used[ny][nx] == 1 || inp[ny][nx] == 0) continue; + used[ny][nx] = 1; + cnt++; + dfs(ny,nx); + } + +} +int main() { + + ios_base::sync_with_stdio(false); + cin.tie(nullptr); + cout.tie(nullptr); + + cin >> N; + + for (int i=0; i> s; + for (int j=0; j comp; + for (int i=0; i Date: Tue, 8 Sep 2026 18:09:00 +0900 Subject: [PATCH 2/2] =?UTF-8?q?1695=20:=20=EB=8B=A8=EC=A7=80=EB=B2=88?= =?UTF-8?q?=ED=98=B8=EB=B6=99=EC=9D=B4=EA=B8=B0=20=EA=B2=BD=EA=B3=A0=20?= =?UTF-8?q?=EC=A0=95=EB=A6=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/JungOl/JO1695/JO1695_V1.cpp | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/src/JungOl/JO1695/JO1695_V1.cpp b/src/JungOl/JO1695/JO1695_V1.cpp index bc269cb..8da4be5 100644 --- a/src/JungOl/JO1695/JO1695_V1.cpp +++ b/src/JungOl/JO1695/JO1695_V1.cpp @@ -7,7 +7,6 @@ int dy[4] = {0,0,1,-1}; int dx[4] = {1,-1,0,0}; int cnt; void dfs(int y, int x) { - int ret = 0; for (int i=0; i<4; i++) { int ny = y + dy[i]; int nx = x + dx[i]; @@ -51,9 +50,9 @@ int main() { cout << comp.size() << '\n'; sort(comp.begin(), comp.end()); - for (int i=0; i