#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());
for(auto i : ans){
cout << i << " 1\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Unexpected end of file - int32 expected |
2 |
Incorrect |
0 ms |
212 KB |
Unexpected end of file - int32 expected |
3 |
Incorrect |
0 ms |
340 KB |
Moves are not sorted in chronological order. |
4 |
Incorrect |
1 ms |
340 KB |
Moves are not sorted in chronological order. |
5 |
Incorrect |
3 ms |
472 KB |
Moves are not sorted in chronological order. |
6 |
Incorrect |
27 ms |
596 KB |
Moves are not sorted in chronological order. |
7 |
Incorrect |
127 ms |
1128 KB |
Moves are not sorted in chronological order. |
8 |
Incorrect |
392 ms |
2392 KB |
Moves are not sorted in chronological order. |
9 |
Execution timed out |
1089 ms |
2204 KB |
Time limit exceeded |
10 |
Incorrect |
74 ms |
4940 KB |
Moves are not sorted in chronological order. |