Submission #105944

#TimeUsernameProblemLanguageResultExecution timeMemory
105944leonardaJetpack (COCI16_jetpack)C++14
80 / 80
77 ms6160 KiB
#include<bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define F first #define S second typedef pair<int, int> pi; typedef long long int lint; const int inf = 0x3f3f3f3f; const int maxn = 1e5 + 10; int n; char c[13][maxn]; vector<int> v; bool memo[13][maxn]; bool jetpack(int x, int y) { if(c[x][y] == 'X' or memo[x][y]) return 0; if(y == n - 1) return 1; memo[x][y] = 1; if(jetpack(min(9, x + 1), y + 1)) return 1; if(jetpack(max(0, x - 1), y + 1)) { v.pb(y); return 1; } return 0; } int main () { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for(int i = 0; i < 10; ++i) for(int j = 0; j < n; ++j) cin >> c[i][j]; assert(jetpack(9, 0) == 1); cout << v.size() << endl; for(int i = v.size() - 1; i >= 0; --i) cout << v[i] << " " << 1 << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...