Hello World!

https://www.acmicpc.net/problem/13903코드#include #include #include using namespace std; #define FASTIO ios::sync_with_stdio(false); cin.tie(NULL); #define MAX 1001 typedef pair pi; int r, c, arr[MAX][MAX], n, ans = INT_MAX, dx[11], dy[11]; bool visit[MAX][MAX]; queue q; void bfs() { while (!q.empty()) { int nx = q.front().first.first; int ny = q.front().first.second; int cnt = q.front().second; q..

https://www.acmicpc.net/problem/6593코드#include #include #include using namespace std; #define MAX 31 #define FASTIO ios::sync_with_stdio(false); cin.tie(NULL); typedef pair pii; int dx[6] = { 0, 0, 1, -1, 0, 0 }; int dy[6] = { 1, -1, 0, 0, 0, 0 }; int dz[6] = { 0, 0, 0, 0, 1, -1 }; int l, r, c; char arr[MAX][MAX][MAX]; bool visit[MAX][MAX][MAX]; queue q; void init() { memset(arr, '#', sizeof(arr..

https://www.acmicpc.net/problem/14226코드#include #include using namespace std;#define MAX 1001#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);int s;bool visited[MAX][MAX]; struct d { int cnt; int clip; int time; };void bfs() { queue q; q.push({ 1, 0, 0 }); visited[1][0] = 1; while (!q.empty()) { int cnt = q.front().cnt; int clip = q.front().clip; ..

https://www.acmicpc.net/problem/15723코드#include #include using namespace std;#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);int n, m, parent[27];int main() { FASTIO; fill(parent, parent + 27, -1); cin >> n; string a, tmp, b; for (int i = 0; i > a >> tmp >> b; parent[a[0] - 'a'] = b[0] - 'a'; } cin >> m; for (int i = 0, s, e; i > a >> tmp >> b; s = a[0] - 'a', e = b[0] - 'a'; while ..

https://www.acmicpc.net/problem/13565코드#include using namespace std;#define MAX 1001#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);int m, n, arr[MAX][MAX];int dx[4] = { 1, -1, 0, 0 }, dy[4] = { 0, 0, 1, -1 };bool visit[MAX][MAX];void dfs(int x, int y) { visit[x][y] = true; for (int i = 0; i = 0 && nx = 0 && ny > m >> n; string s; for (int i = 0; i > s; for (int j = ..

https://www.acmicpc.net/problem/1058코드 #include #include #include using namespace std;#define MAX 51#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);typedef pair pi;int n, ans;char arr[MAX][MAX];bool visit[MAX];void bfs(int s) { queue q; q.push({ s, 0 }); visit[s] = 1; int cnt = 0; while (!q.empty()) { int now = q.front().first; int d = q.front().second; q.pop(); if (d > 1) continu..

https://www.acmicpc.net/problem/6118코드#include #include #include using namespace std;#define MAX 20001int n, m, maxAns;int dst[MAX];vector v[MAX]; bool visit[MAX];void bfs() { queue q; q.push(1); visit[1] = true; dst[1] = 0; while (!q.empty()) { int now = q.front(); q.pop(); for (int i = 0; i > n >> m; for (int i = 0, a, b; i > a >> b; v[a].push_back(b); v[b].push_back(a); } bfs(); return 0..

https://www.acmicpc.net/problem/25516코드#include #include using namespace std;#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);#define MAX 100001int n, k, ans;vector v[MAX];int cnt[MAX];void dfs(int now, int ncnt) { if (ncnt > k) return; ans += cnt[now]; for (int i = 0; i > n >> k; for (int i = 0, s, e; i > s >> e; v[s].push_back(e); } for (int i = 0; i > cnt[i]; dfs(0, 0); cout 설명트리를 생..

https://www.acmicpc.net/problem/1245코드#include #include using namespace std;#define MAX 101#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);typedef pair pi;int arr[MAX][MAX]; bool visit[MAX][MAX]; int dx[8] = { 1, -1, 0, 0, 1, 1, -1, -1 }; int dy[8] = { 0, 0, 1, -1, 1, -1, 1, -1 };int n, m, ans; void bfs(int x, int y) { queue q; q.push({ x, y }); visit[x][y] = true; bo..

https://www.acmicpc.net/problem/11000 코드#include #include #include #include using namespace std;#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);typedef pair pi;vector v;priority_queue, greater> pq;int n;int main() { FASTIO; cin >> n; v.resize(n); for (int i = 0, s, e; i > s >> e; v[i] = { s, e }; } sort(v.begin(), v.end()); pq.push(v[0].second); for (int i = 1; i = pq.top()) pq.pop();..