Submission #872682

#	Time	Username	Problem	Language	Result	Execution time	Memory
872682		vjudge1	Nivelle (COCI20_nivelle)	C++17	24 / 110	1056 ms	2820 KiB

nivelle

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")

#define tof_io  ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double  long double
#define int     long long
#define pb      push_back

#define all(x)  x.begin(),x.end()
#define endl    '\n'

const int mod = 998244353; //998244353 1e9+7 1e9+9
const int inf = 1e18;
const int N = 1e6 + 23;	
const int lg = 23;
int fac[N];
int inv[N];
int  dnt_pow	(int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
void dnt_bld	(){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
int  dnt_ncr	(int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
bool cmp (pair<int,int> a, pair<int,int> b){ return a.second > b.second; }
double mn = 1.0;
int L = -1;
int R = -1;
vector<int> cnt(26);
void check(string s , int i , int j)
{
	double len = j - i + 1;
	double cnt1 = 0;
	for(int i = 0; i < 26; i++)
	{
		if(cnt[i] > 0) cnt1++;
	}
	double res = cnt1 / len;
	if(res < mn)
	{
		L = i;
		R = j;
		mn = res;
	}

}
int32_t main()
{
	int n;
	cin >> n;
	string s;
	cin >> s;

	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < 26; j++) cnt[j] = 0;
		string k="";
		for(int j = i; j < n; j++)
		{
			k = k + s[j];
			cnt[s[j]-'a']++;
			check(k,i,j);
		}
	}
	cout << L+1 << ' ' << R+1;
}

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