2021牛客暑期多校训练营4
C - LCS
solved by oye && Micky. 04:56:54(-3)
题意: 给出四个参数 a , b , c , n a,b,c,n a,b,c,n ,要求构造长度都为n的三个字符串 s 1 , s 2 , s 3 s_{1},s_{2},s_{3} s1,s2,s3 ,使得最长公共子序列的长度 L C S ( s 1 , s 2 ) = a , L C S ( s 2 , s 3 ) = b , L C S ( s 1 , s 3 ) = c LCS(s_{1},s_{2})=a,LCS(s_{2},s_{3})=b,LCS(s_{1},s_{3})=c LCS(s1,s2)=a,LCS(s2,s3)=b,LCS(s1,s3)=c 。分行输出构造的三个字符串 s 1 , s 2 , s 3 s_{1},s_{2},s_{3} s1,s2,s3 ,如果无法构造出满足条件的则输出“NO”
思路:
交换三个字符串的位置,使
L
C
S
(
s
1
,
s
2
)
=
a
,
L
C
S
(
s
2
,
s
3
)
=
b
,
L
C
S
(
s
1
,
s
3
)
=
c
LCS(s_{1},s_{2})=a,LCS(s_{2},s_{3})=b,LCS(s_{1},s_{3})=c
LCS(s1,s2)=a,LCS(s2,s3)=b,LCS(s1,s3)=c(这里的下标表示字符串的位置),满足
a
≤
b
≤
c
a\leq b\leq c
a≤b≤c(方便构造)
先给这三个串加上一个
a
a
a个‘a’的前缀,此时已经满足了
L
C
S
(
s
1
,
s
2
)
=
a
LCS(s_{1},s_{2})=a
LCS(s1,s2)=a,再给
s
1
s_1
s1和
s
2
s_2
s2的剩下部分分别填入‘z’和‘y’。然后再看
#include<iostream>
#include<string.h>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<set>
#include<algorithm>
#include<sstream>
#include<vector>
#include<ctype.h>
#include<deque>
#include<time.h>
using namespace std;
#define ll long long
const int maxn = 1e6;
int vis[3];
string ans[3];
int dp[1111][1111];
int LCS(string s1, string s2, int l1, int l2) {
for (int i = 0; i < l1; i++) {
for (int j = 0; j < l2; j++) {
if (s1[i] == s2[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
}
return dp[l1][l2];
}
int main() {
int a, b, c, n;
cin >> a >> b >> c >> n;
int s[3];
s[0] = a, s[1] = b, s[2] = c;
sort(s, s + 3);
string s1, s2, s3;
for (int i = 0; i < n; i++) {
if (i < s[0]) {
s1.push_back('a');
s2.push_back('a');
s3.push_back('a');
}
else {
s1.push_back('z');
s2.push_back('y');
}
}
for (int i = 0; i < s[1] - s[0]; i++) {
s3.push_back('y');
}
for (int i = 0; i < s[2] - s[0]; i++) {
s3.push_back('z');
}
int f = 1;
if (s3.size() > n) f = 0;
string aa, bb, cc;
if (f) {
int x = s3.size();
for (int i = 0; i < n - x; i++) {
s3.push_back('h');
}
//先固定aa字符串
if (LCS(s1, s2, s1.size(), s2.size()) == a && LCS(s1, s3, s1.size(), s3.size()) == c|| LCS(s1, s2, s1.size(), s2.size()) == c && LCS(s1, s3, s1.size(), s3.size()) == a) {
ans[0] = s1;
}
else if (LCS(s2, s1, s2.size(), s1.size()) == a && LCS(s2, s3, s2.size(), s3.size()) == c|| LCS(s2, s1, s2.size(), s1.size()) == c && LCS(s2, s3, s2.size(), s3.size()) == a) {
ans[0] = s2;
s2 = s3;
s3 = s1;
}
else if (LCS(s3, s1, s3.size(), s1.size()) == a && LCS(s2, s3, s2.size(), s3.size()) == c|| LCS(s3, s1, s3.size(), s1.size()) == c && LCS(s2, s3, s2.size(), s3.size()) == a) {
ans[0] = s3;
s3 = s2;
s2 = s1;
}
//再固定bb与cc字符串
if (LCS(ans[0], s2, ans[0].size(), s2.size()) == a && LCS(ans[0], s3, ans[0].size(), s3.size()) == c) {
ans[1] = s2;
ans[2] = s3;
}
else {
ans[1] = s3;
ans[2] = s2;
}
cout << ans[0] << endl << ans[1] << endl << ans[2] << endl;
}
else {
printf("NO");
}
}
F - Just a joke
solved by oye. 01:10:05(+)
题意: 给出有n个顶点m条边的无向图。现可进行如下操作:①删边。(只删边不删边的两个顶点) ②删没有环的子图。(也包括是孤立点)。Alice先手,最先把整个图删完的人胜利。输出胜者。
思路: 打表找规律。多画几个试试模拟一下就行。对于第一种操作, 会使得边数 -1;对于第二种操作, 会使得点数 -k, 边数 -(k-1)。任何一种操作都会使得点数+边数的和减少一个奇数, 所以答案只跟 n+m 的奇偶性有关。规律:(n+m)为偶数—>Alice,为奇数—>Bob
#include<iostream>
#include<string.h>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<set>
#include<algorithm>
#include<sstream>
#include<vector>
#include<ctype.h>
#include<deque>
#include<time.h>
using namespace std;
#define ll long long
const int maxn=1e6;
int main() {
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
scanf("%d %d",&a,&b);
}
int x=m+n;
if(x%2) printf("Alice");
else printf("Bob");
}
I - Inverse Pair
solved by oye && YukiSam. 02:30:22(-2)
题意: 给出n表示序列中元素个数,再给出一串序列,现在可以对该序列中每个元素加1或加0,使得原先序列的逆序对最多程度减少,输出现在的最小逆序对个数。
思路: 要求最小逆序对个数,则要尽量破坏原有的逆序对。
#include<iostream>
#include<string.h>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<set>
#include<algorithm>
#include<sstream>
#include<vector>
#include<ctype.h>
#include<deque>
#include<time.h>
using namespace std;
#define ll long long
const int maxn=1e6;
int a[maxn];
int all[maxn];
int temp[maxn];
map<int,int>m;
ll cut=0;
int n;
void find(int l, int r) {
if (l >= r)return;
int mid = (r + l) / 2, i, j, k;
find(l, mid);
find(mid + 1, r);
for (k = l, i = l, j = mid + 1; k <= r && i <= mid && j <= r; k++) {
if (all[i] <= all[j])temp[k] = all[i++];
else if (all[i] > all[j]) cut += mid - i + 1, temp[k] = all[j++];
}
while (i <= mid)temp[k++] = all[i++];
while (j <= r)temp[k++] = all[j++];
for (i = l; i <= r; i++)all[i] = temp[i];
}
int main() {
cin>>n;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
all[i]=a[i];
m[a[i]]=i;
}
find(1,n);
for(int i=2;i<=n;i++){
if(m[a[i]+1]){
if(m[a[i]+1]!=-1&&m[a[i]+1]<i){
m[a[i]]=-1;
a[i]++;
cut--;
}
}
}
printf("%lld",cut);
}
J - Average
solved by oye&&Micky. (after)
题意:
给两个数组a, b
构造矩阵Mij, 满足Mij = ai + bj.
在矩阵中找出一个子矩阵,子矩阵的平均值最大,平均值等于矩阵元素和除元素个数。
思路:
对于一个子矩阵范围为 i1 <= i <= i2 , j1 <= j <= j2
那么矩阵的平均值为 (ai1+…+ai2) / (i2 - i1) + (bj1+…+bj2) / (j2 - j1)
结果就是数组a, b 的连续字段的平均值的最大值。
求平均值用二分法,最大的平均值是序列中的最大值,最小的是序列中的最小值。
假设此时二分得到的平均值为mid
判断mid是否合法即判断是否存在一段连续区间满足bi-mid的和大于0。(用前缀和判断一下就好了)
/**/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
typedef long long LL;
using namespace std;
const double eps = 1e-10;
double a1[100005], sum[100005], maxx[100005], temp[100005], a2[100005], v[100005];
double check(double mid, double a[], int n, int x) {
for (int i = 1; i <= n; i++)
v[i] = v[i - 1] + a[i] - mid;
double mn = v[0];
for (int i = x; i <= n; i++) {
if (v[i] >= mn) return 1;
mn = min(mn, v[i - x + 1]);
}
return 0;
}
double maxavr(double a[], int n, int k) {
memset(v, 0, sizeof(v));
double r = 0, l = 100005;
for (int i = 1; i <= n; i++) {
l = min(l, a[i]);
r = max(r, a[i]);
}
while (r - l > eps) {
double mid = (r + l) / 2;
if (!check(mid, a, n, k)) r = mid;
else l = mid;
}
return r;
}
int main()
{
int n, m, x, y;
cin >> n >> m >> x >> y;
for (int i = 1; i <= n; i++) {
cin >> a1[i];
}
for (int i = 1; i <= m; i++) {
cin >> a2[i];
}
double res1, res2;
res1 = maxavr(a1, n, x);
res2 = maxavr(a2, m, y);
cout << fixed << setprecision(10) << res1 + res2;
return 0;
}