-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[docs] ChaNyeok1225 서버 증설 횟수 제출 코드 및 채점 결과 2025-02-28T104633
- Loading branch information
1 parent
7f6c1d7
commit 7e83a1b
Showing
2 changed files
with
29 additions
and
0 deletions.
There are no files selected for viewing
1 change: 1 addition & 0 deletions
1
Private Solve/프로그래머스/389479. 서버 증설 횟수/ChaNyeok1225/2025-02-28T104633/README.md
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
<pre class="console-content"><div></div><div class="console-heading">채점을 시작합니다.</div><div class="console-message">정확성 테스트</div><table class="console-test-group" data-category="correctness"><tbody><tr data-testcase-id="252700"><td valign="top" class="td-label">테스트 1 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.13MB)</td></tr><tr data-testcase-id="252701"><td valign="top" class="td-label">테스트 2 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr><tr data-testcase-id="252702"><td valign="top" class="td-label">테스트 3 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.18MB)</td></tr><tr data-testcase-id="252703"><td valign="top" class="td-label">테스트 4 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.13MB)</td></tr><tr data-testcase-id="252704"><td valign="top" class="td-label">테스트 5 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.13MB)</td></tr><tr data-testcase-id="252705"><td valign="top" class="td-label">테스트 6 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr><tr data-testcase-id="252706"><td valign="top" class="td-label">테스트 7 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.18MB)</td></tr><tr data-testcase-id="252707"><td valign="top" class="td-label">테스트 8 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.01MB)</td></tr><tr data-testcase-id="252708"><td valign="top" class="td-label">테스트 9 <span>〉</span></td><td class="result passed">통과 (0.01ms, 3.68MB)</td></tr><tr data-testcase-id="252709"><td valign="top" class="td-label">테스트 10 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.13MB)</td></tr><tr data-testcase-id="252710"><td valign="top" class="td-label">테스트 11 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr><tr data-testcase-id="252711"><td valign="top" class="td-label">테스트 12 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.21MB)</td></tr><tr data-testcase-id="252712"><td valign="top" class="td-label">테스트 13 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.14MB)</td></tr><tr data-testcase-id="252713"><td valign="top" class="td-label">테스트 14 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.43MB)</td></tr><tr data-testcase-id="252714"><td valign="top" class="td-label">테스트 15 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.19MB)</td></tr><tr data-testcase-id="252715"><td valign="top" class="td-label">테스트 16 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr><tr data-testcase-id="252716"><td valign="top" class="td-label">테스트 17 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr><tr data-testcase-id="252717"><td valign="top" class="td-label">테스트 18 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr><tr data-testcase-id="252718"><td valign="top" class="td-label">테스트 19 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.21MB)</td></tr><tr data-testcase-id="252719"><td valign="top" class="td-label">테스트 20 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.14MB)</td></tr><tr data-testcase-id="252720"><td valign="top" class="td-label">테스트 21 <span>〉</span></td><td class="result passed">통과 (0.01ms, 3.74MB)</td></tr><tr data-testcase-id="252721"><td valign="top" class="td-label">테스트 22 <span>〉</span></td><td class="result passed">통과 (0.01ms, 3.69MB)</td></tr><tr data-testcase-id="252722"><td valign="top" class="td-label">테스트 23 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.16MB)</td></tr><tr data-testcase-id="252723"><td valign="top" class="td-label">테스트 24 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.27MB)</td></tr><tr data-testcase-id="252724"><td valign="top" class="td-label">테스트 25 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.14MB)</td></tr><tr data-testcase-id="253060"><td valign="top" class="td-label">테스트 26 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr><tr data-testcase-id="253061"><td valign="top" class="td-label">테스트 27 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr><tr data-testcase-id="253062"><td valign="top" class="td-label">테스트 28 <span>〉</span></td><td class="result passed">통과 (0.01ms, 4.2MB)</td></tr></tbody></table><div class="console-heading">채점 결과</div><div class="console-message">정확성: 100.0</div><div class="console-message">합계: 100.0 / 100.0</div></pre> |
28 changes: 28 additions & 0 deletions
28
Private Solve/프로그래머스/389479. 서버 증설 횟수/ChaNyeok1225/2025-02-28T104633/solution.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
#include <vector> | ||
using namespace std; | ||
|
||
int solution(vector<int> players, int m, int k) { | ||
int answer = 0; | ||
|
||
int q[50] = {}; | ||
|
||
int curMax = m; | ||
int curServer = 0; | ||
for(int t = 0; t < 24; t++) { | ||
int curPlayer = players[t]; | ||
curServer += q[t]; | ||
curMax += q[t] * m; | ||
|
||
if(curMax <= curPlayer) { | ||
int needs = curPlayer / m; | ||
int add = needs - curServer; | ||
q[t + k] = -add; | ||
answer += add; | ||
curServer = needs; | ||
curMax = (needs + 1) * m; | ||
} | ||
|
||
} | ||
|
||
return answer; | ||
} |