20055 Samsung sw test
์๊ณ ๋ฆฌ์ฆ (๊ตฌํ)
1. durability์ isThereRobot ๋ณ์๋ก ๊ตฌ์ฑ๋ Cell ๊ตฌ์กฐ์ฒด๋ก ์ปจ๋ฒ ์ด์ด ๋ฒจํธ๋ฅผ ๋ง๋ฆ
2. ๋ฌดํ ๋ฃจํ ์์์, ์ด๋์ํค๊ณ -> ๋ด๋ฆฌ๋ ์์น ๋ก๋ด๋นผ๊ณ -> ๋ก๋ด์ด๋ ์ํค๊ณ (์ด๋์ ๋ด๊ตฌ๋ 1๊ฐ์) -> ๋ด๋ฆฌ๋ ์์น ๋ก๋ด๋นผ๊ณ -> ์ฌ๋ฆฌ๋ ์์น ๋ก๋ด ์ฌ๋ฆฌ๊ณ (๋ด๊ตฌ๋ 1๊ฐ์)
-> ๋ด๊ตฌ๋ 0์ธ ์นธ์ด ํ๊ณ์ ์ ๋ฟ์ผ๋ฉด ์ข
๋ฃ
๊ธฐํ
1. ๋งค๋ฒ ๋ด๊ตฌ๋ 0์ธ ์นธ์ด ๋ช๊ฐ์ธ์ง ์ธ๊ธฐ๋ณด๋จ, ๋ด๊ตฌ๋๋ฅผ ๊น๋ ์นธ์ ๊น๊ณ ๋์ ๋ด๊ตฌ๋ 0์ด๋ฉด count++๋ฅผ ํ์ฌ, count๊ฐ ํ๊ณ์ ์ ๋ฟ๋์ง ํ์ธํ๋ ํธ์ด ํจ์ฌ ๋น ๋ฅด๊ฒ ํ ์ ์๋ค.
์ฝ๋
#include <iostream>
#define MAX_WIDTH 100
using namespace std;
typedef struct Cell {
int durability;
bool robot;
} Cell;
Cell belt[2][MAX_WIDTH];
int width, maxDurability;
int getLastSecond();
bool checkDurability();
int main() {
cin >> width >> maxDurability;
for (int i = 0; i < width; i++) {
cin >> belt[0][i].durability;
belt[0][i].robot = false;
}
for (int i = width - 1; i >= 0; i--) {
cin >> belt[1][i].durability;
belt[1][i].robot = false;
}
cout << getLastSecond();
}
int getLastSecond() {
int second = 0;
int zero = 0;
while (true) {
second++;
//๋ฒจํธ ํ์นธ ์ฉ ์ด๋
Cell temp = belt[0][0];
for (int i = 1; i < width; i++) {
Cell temp2 = belt[0][i];
belt[0][i] = temp;
temp = temp2;
}
for (int i = width - 1; i >= 0; i--) {
Cell temp2 = belt[1][i];
belt[1][i] = temp;
temp = temp2;
}
belt[0][0] = temp;
belt[0][width - 1].robot = false;
//๋ก๋ด ์ด๋
for (int i = width - 2; i >= 0; i--) {
if (belt[0][i].robot) {
if (!belt[0][i + 1].robot && belt[0][i + 1].durability > 0) {
belt[0][i + 1].robot = true;
belt[0][i + 1].durability--;
if (belt[0][i + 1].durability == 0)
zero++;
belt[0][i].robot = false;
}
}
}
belt[0][width - 1].robot = false;
//๋ก๋ด ์ฌ๋ฆฌ๊ธฐ
if (!belt[0][0].robot && belt[0][0].durability > 0) {
belt[0][0].durability--;
if (belt[0][0].durability == 0)
zero++;
belt[0][0].robot = true;
}
//์ฒดํฌ
if (zero >= maxDurability)
break;
}
return second;
}