Educational Codeforces Round 124 (Rated for Div. 2)

Educational Codeforces Round 124 (Rated for Div. 2)

A - Playoff

• 签到~

#include <bits/stdc++.h>
#define int long long 
using namespace std;

const int N=1e5+5;

void solve()
{
    int n;
    cin>>n;
    int ans=1;
    for(int i=1;i<=n;i++) ans*=2;
    ans--;
    cout<<ans<<endl;
}
signed main()
{
    int T=1;
    cin>>T;
    while(T--) solve();
}

B - Prove Him Wrong

分析：

• 假设 $a[i]\ge a[j]$ 那么 $2(a[i]-a[j])\ge a[i]+a[j]$

  得到 $a[i]>=3a[j]$

  所以，遍历三的倍数即可

#include <bits/stdc++.h>
#define int long long 
using namespace std;

const int N=1e5+5;

void solve()
{
    int n;
    cin>>n;
    if(n>19) puts("NO");
    else 
    {
        puts("YES");
        int ans=1;
        for(int i=1;i<=n;i++)
        {
            cout<<ans<<' ';
            ans*=3;
        }
        cout<<"\n";
    }
}
signed main()
{
    int T=1;
    cin>>T;
    while(T--) solve();
}

C - Fault-tolerant Network

分析：

• 四个端点（上下的首尾）都必须要连边（因为要成一个环，才能不被断开）（有意思的）
• 然后就是分类讨论：
  • 主要是以四个端点共不共边展开讨论，详见代码

#include <bits/stdc++.h>
#define int long long 
using namespace std;

const int N=1e6+5;
int a[N],b[N];
void solve()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
    for(int i=1;i<=n;i++) scanf("%lld",&b[i]);
    int la=1e9, ra=1e9, lb=1e9, rb=1e9;
    for(int i=1;i<=n;i++)
    {
        la=min(la,abs(a[1]-b[i]));
        lb=min(lb,abs(b[1]-a[i]));
        ra=min(ra,abs(a[n]-b[i]));
        rb=min(rb,abs(b[n]-a[i]));
    }
    int ll=abs(a[1]-b[1]),lr=abs(a[1]-b[n]), rl=abs(a[n]-b[1]), rr=abs(a[n]-b[n]);
    int ans=min({la+lb+ra+rb,ll+rr,lr+rl,ll+ra+rb,lr+ra+lb,rl+la+rb,rr+la+lb});
    cout<<ans<<"\n";
}
signed main()
{
    int T=1;
    cin>>T;
    while(T--) solve();
}

D - Nearest Excluded Points

分析：

• 多源点BFS

  n个点中，上下左右四个点都被标记的不用管（被围住的），其余（边缘的）入队，跑一边BFS

• 但我没想通为什么刚开始的做法wa9了

#include <bits/stdc++.h>
#define int long long 
#define Pa pair<int,int> 
using namespace std;

const int N=2e5+5;
struct node 
{ 
    int x,y;
    bool operator < (node b) const { return x<b.x || x==b.x && y<b.y; } 
}e[N], ans[N];
int dx[]={0,0,-1,1};
int dy[]={1,-1,0,0};
map <node,int> mp;
vector <int> g[N];
int vis[N];
void solve()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld%lld",&e[i].x,&e[i].y);
        mp[e[i]]=i;
        for(int j=0;j<4;j++)
        {
            int x=e[i].x+dx[j], y=e[i].y+dy[j];
            if(mp[{x,y}])
            {
                g[i].push_back(mp[{x,y}]);
                g[mp[{x,y}]].push_back(i);
            }
        }
    }
    queue<int> q;
    for(int i=1;i<=n;i++)
    {
        if(g[mp[e[i]]].size()<4) 
        {
            q.push(i);
            vis[i]=1;
            for(int j=0;j<4;j++)
            {
                int x=e[i].x+dx[j], y=e[i].y+dy[j];
                if(!mp[{x,y}]) ans[i]={x,y};
            }
        } 
    }
    while(!q.empty())
    {
        int u=q.front(); q.pop();
        for(int i=0;i<4;i++)
        {
            int x=e[u].x+dx[i], y=e[u].y+dy[i], v=mp[{x,y}];
            if(mp[{x,y}] && g[mp[{x,y}]].size()==4 && !vis[mp[{x,y}]])
            {
                ans[v]=ans[u];
                vis[v]=1;
                q.push(v);
            }
        }
    }
    for(int i=1;i<=n;i++) cout<<ans[i].x<<' '<<ans[i].y<<"\n";
}
signed main()
{
    int T=1;
    //cin>>T;
    while(T--) solve();
}

wa9了的

#include <bits/stdc++.h>
#define int long long 
using namespace std;

const int N=1e6+5;
map <pair<int,int>,int>mp;
int x[N],y[N];
vector <pair<int,int> >ans;
void solve()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld%lld",&x[i],&y[i]);
        mp[{x[i],y[i]}]=1;
    }
    
    for(int i=1;i<=n;i++)
    {

        queue<pair<int,int> >q;
        q.push({x[i],y[i]});
        int dep=0;
        while(!q.empty())
        {
            pair<int,int> u=q.front(); q.pop();
            int dx=u.first,dy=u.second;
            if(!mp[{dx,dy}] && dx<=1e6 && dx>=-1e6 && dy<=1e6 && dy>=-1e6) 
            {
                //cout<<dx<<' '<<dy<<"\n";
                ans.push_back({dx,dy});
                break;
            }
            dep++;
            if(abs(dx+1-x[i])+abs(dy-y[i])==dep) q.push({dx+1,dy});
            if(abs(dx-1-x[i])+abs(dy-y[i])==dep) q.push({dx-1,dy});
            if(abs(dx-x[i])+abs(dy+1-y[i])==dep) q.push({dx,dy+1});
            if(abs(dx-x[i])+abs(dy-1-y[i])==dep) q.push({dx,dy-1});
        }
        //while(!q.empty()) q.pop();
    }
    for(auto it : ans) cout<<it.first<<' '<<it.second<<"\n";
}
signed main()
{
    int T=1;
    //cin>>T;
    while(T--) solve();
}