(cache)Submission #68698913 - AtCoder Beginner Contest 418

Contest Duration: 2025-08-09(Sat) 21:00 - 2025-08-09(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #68698913

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
char S[114514];
int cnt[114514];
int main(void) {
  int i, j;
  double ans = 0;
  if (scanf("%114513s", S) != 1) return 1;
  for (i = 0; S[i] != '\0'; i++) {
    cnt[i] = (i > 0 ? cnt[i - 1] : 0) + (S[i] == 't');
  }
  for (i = 0; S[i] != '\0'; i++) {
    if (S[i] == 't') {
      for (j = 0; j < i - 1; j++) {
        if (S[j] == 't') {
          double candidate = (double)(cnt[i - 1] - cnt[j]) / (i - 1 - j);
          if (candidate > ans) ans = candidate;
        }
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

char S[114514];

int cnt[114514];

int main(void) {
	int i, j;
	double ans = 0;
	if (scanf("%114513s", S) != 1) return 1;
	for (i = 0; S[i] != '\0'; i++) {
		cnt[i] = (i > 0 ? cnt[i - 1] : 0) + (S[i] == 't');
	}
	for (i = 0; S[i] != '\0'; i++) {
		if (S[i] == 't') {
			for (j = 0; j < i - 1; j++) {
				if (S[j] == 't') {
					double candidate = (double)(cnt[i - 1] - cnt[j]) / (i - 1 - j);
					if (candidate > ans) ans = candidate;
				}
			}
		}
	}
	printf("%.20f\n", ans);
	return 0;
}

Submission Info

Submission Time	2025-08-23 07:28:33
Task	B - You're a teapot
User	mikecat
Language	C (gcc 12.2.0)
Score	200
Code Size	537 Byte
Status	AC
Exec Time	1 ms
Memory	1796 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

200 / 200

Status

× 3

× 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	1580 KiB
00-sample-02.txt	AC	1 ms	1732 KiB
00-sample-03.txt	AC	1 ms	1648 KiB
01-01.txt	AC	1 ms	1708 KiB
01-02.txt	AC	1 ms	1736 KiB
01-03.txt	AC	1 ms	1664 KiB
01-04.txt	AC	1 ms	1712 KiB
01-05.txt	AC	1 ms	1692 KiB
01-06.txt	AC	1 ms	1704 KiB
01-07.txt	AC	1 ms	1628 KiB
01-08.txt	AC	1 ms	1692 KiB
01-09.txt	AC	1 ms	1744 KiB
01-10.txt	AC	1 ms	1796 KiB
01-11.txt	AC	1 ms	1700 KiB
01-12.txt	AC	1 ms	1704 KiB
01-13.txt	AC	1 ms	1648 KiB
01-14.txt	AC	1 ms	1576 KiB
01-15.txt	AC	1 ms	1748 KiB
01-16.txt	AC	1 ms	1728 KiB
01-17.txt	AC	1 ms	1748 KiB
01-18.txt	AC	1 ms	1724 KiB
01-19.txt	AC	1 ms	1640 KiB
01-20.txt	AC	1 ms	1644 KiB
01-21.txt	AC	1 ms	1648 KiB
01-22.txt	AC	1 ms	1748 KiB
01-23.txt	AC	1 ms	1704 KiB
01-24.txt	AC	1 ms	1752 KiB
01-25.txt	AC	1 ms	1652 KiB
01-26.txt	AC	1 ms	1700 KiB
01-27.txt	AC	1 ms	1728 KiB
01-28.txt	AC	1 ms	1688 KiB
01-29.txt	AC	1 ms	1704 KiB
01-30.txt	AC	1 ms	1644 KiB
01-31.txt	AC	1 ms	1788 KiB
01-32.txt	AC	1 ms	1672 KiB
01-33.txt	AC	1 ms	1748 KiB
01-34.txt	AC	1 ms	1700 KiB
01-35.txt	AC	1 ms	1632 KiB
01-36.txt	AC	1 ms	1792 KiB
01-37.txt	AC	1 ms	1736 KiB
01-38.txt	AC	1 ms	1720 KiB
01-39.txt	AC	1 ms	1660 KiB
01-40.txt	AC	1 ms	1744 KiB
01-41.txt	AC	1 ms	1728 KiB
01-42.txt	AC	1 ms	1752 KiB
01-43.txt	AC	1 ms	1696 KiB
01-44.txt	AC	1 ms	1680 KiB
01-45.txt	AC	1 ms	1648 KiB
01-46.txt	AC	1 ms	1752 KiB
01-47.txt	AC	1 ms	1708 KiB
01-48.txt	AC	1 ms	1716 KiB
01-49.txt	AC	1 ms	1672 KiB
01-50.txt	AC	1 ms	1732 KiB
01-51.txt	AC	1 ms	1676 KiB
01-52.txt	AC	1 ms	1752 KiB
01-53.txt	AC	1 ms	1788 KiB
01-54.txt	AC	1 ms	1756 KiB
01-55.txt	AC	1 ms	1644 KiB
01-56.txt	AC	1 ms	1676 KiB
01-57.txt	AC	1 ms	1636 KiB
01-58.txt	AC	1 ms	1712 KiB
01-59.txt	AC	1 ms	1648 KiB
01-60.txt	AC	1 ms	1624 KiB
01-61.txt	AC	1 ms	1676 KiB