#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define st first
#define nd second
#define MOD 1000000007
typedef pair<ll, ll> pii;
const ll maxn = 1e5 + 5;
vector<int> ans;
char d[15][maxn];
int n;
int dfs(int x, int y){
if(x < 0 || x >= 10 || y < 0 || y >= n){
return 0;
}
if(d[x][y] == 'X'){
return 0;
}
if(y == n-1){
return 1;
}
if(dfs(min(9, x+1), y + 1)){
return 1;
}
if(dfs(max(0, x-1), y + 1)){
ans.pb(y);
return 1;
}
return 0;
}
int main(){
cin >> n;
for (int j = 0; j < 10; j++)
{
for (int i = 0; i < n; i++)
{
cin >> d[j][i];
}
}
dfs(9, 0);
reverse(ans.begin(), ans.end());
cout << ans.size() << "\n";
for(auto i : ans){
cout << i << " 1\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
3 ms |
468 KB |
Output is correct |
6 |
Correct |
25 ms |
460 KB |
Output is correct |
7 |
Correct |
127 ms |
1164 KB |
Output is correct |
8 |
Correct |
420 ms |
2500 KB |
Output is correct |
9 |
Execution timed out |
1071 ms |
2136 KB |
Time limit exceeded |
10 |
Correct |
69 ms |
4964 KB |
Output is correct |