快乐测试点
文章目录
1.奶酪(洛谷P3958)(cheese)
算法:宽搜
可能的算法:并查集
我的代码
#include<bits/stdc++.h>
using namespace std;
long long T,n,h,r,d;
long long x[1005],y[1005],z[1005];
bool a[1005],ok;
long long ab(long long x){
return x>0?x:-x;
}
long long po(long long x){
return x*x;
}
int main(){
cin>>T;
while (T--){
cin>>n>>h>>r;
d=r*2;
for (int i=1;i<=n;i++){
cin>>x[i]>>y[i]>>z[i];
}
queue <int> q;
for (int i=1;i<=n;i++){
if (z[i]+r>=0&&z[i]-r<=0) {
a[i]=1;
q.push(i);
}
}
long long dis,x2,y2,z2;
while (!q.empty()){
int k=q.front();q.pop();
if (r+z[k]>=h) {
ok=1;break;
}
for (int i=1;i<=n;++i){
if (a[i]) continue;
x2=ab(x[k]-x[i]);
if (x2>d) continue;
y2=ab(y[k]-y[i]);
if (y2>d) continue;
z2=ab(z[k]-z[i]);
if (z2>d) continue;
dis=po(x2)+po(y2)+po(z2);
if (dis<=po(d)) {
a[i]=1;
q.push(i);
}
}
}
if (ok) printf("Yes\n"),ok=0;
else printf("No\n");
for (int i=1;i<=n;++i) a[i]=0;
}
return 0;
}
估分:80以上
实际:100
这题要long long
宽搜
#include <bits/stdc++.h>
using namespace std;
#define maxn 1003
#define ll long long
int n;
ll h,r;
int head[maxn*maxn*2];
struct Edge{
int nt,to;
}edges[maxn*maxn*2];
ll x[maxn],y[maxn],z[maxn];
inline int check(int i,int j)
{
ll xx=(ll)abs(x[i]-x[j])*abs(x[i]-x[j]);
ll yy=(ll)abs(y[i]-y[j])*abs(y[i]-y[j]);
ll zz=(ll)abs(z[i]-z[j])*abs(z[i]-z[j]);
ll rr=(ll)4*r*r;
if ((ll)xx+yy+zz<=rr) return 1;
return 0;
}
int s=0,t=1002;
int b_cnt=0;
inline void addedge(int x,int y)
{
edges[++b_cnt].nt=head[x];
edges[b_cnt].to=y;
head[x]=b_cnt;
}
int vis[maxn];
int main()
{
//freopen("cheese.in","r",stdin);
//freopen("cheese.out","w",stdout);
int T;
scanf("%d",&T);
while (T--)
{
b_cnt=0;
scanf("%d",&n);
scanf("%lld%lld",&h,&r);
for (int i=1;i<=n;i++)
{
scanf("%lld%lld%lld",&x[i],&y[i],&z[i]);
if (z[i]<=r){ addedge(s,i);}
if (z[i]+r>=h) {
addedge(i,t);
}
}
for (int i=1;i<=n;i++)
for (int j=i+1;j<=n;j++)
{
if (check(i,j)) {
addedge(i,j);
addedge(j,i);
}
}
vis[s]=1;
vis[t]=0;
queue<int> Q;
Q.push(s);
while (!Q.empty())
{
int u=Q.front();
Q.pop();
//vis[u]=1;
for (int i=head[u];i;i=edges[i].nt)
{
int v=edges[i].to;
if (!vis[v])
{
vis[v]=1;
Q.push(v);
}
}
}
if (!vis[t]) printf("No\n");
else printf("Yes\n");
for (int i=0;i<=b_cnt+1;i++) {
head[i]=0,edges[i].to=0,edges[i].nt=0;
}
for (int i=0;i<=n;i++) vis[i]=0;
}
return 0;
}
2.时间复杂度(洛谷P3952)(complexity)
超短的代码(46行)
#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;
}
我的代码太逊了,不放了
算法:模拟
可能的算法:无
估分:30~50
实际:27
3.换教室(洛谷P1850)(classroom)
没写
可能的算法:dp
4.斗地主(洛谷P2668)(landlords)
某大佬的代码
#include<iostream>
#include<cstdio>
#define qwq register
using namespace std;
double p[10001],f[2001][2001],dp[2001][2001][2];
int a[2001][2001],c[20001],d[20001];
inline double min(double a,double b){
return a<b?a:b;
}
inline int qread(){
int k = 0;
char c;
c = getchar();
while(!isdigit(c))c = getchar();
while(isdigit(c)){
k = (k<<1)+(k<<3)+c-48;
c = getchar();
}
return k ;
}
int main()
{
int n,m,v,e,a1,b1,c1;
cin>>n>>m>>v>>e;
for(qwq int i=1;i<=n;i++)c[i]=qread();
for(qwq int i=1;i<=n;i++)d[i]=qread();
for(qwq int i=1;i<=n;i++)cin>>p[i];
for(qwq int i=1;i<=v;i++)
for(qwq int j=1;j<i;j++)
f[i][j]=f[j][i]=999999999;
for(qwq int i=1;i<=e;i++){
a1=qread(),b1=qread(),c1=qread();
f[a1][b1]=f[b1][a1]=min(f[a1][b1],c1);
}
for(qwq int k=1;k<=v;k++)
for(qwq int i=1;i<=v;i++)
for(qwq int j=1;j<i;j++)
if(f[i][k]+f[k][j]<f[i][j])
f[i][j]=f[j][i]=f[i][k]+f[k][j];
for(qwq int i=1;i<=n;i++)
for(qwq int j=0;j<=m;j++)
dp[i][j][0]=dp[i][j][1]=999999999;
dp[1][0][0]=dp[1][1][1]=0;
for(qwq int i=2;i<=n;i++){
double add1=f[c[i-1]][c[i]];
for(qwq int j=0;j<=min(m,i);j++)
{
dp[i][j][0]=min(dp[i-1][j][0]+add1,dp[i-1][j][1]+f[d[i-1]][c[i]]*p[i-1]+f[c[i-1]][c[i]]*(1-p[i-1]));
if(j!=0)
dp[i][j][1]=min(dp[i-1][j-1][0]+f[c[i-1]][d[i]]*p[i]+f[c[i-1]][c[i]]*(1-p[i]),dp[i-1][j-1][1]+f[c[i-1]][c[i]]*(1-p[i-1])*(1-p[i])+f[c[i-1]][d[i]]*(1-p[i-1])*p[i]+f[d[i-1]][c[i]]*(1-p[i])*p[i-1]+f[d[i-1]][d[i]]*p[i-1]*p[i]);
}
}
double hahaha=9999999999;
for(int i=0;i<=m;i++){
hahaha=min(dp[n][i][0],min(dp[n][i][1],hahaha));}
printf("%.2lf",hahaha);
}
估分:(4以内)30分不到
实际:0(枯了)
这次集训逊惹
**我要学暴力,暴力万岁。 **(精神错乱)