# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
198251 |
2020-01-25T08:53:56 Z |
alrad |
Nivelle (COCI20_nivelle) |
C++17 |
|
44 ms |
632 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0) , cout.tie(0);
int n;
cin >> n;
vector<char> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
long double ans = 2.0;
int L = 0 , R = 0;
for (int cnt = 1; cnt <= 26; cnt++) {
vector<int> tot(26 , 0);
int r = 0 , x = 0;
for (int i = 0; i < n; i++) {
while (r < n && x <= cnt) {
if (!tot[int(s[r] - 'a')]) {
if (x + 1 > cnt) {
break;
}
x++;
}
tot[int(s[r] - 'a')]++;
r++;
}
if (ld(cnt) / ld(r - i) < ans) {
ans = ld(cnt) / ld(r - i);
L = i;
R = r - 1;
}
if (tot[int(s[i] - 'a')] == 1) {
x--;
}
tot[int(s[i] - 'a')]--;
}
}
cout << L + 1 << " " << R + 1 << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
4 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
10 ms |
348 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
504 KB |
Output is correct |
2 |
Correct |
27 ms |
504 KB |
Output is correct |
3 |
Correct |
28 ms |
504 KB |
Output is correct |
4 |
Correct |
28 ms |
376 KB |
Output is correct |
5 |
Correct |
27 ms |
512 KB |
Output is correct |
6 |
Correct |
27 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
504 KB |
Output is correct |
2 |
Correct |
28 ms |
376 KB |
Output is correct |
3 |
Correct |
29 ms |
512 KB |
Output is correct |
4 |
Correct |
29 ms |
504 KB |
Output is correct |
5 |
Correct |
29 ms |
376 KB |
Output is correct |
6 |
Correct |
30 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
512 KB |
Output is correct |
2 |
Correct |
40 ms |
504 KB |
Output is correct |
3 |
Correct |
43 ms |
632 KB |
Output is correct |
4 |
Correct |
40 ms |
472 KB |
Output is correct |
5 |
Correct |
42 ms |
504 KB |
Output is correct |
6 |
Correct |
43 ms |
508 KB |
Output is correct |