본문 바로가기

BOJ3

[BOJ] 30804 - 과일 탕후루 (C++, Two-Pointer) #include #include #include #include #include using namespace std;int fruit[10];int arr[200001];int n;int main(){ cin.tie(0); cout.tie(0); ios::sync_with_stdio(false); cin >> n; for(int i=0; i> arr[i]; } int left = 0; int right = 0; int result = 0; while(right 2){ fruit[arr[left]] -= 1; left += 1; } else{ fruit[arr[right]] +=.. 2024. 12. 9.
[BOJ] 13905 - 세부 (C++, Kruskal,BFS) https://www.acmicpc.net/problem/13905#include #include #include #include #include using namespace std;#define INF 99999999struct item{ int a,b,cost;};struct node{ int e, cost;};int n,m;int s,e;int parent[100001];item lst[300001];vector v[100001];int visited[100001];bool compare(item a, item b){ return a.cost > b.cost;}//path compression 미적용int find(int a){ if(parent[a] == a) return a.. 2024. 12. 7.
[BOJ] 15683 - 감시 (C++, 시뮬레이션) / 삼성 SW 역량테스트 기출 https://www.acmicpc.net/problem/15683/문제 링크#include #include #include #include #include using namespace std;int map[9][9];int n,m;//우 상 좌 하int dx[] = {1,0,-1,0};int dy[] = {0,-1,0,1};struct cctv{ int y,x,num;};vector cctvLst;int cctvNum;int mini = 99999999;bool isRange(int y, int x){ return y >= 0 && y = 0 && x > n >> m; for(int i=0; i> map[i][j]; if(map[i][j] != 6 && map[i][.. 2024. 12. 7.

티스토리툴바