Submission #41030301


Source Code Expand

#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
using namespace std;
typedef long long ll;
int n,m;
string arr[105];
int ans[105];
bool in(int y,int x){
	if(y<0 || x<0 || y>=n || x>=m) return 0;
	if(arr[y][x]=='.') return 0;
	return 1;
}
bool pos(int y,int x,int d){
	if(!in(y+d,x+d)) return 0;
	if(!in(y-d,x+d)) return 0;
	if(!in(y+d,x-d)) return 0;
	if(!in(y-d,x-d)) return 0;
	return 1;
}
int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin>>n>>m;
	for(int i=0; i<n; i++) cin>>arr[i];
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			if(arr[i][j]=='.') continue;
			int d = 1;
			while(pos(i,j,d)) d++;
			ans[d-1]++;
		}
	}
	for(int i=1; i<=min(n,m); i++) cout<<ans[i]<<" ";
}

Submission Info

Submission Time
Task C - Cross
User belphegor
Language C++ (GCC 9.2.1)
Score 300
Code Size 1001 Byte
Status AC
Exec Time 13 ms
Memory 3640 KiB

Compile Error

./Main.cpp:2: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
    2 | #pragma optimize ("g",on)
      | 
./Main.cpp:8: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    8 | #pragma comment(linker, "/stack:200000000")
      | 

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 21
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 02_corner_00.txt, 02_corner_01.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 13 ms 3564 KiB
00_sample_01.txt AC 2 ms 3516 KiB
00_sample_02.txt AC 2 ms 3576 KiB
00_sample_03.txt AC 2 ms 3592 KiB
01_random_00.txt AC 2 ms 3604 KiB
01_random_01.txt AC 2 ms 3640 KiB
01_random_02.txt AC 2 ms 3580 KiB
01_random_03.txt AC 2 ms 3612 KiB
01_random_04.txt AC 2 ms 3632 KiB
01_random_05.txt AC 2 ms 3548 KiB
01_random_06.txt AC 2 ms 3636 KiB
01_random_07.txt AC 2 ms 3560 KiB
01_random_08.txt AC 2 ms 3536 KiB
01_random_09.txt AC 2 ms 3540 KiB
01_random_10.txt AC 2 ms 3536 KiB
01_random_11.txt AC 2 ms 3520 KiB
01_random_12.txt AC 2 ms 3604 KiB
01_random_13.txt AC 2 ms 3572 KiB
01_random_14.txt AC 1 ms 3480 KiB
02_corner_00.txt AC 2 ms 3536 KiB
02_corner_01.txt AC 2 ms 3480 KiB