히더

SW Expert Academy :: SWEA :: 5789 :: 현주의 상자 바꾸기 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWYygN36Qn8DFAVm #include using namespace std; int i, j, T, N, Q, n1, n2; int main() {std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);cin >> T;for (int tc = 1; tc > N >> Q;vectorq; vectorv(N + 1, 0), a(N + 1, 0);while (Q--) {cin >> n1 >> n2; q.push_back(..

SW Expert Academy :: SWEA :: 5653 :: 줄기세포배양 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRJ8EKe48DFAUo #include using namespace std; struct cell {int life, x, y;}; int t, tc, ans;int N, M, K;int J[450][450];int dx[] = { 0,0,1,-1 }, dy[] = { 1,-1,0,0 };queue q[11]; void input() {for (int i = 0;i < 11;i++)while (!q[i].empty()) q[i].pop();ans = 0; memset(..

SW Expert Academy :: SWEA :: 5656 :: 벽돌 깨기 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRQm6qfL0DFAUo #include using namespace std; int T, tc, c, N, W, H;int dx[] = { 0,0,1,-1 }, dy[] = { 1,-1,0,0 };int arr[5][15][12]; void go(int D) {queue q;for (int j = 0; j = 0; i--) {if (arr[D][i][j]) {q.push(arr[D][i][j]); arr[D][..

SW Expert Academy :: SWEA :: 5658 :: 보물상자 비밀번호 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRUN9KfZ8DFAUo&categoryId=AWXRUN9KfZ8DFAUo&categoryType=CODE #include #include #include #include #include using namespace std; int N, K;string s; int main() {int T; cin >> T;for (int tc = 1; tc > N >> K;vectorv; int ans = 0;cin >> s; int tmp; for (int i = 0; i < ..

SW Expert Academy :: SWEA :: 5644 :: 무선 충전 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRDL1aeugDFAUo #include #include #include #include using namespace std; struct BC {int x, y, c, p, n;}; int M, N, ans;int user[2][101];int dir[5][2] = { {0,0},{0,-1},{1,0},{0,1},{-1,0} };vector map; inline bool check(int x, int y, BC bc) { return bc.c >= ((abs(bc.x-x..

SW Expert Academy :: SWEA :: 5648 :: 원자 소멸 시뮬레이션 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRFInKex8DFAUo&categoryId=AWXRFInKex8DFAUo&categoryType=CODE #include #include #include using namespace std; struct atom { int n, i, j, d, e; float c;}; int N, ans;vector v;vector ev; inline void check(atom n1, atom n2) {if (n1.d == 0) {if (n2.d == 1 && n1.j ==..

SW Expert Academy :: SWEA :: 5650 :: 핀볼게임 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRF8s6ezEDFAUo #include using namespace std; struct S { int y, x, d; };int T, N, tc, ans, A[102][102], dy[] = { -1,0,1,0 }, dx[] = { 0,1,0,-1 },C[6][4] = { {},{2,3,1,0},{1,3,0,2},{3,2,0,1},{2,0,3,1},{2,3,0,1} }, D[5][5]; void G() {for (int i = 1; i T;while (T--) {cin ..

SW Expert Academy :: SWEA :: 5521 :: 상원이의 생일파티 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWWO3kT6F2oDFAV4&categoryId=AWWO3kT6F2oDFAV4&categoryType=CODE #include #include using namespace std; int main() {int T; scanf("%d", &T);for (int tc = 1; tc > v(501);bool c[501] = { 0, }; c[1] = 1;while (M--) {scanf("%d %d", &a, &b); v[a].push_..

SW Expert Academy :: SWEA :: 5436 :: 동욱이의 조판하기 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWV5nLjas4cDFAV4&categoryId=AWV5nLjas4cDFAV4&categoryType=CODE #include #include #include #include using namespace std; int arr[500005], check[500005], a, b;long long ans; long long cal(int num, int m, long long aa) {for (int i = m - 1; i = 0) {aa += (arr[check[i]]..

SW Expert Academy :: SWEA :: 5432 :: 쇠막대기 자르기 출처 : https://www.swexpertacademy.com/main/talk/codeBattle/problemDetail.do #include #include using namespace std; char s[100001];int a, n, l; int main() { int T; scanf("%d", &T); for (int tc = 1; tc