oj.uz

답안 #201859

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201859 2020-02-12T09:57:44 Z blacktulip Emacs (COCI20_emacs) C++14
50 / 50
 7 ms 1272 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,vis[105][105];
int cev;
string s;
char c[105][105];
vector<int> v;

inline void dfs(int satir,int sutun){
	if(satir>n || sutun>m || satir<1 || sutun<1)return ;
	if(c[satir][sutun]=='.')return ;
	if(vis[satir][sutun]==1)return ;
	vis[satir][sutun]=1;
	dfs(satir+1,sutun);
	dfs(satir-1,sutun);
	dfs(satir,sutun+1);
	dfs(satir,sutun-1);
}

int main(void){
	scanf("%d %d",&n,&m);
	FOR{
		for(int j=1;j<=m;j++){
			scanf(" %c",&c[i][j]);
		}
	}
	FOR{
		for(int j=1;j<=m;j++){
			if(vis[i][j]==1)continue;
			if(c[i][j]=='.')continue;
			dfs(i,j);
			cev++;
		}
	}
	printf("%d\n",cev);
	return 0;
}

Compilation message

emacs.cpp: In function 'int main()':
emacs.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
emacs.cpp:46:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf(" %c",&c[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 1144 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 6 ms 888 KB Output is correct
8 Correct 7 ms 1016 KB Output is correct
9 Correct 6 ms 1272 KB Output is correct
10 Correct 6 ms 760 KB Output is correct