CCF-2019-12-2

#include<iostream>

using namespace std;

struct pos {

       int x;

       int y;

       bool verify;

       int score;

};

int main() {

       int n;

       cin >> n;

       pos * loca = new pos[n];

       for (int i=0; i<n; ++i) {

              cin >> loca[i].x;

              cin >> loca[i].y;

       }

       for (int i=0; i<n; ++i) {

              bool ver1 = false , ver2 = false , ver3 = false , ver4 = false;

              for (int j=0; j<n; ++j) {

                     if((loca[i].x == loca[j].x)&&(loca[i].y + 1 == loca[j].y)) ver1 = true;

                     if((loca[i].x == loca[j].x)&&(loca[i].y - 1 == loca[j].y)) ver2 = true;

                     if((loca[i].x - 1 == loca[j].x)&&(loca[i].y == loca[j].y)) ver3 = true;

                     if((loca[i].x + 1 == loca[j].x)&&(loca[i].y == loca[j].y)) ver4 = true;

              }

              loca[i].verify = ver1&&ver2&&ver3&&ver4;

       }

       for (int i=0; i<n; ++i) {

              if(loca[i].verify) {

                     int s1=0,s2=0,s3=0,s4=0;

                     for (int j=0; j<n; ++j) {

                            if((loca[i].x - 1== loca[j].x)&&(loca[i].y + 1 == loca[j].y)) s1 = 1;

                            if((loca[i].x + 1== loca[j].x)&&(loca[i].y + 1 == loca[j].y)) s2 = 1;

                            if((loca[i].x - 1== loca[j].x)&&(loca[i].y - 1 == loca[j].y)) s3 = 1;

                            if((loca[i].x + 1== loca[j].x)&&(loca[i].y - 1 == loca[j].y)) s4 = 1;

                     }

                     loca[i].score = s1 + s2 + s3 + s4;

              }

       }

       int plaSco[5]={0,0,0,0,0};

       for (int i=0; i<n; ++i) {

              if(loca[i].verify) {

                     ++plaSco[loca[i].score];

              }

       }

       for (int i=0;i<5;++i){

              cout << plaSco[i] <<endl;

       }

       return 0;

}

  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值