하루 코딩 하루 코딩

Algorithm/BOJ

• 욕심쟁이 판다 - 1937

  Algorithm/BOJ 2020. 2. 25. 20:18

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 //1937 - 욕심쟁이 판다 #include #include using namespace std; #define IMP -100000000 int N; vector arr; vector cache; int xarr[4] = {1, -1, 0, 0}; int yarr[4] = {0, 0, 1, -1}; void init() { cin >> N; arr = cache = vector(N+2, vector(N+2)); for(int i = 1; i arr[i]..

  Read More

• 최대 유량 - 6086

  Algorithm/BOJ 2020. 2. 25. 00:21

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 //6086 - 최대 유량 #include #include #include using namespace std; #define MAX_V 52 #d..

  Read More

• 열혈강호 - 11375

  Algorithm/BOJ 2020. 2. 24. 00:08

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 //11375 - 열혈강호 #include #include using namespace std; int N, M; vector adj; vector aMatch, bMatch; vector visited; void init() { cin >> N >> M; adj = vector(N + 1, vector(M + 1, false)); int n; int from; for(int to = 1..

  Read More

• 발전소 - 1102

  Algorithm/BOJ 2020. 2. 23. 18:29

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 //1102 - 발전소 #include #include using namespace std; #define INF 2000000000 int N; int arr[16][16]; int fstate = 0; int cond; vector cache; void init() { cin >> N; for(int i = 0; i arr[i][j]; string s; cin >> s; for(int i = 0; i

  Read More

• 외판원 순회 - 2098

  Algorithm/BOJ 2020. 2. 19. 20:24

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 //2098 - 외판원 순회 #include #include using namespace std; #define INF 200000000 int N; int arr[16][16]; vector cache; void init() { cin >> N; for(int i = 0; i arr[i][j]; cache = vector(1

  Read More

• 등산 - 1486

  Algorithm/BOJ 2020. 2. 18. 19:41

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 //1486 - 등산 #include #include using namespace std; #define INF 200000000 int N, M, T, D; vector adj, arr; int xarr[4] = {1, -1, 0, 0}; int yarr[4] = {0, 0, 1, -1}; void init() { cin >> N >> M >> T >> D; arr = vector..

  Read More

• DFS와 BFS

  Algorithm/BOJ 2020. 2. 18. 17:17

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 //1260 - DFS와 BFS #include #include #include #include using namespace std; int N, M, S; vector adj; vector visit; void init() { cin >> N >> M >> S; adj = vector(N+1); visit = vector(N+1..

  Read More