当前位置:网站首页>Problem - 922D、Robot Vacuum Cleaner - Codeforces
Problem - 922D、Robot Vacuum Cleaner - Codeforces
2022-07-06 16:15:00 【Hello_ Ä】
Problem - 922D、Robot Vacuum Cleaner - Codeforces
Pushok the dog has been chasing Imp for a few hours already.
Fortunately, Imp knows that Pushok is afraid of a robot vacuum cleaner.While moving, the robot generates a string t consisting of letters ‘s’ and ‘h’, that produces a lot of noise. We define noise of string t as the number of occurrences of string “sh” as a subsequence in it, in other words, the number of such pairs (i, j), that i < j and and
.The robot is off at the moment. Imp knows that it has a sequence of strings ti in its memory, and he can arbitrary change their order. When the robot is started, it generates the string t as a concatenation of these strings in the given order. The noise of the resulting string equals the noise of this concatenation.Help Imp to find the maximum noise he can achieve by changing the order of the strings.
Input
The first line contains a single integer n (1 ≤ n ≤ 105) — the number of strings in robot’s memory.Next n lines contain the strings t1, t2, …, tn, one per line. It is guaranteed that the strings are non-empty, contain only English letters ‘s’ and ‘h’ and their total length does not exceed 105.
Output
Print a single integer — the maxumum possible noise Imp can achieve by changing the order of the strings.
Examples
input
4
ssh
hs
s
hhhs
output
18
Problem analysis
The question is , Here you are. n A string , These strings are all composed of characters ’s’ and ‘h’ Composed of . Let you combine these strings in any order , Make the string contain ’sh‘ Subsequences are at most .
About this problem , It uses a kind of called “ Neighborhood exchange ” Written by , The idea is like this : Two strings a and b, If a+b The composed string contains ’sh‘ Subsequence ratio b+a The string consists of many , Then when you finally splice a Put it in b The former is a better choice . So this method is to write a cmp then sort Just a moment .
cmp The content is to combine the two strings in different order , Calculate what they contain respectively ’sh‘ Number , as for ’sh‘ Number of sequences , It's every one h All before the character s The number of characters adds up . Pay attention to the , If two strings of ’sh‘ The number of sequences is equal , Then go back false( I don't know why , But that's it , Otherwise re).
AC Code
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<math.h>
#include<set>
#include<numeric>
#include<string>
#include<string.h>
#include<iterator>
#include<map>
#include<unordered_map>
#include<stack>
#include<list>
#include<queue>
#include<iomanip>
#define endl '\n'
#define int ll
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>PII;
const int N = 2e5 + 50;
int get_sh(string& s)
{
int cnt = 0, nums = 0, numh = 0;
for (auto i : s)
{
if (i == 's')
{
nums++;
}
else
{
numh++;
cnt += nums;
}
}
return cnt;
}
bool cmp(string a, string b)
{
string s1 = a + b, s2 = b + a;
return get_sh(s1)>get_sh(s2);
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<string>v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end(),cmp);
string s;
for (auto i : v)s += i;
cout << get_sh(s) << endl;
return 0;
}
ending
Adjacent term exchange method is also a common greedy method , Similar topics include Algorithm improvement Minimum string and New king game - subject - Daimayuan Online Judge
边栏推荐
- 第 300 场周赛 - 力扣(LeetCode)
- Interval sum ----- discretization
- Codeforces - 1526C1&&C2 - Potions
- Problem - 1646C. Factorials and Powers of Two - Codeforces
- Hdu-6025-prime sequence (girls' competition)
- Opencv learning log 29 -- gamma correction
- HDU - 6024 building shops (girls' competition)
- [exercise-8] (UVA 246) 10-20-30== simulation
- Determine the Photo Position
- AcWing:第56场周赛
猜你喜欢
Browser print margin, default / borderless, full 1 page A4
力扣:第81场双周赛
Suffix expression (greed + thinking)
[exercise-7] crossover answers
807. Maintain the urban skyline
Borg maze (bfs+ minimum spanning tree) (problem solving report)
1605. Sum the feasible matrix for a given row and column
1855. Maximum distance of subscript alignment
Differential (one-dimensional, two-dimensional, three-dimensional) Blue Bridge Cup three body attack
409. Longest palindrome
随机推荐
[exercise-5] (UVA 839) not so mobile (balance)
It is forbidden to trigger onchange in antd upload beforeupload
(POJ - 2739) sum of constructive prime numbers (ruler or two points)
QT实现圆角窗口
[exercise-4] (UVA 11988) broken keyboard = = (linked list)
Problem - 1646C. Factorials and Powers of Two - Codeforces
AcWing——第55场周赛
The concept of C language array
Find 3-friendly Integers
双向链表—全部操作
Codeforces Round #802(Div. 2)A~D
1689. Ten - the minimum number of binary numbers
Hdu-6025-prime sequence (girls' competition)
Problem - 1646C. Factorials and Powers of Two - Codeforces
Raspberry pie csi/usb camera uses mjpg to realize web camera monitoring
Suffix expression (greed + thinking)
Some problems encountered in installing pytorch in windows11 CONDA
Penetration test (2) -- penetration test system, target, GoogleHacking, Kali tool
Basic Q & A of introductory C language
Specify the format time, and fill in zero before the month and days