2017CCPC女生赛
最近组队赛有点拉跨,于是个人vp加训,写写题解。
2021.10.13
A - Automatic Judge
签到,模拟。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+7;
const int MOD = 1e9+7;
int n,m;
int main(){
int T=1;
scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
vector<pair<int,int>> ve[22];
for(int i=1,a,b,c;i<=m;i++){
char d[22];
scanf("%d %d:%d %s",&a,&b,&c,d);
int t=b*60+c;
if(d[0]=='A'&&d[1]=='C'){
ve[a-1000].push_back({
t,1});
}else {
ve[a-1000].push_back({
t,0});
}
}
int ans=0,cnt=0;
for(int i=1;i<=n;i++){
int s=0;
sort(ve[i].begin(),ve[i].end());
for(auto j:ve[i]){
if(j.second){
cnt++;
ans+=s+j.first;
break;
}else{
s+=20;
}
}
}
printf("%d %d\n",cnt,ans);
}
}
B - Building Shops
dp。先对每个pair按照位置排序, f [ i ] [ j ] f[i][j] f[i][j]为考虑前 i i i个点,上一次选在 j j j时的答案,则有 f [ i ] [ j ] = m i n ( f [ i ] [ j ] , f [ i − 1 ] [ j ] + x [ i ] − x [ j ] ) ( i ! = j ) , f [ i ] [ j ] = m i n ( f [ i ] [ j ] , f [ i − 1 ] [ j ] + c [ i ] ) ( i = = j ) f[i][j]=min(f[i][j],f[i-1][j]+x[i]-x[j])(i!=j),f[i][j]=min(f[i][j],f[i-1][j]+c[i])(i==j) f[i][j]=min(f[i][j],f[i−1][j]+x[i]−x[j])(i!=j),f[i][j]=min(f[i][j],f[i−1][j]+c[i])(i==j)。最终答案为 m a x ( { f [ n ] [ 1... n ] } ) max(\{f[n][1...n]\}) max({ f[n][1...n]})。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3000+7;
const int MOD = 1e9+7;
int n,x[N],c[N];
ll f[N][N];
pair<int,int> p[N];
ll solve(){
sort(p+1,p+1+n);
memset(f,0x3f,sizeof f);
f[1][1]=p[1].second;
for(int i=2;i<=n;i++){
for(int j=1;j<i;j++){
f[i][j]=min(f[i][j],f[i-1][j]+p[i].first-p[j].first);
f[i][i]=min(