Submission #59020892

Source Code Expand

#include <bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef modint1000000007 mi;
constexpr ll mod=1000000007;

int id[2005][2005];
int color[2005][2005];
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};

int main(){
	int h,w;cin>>h>>w;

	rep(i,2005)rep(j,2005)id[i][j]=-1;
	rep(i,h)rep(j,w)id[i+1][j+1]=i*w+j;

	dsu d(h*w);

	int q;cin>>q;
	rep(Q,q){
		int type;cin>>type;
		if(type==1){
			int r,c;cin>>r>>c;
			color[r][c]=1;
			rep(i,4){
				if(color[r+dx[i]][c+dy[i]]){
					d.merge(id[r][c],id[r+dx[i]][c+dy[i]]);
				}
			}
		}
		else{
			int ra,ca,rb,cb;
			cin>>ra>>ca>>rb>>cb;
			if(d.same(id[ra][ca],id[rb][cb])&&color[ra][ca]&&color[rb][cb])cout<<"Yes"<<endl;
			else cout<<"No"<<endl;
		}


	}
	
}

Submission Info

Submission Time
Task 012 - Red Painting（★4）
User Rho17
Language C++ 20 (gcc 12.2)
Score 4
Code Size 899 Byte
Status AC
Exec Time 193 ms
Memory 36956 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 4 / 4
Status
AC × 3
AC × 43
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt
Case Name Status Exec Time Memory
sample_01.txt AC 7 ms 19224 KiB
sample_02.txt AC 7 ms 19248 KiB
sample_03.txt AC 8 ms 19228 KiB
subtask_1_01.txt AC 147 ms 19216 KiB
subtask_1_02.txt AC 37 ms 23016 KiB
subtask_1_03.txt AC 104 ms 22436 KiB
subtask_1_04.txt AC 84 ms 29396 KiB
subtask_1_05.txt AC 76 ms 21492 KiB
subtask_1_06.txt AC 56 ms 19460 KiB
subtask_1_07.txt AC 58 ms 22744 KiB
subtask_1_08.txt AC 123 ms 24864 KiB
subtask_1_09.txt AC 59 ms 21044 KiB
subtask_1_10.txt AC 96 ms 20180 KiB
subtask_1_11.txt AC 40 ms 24144 KiB
subtask_1_12.txt AC 11 ms 20444 KiB
subtask_1_13.txt AC 39 ms 22232 KiB
subtask_1_14.txt AC 34 ms 20928 KiB
subtask_1_15.txt AC 113 ms 26040 KiB
subtask_1_16.txt AC 83 ms 30412 KiB
subtask_1_17.txt AC 40 ms 28120 KiB
subtask_1_18.txt AC 15 ms 20236 KiB
subtask_1_19.txt AC 36 ms 22660 KiB
subtask_1_20.txt AC 143 ms 22756 KiB
subtask_1_21.txt AC 98 ms 33600 KiB
subtask_1_22.txt AC 15 ms 26324 KiB
subtask_1_23.txt AC 54 ms 25288 KiB
subtask_1_24.txt AC 78 ms 26092 KiB
subtask_1_25.txt AC 112 ms 22068 KiB
subtask_1_26.txt AC 15 ms 21332 KiB
subtask_1_27.txt AC 110 ms 20720 KiB
subtask_1_28.txt AC 128 ms 19812 KiB
subtask_1_29.txt AC 134 ms 20164 KiB
subtask_1_30.txt AC 122 ms 20528 KiB
subtask_1_31.txt AC 155 ms 19776 KiB
subtask_1_32.txt AC 105 ms 20496 KiB
subtask_1_33.txt AC 70 ms 20976 KiB
subtask_1_34.txt AC 48 ms 35284 KiB
subtask_1_35.txt AC 159 ms 34756 KiB
subtask_1_36.txt AC 138 ms 35988 KiB
subtask_1_37.txt AC 185 ms 35304 KiB
subtask_1_38.txt AC 193 ms 35164 KiB
subtask_1_39.txt AC 150 ms 36832 KiB
subtask_1_40.txt AC 139 ms 36956 KiB