This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
⭐ Total Stars: 1 | |
➕ Total Commits: 726 | |
🔀 Total PRs: 6 | |
🚩 Total Issues: 32 | |
📦 Contributed to: 8 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
🌞 Morning 27 commits █░░░░░░░░░░░░░░░░░░░░ 4.9% | |
🌆 Daytime 233 commits ████████▊░░░░░░░░░░░░ 42.1% | |
🌃 Evening 187 commits ███████░░░░░░░░░░░░░░ 33.8% | |
🌙 Night 106 commits ████░░░░░░░░░░░░░░░░░ 19.2% |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// https://www.acmicpc.net/problem/16918 | |
#include <iostream> | |
using namespace std; | |
char board[200][200]; | |
int _time[200][200]; | |
int dx[4] = { 0,0,-1,1 }; | |
int dy[4] = { -1,1,0,0 }; | |
int R, C, N; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// https://www.acmicpc.net/problem/7576 | |
#include <iostream> | |
#include <queue> | |
using namespace std; | |
int tomato[1001][1001]; // 토마토 농장 상태 | |
bool visit[1001][1001]; // 방문 여부 저장 | |
int dist[1001][1001]; // 일 수 저장 | |
int dx[4] = { -1,1,0,0 }; // x좌표 이동 | |
int dy[4] = { 0,0,-1,1 }; // y좌표 이동 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// https://www.acmicpc.net/problem/2667 | |
#include <iostream> | |
#include <vector> | |
#include <queue> | |
#include <algorithm> | |
using namespace std; | |
int n; | |
int board[26][26]; | |
bool visit[26][26]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// https://www.acmicpc.net/problem/2178 | |
#include <iostream> | |
#include <queue> | |
using namespace std; | |
int n, m; | |
int board[101][101]; // 미로 | |
bool visit[101][101]; // 방문 여부 | |
int dist[101][101]; // 거리 | |
int dx[4] = { -1,1,0,0 }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//https://www.acmicpc.net/problem/11725 | |
#include <iostream> | |
#include <vector> | |
#include <queue> | |
using namespace std; | |
int n; | |
vector<int> graph[100001]; // 그래프 | |
bool visit[100001]; // 방문여부 저장 | |
int parent[100001]; // 부모 노드값 저장 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// https://www.acmicpc.net/problem/1260 | |
#include <iostream> | |
#include <queue> | |
#include <vector> | |
#include <stack> | |
using namespace std; | |
int n, m, v; | |
int graph[1001][1001]; | |
bool visit[1001]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// https://www.acmicpc.net/problem/2606 | |
#include <iostream> | |
#include <queue> | |
#include <vector> | |
using namespace std; | |
vector<int> computers[101]; | |
bool visit[101]; | |
void bfs() { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// https://www.acmicpc.net/problem/1515 | |
#include <iostream> | |
#include <string> | |
using namespace std; | |
int main() { | |
ios::sync_with_stdio(0); | |
cin.tie(0); | |
cout.tie(0); |
NewerOlder