Submission #500252

# Submission time Handle Problem Language Result Execution time Memory
500252 2021-12-30T14:18:04 Z Mounir Nivelle (COCI20_nivelle) C++14
110 / 110
70 ms 928 KB
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define pb push_back
#define pii pair<int, int>
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define x first
#define y second
//#define int long long
using namespace std;

signed main(){
      int nVals; cin >> nVals;
      string line; cin >> line;

      queue<int> occs[26];
      for (int i = 0; i < nVals; ++i)
            occs[line[i] - 'a'].push(i);
      
      int l, r;
      double res = 2;
      for (int deb = 0; deb < nVals; ++deb){
            if (deb != 0)
                  occs[line[deb - 1] - 'a'].pop();
            
            vector<int> dates;
            for (int c = 0; c < 26; ++c){
                  if (!occs[c].empty())
                        dates.pb(occs[c].front());
            }
            sort(all(dates));
            for (int i = 0; i < sz(dates); ++i){
                  int maxi = nVals - 1;
                  if (i + 1 != sz(dates))
                        maxi = dates[i + 1] - 1;
                  
                  double resCur = (i + 1)/double(maxi - deb + 1);
                  if (resCur < res){
                        res = resCur;
                        l = deb;
                        r = maxi;
                  }
            }
      }
      cout << l + 1 << " " << r + 1 << endl;
      return 0;   
}

Compilation message

nivelle.cpp: In function 'int main()':
nivelle.cpp:46:35: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   46 |       cout << l + 1 << " " << r + 1 << endl;
      |                                   ^
nivelle.cpp:46:24: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]
   46 |       cout << l + 1 << " " << r + 1 << endl;
      |                        ^~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 292 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 924 KB Output is correct
2 Correct 11 ms 784 KB Output is correct
3 Correct 10 ms 920 KB Output is correct
4 Correct 10 ms 836 KB Output is correct
5 Correct 11 ms 928 KB Output is correct
6 Correct 10 ms 808 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 23 ms 920 KB Output is correct
2 Correct 20 ms 908 KB Output is correct
3 Correct 25 ms 844 KB Output is correct
4 Correct 20 ms 912 KB Output is correct
5 Correct 20 ms 844 KB Output is correct
6 Correct 19 ms 904 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 63 ms 896 KB Output is correct
2 Correct 67 ms 896 KB Output is correct
3 Correct 69 ms 844 KB Output is correct
4 Correct 66 ms 900 KB Output is correct
5 Correct 67 ms 904 KB Output is correct
6 Correct 70 ms 908 KB Output is correct