제출 #559532

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
559532		kappa	Jetpack (COCI16_jetpack)	C++14	0 / 80	1096 ms	6084 KiB

jetpack

#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<ll> ans;

char d[15][maxn];

ll n;

ll dfs(ll x, ll 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(x + 1 >= 9 ? 9 : x + 1, y + 1)){
        return 1;
    }
    if(dfs(x - 1 <= 0 ? 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";
    }
}

• Subtask 1: 0 / 80