Algorithm32 (BOJ) 1766 풀이 #include using namespace std; int N,M; int in_degree[32001]; vector v[32001]; priority_queue pq; int main(){ ios::sync_with_stdio(0);cin.tie(0); cin >> N >> M; for(int i=1;i> a >> b; v[a].push_back(b); in_degree[b]++; } // for(int i=1;i 2022. 1. 18. (BOJ) 3055 풀이 #include #include using namespace std; typedef struct xy{ int x,y; char t; }xy; xy dest,start; int R,C; char ar[52][52]={0,}; int visited[52][52]={0,}; int water[52][52]={0,}; int dx[4]={0,1,0,-1}; int dy[4]={-1,0,1,0}; queue q; void BFS(int y,int x){ q.push({x,y,'.'}); int flag=0; while(!q.empty()){ int x=q.front().x; int y=q.front().y; int t=q.front().t; q.pop(); for(int i=0;i 2022. 1. 14. (BOJ) 10216 풀이 #include using namespace std; typedef struct xyr{ int x,y,r; }xyr; xyr cord[5001]; int visited[5001]; int sqare(int x){ return x*x; } int main(void){ int T,N,ans=0; scanf("%d",&T); while(T--){ scanf("%d",&N); ans=0; fill(visited,visited+N,0); stack s; for(int i=0;i 2022. 1. 12. (BOJ) 2667 풀이 #include #include #include using namespace std; int map[26][26]={0,}; int visit[26][26]={0,}; int yy[]={0,-1,0,1}; int xx[]={-1,0,1,0}; int N; int DFS(int y,int x,int c){ if (y = N || x >= N || map[y][x] == 0) return 0; visit[y][x]=1; for(int asdf=0;asdf 2022. 1. 11. 이전 1 ··· 5 6 7 8 다음
