#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout<< *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=2e6+1;
const int M=1e9+7;
signed main(){
fast_io;
int n;
cin>>n;
vector<vector<char>>a(10,vector<char>(n));
for(int i=0;i<10;i++){
for(int j=0;j<n;j++) cin>>a[i][j];
}
vector<vector<bool>>used(10,vector<bool>(n,0));
vector<vector<int>>p(10,vector<int>(n,-1));
vector<vector<pii>>pd(10,vector<pii>(n));
queue<pii>q;
q.push({9,0});
while(!q.empty()){
auto c=q.front();
// debug()<<imie(c);
q.pop();
int nx=c.f,ny=c.s;
nx--,ny++;
nx=max(0,nx);ny=min(ny,n-1);
if(!used[nx][ny] && a[nx][ny]!='X'){
used[nx][ny]=1;
q.push({nx,ny});
p[nx][ny]=0;
pd[nx][ny]=c;
}
nx=c.f,ny=c.s;
nx++,ny++;
nx=min(9,nx);ny=min(ny,n-1);
if(!used[nx][ny] && a[nx][ny]!='X'){
used[nx][ny]=1;
q.push({nx,ny});
p[nx][ny]=1;
pd[nx][ny]=c;
}
}
for(int i=0;i<10;i++){
if(used[i][n-1]){
vector<pii>ans;
int cur=p[i][n-1],cnt=1;
// cout<<endl;
pii c={i,n-1};
while(c.f!=9 && c.s!=0){
// debug()<<imie(c);
if(cur!=p[c.f][c.s]){
ans.p_b({cur,cnt});
cnt=1;
cur=p[c.f][c.s];
}
else{
cnt++;
}
c=pd[c.f][c.s];
}
ans.p_b({cur,cnt});
int ps=0;
reverse(all(ans));
//cout<<sz(ans)<<endl;
vector<pii>ra;
for(int i=0;i<sz(ans);i++){
// cout<<ps<<' '<<ans[i]<<endl;
if(!ans[i].f){
/// cout<<ps<<' '<<ans[i].s<<endl;
ra.p_b({ps,ans[i].s});
}
ps+=ans[i].s;
}
cout<<sz(ra)<<endl;
for(auto &z : ra) cout<<z.f<<' '<<z.s<<endl;
exit(0);
}
}
return 0;
}
///stuff you should look for :
/*
6
abc
bc
c
a
da
cda
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* read the conditions carefully
* WRITE STUFF DOWN
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
384 KB |
Crashed with an obstacle |
| 3 |
Incorrect |
5 ms |
384 KB |
Crashed with an obstacle |
| 4 |
Incorrect |
5 ms |
512 KB |
Crashed with an obstacle |
| 5 |
Incorrect |
7 ms |
1024 KB |
Crashed with an obstacle |
| 6 |
Incorrect |
7 ms |
1152 KB |
Crashed with an obstacle |
| 7 |
Incorrect |
13 ms |
3328 KB |
Crashed with an obstacle |
| 8 |
Incorrect |
26 ms |
7364 KB |
Crashed with an obstacle |
| 9 |
Incorrect |
34 ms |
10980 KB |
Crashed with an obstacle |
| 10 |
Incorrect |
37 ms |
15096 KB |
Crashed with an obstacle |
