链接:

https://codeforces.com/contest/1182/problem/C

题意:

You are given n words, each of which consists of lowercase alphabet letters. Each word contains at least one vowel. You are going to choose some of the given words and make as many beautiful lyrics as possible.

Each lyric consists of two lines. Each line consists of two words separated by whitespace.

A lyric is beautiful if and only if it satisfies all conditions below.

The number of vowels in the first word of the first line is the same as the number of vowels in the first word of the second line.

The number of vowels in the second word of the first line is the same as the number of vowels in the second word of the second line.

The last vowel of the first line is the same as the last vowel of the second line. Note that there may be consonants after the vowel.

Also, letters "a", "e", "o", "i", and "u" are vowels. Note that "y" is never vowel.

For example of a beautiful lyric,

"hello hellooowww"

"whatsup yowowowow"

is a beautiful lyric because there are two vowels each in "hello" and "whatsup", four vowels each in "hellooowww" and "yowowowow" (keep in mind that "y" is not a vowel), and the last vowel of each line is "o".

For example of a not beautiful lyric,

"hey man"

"iam mcdic"

is not a beautiful lyric because "hey" and "iam" don't have same number of vowels and the last vowels of two lines are different ("a" in the first and "i" in the second).

How many beautiful lyrics can you write from given words? Note that you cannot use a word more times than it is given to you. For example, if a word is given three times, you can use it at most three times.

思路:

模拟,记录元音个数和最后一个元音,根据个数,和最后一个元音排序。将元音个数相等最后一个元音不等的放到一个对里,将个数相等最后一个元音也相等的放到另一个对里。

挨个输出。当元音相等的较多时,补充一下即可。

因为vector的size是无符号整数,不能直接相减,因为这个wa2多次。。

代码:

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;
int n, m, k, t; struct Word
{
string word;
int num;
char last;
bool operator < (const Word& that) const
{
if (this->num != that.num)
return this->num < that.num;
return this->last < that.last;
}
}words[MAXN]; int main()
{
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (int i = 1;i <= n;i++)
{
cin >> words[i].word;
for (auto c:words[i].word)
{
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')
{
words[i].num++;
words[i].last = c;
}
}
}
sort(words+1, words+1+n);
vector<pair<int, int> > fi, se;
int pos = 1;
int w = -1, cnt = 1;
while(pos <= n)
{
if (words[pos].num == words[pos+1].num && words[pos].last == words[pos+1].last)
{
se.emplace_back(make_pair(pos, pos+1));
pos += 2;
}
else if (words[pos].num != cnt)
{
w = pos;
cnt = words[pos].num;
pos++;
}
else if (w == -1)
{
w = pos;
pos++;
}
else
{
fi.emplace_back(make_pair(w, pos));
w = -1;
pos++;
}
}
int s1 = fi.size(), s2 = se.size();
int res = 0;
res += min(s1, s2) + max(0, (s2-s1)/2);
cout << res << endl;
int i;
for (i = 0;i < min(fi.size(), se.size());i++)
{
cout << words[fi[i].first].word << ' ' << words[se[i].first].word << endl;
cout << words[fi[i].second].word << ' ' << words[se[i].second].word << endl;
}
for (;i+1 < se.size();i+=2)
{
cout << words[se[i].first].word << ' ' << words[se[i+1].first].word << endl;
cout << words[se[i].second].word << ' ' << words[se[i+1].second].word << endl;
} return 0;
}

