2021 RoboCom 世界机器人开发者大赛-本科组（初赛）

官方思路

7-1 代码：略

7-2 代码：

#include<bits/stdc++.h>
#define x1 first
#define y1 second

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll N=100009;

ll n;
ll x,y,p,xx,yy;


map<pair<ll,ll>,vector<pair<ll,ll>> >M;
map<pair<ll,ll>,vector<pair<ll,ll>> > ::iterator it;
map<ll,map<ll,ll> >v;


bool cmp(pair<ll,ll> a,pair<ll,ll> b){
  return sqrt(a.x1*a.x1+a.y1*a.y1)-sqrt(b.x1*b.x1+b.y1*b.y1)<0;
}

int main()
{
    scanf("%lld",&n);
    for(ll i=1;i<=n;i++){
      scanf("%lld%lld%lld",&x,&y,&p);
      v[x][y]=p;
      ll k=__gcd(x,y);
      if(k<0)k=-k;
      xx=x/k,yy=y/k;
      M[make_pair(xx,yy)].push_back(make_pair(x,y));
    }
    ll ans=0,cnt=0;
    for(it=M.begin();it!=M.end();it++){
       pair<ll,ll> ss=it->x1;
       sort(M[ss].begin(),M[ss].end(),cmp);
       bool flag=0;
       ll t=0;
       for(int i=0;i<M[ss].size();i++){
          ll fi=M[ss][i].x1;
          ll se=M[ss][i].y1;
          if(v[fi][se]!=1){
            cnt++,ans+=v[fi][se];
            if(flag)cnt++,ans+=t,t=0,flag=0;
          }
          else{
            t++;
            flag=1;
          }
       }
      if(t>0)cnt++,ans+=t,t=0;
    }
    cout<<ans<<" "<<cnt<<endl;

    return 0;
}

7-4 疫情防控

思路：逆序建图

#include<bits/stdc++.h>

using namespace std;
const int N=500009;

int n,m,d;
int a[N],b[N],c[N],q[1009];
int x[1009][1009],y[1009][1009],f[N];
int ans[N];
bool vis[N];
vector<int>v[N];

int Find(int x){
  if(x!=f[x])f[x]=Find(f[x]);
  return f[x];
}

int main()
{
    scanf("%d%d%d",&n,&m,&d);
    for(int i=0;i<=n;i++)f[i]=i;
    for(int i=1;i<=m;i++){
        scanf("%d%d",&a[i],&b[i]);
        v[a[i]].push_back(b[i]);
        v[b[i]].push_back(a[i]);
    }
    for(int i=1;i<=d;i++){
       scanf("%d%d",&c[i],&q[i]);
       vis[c[i]]=1;
       for(int j=1;j<=q[i];j++)scanf("%d%d",&x[i][j],&y[i][j]);
    }
    for(int i=1;i<=m;i++){
       if(!vis[a[i]]&&!vis[b[i]]){
         int fa=Find(a[i]);
         int fb=Find(b[i]);
         if(fa!=fb)f[fa]=fb;
       }
    }
    for(int i=d;i>=1;i--){
      for(int j=1;j<=q[i];j++){
        //cout<<i<<":"<<x[i][j]<<" "<<y[i][j]<<endl;
        if(Find(x[i][j])!=Find(y[i][j]))ans[i]++;
      }
      vis[c[i]]=0;
      for(int j=0;j<v[c[i]].size();j++){
        if(vis[v[c[i]][j]])continue;
        int fj=Find(v[c[i]][j]);
        int fc=Find(c[i]);
        if(fj!=fc)f[fj]=fc;
      }
    }
    for(int i=1;i<=d;i++)cout<<ans[i]<<endl;

    return 0;
}

持续更新中…