Submission #483157

#	Time	Username	Problem	Language	Result	Execution time	Memory
483157		jalsol	Nivelle (COCI20_nivelle)	C++17	110 / 110	250 ms	584 KiB

nivelle

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "RUCRO"
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 1e5 + 5;

int n;
char s[maxn];

signed main() {
    cin >> n >> (s + 1);

    int nu = 1, de = 1;
    int ansL = 1, ansR = 1;

    For (uni, 1, 26) {
        map<char, int> cnt;

        int L = 1;
        For (R, 1, n) {
            ++cnt[s[R]];

            while (isz(cnt) > uni) {
                --cnt[s[L]];
                if (cnt[s[L]] == 0) {
                    cnt.erase(s[L]);
                }
                ++L;
            }

            if (isz(cnt) < uni) continue;

            if (1LL * (R - L + 1) * nu >= 1LL * de * uni) {
                nu = uni;
                de = R - L + 1;
                ansL = L;
                ansR = R;
            }
        }
    }

    cout << ansL << ' ' << ansR << '\n';
}

• Subtask 1: 7 / 7
• Subtask 2: 17 / 17
• Subtask 3: 13 / 13
• Subtask 4: 25 / 25
• Subtask 5: 48 / 48