제출 #773836

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
773836	2023-07-05 09:00:52	vjudge1	Paint (COI20_paint)	C++17	0 / 100	224 ms	524288 KiB

paint

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;
#define lalala ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define int long long int
#define N 10005
int var[N][N],renk[N][N];
int n,m;
void bfs(int x,int y,int co,int mor){
  queue<pair<int,int>> q;
  q.push({x,y});
  while(q.size()){
    int a=q.front().first,b=q.front().second;q.pop();
    if(var[a][b])continue;
    var[a][b]=1;
    renk[a][b]=mor;
    if(a-1>0&&var[a-1][b]==0&&renk[a-1][b]==co){q.push({a-1,b});}
    
    if(a+1<=n&&var[a+1][b]==0&&renk[a+1][b]==co){q.push({a+1,b});}
    
    if(b-1>0&&var[a][b-1]==0&&renk[a][b-1]==co){q.push({a,b-1});}
    if(b+1<=m&&var[a][b+1]==0&&renk[a][b+1]==co){q.push({a,b+1});}
  }
}
signed main(){
  lalala;
  cin>>n>>m;
  for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 31
• Subtask 4: 0 / 52