Submission #443677

#	Time	Username	Problem	Language	Result	Execution time	Memory
443677		Karliver	Nivelle (COCI20_nivelle)	C++14	110 / 110	147 ms	11212 KiB

nivelle

    
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;

const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  

template <typename XPAX>
void ckma(XPAX &x, XPAX y) {
    x = (x < y ? y : x);
}
template <typename XPAX>
void ckmi(XPAX &x, XPAX y) {
    x = (x > y ? y : x);
}
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
void solve() {


    
    int n;
    cin >> n;

    string s;
    cin >> s;

    VV<int> pos(26, V<int>(n, INF));   
    double ans = 2.0;
    int lx = 0, rx = 0;
    auto upd = [&](int l, int r, int ps) {
        double val = 1.0 * ps / (r - l + 1);

        if(ans > val) {
            lx = l;
            rx = r;
            ans = val;
        }
    };


    forn(i, n) pos[s[i] - 'a'][i] = i;

    for(int i = n - 2;i >= 0;--i) {
        forn(j, 26) {
            ckmi(pos[j][i], pos[j][i + 1]);
        }
    }

    forn(l, n) {
        V<int> pt;
        forn(j, 26) {
            if(pos[j][l] != INF)
                pt.push_back(pos[j][l]);
        }

        sort(all(pt));
        pt.push_back(n);
        for(int i = 1;i < (int)pt.size();++i) {
            upd(l, pt[i] - 1, i);
        }
    }
    cout << lx + 1 << ' ' << rx + 1 << '\n';


}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

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