oj.uz

답안 #149478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149478 2019-09-01T06:35:02 Z 팀명못정해서15시간째고민중인팀(#3792, onjo0127, sg1774) HicCup (FXCUP4_hiccup) C++17
24 / 100
 317 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;
            for(auto i:S){
                //if(!s.empty()) printf("%d %d\n",s.top().first,s.top().second);
                //else printf("��\n");
                if(i=='H') s.push({1,0});
                else if(!s.empty()&&i=='C') s.pop(),s.push({2,0});
                else{
                    if(!s.empty()&&s.top().second==mid) s.pop();
                    if(!s.empty()){
                        int c=s.top().second; s.pop();
                        s.push({2,c+1});
                    }
                    if(!s.empty()&&s.top().second==mid) s.pop();
                }
            }
            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: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 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 18 ms 716 KB Output is correct
5 Correct 317 ms 7488 KB Output is correct
6 Correct 20 ms 3328 KB Output is correct
7 Correct 20 ms 3328 KB Output is correct
8 Correct 308 ms 7496 KB Output is correct
9 Correct 313 ms 7504 KB Output is correct
10 Correct 20 ms 3328 KB Output is correct
11 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 18 ms 716 KB Output is correct
5 Correct 317 ms 7488 KB Output is correct
6 Correct 20 ms 3328 KB Output is correct
7 Correct 20 ms 3328 KB Output is correct
8 Correct 308 ms 7496 KB Output is correct
9 Correct 313 ms 7504 KB Output is correct
10 Correct 20 ms 3328 KB Output is correct
11 Correct 20 ms 3200 KB Output is correct
12 Correct 16 ms 3328 KB Output is correct
13 Correct 14 ms 3328 KB Output is correct
14 Correct 5 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 128 KB Output is correct
18 Correct 7 ms 640 KB Output is correct
19 Correct 247 ms 3328 KB Output is correct
20 Incorrect 248 ms 3456 KB Output isn't correct
21 Halted 0 ms 0 KB -