結果

問題 No.2076 Concon Substrings (ConVersion)
ユーザー tokusakurai
提出日時 2022-09-16 23:13:22
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,302 bytes
コンパイル時間 2,054 ms
コンパイル使用メモリ 203,236 KB
最終ジャッジ日時 2025-02-07 10:36:00
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 25 WA * 3
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;
int main() {
int N, A, B;
cin >> N >> A >> B;
string S;
cin >> S;
vector<int> c;
for (int i = 0; i < N;) {
int j = 0;
while (i + 3 * j <= N - 3 && S.substr(i + 3 * j, 3) == "con") j++;
c.eb(j);
i += 3 * j + 1;
}
int K = sz(c);
// print(c);
auto solve = [&](int x) {
int rem = 0;
priority_queue<pii> que;
rep(i, K) {
rem += c[i] / A;
que.emplace(c[i] % A, c[i]);
}
int cnt = 0;
if (rem < x) return -1;
while (!empty(que)) {
auto [a, b] = que.top();
que.pop();
if (b < B) continue;
int tmp = rem - (b / A) + ((b - B) / A);
if (tmp < x) break;
rem = tmp;
b -= B;
a = b % A;
cnt++;
que.emplace(a, b);
}
return cnt;
};
if (A >= B) {
int L = 0, R = N + 1;
while (R - L > 1) {
int M = (L + R) / 2;
int x = solve(M);
(x >= M - 1 ? L : R) = M;
}
cout << L + min(solve(L), L) << '\n';
} else {
swap(A, B);
int L = 0, R = N + 1;
while (R - L > 1) {
int M = (L + R) / 2;
int x = solve(M);
(x >= M ? L : R) = M;
}
cout << L + min(solve(L), L + 1) << '\n';
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0