UOJ Logo

NOI.AC

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#205530#42. queenLyx350925010ms5104kbC++1.3kb2024-07-12 16:58:052024-07-12 16:58:06

answer

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

int main(int argc, char** argv){
	int n,m,x,y;
	cin>>n>>m;
	int s[9]={0};
	int a[n][n];
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			a[i][j]=0; 
		}
	}
	for(int i=0;i<m;i++){
		cin>>x>>y;
		x--;y--;
		a[x][y]=1;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(a[i][j]==1){
				int num=0;
				x=i;y=j;
				while(x&&y){
					x--;y--;
					if(a[x][y]==1){
						num++;
						break;
					}
				}
				x=i;y=j;
				while(x){
					x--;
					if(a[x][y]==1){
						num++;
						break;
					}
				}
				x=i;y=j;
				while(x&&y!=n-1){
					x--;y++;
					if(a[x][y]==1){
						num++;
						break;
					}
				}
				x=i;y=j;
				while(y!=n-1){
					y++;
					if(a[x][y]==1){
						num++;
						break;
					}
				}
				x=i;y=j;
				while(x!=n-1&&y!=n-1){
					x++;y++;
					if(a[x][y]==1){
						num++;
						break;
					}
				}
				x=i;y=j;
				while(x!=n-1){
					x++;
					if(a[x][y]==1){
						num++;
						break;
					}
				}
				x=i;y=j;
				while(x!=n-1&&y){
					x++;y--;
					if(a[x][y]==1){
						num++;
						break;
					}
				}
				x=i;y=j;
				while(y){
					y--;
					if(a[x][y]==1){
						num++;
						break;
					}
				}
				s[num]++;
			}
		}
	}
	for(int i=0;i<9;i++){
		cout<<s[i]<<" ";
	}
	return 0;
}

Details

小提示:点击横条可展开更详细的信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 1200kb

input:

10 10
3 4
4 5
10 9
4 2
5 5
3 1
8 9
3 3
2 5
2 6

output:

0 2 3 3 1 1 0 0 0 

result:

wrong answer 1st lines differ - expected: '0 2 3 3 1 1 0 0 0', found: '0 2 3 3 1 1 0 0 0 '

Test #2:

score: 0
Wrong Answer
time: 7ms
memory: 4360kb

input:

900 900
503 575
536 735
97 767
131 791
188 113
363 502
247 825
264 842
438 893
599 314
348 274
574 6...

output:

32 148 285 257 131 39 8 0 0 

result:

wrong answer 1st lines differ - expected: '32 148 285 257 131 39 8 0 0', found: '32 148 285 257 131 ...

Test #3:

score: 0
Wrong Answer
time: 3ms
memory: 5104kb

input:

1000 1000
23 676
835 868
253 639
489 773
106 384
628 585
863 502
789 471
964 251
967 630
5 75
750 16...

output:

37 151 320 288 141 47 16 0 0 

result:

wrong answer 1st lines differ - expected: '37 151 320 288 141 47 16 0 0', found: '37 151 320 288 141...

Test #4:

score: 0
Runtime Error

input:

100000 500
78494 97550
83510 81587
95499 87612
84636 74826
75513 95815
67640 68373
83551 77889
69117...

output:


result:


Test #5:

score: 0
Runtime Error

input:

100000 750
23890 2611
15946 9023
304 26283
3001 13845
18144 26822
1752 24381
8020 25573
28483 19123
...

output:


result:


Test #6:

score: 0
Runtime Error

input:

100000 1000
8960 2686
12346 26683
25083 1374
1210 19895
7811 13373
2765 20979
28138 10479
1275 5254
...

output:


result:


Test #7:

score: 0
Runtime Error

input:

70000 100000
67449 59032
56582 61809
65627 45023
54832 54881
63697 67627
49930 66219
42393 54328
458...

output:


result:


Test #8:

score: 0
Runtime Error

input:

80000 100000
65069 68649
69222 78853
74951 60634
79644 61172
72125 79083
54777 60756
49785 62752
589...

output:


result:


Test #9:

score: 0
Runtime Error

input:

90000 100000
67457 78587
80771 77113
75880 71265
79726 77572
67867 70275
63940 73566
73084 78097
671...

output:


result:


Test #10:

score: 0
Runtime Error

input:

100000 100000
82685 88489
89768 75476
99150 99508
79240 92502
98469 76447
72619 88003
78215 79291
81...

output:


result: