# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
937167 | melody_rules | Tracks in the Snow (BOI13_tracks) | C++17 | 2064 ms | 53920 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n=0;
int m=0;
int a=0;
int b=0;
char c;
int i=0;
int j=0;
bool check1=false;
bool check2=false;
cin>>n>>m;
vector<vector<char>> vec(n, vector<char>(m));
vector<vector<bool>> vis(n, vector<bool>(m));
for(i=0;i<n;i++) {
for(j=0;j<m;j++) {
cin>>c;
vec.at(i).at(j) = c;
}
}
queue<pair<int, int>> q;
q.push({0, 0});
while(!q.empty()) {
a = q.front().first;
b = q.front().second;
cout<<a<<" "<<b<<endl;
q.pop();
vis.at(a).at(b) = true;
if(vec.at(a).at(b) == 'R')
check1 = true;
else
check2 = true;
if(check1 && check2) {
break;
}
if(a!=0 && vec.at(a-1).at(b) != '.' && !vis.at(a-1).at(b))
q.push({a-1, b});
if(a!=(m-1) && vec.at(a+1).at(b) != '.' && !vis.at(a+1).at(b))
q.push({a+1, b});
if(b!=0 && vec.at(a).at(b-1) != '.' && !vis.at(a).at(b-1))
q.push({a, b-1});
if(b!=(n-1) && vec.at(a).at(b+1) != '.' && !vis.at(a).at(b+1))
q.push({a, b+1});
}
if(check1 && check2)
cout<<2<<endl;
else
cout<<1<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |