Submission #737529

#	Time	Username	Problem	Language	Result	Execution time	Memory
737529		Sam_a17	Nivelle (COCI20_nivelle)	C++17	110 / 110	80 ms	10808 KiB

nivelle

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

int ka() {
	int x = 0;
	bool z = false;
	while (1)
	{
		char y = getchar();
		if (y == '-')
			z = true;
		else if ('0' <= y && y <= '9')
			x = x * 10 + y - '0';
		else
		{
			if (z)
				x *= -1;
			return x;
		}
	}
}

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 10;
int nxt[N][26];

void solve_() {
  int n; cin >> n;
  string s; cin >> s;

  // if(n <= 2000) {
  //   long double pat = 1;
  //   int li = 0, ri = 0;
  //   for(int i = 0; i < n; i++) {
  //     vector<int> a(26);
  //     long double cnt = 0;
  //     for(int j = i; j < n; j++) {
  //       a[s[j] - 'a']++;
  //       if(a[s[j] - 'a'] == 1) {
  //         cnt += 1;
  //       }
  //       long double range = j - i + 1;
  //       if(cnt / range < pat) {
  //         pat = cnt / range;
  //         li = i, ri = j;
  //       }
  //     }
  //   }

  //   cout << li + 1 << " " << ri + 1 << '\n';
  // } else {
    long double pat = 1;
    int li = 0, ri = 0;
    long double cnt = 0;

    for(int i = 0; i < 26; i++) {
      nxt[n][i] = n;
    }

    for(int i = n - 1; i >= 0; i--) {
      for(int j = 0; j < 26; j++) {
        nxt[i][j] = nxt[i + 1][j];
      }
      nxt[i][s[i] - 'a'] = i;
    }

    for(int i = 0; i < n; i++) {
      vector<int> vec;
      vec.push_back(n);
      for(int j = 0; j < 26; j++) {
        vec.push_back(nxt[i][j]);
      }
      sort(all(vec));
      uniq(vec);

      long double cnt = 1;
      for(int j = 1; j < sz(vec); j++) {
        long double range = vec[j] - i;

        if(pat > cnt / range) {
          pat = cnt / range;
          li = i, ri = vec[j] - 1;
        }

        if(vec[j] < n) {
          cnt += 1;
        }
      }
    }

    cout << li + 1 << ' ' << ri + 1 << '\n';
  // }
} 
 
int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
} 

Compilation message (stderr)

nivelle.cpp: In function 'void solve_()':
nivelle.cpp:119:17: warning: unused variable 'cnt' [-Wunused-variable]
  119 |     long double cnt = 0;
      |                 ^~~
nivelle.cpp: In function 'void setIO(std::string)':
nivelle.cpp:83:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nivelle.cpp:84:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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