본문 바로가기

코테 문풀/[Algorithm]백준(BOJ) 풀이

 (4)
[Algorithm] BOJ 16235 - 나무 재테크(C++) 해당 문제는 그냥 시뮬레이션 구현 문제이다. #include #include #include #include using namespace std; typedef struct { int yangbun; vector trees; }Map; int n,m,k; int dx[] = {-1, -1, 0 ,1, 1,1, 0,-1}; int dy[] = {0,-1,-1,-1,0,1,1,1}; //좌 상 우 하 int A[11][11]; Map G[11][11]; void initVar(void){ cin >> n >> m >> k; for(int i = 1; i A[i][j]; G[i][j].yangbun = 5; } } for(int i = 0; i> row >> col >> age; G[row][col].tree..
[Algorithm] BOJ 1260 - DFS와 BFS (C++) #include #include #include #include #include using namespace std; typedef long long ll; int N, M, V; typedef struct Node { char idx; bool visited = false; vector vec; // char vec_idx = 0; }Node; vector node_vec; void input(void) { cin >> N >> M >> V; Node tmp; tmp.idx = -1; node_vec.push_back(tmp); for (int i = 1; i > a >> b; node_vec[a].vec.push_back(b); node_vec[b].vec.push_back(a); } for (int..
[BOJ] 12100 - 2048(EASY) #include #include #define endl "\n" #define up 0 #define down 1 #define left 2 #define right 3 using namespace std; int basic_map[21][21]; int n; int max(int** map) { int m = -1; for (int i = 0; i m) m = map[i][j]; } } return m; } int** move(int** map, int dir) { int idx; queue q; if (dir == up) { //cout
[Algorithm] BOJ 11053번 #include #include #include #include using namespace std; typedef long long ll; int *arr; int *memo; int lss(int size) { int min_or_max; int cnt = 0; int answer = 1; for (int i = 0; i arr[j]) mid_result += 1; else continue; if (mid_result > memo[i]) memo[i] = mid_result; } if (memo[i] > answer) answer..

티스토리툴바