oj.uz

답안 #1039611

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039611 2024-07-31T05:44:07 Z Name(#11031) Toy (CEOI24_toy) C++17
0 / 100
 1 ms 860 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
using pii=array<int,2>;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N=1505;
int h,w,k,l,a[N][N],sumH[N][N],sumV[N][N],chk[N][N];
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
pii S[2],E;
bool vis[2][N][N];
string s;
bool chkH(int x,int y){
	return y+k-1<=w&&sumH[x][y+k-1]==sumH[x][y-1];
}
bool chkV(int x,int y){
	return x+l-1<=h&&sumV[x+l-1][y]==sumV[x-1][y]&&chk[x+l-1][y]!=chk[x-1][y];
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>w>>h>>k>>l;
	cin>>S[0][0]>>S[0][1]>>S[1][0]>>S[1][1];
	S[0][0]++;
	S[0][1]++;
	S[1][0]++;
	S[1][1]++;
	for(int i=1;i<=h;i++){
		cin>>s;
		for(int j=1;j<=w;j++){
			if(s[j-1]=='X') a[i][j]=1;
			else{
				a[i][j]=0;
				if(s[j-1]=='*') E={i,j};
			}
		}
	}
	for(int i=1;i<=h;i++) for(int j=1;j<=w;j++){
		sumH[i][j]=sumH[i][j-1]+a[i][j];
		sumV[i][j]=sumV[i-1][j]+a[i][j];
	}
	{
		queue<pii> que;
		vis[0][S[0][0]][S[0][1]]=1;
		que.push(S[0]);
		while(que.size()){
			pii p=que.front(); que.pop();
			for(int k=0;k<4;k++){
				int x=p[0]+dx[k],y=p[1]+dy[k];
				if(x<1||x>h||y<1||y>w||!chkH(x,y)||vis[0][x][y]) continue;
				vis[0][x][y]=1;
				que.push({x,y});
			}
		}
	}
	for(int i=1;i<=h;i++) for(int j=1;j<=w;j++) if(vis[0][i][j]){
		chk[i][j]++;
		chk[i][j+k]--;
	}
	for(int i=1;i<=h;i++) for(int j=1;j<=w;j++) chk[i][j]+=chk[i][j-1];
	for(int i=1;i<=h;i++) for(int j=1;j<=w;j++) chk[i][j]+=chk[i-1][j];
	{
		queue<pii> que;
		vis[1][S[1][0]][S[1][1]]=1;
		que.push(S[1]);
		while(que.size()){
			pii p=que.front(); que.pop();
			if(p[0]<=E[0]&&E[0]<=p[0]+l-1&&p[1]==E[1]){
				cout<<"YES\n";
				return 0;
			}
			for(int k=0;k<4;k++){
				int x=p[0]+dx[k],y=p[1]+dy[k];
				if(x<1||x>h||y<1||y>w||!chkV(x,y)||vis[1][x][y]) continue;
				vis[1][x][y]=1;
				que.push({x,y});
			}
		}
	}
	cout<<"NO\n";
	return 0;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #1
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 860 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -