oj.uz

Submission #849151

# Submission time Handle Problem Language Result Execution time Memory
849151 2023-09-14T07:24:38 Z TB_ Jetpack (COCI16_jetpack) C++17
80 / 80
 13 ms 15316 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

vector<string> grid(11);
int n;

int memo[12][100001];
vi res;

bool dfs(pii pos){
    if(pos.S == n) return 1;
    if(grid[pos.F][pos.S] == 'X') return 0;
    if(memo[pos.F][pos.S]) return 0;
    memo[pos.F][pos.S] = 1;

    if(dfs({max(0, pos.F-1), pos.S+1})){
        res.pb(0);
        grid[pos.F][pos.S] = '#';
        return 1;
    }
    if(dfs({min(9, pos.F+1), pos.S+1})){
        res.pb(1);
        grid[pos.F][pos.S] = '#';
        return 1;
    }
    return 0;
}

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    fo(i, 10) cin >> grid[9-i];
    dfs({0, 0});

    int start = INF;
    vpl ans;
    reverse(all(res));
    res.pb(0);
    fo(i, n){
        if(start>i && res[i]) start = i;
        if(start<i && !res[i]){
            ans.pb(mp(start, i-start));
            start = INF;
        }
    }
    
    cout << ans.size() << "\n";
    fo(i, ans.size()) cout << ans[i].F << " " << ans[i].S << "\n";

    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 4 ms 3288 KB Output is correct
8 Correct 6 ms 7452 KB Output is correct
9 Correct 9 ms 11092 KB Output is correct
10 Correct 13 ms 15316 KB Output is correct