QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#86823#3002. Busy BoardAFewSunsWA 7ms5008kbC++142.2kb2023-03-11 09:26:132023-03-11 09:26:16

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-11 09:26:16]
  • 评测
  • 测评结果:WA
  • 用时:7ms
  • 内存:5008kb
  • [2023-03-11 09:26:13]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll n,m,sum1[1010],sum2[1010];
char s[1010][1010],t[1010][1010];
bl pd1[1010],pd2[1010];
il bl chk1(){
	fr(i,1,n) fr(j,1,m) if(s[i][j]!=t[i][j]) return 0;
	return 1;
}
int main(){
	n=read();
	m=read();
	fr(i,1,n) scanf("%s",s[i]+1);
	fr(i,1,n) scanf("%s",t[i]+1);
	if(chk1()) write(1);
	else{
		fr(i,1,n){
			fr(j,1,m){
				sum1[i]+=(t[i][j]=='X');
				sum2[j]+=(t[i][j]=='X');
			}
		}
		bl ck;
		do{
			ck=0;
			fr(i,1,n){
				fr(j,1,m){
					if(pd1[i]&&pd2[j]) continue;
					bl o=0;
					if(!pd1[i]&&!pd2[j]&&sum1[i]==1&&sum2[j]==1&&t[i][j]=='X') o=1;
					if((pd1[i]||pd2[j])&&!sum1[i]&&!sum2[j]) o=1;
					if(o){
						ck=1;
						fr(k,1,m){
							sum1[i]-=(t[i][k]=='X');
							sum2[k]-=(t[i][k]=='X');
						}
						fr(k,1,n){
							sum1[k]-=(t[k][j]=='X');
							sum2[j]-=(t[k][j]=='X');
						}
						pd1[i]=pd2[j]=1;
					}
				}
			}
		}while(ck);
		ck=0;
		fr(i,1,n) fr(j,1,m) if(pd1[i]&&pd2[j]&&s[i][j]=='O') ck=1;
		write(ck);
	}
}

详细

Test #1:

score: 0
Wrong Answer
time: 7ms
memory: 5008kb

input:

769 998
OOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOOO...

output:

1

result:

wrong answer expected 0, found 1