QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #91763 | #4231. Rafting Trip | FHQY | WA | 2ms | 3580kb | C++20 | 3.0kb | 2023-03-29 15:37:03 | 2023-03-29 15:37:09 |
Judging History
answer
#include<bits/stdc++.h>
#define pii pair<int,int>
#define pb push_back
typedef long long int ll;
using namespace std;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
char s[503][503];
int vis[503][503];
int mark[503][503];
map<char,int> mp;
int n,m;
int ans;
bool check(int x,int y){
if(s[x][y]=='.' || s[x][y]=='#') return false;
int typ=mp[s[x][y]];
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(k==typ && s[r][c]!='.' && s[r][c]!='#') return false;
}
return true;
}
void dfs1(int x,int y,int res){
mark[x][y]=1;
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(s[r][c]=='#' && vis[r][c]==0){
vis[r][c]=1;
res++;
}
}
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(s[r][c]=='.' || s[r][c]=='#') continue;
if(mp[s[r][c]]==(k+2)%4) dfs1(r,c,res);
}
ans=max(ans,res);
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(s[r][c]=='#' && vis[r][c]==1){
vis[r][c]=0;
res--;
}
}
}
int tem;
void dfscyc1(int x,int y){
if(mark[x][y]==2) return;
mark[x][y]++;
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(mp[s[x][y]]==k) dfscyc1(r,c);
if(s[r][c]=='#' && vis[r][c]==0){
vis[r][c]=1;
tem++;
}
}
}
void dfscyc2(int x,int y){
if(mark[x][y]==4) return;
mark[x][y]++;
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(mp[s[x][y]]==k) dfscyc2(r,c);
if(s[r][c]=='#' && vis[r][c]==1){
vis[r][c]=0;
}
}
}
void dfs3(int x,int y,int res){
if(mark[x][y]==3) return;
mark[x][y]++;
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(s[r][c]=='.' || s[r][c]=='#') continue;
if(mp[s[r][c]]==(k+2)%4 && mark[r][c]<2) dfs1(r,c,res);
}
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(mp[s[x][y]]==k) dfs3(r,c,res);
}
}
void dfs2(int x,int y){
mark[x][y]++;
if(mark[x][y]==2){
mark[x][y]=1;
tem=0;
dfscyc1(x,y);
ans=max(ans,tem);
dfs3(x,y,tem);
dfscyc2(x,y);
}else{
for(int k=0;k<4;k++){
int r=x+dx[k];
int c=y+dy[k];
if(r<1 || r>n || c<1 || c>m) continue;
if(s[r][c]=='.' || s[r][c]=='#') continue;
if(mp[s[x][y]]==k){
dfs2(r,c);
}
}
}
}
void solve(){
cin >> n >> m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin >> s[i][j];
if(s[i][j]=='.' || s[i][j]=='#') mark[i][j]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(check(i,j)){
dfs1(i,j,0);
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(mark[i][j]==0) dfs2(i,j);
}
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);
int t=1;
mp['^']=0;
mp['<']=1;
mp['v']=2;
mp['>']=3;
// cin >> t;
while(t--){
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3404kb
input:
5 6 v<<<#v v#v<.> >>v<<< ..v##^ #<<<.^
output:
4
result:
ok single line: '4'
Test #2:
score: 0
Accepted
time: 2ms
memory: 3400kb
input:
4 5 >v<<. ^<..# #...# .#>^#
output:
2
result:
ok single line: '2'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3400kb
input:
4 6 >>v#>v ^#>>^v ^<<#v< .#^<<#
output:
5
result:
ok single line: '5'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
6 6 ^.>>>> ^..... ^....v ^....v #....v <<<<#v
output:
2
result:
ok single line: '2'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
6 7 ^>>>>>v ^.....v ^.#^..v ^.#^<.v ^.....v ^<<<<<<
output:
2
result:
ok single line: '2'
Test #6:
score: -100
Wrong Answer
time: 2ms
memory: 3572kb
input:
3 7 >v<<<<# ^<##### #^<<<<<
output:
7
result:
wrong answer 1st lines differ - expected: '6', found: '7'