oj.uz

답안 #150317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150317 2019-09-01T08:08:08 Z Torat(#3726, Osama_Alkhodairy, mohammedehab2002, mahmoudbadawy) HicCup (FXCUP4_hiccup) C++17
24 / 100
 56 ms 12196 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;

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){
    vector <int> g(n);
    for(int i = n - 1 ; i >= 0 ; i--){
        if(s[i] == '!') g[h[i]]++;
        else if(s[i] == 'C'){
            if(g[h[i]] < x) return 0;
            g[h[i]] -= x;
        }
    }
    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;
    }
    int z = 0;
    for(int i = 0 ; i < 1000000 ; i++){
        int x = 352700;
        int y = 50398;
        z += x % y;
    }
    return l - 1;
}

Compilation message

hiccup.cpp: In function 'int HicCup(std::__cxx11::string)':
hiccup.cpp:60:11: warning: iteration 42683 invokes undefined behavior [-Waggressive-loop-optimizations]
         z += x % y;
         ~~^~~~~~~~
hiccup.cpp:57:23: note: within this loop
     for(int i = 0 ; i < 1000000 ; i++){
                     ~~^~~~~~~~~

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 128 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 54 ms 12196 KB Output is correct
6 Correct 14 ms 4352 KB Output is correct
7 Correct 14 ms 4224 KB Output is correct
8 Correct 55 ms 12196 KB Output is correct
9 Correct 56 ms 12196 KB Output is correct
10 Correct 14 ms 4352 KB Output is correct
11 Correct 6 ms 384 KB Output is correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 128 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 54 ms 12196 KB Output is correct
6 Correct 14 ms 4352 KB Output is correct
7 Correct 14 ms 4224 KB Output is correct
8 Correct 55 ms 12196 KB Output is correct
9 Correct 56 ms 12196 KB Output is correct
10 Correct 14 ms 4352 KB Output is correct
11 Correct 15 ms 4352 KB Output is correct
12 Correct 16 ms 4352 KB Output is correct
13 Correct 14 ms 4224 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 16 ms 4352 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 Correct 49 ms 12008 KB Output is correct
20 Incorrect 45 ms 12136 KB Output isn't correct
21 Halted 0 ms 0 KB -