Submission #559537

#TimeUsernameProblemLanguageResultExecution timeMemory
559537kappaJetpack (COCI16_jetpack)C++14
72 / 80
1071 ms4964 KiB
#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()); cout << ans.size() << "\n"; for(auto i : ans){ cout << i << " 1\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...