블루베리의 블로그

[문제 링크] : https://www.acmicpc.net/problem/10775#include using namespace std;int G, P;int Arr[100001];int Ans;int find(int n){ if(n == Arr[n]){ return n; } return Arr[n] = find(Arr[n]);}void solve(int a, int b){ a = find(a); b = find(b); if(a > b){ swap(a, b); } Arr[b] = a; return;}int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);..

[문제 링크] : https://www.acmicpc.net/problem/7453#include #include #include using namespace std;int N;int A[4001];int B[4001];int C[4001];int D[4001];long long Ans;vector V;int main(){ cin >> N; for(int i=0; i> A[i] >> B[i] >> C[i] >> D[i]; } for(int i=0; i

[문제 링크] : https://www.acmicpc.net/problem/22864#include using namespace std;int A, B, C, D;int Ans, Cnt;int main(){ cin >> A >> B >> C >> D; int T = 24; while(T--){ if(Cnt + A

[문제 링크] : https://www.acmicpc.net/problem/26307#include using namespace std;int main(){ int H, M; cin >> H >> M; int A = 9 * 60, B = H * 60 + M; cout

[문제 링크] : https://www.acmicpc.net/problem/17406#include using namespace std;int N, M, K;int Ans = 1234567890;int Arr[51][51];int Tmp[51][51];int Cal[6][3];bool Check[6];int Order[6];int calc(){ int res = 1234567890; for(int i=1; ix-i; j--){ Tmp[y - i][j] = Tmp[y - i][j - 1]; } for(int j=x-i+1; jy-i; j--){ Tmp[j][x + i] = Tmp[j - 1][x + i]..

[문제 링크] : https://www.acmicpc.net/problem/3020#include using namespace std;int U[500001];int D[500001];int main(){ int N, H, inp; cin >> N >> H; for(int i=0; i> inp; if(i % 2 == 0){ D[inp]++; } else{ U[H - inp + 1]++; } } for(int i=1; i

[문제 링크] : https://www.acmicpc.net/problem/16637#include using namespace std;int N;string S;int Ans = -1234567890;int calc(int a, int b, char op){ int res = a; if(op == '+'){ res += b; } else if(op == '-'){ res -= b; } else if(op == '*'){ res *= b; } return res;}void solve(int idx, int val){ if(idx > N - 1){ Ans = max(Ans, val); return..

[문제 링크] : https://www.acmicpc.net/problem/17472#include #include #include #include using namespace std;int N, M;int Arr[11][11];int Cnt = 2;int Dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};int Parent[11];bool Visit[11];vector>> V;int Ans;int get(int n){ if (Parent[n] == n) return n; else return get(Parent[n]);}void unionP(int a, int b) { a = get(a); b = get(b); if(a > Q; Q.push({y, x}); ..

[문제 링크] : https://www.acmicpc.net/problem/17140#include #include #include #include using namespace std;int R, C, K;int Arr[201][201];int Cnt[101];int rSize = 3, cSize = 3;int main(){ cin >> R >> C >> K; int inp; for(int i=1; i> Arr[i][j]; } } int Ans = 0; while(true){ if(Ans > 100){ cout = cSize){ int maxi = 0; for(int i=1; i> V; ..

[문제 링크] : https://www.acmicpc.net/problem/6593#include #include #include using namespace std;int L, C, R;char Arr[31][31][31];bool Visit[31][31][31];int sz, sy, sx;int Dir[6][3] = {{0, 0, -1}, {0, 0, 1}, {0, -1, 0}, {0, 1, 0}, {-1, 0, 0}, {1, 0, 0}};void init(){ for(int i=0; i, int>> Q; Q.push({{sz, sy}, sx}); Visit[sz][sy][sx] = true; int Ans = 0; while(Q.empty() == false){ ..