順位表 - 第四回日本最強プログラマー学生選手権-予選-(AtCoder Beginner Contest 313)
赛时没开出G,先写个E吧
A - To Be Saikyo
题意:
给出一个长度为n的序列A,求让a1加上最少多少之后a1>ai(1<i<=n)
题解:
#define _CRT_SECURE_NO_WARNINGS
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const LL N = 1e5 + 10, MOD = 998244353, INF = 0x3f3f3f3f;
int a[N];
void solve()
{
int n, mx = 0;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
{
scanf("%d", &a[i]);
if (i > 1)mx = max(mx, a[i]);
}
if (mx >= a[1])
printf("%d\n", mx - a[1] + 1);
else
printf("0\n");
}
int main()
{
int T = 1;
//scanf("%d", &T);
while (T--)
{
solve();
}
return 0;
}
B - Who is Saikyo?
题意:
给出n人和m个强弱关系ai,bi(ai强于bi),当人x强于人y并且人y强于人z时我们认为人x强于人z。问是否存在且仅存在一个最强者(比所有人都强)
题解:
当人x不弱于任何人那说明他可能是一个最强者,当这样的情况只存在一个时说明存在最强者,且最强者就是不弱于任何人的那个人。(相当于建b向a的单项边,如果只有一个出度为0的点那那个点就是最強のプログラマー)
#define _CRT_SECURE_NO_WARNINGS
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const LL N = 5e1 + 10, MOD = 998244353, INF = 0x3f3f3f3f;
int chu[N];
void solve()
{
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i)
{
int a, b;
scanf("%d%d", &a, &b);
chu[b]++;
}
vector<int>ans;
for (int i = 1; i <= n; ++i)
{
if (chu[i] == 0)ans.push_back(i);
}
if (ans.size() == 1)
printf("%d\n", ans[0]);
else
printf("-1\n");
}
int main()
{
int T = 1;
//scanf("%d", &T);
while (T--)
{
solve();
}
return 0;
}
C - Approximate Equalization 2
题意:
给出一个长度为n的整数序列a。你可以进行以下一种操作:选择一对i,j,将ai加一,并将aj减一。问使得序列中最大值与最小值差值在1以内的最少操作次数
题解:
若序列的平均值为整数,那序列经过操作后最终一定都为平均数,否则都为平均值向下取整和平均值向上取整。最少的操作步数相当于将小于平均值的加到平均值向下取整,将大于平均值的减到平均值向上取整(或者sort之后前半部分算到平均值向下取整的距离后半部分到平均值向下取整的距离)
#define _CRT_SECURE_NO_WARNINGS
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const LL N = 2e5 + 10, MOD = 998244353, INF = 0x3f3f3f3f;
int a[N];
void solve()
{
int n;
scanf("%d", &n);
LL s = 0;
for (int i = 1; i <= n; ++i)
{
scanf("%d", &a[i]);
s += a[i];
}
sort(a + 1, a + 1 + n);
LL t = s / n, c = s - s / n * n, ans = 0;
for (int i = 1; i <= n - c; ++i)
ans += abs(t - a[i]);
for (int i = n - c + 1; i <= n; ++i)
ans += abs(t + 1 - a[i]);
printf("%lld\n", ans / 2);
}
int main()
{
int T = 1;
//scanf("%d", &T);
while (T--)
{
solve();
}
return 0;
}
D - Odd or Even
题意:
交互题。给出一个n和一个奇数k(1<=k<n<=1000),有一个隐藏的长度为n的由01组成的数组。你能进行最多n次询问:先输出一个"?"然后输出k个下标,系统将给你返回这些数相加之后的奇偶性。询问完之后先输出一个"!"然后依次输出隐藏的数组的每一个数。
题解:
先对前k+1个数中每种缺少一个数的情况进行一次询问并记缺少一个i的询问为ai,记它们的和为s1,易知,k是奇数,所以s1与的奇偶性相同。当ai的奇偶性与s相同说明第i为为0,若不同说明第i为是1,由此可以求出前k+1位的值。对于之后剩下的只需要选取前k-1位与第i位就能得出第i位的值(因为前k-1位的值已经知道了)。
#define _CRT_SECURE_NO_WARNINGS
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const LL N = 1e3 + 10, MOD = 998244353, INF = 0x3f3f3f3f;
int a[N];
void solve()
{
int n, k;
cin >> n >> k;
for (int i = 1; i <= k + 1; ++i)
{
cout << "?";
for (int j = 1; j <= k + 1; ++j)if (i != j)
cout << " " << j;
cout << endl;
cin >> a[i];
}
int s = 0;
for (int i = 1; i <= k + 1; ++i)
s += a[i];
s %= 2;
for (int i = 1; i <= k + 1; ++i)
{
if (a[i] == s)
a[i] = 0;
else
a[i] = 1;
}
s = 0;
for (int i = 1; i < k; ++i)
s += a[i];
s %= 2;
for (int i = k + 2; i <= n; ++i)
{
cout << "?";
for (int j = 1; j < k; ++j)
cout << " " << j;
cout << " " << i << endl;
cin >> a[i];
if (a[i] == s)
a[i] = 0;
else
a[i] = 1;
}
cout << "!";
for (int i = 1; i <= n; ++i)
cout << " " << a[i];
cout << endl;
}
int main()
{
int T = 1;
//scanf("%d", &T);
while (T--)
{
solve();
}
return 0;
}
E - Duplicate
题意:
给出一个由数字组成的字符串s,定义一种操作f(s):定义一个新的字符串T,刚开始T为空串;对字符串S的第i=1,2,3...|S|-1位进行以下操作 在T的末尾加入Si+1个Si。问在进行多少次s=f(s)操作后字符串s仅剩一个字符(MOD 998244353)。若无法做到仅剩一位输出-1。
题解:
当字符串中存在连续两个数大于1的情况时输出-1。
对于每一位,当已操作步数为step的情况下再次操作删除最后一位时,最后一位将会额外产出(step+1)*ai个前一位,从后往前for一遍即可
#define _CRT_SECURE_NO_WARNINGS
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const LL N = 1e6 + 10, MOD = 998244353, INF = 0x3f3f3f3f;
char ch[N];
void solve()
{
int n;
scanf("%d%s", &n, ch + 1);
for (int i = 1; i < n; ++i)
{
if (ch[i] > '1' && ch[i + 1] > '1')
{
printf("-1\n");
return;
}
}
LL ans = 0;
for (int i = n; i > 1; --i)
{
//这一位会额外产出(step+1)*ai-1个1
ans = (ans + 1) * (ch[i] - '0')% MOD;
}
printf("%lld\n", ans);
}
int main()
{
int T = 1;
//scanf("%d", &T);
while (T--)
{
solve();
}
return 0;
}