QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#214239	#6723. Grid with Arrows	yyyyy3	WA	164ms	13492kb	C++14	1.7kb	2023-10-14 18:09:40	2023-10-14 18:09:40

Judging History

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

[2023-10-14 18:09:40]
评测

测评结果：WA
用时：164ms
内存：13492kb

查看

[2023-10-14 18:09:40]
提交

answer


#include<bits/stdc++.h>
#define endl '\n'
#define fast() ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define _ int _T; cin >> _T; while(_T --) 
#define int long long

using namespace std;
const int N = 1e5 + 10;
const int MAX = 1e3 + 10;
int n,m;
string s[N];
vector<int> g[N];
int r[N];
bool st[N];

void bfs(){
	queue<int> q;
	for(int i = 1;i <= n * m;i ++){
		if(!r[i]){
			q.push(i);
			break;
		}
	} int flag = 0;
	if(!q.size()){
		q.push(1);
		flag = 1;
	}
	int ans = 0;
	while(q.size()){
		int t = q.front();
		q.pop();
		if(st[t]) continue;
		st[t] = true;
	//	cout << t << "TTT" << endl;
		ans ++;
		for(auto x : g[t]){
			q.push(x);
		}
		if(t == flag) break;
	}// cout << ans << endl;
	for(int i = 1;i <= n * m;i ++){
		if(!st[i]){
			cout << "NO" << endl;
			return;
		}
	} cout << "YES" << endl;
}

void solve(){
	int pos = 1;
	cin >> n >> m;
	for(int i = 1;i <= n * m;i ++){
		st[i] = false;
		g[i].clear();
		r[i] = 0;
	}
	for(int i = 1;i <= n;i ++){
		cin >> s[i];
	}

	for(int i = 1;i <= n;i ++){
		for(int j = 0;j < m;j ++){
			int a; cin >> a;
			if(s[i][j] == 'r' && j + 1 + a <= m){
				g[pos].push_back(pos + a);
				r[pos + a] ++;
			}
			if(s[i][j] == 'l' && j + 1 - a >= 1){
				g[pos].push_back(pos - a);
				r[pos - a] ++;
			}
			if(s[i][j] == 'u' && i - a >= 1){
				g[pos].push_back(pos - a * m);
				r[pos - a * m] ++;
			}
			if(s[i][j] == 'd'){
				g[pos].push_back(pos + a * m);
				r[pos + a * m] ++;
			}
			pos ++;
		}
	} 
	bfs();
//	for(int i = 1;i <= n * m;i ++){
//		for(auto t : g[i]){
//			cout << t << " " << r[t] << " " << i << " " << t ;
//		} cout << endl;
//	}
}

signed main(){
//	fast();
	_
	solve();
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 9096kb

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: 164ms

memory: 13492kb

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:

NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
NO
YES
NO
NO
YES
NO
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
NO...

result:

wrong answer expected YES, found NO [1st token]