QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#192912	#6305. Chinese Checker	ucup-team870	AC ✓	6ms	3820kb	C++17	2.3kb	2023-09-30 15:52:58	2023-09-30 15:52:59

Judging History

你现在查看的是最新测评结果

[2023-09-30 15:52:59]
评测

测评结果：AC
用时：6ms
内存：3820kb

查看

[2023-09-30 15:52:58]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
map<P,P>mp;
bool bd[50][50],hs[50][50],vis[50][50];
vector<P>all;
P q[200];
void slv(){
    int n;cin>>n;
    vector<P>p(n+1);
    for(auto [x,y]:all)hs[x][y]=0;
    rep(i,1,n)cin>>p[i].first>>p[i].second,p[i]=mp[p[i]],hs[p[i].first][p[i].second]=1;
    int ans=0;
    vector<P>nxt;
    auto wk=[&](int x,int y,const P&dir){
        for(int k=1;;++k){
            int nx=x+dir.first*k, ny=y+dir.second*k;
            if(!bd[nx][ny])return;
            if(!hs[nx][ny])continue;
            rep(t,1,2*k-1){
                if(t==k)continue;
                int xx=x+dir.first*t,yy=y+dir.second*t;
                if(!bd[xx][yy] || hs[xx][yy])return;
            }
            P ans={nx*2-x,ny*2-y};
            if(bd[ans.first][ans.second] && !hs[ans.first][ans.second] )nxt.push_back(ans);
            return;
        }
    };
    rep(i,1,n){
        auto [x,y]=p[i]; hs[x][y]=0;
        for(auto [u,v]:all)vis[u][v]=0;
        int L=1,R=0; q[++R]={x,y}; vis[x][y]=1;
        // cout<<x<<' '<<y<<":\n";
        while(L<=R){
            auto [x,y]=q[L++];
            // cout<<x<<'h'<<y<<' ';
            nxt.clear();
            wk(x,y,{0,1}); wk(x,y,{1,0}); wk(x,y,{1,1});
            wk(x,y,{0,-1}); wk(x,y,{-1,0}); wk(x,y,{-1,-1});
            for(auto [nx,ny]:nxt){
                if(!vis[nx][ny]){
                    vis[nx][ny]=1; q[++R]={nx,ny};
                }
            }
        }
        ans+=R-1;
        hs[x][y]=1;
    }
    cout<<ans<<'\n';
}
signed main(){
    IOS
    vector<int>q[20];
    rep(i,1,4){
        rep(j,1,i)q[i].push_back(j);
    }
    rep(i,5,8){
        rep(j,-8+i,9)q[i].push_back(j);
    }
    rep(i,9,13){
        rep(j,1,i-9+9)q[i].push_back(j);
    }
    rep(i,14,17){
        rep(j,i-8,9)q[i].push_back(j);
    }
    rep(i,1,17){
        rep(j,0,(int)q[i].size()-1){
            q[i][j]+=4; mp[{i,j+1}]={i,q[i][j]}; bd[i][q[i][j]]=1; all.push_back({i,q[i][j]});
        }
    }
    int T;cin>>T;
    while(T--)slv();
}
/*
10
1 1
2 1
2 2
3 1
3 2
3 3
4 1
4 2
4 3
4 4

2
1 1
2 1
*/

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3568kb

input:

output:

result:

ok 5 number(s): "0 1 2 6 13"

Test #2:

score: 0

Accepted

time: 4ms

memory: 3644kb

input:

output:

result:

ok 100 numbers

Test #3:

score: 0

Accepted

time: 4ms

memory: 3820kb

input:

output:

result:

ok 100 numbers

Test #4:

score: 0

Accepted

time: 0ms

memory: 3648kb

input:

output:

result:

ok 100 numbers

Test #5:

score: 0

Accepted

time: 4ms

memory: 3656kb

input:

output:

result:

ok 100 numbers

Test #6:

score: 0

Accepted

time: 4ms

memory: 3524kb

input:

output:

result:

ok 100 numbers

Test #7:

score: 0

Accepted

time: 6ms

memory: 3636kb

input:

output:

result:

ok 100 numbers

Test #8:

score: 0

Accepted

time: 6ms

memory: 3800kb

input:

output:

result:

ok 100 numbers

Test #9:

score: 0

Accepted

time: 6ms

memory: 3548kb

input:

output:

result:

ok 100 numbers

Test #10:

score: 0

Accepted

time: 3ms

memory: 3624kb

input:

output:

result:

ok 100 numbers