目录
A-World Final? World Cup! (I)(规律)
A-World Final? World Cup! (I)(规律)
比赛时手算了每种情况,但其实可以思考得出能得出胜利结果的必须是一人未点球的球全进加目前的分数小于对手当前已有分数,则计算每一轮次一人后面全进(最佳结果)零另一人后面全不进(最坏结果) 能赢或能输得出结果
#include<bits/stdc++.h>
using namespace std;
int t,cnt,a,b;
string s;
bool solve(int a, int b) {
if (abs(a - b) == 1) {
if (cnt == 10 && a > b)return 1;
else if ((cnt == 9 || cnt > 9) && a < b)return 1;
}
else if (abs(a - b) == 2) {
if ((cnt == 8 || cnt > 8) && a > b)return 1;
else if ((cnt == 7 || cnt > 7) && a < b)return 1;
}
else if (abs(a - b) == 3) {
if ((cnt == 6 || cnt > 6) && a > b)return 1;
else if ((cnt == 5 || cnt > 5) && a < b)return 1;
}
else if (abs(a - b) == 4) {
if ((cnt == 4 || cnt > 4) && a > b)return 1;
else if ((cnt == 3 || cnt > 3) && a < b)return 1;
}
return 0;
}
int main() {
scanf("%d", &t);
while (t--) {
cin >> s;
a = b = 0; cnt = 0; int f = 0;
for (int i = 0; i < 10; i++) {
cnt++;
if (s[i] == '1')
if (i % 2 == 0)a++;
else b++;
//printf("a:%d b%d cnt:%d\n", a, b, cnt);
if (solve(a, b)) {
f = 1;
printf("%d\n", cnt);
break;
}
}if (!f)printf("-1\n");
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int t,cnt,a,b;
int a1, a2, b1, b2;
string s;
int main() {
scanf("%d", &t);
while (t--) {
cin >> s;
a = b = 0; cnt = 0; int f = 0;
for (int i = 0; i < 10; i++) {
cnt++;
if (s[i] == '1')
if (i % 2 == 0) a++;
else b++;
a1 = (10 - cnt) / 2 + a;
a2= a;
b1 = (11 - cnt) / 2 + b;
b2 = b;
//printf("a:%d b:%d cnt:%d\n", a, b, cnt);
//printf("a1:%d a2:%d b1:%d b2:%d\n", a1, a2, b1, b2);
if ((a1-b2)*(b1-a2)<0) {
f = 1;
printf("%d\n", cnt);
break;
}
}if (!f)printf("-1\n");
}
return 0;
}
C-现在是,学术时间 (I)(规律)
一个教授只有一篇文章,,判断每个教授的文章影响是否为0即可
#include<bits/stdc++.h>
using namespace std;
int t, n;
int x;
int main() {
scanf("%d", &t);
while (t--) {
int ans = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &x);
if (x)ans++;
}printf("%d\n", ans);
}
return 0;
}
D-现在是,学术时间 (II)(数学)
数学题,在GT内,GT右,GT上,GT右上四种情况分别讨论
#include<bits/stdc++.h>
using namespace std;
int t;
int x, y, xp, yp;
double s1, s2;
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d%d%d%d", &x, &y, &xp, &yp);
if ((xp <= x) && (yp <= y)) {//GT内
s1 = max(xp, x - xp) * max(yp, y - yp);
printf("%lf\n", s1 / (x * y));
}
else if (yp <= y) {//右下
double h = 1.0 * max(y - yp, yp);
s1 = 1.0 * x * h;
s2 = 1.0 * x * y - s1 + 1.0 * xp * h;
printf("%lf\n", s1 / s2);
}
else if (xp <= x) {//左上
double h = 1.0 * max(x - xp, xp);
s1 = 1.0 * y * h;
s2 = 1.0 * y * x - s1 + 1.0 * yp * h;
printf("%lf\n", s1 / s2);
}
else {//右上
double ans =1.0 * x * y / (xp * yp);
printf("%lf\n", ans);
}
}
return 0;
}
H-本题主要考察了DFS
(规律)
检查每张拼图凹凸记录即可
#include<bits/stdc++.h>
using namespace std;
int t, n;
string x;
int main() {
scanf("%d", &t);
while (t--) {
int cnt = 0;
scanf("%d", &n);
n = n * n - 1;
while (n--) {
//printf("%d\n", n);
cin >> x;
for (int i = 0; i < 4; i++) {
if (x[i] == '1')cnt++;
else if (x[i] == '2')cnt--;
}
}
printf("%d\n", 10+cnt);
}
return 0;
}
K-本题主要考察了dp(贪心)
找坏区间总数最少的字符串中有几个坏区间
100100100…排列时坏区间011,101,110,111最少,m > n/3时,在后面依次向前补1,所得字符串即为坏区间总数最少的字符串
kmp字符串匹配找出有多少个坏区间
赛后发现无需使用kmp判断,只要遍历一遍s字符串即可
#include<bits/stdc++.h>
using namespace std;
int n, m;
char s[1005];
int ln, lm, t;
int nxt[200005];
char p[5];
int kmp() {
memset(nxt, 0, sizeof(nxt));
ln = strlen(s + 1);
lm = strlen(p + 1);
p[lm + 1] = '#';
for (int i = lm + 2, j = 1; j <= ln; i++, j++)
p[i] = s[j];
int j = 0;
nxt[1] = 0;
for (int i = 2; i <= ln + lm + 1; i++) {
while (j > 0 && p[j + 1] != p[i])//当j=0时,无法再向前更新
j = nxt[j];
if (p[j + 1] == p[i])//当找不到对应相等的字符时j=0
j++;
nxt[i] = j;
}
int ans = 0;
for (int i = lm + 2; i <= ln + lm + 1; i++)
if (nxt[i] == lm)++ans;
return ans;
}
int main() {
scanf("%d%d", &n,&m);
int x = n / 3 + n % 3;
int cnt = 0;
for (int i = 1; i <= n; i += 3) {//100初始化
cnt++;
s[i] = '1', s[i + 1] = '0', s[i + 2] = '0';
}s[n + 1] = '\0';
if (m < cnt || m == cnt)printf("0");
else {
cnt = m - cnt;
for (int i = n; cnt; i--) {//补充1
if (s[i] == '0') {
s[i] = '1', cnt--;
}
}//cout << s + 1;
int sum = 0;
strcpy(p + 1, "111");
sum+=kmp();
strcpy(p + 1, "011");
sum+=kmp();
strcpy(p + 1, "101");
sum+=kmp();
strcpy(p + 1, "110");
sum+=kmp();
printf("%d", sum);
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int n, m;
char s[1005];
int main() {
scanf("%d%d", &n,&m);
int x = n / 3 + n % 3;
int cnt = 0;
for (int i = 1; i <= n; i += 3) {//100初始化
cnt++;
s[i] = '1', s[i + 1] = '0', s[i + 2] = '0';
}s[n + 1] = '\0';
if (m < cnt || m == cnt)printf("0");
else {
cnt = m - cnt;
for (int i = n; cnt; i--) {//补充1
if (s[i] == '0') {
s[i] = '1', cnt--;
}
}//cout << s + 1;
int sum = 0;
for (int i = 2; i < n; i++) {
if (s[i - 1] + s[i] + s[i + 1] >= '0' + '1' + '1')
sum++;
}
printf("%d", sum);
}
return 0;
}
L-本题主要考察了运气(期望)
因为每个团、每个人直接彼此没区别,所以最佳策略就是依次猜, 先猜出团,在猜出团里的人
猜团:5个团,第1次猜中概率是0.2,第二次是0.2,第三次是 0.2,第四次是0.4
猜人:4个人,第一次是0.25,第二次是0.25,第三次是0.5;
最终答案:32(5.05)
M-本题主要考察了找规律(dp)
dp[ i ][ j ]:已经给i个人分了物品,分出去了共j个的最大提升好感度之和。
状态转移方程:𝑑𝑝[ 𝑖 ][ 𝑗 ] = max 𝑘≤𝑗 ( (𝑑𝑝[ 𝑖 − 1 ][ 𝑗 − 𝑘 ] + 𝑘 / (𝑚−(𝑗−𝑘)) )
#include<bits/stdc++.h>
using namespace std;
int n, m, ans;
double dp[505][505];
double max_(double x, double y) {
if (x > y)return x;
return y;
}
int main() {
scanf("%d%d", &n, &m);
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
for (int k = 0; k <= j; k++) {
dp[i][j] = max_(dp[i][j],dp[i - 1][j - k] + 1.0 * k / (m - (j - k)));
}
}
}
printf("%lf", dp[n][m]);
return 0;
}