Submission #68313496


Source Code Expand

#include <string>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
vector<lint> RH_B = {1532834020, 1388622299};
vector<lint> RH_M = {2147482409, 2147478017};
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string S;
  cin >> S;
  double max_value = 0;
  REP(i, S.size()) FOR(j, i+2, S.size()) {
    if(S[i] != 't' || S[j] != 't') continue;
    int cnt = 0;
    FOR(k, i, j+1) if(S[k] == 't') cnt++;
    double value = (cnt - 2) / (double)(j - i - 1);
    if(value > max_value) {
      max_value = value;
    }
  }
  cout << fixed << setprecision(10) << max_value << "\n";
}

Submission Info

Submission Time
Task B - You're a teapot
User Shun_PI
Language C++ 20 (gcc 12.2)
Score 200
Code Size 1322 Byte
Status AC
Exec Time 1 ms
Memory 3868 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 64
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt, 01-47.txt, 01-48.txt, 01-49.txt, 01-50.txt, 01-51.txt, 01-52.txt, 01-53.txt, 01-54.txt, 01-55.txt, 01-56.txt, 01-57.txt, 01-58.txt, 01-59.txt, 01-60.txt, 01-61.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 1 ms 3652 KiB
00-sample-02.txt AC 1 ms 3772 KiB
00-sample-03.txt AC 1 ms 3576 KiB
01-01.txt AC 1 ms 3572 KiB
01-02.txt AC 1 ms 3756 KiB
01-03.txt AC 1 ms 3764 KiB
01-04.txt AC 1 ms 3768 KiB
01-05.txt AC 1 ms 3752 KiB
01-06.txt AC 1 ms 3708 KiB
01-07.txt AC 1 ms 3676 KiB
01-08.txt AC 1 ms 3768 KiB
01-09.txt AC 1 ms 3752 KiB
01-10.txt AC 1 ms 3648 KiB
01-11.txt AC 1 ms 3748 KiB
01-12.txt AC 1 ms 3768 KiB
01-13.txt AC 1 ms 3772 KiB
01-14.txt AC 1 ms 3572 KiB
01-15.txt AC 1 ms 3648 KiB
01-16.txt AC 1 ms 3772 KiB
01-17.txt AC 1 ms 3736 KiB
01-18.txt AC 1 ms 3656 KiB
01-19.txt AC 1 ms 3700 KiB
01-20.txt AC 1 ms 3756 KiB
01-21.txt AC 1 ms 3764 KiB
01-22.txt AC 1 ms 3696 KiB
01-23.txt AC 1 ms 3784 KiB
01-24.txt AC 1 ms 3732 KiB
01-25.txt AC 1 ms 3660 KiB
01-26.txt AC 1 ms 3696 KiB
01-27.txt AC 1 ms 3772 KiB
01-28.txt AC 1 ms 3732 KiB
01-29.txt AC 1 ms 3868 KiB
01-30.txt AC 1 ms 3760 KiB
01-31.txt AC 1 ms 3732 KiB
01-32.txt AC 1 ms 3728 KiB
01-33.txt AC 1 ms 3748 KiB
01-34.txt AC 1 ms 3696 KiB
01-35.txt AC 1 ms 3736 KiB
01-36.txt AC 1 ms 3752 KiB
01-37.txt AC 1 ms 3760 KiB
01-38.txt AC 1 ms 3696 KiB
01-39.txt AC 1 ms 3768 KiB
01-40.txt AC 1 ms 3780 KiB
01-41.txt AC 1 ms 3764 KiB
01-42.txt AC 1 ms 3660 KiB
01-43.txt AC 1 ms 3712 KiB
01-44.txt AC 1 ms 3712 KiB
01-45.txt AC 1 ms 3748 KiB
01-46.txt AC 1 ms 3772 KiB
01-47.txt AC 1 ms 3696 KiB
01-48.txt AC 1 ms 3744 KiB
01-49.txt AC 1 ms 3720 KiB
01-50.txt AC 1 ms 3576 KiB
01-51.txt AC 1 ms 3764 KiB
01-52.txt AC 1 ms 3752 KiB
01-53.txt AC 1 ms 3756 KiB
01-54.txt AC 1 ms 3772 KiB
01-55.txt AC 1 ms 3756 KiB
01-56.txt AC 1 ms 3868 KiB
01-57.txt AC 1 ms 3756 KiB
01-58.txt AC 1 ms 3748 KiB
01-59.txt AC 1 ms 3752 KiB
01-60.txt AC 1 ms 3728 KiB
01-61.txt AC 1 ms 3756 KiB