제출 #844331

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
844331		vjudge1	Nivelle (COCI20_nivelle)	C++17	0 / 110	1094 ms	10840 KiB

nivelle

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
//#define int long long

#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    #define OPEN freopen(".in", "r", stdin); \
                 freopen(".out", "w", stdout);
#else
    #define OPEN void(23);
#endif

void solve()
{
    int n; cin >> n;
    string str; cin >> str; str = '$' + str;

    vector <array <int, 26>> pref(n +1);
    for(int i = 0; i < 26; i++) pref[0][i] = 0;
    for(int i = 1; i <= n; i++)
    {
        pref[i] = pref[i -1];
        pref[i][str[i] - 'a' +1]++;
    }

    long double ans = 2;
    pair <int, int> inds;
    for(int l = 1; l <= n; l++)
    {
        for(int r = l; r <= n; r++)
        {
            array <int, 26> c;
            int tot = 0;
            for(int i = 0; i < 26; i++) 
                c[i] = pref[r][i] - pref[l -1][i], tot += (c[i] != 0);

            long double cost = tot;
            cost /= (r - l +1);
            //cerr << l << " " << r << " " << cost << "\n";
            if(cost < ans)
            {
                ans = cost;
                inds = {l, r};
            }
        }
    }

    cout << inds.first << " " << inds.second << "\n";

    return;
}

int32_t main()
{
    OPEN;

    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int t = 1; //cin >> t;
    while(t--)
    {
        solve();
    }
}

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