Submission #149778

#TimeUsernameProblemLanguageResultExecution timeMemory
149778Torat (#200)HicCup (FXCUP4_hiccup)C++17
24 / 100
71 ms55204 KiB
#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(int i = 0 ; i < n ; i++){ if(s[i] == 'H' && s[i + 1] == '!') 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...