这场诈骗题居多,属实是玩心计了(
A题:
做法:每次踢完判断最坏情况下能不能提前结束,否则最后输出-1,代码如下:
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
void solve()
{
string s;
cin >> s;
int n = s.size();
s = " " + s;
int a = 0, b = 0, ans = -1;
for (int i = 1; i <= n; i++)
{
if (i & 1)
{
a += s[i] - '0';
if (a - b > (n - i + 1) / 2)
{
ans = i;
break;
}
if (b - a > (n - i) / 2)
{
ans = i;
break;
}
}
else
{
b += s[i] - '0';
if (a - b > (n - i) / 2)
{
ans = i;
break;
}
if (b - a > (n - i) / 2)
{
ans = i;
break;
}
}
}
cout << ans << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
C题:
做法:仔细想一下就可以选择每人发一篇论文就可以最大化,也是个诈骗题
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
int a[N];
void solve()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
int ans = 0;
for (int i = 1; i <= n; i++)
{
if (a[i] == 0)
continue;
else
ans++;
}
cout << ans << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
H题:
做法:同样是道诈骗题,但其实想了想,总价格是不变,然后 n 2 − 1 n^2-1 n2−1块的价格都知道,加起来用总和减一下就是少的那块的价格,代码如下:
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
void solve()
{
int n;
cin >> n;
int sum = n * n * 10;
int ans = 0;
for (int i = 1; i <= n * n - 1; i++)
{
string s;
cin >> s;
ans += 10;
for (auto c : s)
{
if (c == '1')
{
ans--;
}
if (c == '2')
{
ans++;
}
}
}
cout << sum - ans << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
L题:
做法:没想,直接抄的答案hh
print(32)
K题:
做法:首先想到贪心的做法,先100100100这样放,最后再放111111,最后统计下,证明想了下差不多对。代码如下:
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
int t = n - m;
vector<int> a;
while (m || t)
{
if (m)
a.push_back(1), m--;
if (t)
a.push_back(0), t--;
if (t)
a.push_back(0), t--;
}
int ans = 0;
for (int i = 0; i <= n - 3; i++)
{
if (a[i] + a[i + 1] + a[i + 2] >= 2)
{
ans++;
}
}
cout << ans;
return 0;
}
D题:
做法:通过做题的经验,剩下一个点肯定是在四个顶点中选,所以挨个遍历一下,算下答案,再取个max即可,代码如下:
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
void solve()
{
int x, y, a, b;
cin >> x >> y >> a >> b;
double ans = 0;
for (auto c : {0, x})
{
for (auto d : {0, y})
{
int xl = max(0, min(a, c));
int xr = min(x, max(a, c));
int yl = max(0, min(b, d));
int yr = min(y, max(b, d));
int inter = max(0, xr - xl) * max(0, yr - yl);
int uni = x * y + abs(a - c) * abs(b - d) - inter;
double res = 1. * inter / uni;
ans = max(ans, res);
}
}
cout << ans << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10) << endl;
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
M题:
做法:根据定义可以得到状态转移的方程:
d
p
[
i
]
[
j
]
=
m
a
x
k
≤
j
(
d
p
[
i
−
1
]
[
j
−
k
]
+
k
m
−
(
j
−
k
)
)
dp[i][j]=max_{k\leq j}(dp[i-1][j-k]+\frac {k}{m-(j-k)})
dp[i][j]=maxk≤j(dp[i−1][j−k]+m−(j−k)k)
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int N = 505;
int n, m;
double dp[N][N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(12) << endl;
cin >> n >> m;
dp[0][0] = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
for (int k = 1; k <= j; k++)
{
dp[i][j] = max(dp[i][j], dp[i - 1][j - k] + (double)k / (m - (j - k)));
}
}
}
cout << dp[n][m] << endl;
return 0;
}
G题:
做法:经过简单的计算,最终会趋于三个值:0,99,100,所以可以用set或者并查集来做,代码如下:
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
int a[N], p[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
ll ans = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
ans += a[i];
}
for (int i = 1; i <= n + 2; i++)
{
p[i] = i;
}
function<int(int)> find = [&](int x)
{
return p[x] == x ? x : find(p[x]);
};
for (int i = 1; i <= m; i++)
{
int ty;
cin >> ty;
if (ty == 1)
{
int l, r, k;
cin >> l >> r >> k;
int now = l;
while (now <= r)
{
bool ok = false;
for (int j = 1; j <= k; j++)
{
ll cur = round(10 * sqrt(a[now]));
if (cur == a[now])
{
ok = true;
break;
}
ans -= a[now] - cur;
a[now] = cur;
}
if (ok)
{
p[now] = find(now + 1);
}
now = (find(now) == now) ? now + 1 : p[now];
}
}
else
{
cout << ans << endl;
}
}
return 0;
}
F题:
做法:一个连通块里的任意两点的方案数都为
s
z
∗
s
z
sz*sz
sz∗sz,所以可以记第
i
i
i块连通块的大小为
s
z
i
sz_i
szi,有炸弹的连通块数量为
n
u
m
num
num,则
n
u
m
=
0
时
,
输出
∑
s
z
i
2
n
u
m
=
1
时
,
输出有炸弹连通块
j
的
s
z
2
n
u
m
=
2
时
,
无解,输出
0
num=0时,输出\sum {sz_i^2}\\ num=1时,输出有炸弹连通块j的sz^2\\ num=2时,无解,输出0
num=0时,输出∑szi2num=1时,输出有炸弹连通块j的sz2num=2时,无解,输出0
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
int n, m, c[N];
vector<int> g[N];
int vis[N], siz, boom;
void dfs(int now)
{
vis[now] = 1;
siz++;
if (c[now])
{
boom = 1;
}
for (auto to : g[now])
{
if (!vis[to])
{
dfs(to);
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 1; i <= m; i++)
{
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
for (int i = 1; i <= n; i++)
{
cin >> c[i];
}
int bomb = 0, last = -1;
vector<ll> v_siz;
for (int i = 1; i <= n; i++)
{
if (!vis[i])
{
siz = boom = 0;
dfs(i);
bomb += boom;
v_siz.push_back(siz);
if (boom)
last = ((int)v_siz.size()) - 1;
}
}
ll ans = 0;
if (bomb == 0)
{
for (auto to : v_siz)
{
ans += (to * to);
}
}
else if (bomb == 1)
{
ans = (v_siz[last] * v_siz[last]);
}
else
{
ans = 0;
}
cout << ans << endl;
return 0;
}