Skip to content

[hyodol] 달팽이 문제 풀이 #62

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
honux77 merged 1 commit into from
Jun 10, 2019
Merged

[hyodol] 달팽이 문제 풀이 #62

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
54 changes: 54 additions & 0 deletions 190530/hyodol/snail.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,54 @@
// BOJ 1913 - 달팽이
#include <iostream>
#include <vector>
using namespace std;

const int dy[] = {-1, 0, 1, 0};
const int dx[] = {0, 1, 0, -1};

int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);

int n;
cin >> n;
vector<vector<int> > arr(n, vector<int>(n));

int value;
cin >> value;

int num = 1;
int dir = 0;
int y = n / 2;
int x = n / 2;
while (!(y == 0 && x == 0)) {
arr[y][x] = num++;
int ny = y + dy[dir % 4];
int nx = x + dx[dir % 4];
if (ny < 0 || ny >= n || nx < 0 || nx >= n) dir++;
if (arr[ny][nx] == 0) {
y = ny;
x = nx;
dir++;
} else {
dir--;
num--;
}
}
arr[y][x] = num;

int findY = 0, findX = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (value == arr[i][j]) {
findY = i+1;
findX = j+1;
}
cout << arr[i][j] << " ";
}
cout << '\n';
}

cout << findY << " " << findX << '\n';
return 0;
}