# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
148376 | 2019-09-01T04:12:31 Z | 모현보유국(#3693, jhnah917, stonejjun03, ahgus89) | HicCup (FXCUP4_hiccup) | C++17 | 11 ms | 512 KB |
#include "hiccup.h" #include <bits/stdc++.h> using namespace std; stack<int> stk; string s; bool chk(int x){ int cnt = 0; int save = 0; for(int i=0; i<s.size(); i++){ if(s[i] == 'H') cnt++; else if(s[i] == 'C'){ if(cnt == 0) return 0; cnt--; save += x; }else if(s[i] == '!' && save > 0) save--; } return save <= 0; } int HicCup(string S) { s = S; int n = s.size(); int ans = -1; int l = 0, r = 1000000; while(l <= r){ int m = l + r >> 1; if(chk(m)){ ans = m; l = m + 1; }else{ r = m - 1; } } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
3 | Correct | 6 ms | 384 KB | Output is correct |
4 | Incorrect | 11 ms | 512 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
3 | Correct | 6 ms | 384 KB | Output is correct |
4 | Incorrect | 11 ms | 512 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |