민듀의 일상

https://www.acmicpc.net/problem/2021 시도#include #include #include #include #include using namespace std;int N, L, start, finish;vector> v;vector> edges;unordered_set startLines;unordered_set finishLines;int minTransfer = 1e9;int bfs(int startLine) { vector visited(L, 0); queue q; int transfer = 0; q.push(startLine); visited[startLine] = 0; while (!q.empty()) { int now = q.front(); q.pop(); if..

https://www.acmicpc.net/problem/2941 string.replace(교체하고 싶은 문자열의 위치, 교체하고 싶은 문자열의 길이, 새로운 문자열) #include #include using namespace std;void changeAlpha(string &word, string toFind, string toChange) { int idx = 0; while (true) { auto pos = word.find(toFind, idx); if (pos == string::npos) break; word.replace(pos, toFind.size(), toChange); idx = pos; }}void changeWord(string &word) { changeAlph..

https://www.acmicpc.net/problem/11718  라이브러리의 getline 함수를 이용하면 된다.#include #include using namespace std;int main() { string s; while (getline(cin, s)) { cout

https://www.acmicpc.net/problem/14503 간단한 구현문제맞왜틀: 시계방향이 아닌 반시계방향으로 돌리기 #include #include using namespace std;struct Node { int y, x, d; };int N, M;vector> map;Node start;int direct[4][2] = { -1, 0, 0, 1, 1, 0, 0, -1,};int main() { cin >> N >> M; map.assign(N, vector(M, 0)); cin >> start.y >> start.x >> start.d; for (int i = 0; i > map[i][j]; } } int cnt = 0; while (true) { // 1. 현재 칸이 아직 청소되..

https://www.acmicpc.net/problem/9205 #include #include #include #include using namespace std;struct Node { int y, x; bool operator ==(const Node& other) const { return y == other.y && x == other.x; }};struct NodeHash { size_t operator()(const Node& node) const { return hash()(node.y) ^ hash()(node.x); }};int T;unordered_set visited;unordered_set convi;Node start, festival;int getDistance(Node ..

https://www.acmicpc.net/problem/5972 간단한 다익스트라 문제. #include #include #include using namespace std;struct Edge { int to; int cost; bool operator Next.cost; }};int N, M;vector> graph;vector dist;void dijkstra(int start) { dist.assign(N + 1, 1e9); priority_queue pq; pq.push({start, 0}); dist[start] = 0; while (!pq.empty()) { Edge nowEdge = pq.top(); pq.pop(); int now = nowEdge.to; int nowCost ..

https://www.acmicpc.net/problem/16928 from collections import dequeleather = {}snake = {}visited = [1e9 for _ in range(101)]def bfs(start): q = deque() visited[start] = 1 q.append(start) while q: now = q.popleft() for i in range(1, 7): next = now + i if next > 100 or visited[next]

https://www.acmicpc.net/problem/16928 테케 36%에서 틀린다면, 사다리나 뱀으로 이동한 뒤에 visited도 체크 해 줬는지 확인해보자. #include #include #include using namespace std;int N, M;int dice[6] = { 1, 2, 3, 4, 5, 6 };unordered_map leather;unordered_map snake;vector visited(101, 1e9);void bfs(int start) { queue q; visited[start] = 1; q.push(start); while (!q.empty()) { int now = q.front(); q.pop(); for (int i = 0; i 100) co..

https://www.acmicpc.net/problem/7562 from collections import dequevisited = []dy = [-1, -2, -2, -1, 1, 2, 2, 1]dx = [-2, -1, 1, 2, 2, 1, -1, -2]l = 0endy = 0endx = 0def bfs(starty, startx): q = deque() visited[starty][startx] = True q.append((starty, startx)) while q: nowy, nowx = q.popleft() if nowy == endy and nowx == endx: return visited[nowy][nowx] ..

https://www.acmicpc.net/problem/1806 투포인터 문제.71%에서 틀렸습니다가 나온다면 마지막 원소를 고려하지 않은 것. #include #include #include using namespace std;int N, S;vector arr;int main() { cin >> N >> S; arr.assign(N, 0); for (int i = 0; i > arr[i]; } arr.push_back(0); int i = 0; int j = 0; int sum = arr[0]; int minLen = 1e9; do { if (sum >= S) { minLen = min(minLen, j - i + 1); sum -= arr[i]; i++; } if (sum