oj.uz

답안 #149555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149555 2019-09-01T06:43:14 Z 팀명못정해서15시간째고민중인팀(#3792, onjo0127, sg1774) HicCup (FXCUP4_hiccup) C++17
24 / 100
 344 ms 7504 KB 
#include "hiccup.h"
#include<bits/stdc++.h>
using namespace std;

int HicCup(std::string S) {
	int N = S.size();
	stack<int> st;
	bool chk=true,r=false;
	for(auto i:S){
        if(i=='H') st.push(1),r=false;
        else if(i=='C'){
            if(!st.empty()) st.pop(),r=true;
            else chk=false;
        }
        else if(!r) chk=false;
	}
	if(!st.empty()) chk=false;
	if(!chk) return -1;
	else{
        int l=0,r=1000000,Max=0;
        while(l<=r){
            int mid=(l+r)/2;
            //printf("%d %d %d\n",l,r,mid);
            stack<pair<int,int>> s;
            bool ct=true;
            for(auto i:S){
                //if(!s.empty()) printf("%d %d\n",s.top().first,s.top().second);
                //else printf("��\n");
                if(!s.empty()&&s.top().first==2&&s.top().second==mid) s.pop();
                if(i=='H') s.push({1,0});
                else if(i=='C') s.pop(),s.push({2,0});
                else{
                    if(!s.empty()){
                        int c=s.top().second; s.pop();
                        s.push({2,c+1});
                    }
                }
            }
            while(!s.empty()&&s.top().second==mid) s.pop();
            if(s.empty()) l=mid+1,Max=max(Max,mid);
            else r=mid-1;
        }
        return Max;
	}
}

Compilation message

hiccup.cpp: In function 'int HicCup(std::__cxx11::string)':
hiccup.cpp:25:18: warning: unused variable 'ct' [-Wunused-variable]
             bool ct=true;
                  ^~
hiccup.cpp:6:6: warning: unused variable 'N' [-Wunused-variable]
  int N = S.size();
      ^

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 9 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 17 ms 728 KB Output is correct
5 Correct 344 ms 7504 KB Output is correct
6 Correct 20 ms 3328 KB Output is correct
7 Correct 20 ms 3328 KB Output is correct
8 Correct 334 ms 7492 KB Output is correct
9 Correct 342 ms 7496 KB Output is correct
10 Correct 20 ms 3328 KB Output is correct
11 Correct 6 ms 384 KB Output is correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 9 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 17 ms 728 KB Output is correct
5 Correct 344 ms 7504 KB Output is correct
6 Correct 20 ms 3328 KB Output is correct
7 Correct 20 ms 3328 KB Output is correct
8 Correct 334 ms 7492 KB Output is correct
9 Correct 342 ms 7496 KB Output is correct
10 Correct 20 ms 3328 KB Output is correct
11 Correct 19 ms 3328 KB Output is correct
12 Correct 15 ms 3328 KB Output is correct
13 Correct 14 ms 3328 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 14 ms 3328 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Runtime error 186 ms 3448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -