제출 #704288

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
704288	2023-03-02 03:01:36	willychan	Dijamant (COCI22_dijamant)	C++14	70 / 70	226 ms	234860 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
bool arr[2005][2005];
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int n,m;
bool inbound(int x,int y){
  return (x>=0 && y>=0);
}
int xpymax,xpymin,xmymax,xmymin;
int cnt = 0;
void dfs(int x,int y){
  arr[x][y]=1;
  cnt++;
  xpymax = max(xpymax,x+y);
  xpymin = min(xpymin,x+y);
  xmymax = max(xmymax,x-y);
  xmymin = min(xmymin,x-y);
  for(int i=0;i<4;i++){
    if(inbound(x+dx[i] , y+dy[i])){
      if(arr[x+dx[i]][y+dy[i]]==0){
        dfs(x+dx[i],y+dy[i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 50 / 50