Submission #223472

#TimeUsernameProblemLanguageResultExecution timeMemory
223472NONAMENivelle (COCI20_nivelle)C++17
0 / 110
39 ms768 KiB
#include <bits/stdc++.h> #include <time.h> //#include <random> #define sz(x) int(x.size()) #define in(x) freopen(x, "r", stdin) #define out(x) freopen(x, "w", stdout) #define N 100500 / 100 #define oo ll(1e16) #define pii pair <int, int> #define pll pair <ll, ll> #define ft first #define sd second #define pb push_back #define ppb pop_back #define el '\n' #define elf endl #define base ll(1e9 + 7) #define re return #define nins 4294967295 using namespace std; typedef long long ll; typedef long double ld; //mt19937 rnd(0); void solve() { int n, alp[26]; string s; cin >> n; cin >> s; int ans = -1; int l = -1, r = -1; for (int i = 1; i < 26; i++) { int cl = 0, cr = 0; for (int j = 0; j < 26; j++) alp[j] = 0; int cur = 0; while (cr < n) { while (cr < n && cur <= i) { if (alp[s[cr] - 'a'] == 0) cur++; alp[s[cr] - 'a']++; cr++; } if (cur >= i) { if (ans == -1 || (ans * (cr - cl - 1) > i * (r - l + 1))) { ans = i; r = cr - 2; l = cl; } } alp[s[cl] - 'a']--; if (alp[s[cl++] - 'a'] == 0) cur--; } } cout << l + 1 << ' ' << r + 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifdef _LOCAL in("input.txt"); int t = 1; // cin >> t; for (int i = 1; i <= t; i++) { cout << "Test #" << i << elf; clock_t start_time = clock(); solve(); cerr.precision(4); cerr << fixed; cerr << elf; cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf; cout << elf; } #else int t = 1; // cin >> t; while (t--) { solve(); cout << el; } #endif }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...