D题
题意:
题目要求我们对于n * n的矩形每个都需要点亮,而点亮一个 i 行 j 列的格子的话,整个i行,j列都会被点亮,点亮每个点都有花费,我们需要找出能点亮所有格子的最小的花费。
思路:
我们可以推出,正常情况下,每行都必须选一个数,或者每一列都必须选一个数,而且如果都点亮之后还有负数格子,还需要都加上才是最小值。枚举两种情况然后输出最小值即可。
代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<stack>
#include<cmath>
#include<unordered_set>
#define PII pair<int, int>
#define ll long long
using namespace std;
const int N = 550;
int n;
int a[N][N];
bool st[N][N];
void solve()
{
cin >> n;
for (int i = 0; i < n; ++ i)
for (int j = 0; j < n; ++ j) cin >> a[i][j];
int mi = 0x3f3f3f3f, x, y;
ll row = 0, col = 0;
for (int i = 0; i < n; ++ i)
{
mi = 0x3f3f3f3f;
for (int j = 0; j < n; ++ j)
{
if(a[i][j] < mi)
{
x = i, y = j;
mi = a[i][j];
}
}
st[x][y] = true;
row += mi;
}
for (int i = 0; i < n; ++ i)
for (int j = 0; j < n; ++ j)
{
if(!st[i][j] && a[i][j] < 0) row += a[i][j];
cout << a[i][j] << endl;
}
memset(st, false, sizeof st);
for (int i = 0; i < n; ++ i)
{
mi = 0x3f3f3f3f;
for (int j = 0; j < n; ++ j)
{
if(a[j][i] < mi)
{
x = i, y = j;
mi = a[j][i];
}
}
st[x][y] = true;
col += mi;
}
for (int i = 0; i < n; ++ i)
for (int j = 0; j < n; ++ j) if(!st[i][j] && a[i][j] < 0) col += a[i][j];
row = min(row, col);
cout << row << endl;
}
signed main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int T;
cin >> T;
while(T--)
{
solve();
}
return 0;
}
M题
题意:
答题,最多提交两次,第一次和第二次使用时间为a[i]和b[i],第一次提交失败的概率是p,罚时计算是第i道题的罚时等于从1到i的时间的总和。求最短罚时。
思路:
每道题的期望罚时等于每个可能与概率的乘积之和,算出来每个数的期望后从小到大排序即可,然后算前缀和即可。
代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<stack>
#include<cmath>
#include<unordered_set>
#define PII pair<int, int>
#define ll long long
using namespace std;
const int N = 1e6 + 10;
int n;
int a[N] b[N];
double p[N];
double sum[N];
void solve()
{
cin >> n;
for (int i = 0; i < n; ++ i)
{
cin >> a[i] >> b[i] >> p[i];
sum[i] = (a[i] * (1 - p[i]) + (a[i] + b[i]) * p[i]);
}
sort(sum, sum + n);
double ans = 0.0;
for (int i = 0; i < n; ++ i)
{
if(i == 0) ans += sum[i];
else sum[i] += sum[i - 1], ans += sum[i];
}
printf("%.10lf\n", ans);
}
signed main()
{
// ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int T;
cin >> T;
while(T--)
{
solve();
}
return 0;
}
L题
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ull P=10007;
ull PP[5005],_=[]{
PP[0]=1;
for(int i=1;i<=5004;i++) PP[i]=PP[i-1]*P;
return 0;
}();
vector<ull> get_has(string &s){
ull h=0;
vector<ull> has;
for(char c:s){
has.push_back(h=h*P+c*3);
}
return has;
}
ull get_h(auto &v,int l,int r){
if(l==0) return v[r];
else return v[r]-v[l-1]*PP[r-l+1];
}
void sol(){
string s;cin>>s;
auto has=get_has(s);
int ans=0;
for(int i=0;i<s.size();i++){
int nl=i+1,nr=i;
for(int l=i,r=i+1;l>=0&&r<s.size();l--,r++){
if(get_h(has,l,nl-1)==get_h(has,nr+1,r)) ans++,nl=l,nr=r;
}
}
cout<<ans<<endl;
}
int main(){
int t;cin>>t;
while(t--){
sol();
}
}