2021-03-04

最新推荐文章于 2025-05-09 14:03:51 发布

原创最新推荐文章于 2025-05-09 14:03:51 发布 · 52 阅读

0 ·

CC 4.0 BY-SA版权

笔记专栏收录该内容

1 篇文章

订阅专栏

Csp201912-2 回收站选址
#include
#includeusing namespace std;int n, v0 = 0, v1 = 0, v2 = 0, v3 = 0, v4 = 0;typedef struct point { int x; int y;};int det(point* a,point b)//判断点是否为选点{ int i,p=0; for (i = 0; i < n; i++) { if (a[i].x - 1 == b.x && a[i].y == b.y) p++; if (a[i].x + 1 == b.x && a[i].y == b.y) p++; if (a[i].y - 1 == b.y && a[i].x == b.x) p++; if (a[i].y + 1 == b.y && a[i].x == b.x) p++; } if (p == 4) return 1; return 0;}int lev(point* a,point b)//对点进行评级{ int i,p=0; for (i = 0; i < n; i++) { if (a[i].x - 1 == b.x && a[i].y-1 == b.y) p++; if (a[i].x + 1 == b.x && a[i].y-1 == b.y) p++; if (a[i].x - 1 == b.x && a[i].y+1 == b.y) p++; if (a[i].x + 1 == b.x && a[i].y+1 == b.y) p++; } return p;}int sta(point* a)//统计各个等级的点个数{ int i; for (i = 0; i < n; i++) { if (det(a, a[i])) { if (lev(a, a[i]) == 0) v0++; if (lev(a, a[i]) == 1) v1++; if (lev(a, a[i]) == 2) v2++; if (lev(a, a[i]) == 3) v3++; if (lev(a, a[i]) == 4) v4++; } } cout << v0 << endl; cout << v1 << endl; cout << v2 << endl; cout << v3 << endl; cout << v4 << endl; return 0;}int main() { int i,t; point m; vector v; cin >> n; for (i = 0; i < n; i++) { cin >> m.x >> m.y; v.push_back(m); } t = v.size(); point a[1000]; for (i = 0; i < t; i++) { a[i].x = v[i].x; a[i].y = v[i].y; } sta(a);}