oj.uz

답안 #844757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
844757 2023-09-05T19:53:46 Z vjudge1 Nivelle (COCI20_nivelle) C++14
38 / 110
 29 ms 772 KB 
// Aber der schlimmste Fiend, dem du begegnen kannst, wirst du immer dir selber sein
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define rev reverse
#define all(x) x.begin(),x.end()
#define acc accumulate
#define sz size()
#define MOD 1000000007
#define rall(x) x.rbegin(),x.rend()
#define rep(i, x, n) for(int i = x; i < n; i++)
using namespace std;
const int N = 1e6 + 5;
inline void solve(){
    int n;
    cin >> n;
    string s;
    cin >> s;
    double mn = n + 1, l, r;
    rep(i, 1, 26){
        int cnt[26];
        fill(cnt, cnt+26, 0);
        int cur = 0;
        int ll = 0;
        rep(j, 0, n){
            if(++cnt[s[j] - 'a'] == 1){
                cur++;
            }
            while(cur > i){
                if(--cnt[s[ll] - 'a'] == 0) cur--;
                ll++;
            }
            if(cur == i){
                double ans = (double)i / (double)(j - ll + 1);
                if(mn > ans) mn = ans, l = ll, r = j; 
            }
        }
    }
    cout << l+1 << " " << r+1 << endl;
}
int main(){
    fast_io
    int t;
    t = 1;
    while(t--) solve();
}

Compilation message

nivelle.cpp: In function 'void solve()':
nivelle.cpp:44:29: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |     cout << l+1 << " " << r+1 << endl;
      |                             ^
nivelle.cpp:44:15: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |     cout << l+1 << " " << r+1 << endl;
      |               ^

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 604 KB Output is correct
2 Correct 7 ms 768 KB Output is correct
3 Correct 8 ms 772 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 9 ms 600 KB Output is correct
6 Correct 7 ms 604 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 604 KB Output is correct
2 Correct 9 ms 764 KB Output is correct
3 Correct 9 ms 600 KB Output is correct
4 Correct 9 ms 576 KB Output is correct
5 Correct 9 ms 612 KB Output is correct
6 Correct 10 ms 764 KB Output is correct

Subtask #5
0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 668 KB Output is correct
2 Correct 24 ms 604 KB Output is correct
3 Correct 23 ms 600 KB Output is correct
4 Correct 24 ms 600 KB Output is correct
5 Correct 25 ms 600 KB Output is correct
6 Incorrect 29 ms 604 KB Output isn't correct
7 Halted 0 ms 0 KB -