oj.uz

답안 #149844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149844 2019-09-01T07:16:00 Z Torat(#3726, Osama_Alkhodairy, mohammedehab2002, mahmoudbadawy) HicCup (FXCUP4_hiccup) C++17
24 / 100
 84 ms 63900 KB 
#include <bits/stdc++.h>
#include "hiccup.h"
//~ #include "grader.cpp"
using namespace std;

const int N = 1000001;

int n;
string s;
vector <int> h, v[N], g[N];

bool valid(){
    int o = 0;
    for(auto &i : s){
        o += i == 'H';
        o -= i == 'C';
        if(o < 0) return 0;
    }
    if(o) return 0;
    for(auto &i : s){
        if(i == 'H') o = 0;
        else if(i == 'C') o = 1;
        else if(o == 0) return 0;
    }
    return 1;
}
bool check(int x){
    for(int i = 0 ; ; i++){
        if((int)v[i].size() == 0) break;
        g[i] = v[i];
    }
    for(int i = n - 1 ; i >= 0 ; i--){
        if(s[i] == 'C'){
            int cur = x;
            while(cur > 0 && g[h[i]].size() && g[h[i]].back() > i){
                g[h[i]].pop_back();
                cur--;
            }
            if(cur) return 0;
        }
    }
    return 1;
}
int HicCup(std::string S) {
    s = S;
    n = s.size();
    if(!valid() || s == string(n, '!')) return -1;
    h.resize(n);
    h[0] = 1;
    for(int i = 1 ; i < n ; i++){
        h[i] = h[i - 1];
        if(s[i] == 'H') h[i]++;
        else if(s[i] == 'C') h[i]--;
        else v[h[i]].push_back(i);
    }
    int l = 0, r = n;
    while(l <= r){
        int mid = (l + r) / 2;
        if(check(mid)) l = mid + 1;
        else r = mid - 1;
    }
    return l - 1;
}

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 47360 KB Output is correct
2 Correct 32 ms 47360 KB Output is correct
3 Correct 35 ms 47360 KB Output is correct
4 Correct 38 ms 47736 KB Output is correct
5 Correct 80 ms 55204 KB Output is correct
6 Correct 47 ms 51192 KB Output is correct
7 Correct 43 ms 51448 KB Output is correct
8 Correct 74 ms 55256 KB Output is correct
9 Correct 73 ms 55252 KB Output is correct
10 Correct 44 ms 51320 KB Output is correct
11 Correct 37 ms 47360 KB Output is correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 47360 KB Output is correct
2 Correct 32 ms 47360 KB Output is correct
3 Correct 35 ms 47360 KB Output is correct
4 Correct 38 ms 47736 KB Output is correct
5 Correct 80 ms 55204 KB Output is correct
6 Correct 47 ms 51192 KB Output is correct
7 Correct 43 ms 51448 KB Output is correct
8 Correct 74 ms 55256 KB Output is correct
9 Correct 73 ms 55252 KB Output is correct
10 Correct 44 ms 51320 KB Output is correct
11 Correct 43 ms 51320 KB Output is correct
12 Correct 44 ms 51200 KB Output is correct
13 Correct 44 ms 51320 KB Output is correct
14 Correct 34 ms 47360 KB Output is correct
15 Correct 42 ms 51328 KB Output is correct
16 Correct 34 ms 47360 KB Output is correct
17 Correct 36 ms 47360 KB Output is correct
18 Correct 36 ms 47616 KB Output is correct
19 Correct 76 ms 63900 KB Output is correct
20 Incorrect 84 ms 63264 KB Output isn't correct
21 Halted 0 ms 0 KB -