QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#243230	#6723. Grid with Arrows	gzzz^#	WA	65ms	10560kb	C++20	1.4kb	2023-11-07 22:35:37	2023-11-07 22:35:38

Judging History

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

[2023-11-07 22:35:38]
评测

测评结果：WA
用时：65ms
内存：10560kb

查看

[2023-11-07 22:35:37]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e5+10;
string mp[maxn];
vector<vector<int> > s;
int in[maxn],out[maxn],fa[maxn];
int find(int x){
	if(fa[x]==x) {
		return x;
	}
	return fa[x]=find(fa[x]);
}
void unit(int x,int y){
	fa[find(x)]=find(y);
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;cin>>t;
	while(t--) {
		int n,m;
		cin>>n>>m;
		for(int i=0;i<n*m;i++){
			fa[i]=i;
		}
		s.clear();
		for(int i=0;i<n;i++){
			mp[i].clear();
			cin>>mp[i];
		}
		for(int i=1;i<=n;i++){
			vector<int> tmp;
			for(int j=1;j<=m;j++){
				int x;cin>>x;
				tmp.push_back(x);
			}
			s.push_back(tmp);
		}
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				int fr=i*m+j;
				int tox=i,toy=j;
				if(mp[i][j]=='r') {
					toy+=s[i][j];
				}
				else if(mp[i][j]=='l'){
					toy-=s[i][j];
				}
				else if(mp[i][j]=='u'){
					tox-=s[i][j];
				}
				else {
					tox+=s[i][j];
				}
				if(tox<0||tox>=n||toy<0||toy>=m) {
					continue;
				}
				else {
					int to=tox*m+toy;
					in[to]++;
					out[fr]++;
					unit(fr,to);
				}
			}
		}
		int num=0;
		bool flag=true;
		for(int i=0;i<n*m&&flag;i++){
			if(in[i]!=out[i]) {
				num++;
			}
			if(find(i)!=find(0)){
				flag=false;
			}
		}
		if(num>2) flag=false;
		if(flag) cout<<"Yes\n";
		else cout<<"No\n";
	}
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 6752kb

input:

2
2 3
rdd
url
2 1 1
1 1 2
2 2
rr
rr
1 1
1 1

output:

Yes
No

result:

ok 2 token(s): yes count is 1, no count is 1

Test #2:

score: -100

Wrong Answer

time: 65ms

memory: 10560kb

input:

1109
5 8
rddddldl
drruludl
rrldrurd
urrrlluu
uurrulrl
4 4 1 2 4 3 1 6
1 3 5 1 1 1 3 6
2 4 1 1 2 1 1 1
2 3 4 2 4 3 3 3
4 1 1 2 2 5 1 5
7 9
rdrddrdll
urrdruldl
ruullrulu
drrlrlddl
rrrdddlll
ruulururl
ruurrlluu
7 1 1 1 2 1 2 3 6
1 7 3 1 3 1 2 1 8
2 2 1 2 4 3 1 2 2
2 2 4 1 1 5 3 3 1
3 4 6 1 2 1 2 7 7
6 ...

output:

Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes...

result:

wrong answer expected YES, found NO [5th token]