Codeforces Round #566 (Div. 2) C. Beautiful Lyrics的更多相关文章

  1. Codeforces Round #566 (Div. 2)

    Codeforces Round #566 (Div. 2) A Filling Shapes 给定一个 \(3\times n\) 的网格,问使用 这样的占三个格子图形填充满整个网格的方案数 如果 ...

  2. Codeforces Round #566 (Div. 2)题解

    时间\(9.05\)好评 A Filling Shapes 宽度为\(3\),不能横向填 考虑纵向填,长度为\(2\)为一块,填法有两种 如果长度为奇数则显然无解,否则\(2^{n/2}\) B Pl ...

  3. Codeforces Round #181 (Div. 2) C. Beautiful Numbers 排列组合 暴力

    C. Beautiful Numbers 题目连接: http://www.codeforces.com/contest/300/problem/C Description Vitaly is a v ...

  4. Codeforces Round #345 (Div. 2) B. Beautiful Paintings 暴力

    B. Beautiful Paintings 题目连接: http://www.codeforces.com/contest/651/problem/B Description There are n ...

  5. Codeforces Round #604 (Div. 2) E. Beautiful Mirrors

    链接: https://codeforces.com/contest/1265/problem/E 题意: Creatnx has n mirrors, numbered from 1 to n. E ...

  6. Codeforces Round #604 (Div. 2) D. Beautiful Sequence(构造)

    链接: https://codeforces.com/contest/1265/problem/D 题意: An integer sequence is called beautiful if the ...

  7. Codeforces Round #604 (Div. 2) C. Beautiful Regional Contest

    链接: https://codeforces.com/contest/1265/problem/C 题意: So the Beautiful Regional Contest (BeRC) has c ...

  8. Codeforces Round #604 (Div. 2) B. Beautiful Numbers

    链接: https://codeforces.com/contest/1265/problem/B 题意: You are given a permutation p=[p1,p2,-,pn] of ...

  9. Codeforces Round #604 (Div. 2) A. Beautiful String

    链接: https://codeforces.com/contest/1265/problem/A 题意: A string is called beautiful if no two consecu ...

随机推荐

  1. 简洁多用途SuperSlide插件—tab标签样式

    简洁多用途SuperSlide插件—tab标签切换代码样式,由huiyi8素材网提供. 源码:http://www.huiyi8.com/tab/

  2. 高并发压力下导致数据库bug

    环境信息:  linux 6.1 + oracle11.2.0.3 RAC     问题现象: 学校晚上6点选课,人数大概有3000,7点时,数据库报错如下(数据库到6点多还是可以连接的),数据库hu ...

  3. YYYY-mm-dd HH:MM:SS 备忘录

    d 月中的某一天.一位数的日期没有前导零. dd 月中的某一天.一位数的日期有一个前导零. ddd 周中某天的缩写名称,在 AbbreviatedDayNames 中定义. dddd 周中某天的完整名 ...

  4. 【Codeforces】Gym 101156G Non-Attacking Queens 打表

    题意 求$n\times n$的棋盘上放$3$个皇后使得互相不攻击的方案数 拓展是$m\times n$棋盘上放$k$皇后,暴力打表找到了公式 OEIS 代码 import java.math.Big ...

  5. bzoj2309 CTSC2011 字符串重排

    题意: 给定n个字符串S1,S2,S3,...,Sn,把它们排序 设排序结果为Sp1,Sp2,Sp3,...,Spn 现在给定q个任务,每个任务的格式都是"要求在排序结果中Sa恰好在Sb前一 ...

  6. SPOJ CIRU SPOJ VCIRCLE 圆的面积并问题

    SPOJ VCIRCLE SPOJ CIRU 两道题都是给出若干圆 就面积并,数据规模和精度要求不同. 求圆面积并有两种常见的方法,一种是Simpson积分,另一种是几何法. 在这里给出几何方法. P ...

  7. poj3067Japan——树状数组查找逆序对

    题目:http://poj.org/problem?id=3067 利用树状数组查找逆序对. 代码如下: #include<iostream> #include<cstdio> ...

  8. Ubuntu下mysql修改连接超时wait_timeout

    命令行登入mysql show variables like '%timeout%':(其中有用的是: interactive_timeout  和wait_timeout  为28800,默认为8小 ...

  9. 【win10激活问题】 从【win10专业工作站版】转为 数字许可证的【win10专业版】

    今天安装了 win10 1903 (10.0.18362 暂缺 Build 18362) 安装时 选的 是[win10 专业工作站版] 却无法激活, (因为当初是从win7升级上win10的,只有关联 ...

  10. bzoj4763

    $分块$ $一个很有趣的技巧$ $在树上选sqrt(n)个关键点,每两个关键点之间的距离<=sqrt(n),每个关键点属于一条链$ $预处理出每两个关键点的bitset$ $每次询问就暴力向上爬 ...