#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
#include <random>
#include <chrono>
#include <iomanip>
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};
const int R = 10 + 5;
const int C = 1e5 + 5;
int c;
int dp [R][C][2];
char g [R][C];
bool is_valid (int linha, int coluna) {
if (linha < 0 || linha >= 10) return false;
if (coluna >= c) return true;
return (g[linha][coluna] == '.');
}
bool dfs (int linha = 9, int coluna = 0, bool is_flying = 0) {
if (!is_valid(linha, coluna)) return false;
int &res = dp[linha][coluna][is_flying];
if (coluna >= c) return (res = true);
if (~res) return res;
res = false;
if (is_flying) {
res |= dfs (linha + 1, coluna + 1, 0);
if (linha - 1 >= 0) {
res |= dfs (linha - 1, coluna + 1, 1);
} else {
res |= dfs (linha, coluna + 1, 1);
}
} else {
res |= dfs (linha - 1, coluna + 1, 1);
if (linha + 1 < 10) {
res |= dfs (linha - 1, coluna + 1, 0);
} else {
res |= dfs (linha, coluna + 1, 0);
}
}
return res;
}
vpii ans;
void backtrack (int linha = 9, int coluna = 0, bool is_flying = 0, int last_flight = -1) {
if (coluna >= c) {
if (last_flight != -1 && last_flight < c) ans.eb(last_flight, coluna - last_flight);
return;
}
if (is_flying) {
if (linha + 1 < 10 && dp[linha + 1][coluna + 1][0] == true) {
ans.eb(last_flight, coluna - last_flight);
backtrack (linha + 1, coluna + 1, 0, -1);
return;
}
if (linha - 1 >= 0) {
backtrack (linha -1, coluna + 1, 1, last_flight);
return;
} else {
backtrack (linha, coluna + 1, 1, last_flight);
return;
}
} else {
if (linha - 1 >= 0 && dp[linha - 1][coluna + 1][1] == true) {
backtrack (linha - 1, coluna + 1, 1, coluna);
return;
}
if (linha + 1 < 10) {
backtrack (linha - 1, coluna + 1, 0, -1);
return;
} else {
backtrack (linha, coluna + 1, 0, -1);
return;
}
}
assert (1 == 0);
}
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> c;
F0R (i, 10) F0R (j, c) cin >> g[i][j];
memset (dp, -1, sizeof(dp));
dfs ();
backtrack ();
cout << sz(ans) << '\n';
GO (to, ans) cout << to.f << ' ' << to.s << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
12132 KB |
Output is correct |
| 2 |
Correct |
11 ms |
12160 KB |
Output is correct |
| 3 |
Incorrect |
11 ms |
12160 KB |
Crashed with an obstacle |
| 4 |
Incorrect |
11 ms |
12160 KB |
Crashed with an obstacle |
| 5 |
Incorrect |
12 ms |
12416 KB |
Crashed with an obstacle |
| 6 |
Incorrect |
12 ms |
12416 KB |
Crashed with an obstacle |
| 7 |
Incorrect |
16 ms |
13312 KB |
Crashed with an obstacle |
| 8 |
Incorrect |
19 ms |
14848 KB |
Crashed with an obstacle |
| 9 |
Incorrect |
22 ms |
16384 KB |
Crashed with an obstacle |
| 10 |
Incorrect |
27 ms |
18048 KB |
Crashed with an obstacle |
