1.奶酪
算法思路:分别算出每两点之间的距离,标记可以连通的球;再分别求出与底面和顶面相连的球;然后分别从底面向上找球和从顶面向下找,直到二者相遇 ~~~~~~代码胡乱瞎写这玩意儿时间必超
估分:10–20左右;
实际得分:40;
其他思路:改用并查集,将相通的球并在一起,最后判断底面和顶面是否在一个集合
40分的代码:
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int T,n,h,r,x[N],y[N],z[N],head[N],tail[N];
int bj[N][N],l[N][N],v1[N],v11[N],v21[N],v2[N],flag;
void find1(int x,int y){
int f=x;
for(int i2=1;i2<=y;i2++)
if(bj[f][i2]==1||bj[i2][f]==1){
if(v21[i2]==1){cout<<"Yes"<<endl;flag=1;return ;}
if(v1[i2]!=1){v1[i2]=1;v11[i2]=1;find1(i2,y);v1[i2]=0;}
}
}
void find2(int x,int y){
int f=x;
for(int i2=1;i2<=y;i2++)
if(bj[f][i2]==1||bj[i2][f]==1){
if(v11[i2]==1){cout<<"Yes"<<endl;flag=1;return ;}
if(v2[i2]!=1){v2[i2]=1;v21[i2]=1;find2(i2,y);v2[i2]=0;}
}
}
int main(){
cin>>T;
for(int i=1;i<=T;i++){
memset(bj,0,sizeof(bj));memset(l,0,sizeof(l));
memset(v1,0,sizeof(v1));memset(v2,0,sizeof(v2));
flag=0;
cin>>n>>h>>r;
for(int j=1;j<=n;j++)cin>>x[j]>>y[j]>>z[j];
for(int j2=1;j2<n;j2++)
for(int k=j2+1;k<=n;k++){
int a=pow(x[j2]-x[k],2),b=pow(y[j2]-y[k],2),c=pow(z[j2]-z[k],2);
l[j2][k]=sqrt(a+b+c);
if(l[j2][k]<=2*r)bj[j2][k]=1;
}
int t1=0,t2=0;
for(int i2=1;i2<=n;i2++){
if(z[i2]-0<=r)head[++t1]=i2;
if(h-z[i2]<=r)tail[++t2]=i2;
if(z[i2]-0<=r&&h-z[i2]<=r){cout<<"Yes"<<endl;flag=1;break;}
}
if(flag==1)continue;
int w1=1,w2=1,h1=t1,h2=t2,f1=0,f2=0;
while(h1!=0&&h2!=0){
find1(head[++f1],n);h1--;
if(flag==1)continue;
find2(head[++f2],n);h2--;
if(flag==1)continue;
}
if(flag==0)cout<<"No"<<endl;
}
return 0;
}
并查集代码:
#include<bits/stdc++.h>
using namespace std;
const int N=10005;
long long T,n,h,r,x[N],y[N],z[N],fa[N],rk[N];
void make_set(int q){
fa[q]=q;
rk[q]=0;
}
int find(int p){
if(p!=fa[p])fa[p]=find(fa[p]);
return fa[p];
}
void uni(int x,int y){
x=find(x);y=find(y);
if(x!=y)
if(rk[x]>rk[y])
fa[y]=x;
else{
fa[x]=y;
if(rk[x]==rk[y])
rk[y]++;
}
}
int main(){
cin>>T;
for(int i=1;i<=T;i++){
cin>>n>>h>>r;
for(int k=0;k<=n+1;k++)make_set(k);
for(int j=1;j<=n;j++){
cin>>x[j]>>y[j]>>z[j];
if(z[j]<=r)uni(0,j);
if(z[j]+r>=h)uni(j,n+1);
}
for(int i2=1;i2<n;i2++){
for(int j2=i2+1;j2<=n;j2++){
long long a=pow(x[i2]-x[j2],2),b=pow(y[i2]-y[j2],2),c=pow(z[i2]-z[j2],2);
long long l=a+b+c;
if(l<=pow(2*r,2)&&l!=0)uni(i2,j2);
}
}
if(find(0)==find(n+1))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
2.时间复杂度
还没做输入实在搞不出来
思路:也许可以用栈?
实得分数:0
正解(洛谷):
#include <bits/stdc++.h>
using namespace std;
int n, top;
char line[105], stk[105];
bool noin[105], nc[105], err;
int inc, res, nd;
int main() {
int t;
scanf("%d", &t);
while(t--) {
scanf("%d%s", &n, line);
if(line[2] == '1') inc = 0;
else sscanf(line, "O(n^%d)", &inc);
res = nd = top = 0;
err = 0;
while(n--) {
scanf("\n%[^\n]", line);
if(err) continue;
if(*line == 'E') {
if(!top) err = 1;
if(nc[top--]) nd--;
} else {
int len = strlen(line);
top++;
for(int i = 1;i < top;i++)
if(stk[i] == line[2]) err = 1;
noin[top] = noin[top - 1]
|| (line[4] == 'n' && line[len - 1] != 'n');
if(line[len - 1] != 'n' && line[4] != 'n') {
int a, b;
sscanf(line, "%*s%*s%d%d", &a, &b);
if(a > b) noin[top] = 1;
}
if(line[len - 1] == 'n' && line[4] != 'n')
nc[top] = 1, nd++;
else nc[top] = 0;
stk[top] = line[2];
if(!noin[top] && res < nd) res = nd;
}
}
if(top) err = 1;
if(err) puts("ERR");
else puts(res == inc ? "Yes" : "No");
}
return 0;
}
3.换教室
也没做一见dp就头疼
思路:dp
估分:0
实际得分:0
正解代码(洛谷):
#include<cstdio>
#include<iostream>
using namespace std;
const int INF=800000000;
int n,m,v,e;
int c[2005],d[2005],dis[305][305];
double k[2005],f[2005][2005][2];
void Read()
{
scanf("%d%d%d%d",&n,&m,&v,&e);
for (int i=1;i<=n;i++)
scanf("%d",&c[i]);
for (int i=1;i<=n;i++)
scanf("%d",&d[i]);
for (int i=1;i<=n;i++)
scanf("%lf",&k[i]);
for (int i=1;i<=v;i++)
for (int j=1;j<i;j++)
dis[j][i]=dis[i][j]=INF;
for (int i=1;i<=e;i++)
{
int a,b,w;
scanf("%d%d%d",&a,&b,&w);
dis[a][b]=min(dis[a][b],w);
dis[b][a]=dis[a][b];
}
}
void Floyd()
{
for (int k=1;k<=v;k++)
for (int i=1;i<=v;i++)
for (int j=1;j<i;j++)
if (dis[i][j]>dis[i][k]+dis[k][j])
dis[j][i]=dis[i][j]=dis[i][k]+dis[k][j];
}
void DP()
{
for (int i=1;i<=n;i++)
for (int j=0;j<=m;j++)
{
f[i][j][0]=f[i][j][1]=INF;
}
f[1][0][0]=0;
f[1][1][1]=0;
for (int i=2;i<=n;i++)
for (int j=0;j<=m;j++)
{
f[i][j][0]= min(f[i-1][j][1]+ k[i-1]*dis[d[i-1]][c[i]]+ (1-k[i-1])*dis[c[i-1]][c[i]],
f[i-1][j][0] +dis[c[i-1]][c[i]]);
if (j!=0)
f[i][j][1]=min(f[i-1][j-1][1]+k[i-1]*k[i]*dis[d[i-1]][d[i]]+k[i-1]*(1-k[i])*dis[d[i-1]][c[i]]+(1-k[i-1])*k[i]*dis[c[i-1]][d[i]]+(1-k[i-1])*(1-k[i])*dis[c[i-1]][c[i]],
f[i-1][j-1][0]+k[i]*dis[c[i-1]][d[i]]+(1-k[i])*dis[c[i-1]][c[i]]);
}
}
void Write()
{
double ans=INF;
for (int i=0;i<=m;i++)
for (int j=0;j<=1;j++)
{
ans=min(ans,f[n][i][j]);
}
printf("%.2lf",ans);
}
int main()
{
Read();
Floyd();
DP();
Write();
return 0;
}
4.斗地主
还是不会连骗分都不配
没有找到题解诶
实得分数:0
反思:
我太菜了还得多找题练,各种算法熟练度还是不够甚至都不太码的出来