제출 #241364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241364		ne4eHbKa	Jetpack (COCI16_jetpack)	C++17	80 / 80	60 ms	4980 KiB

jetpack

//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 2e5 + 5;
const int m = 10;

bool f[m][N];

void solve() {
    int n; cin >> n;
    bool a[m][n];
    for(int i = 0; i < m; ++i)
        for(int j = 0; j < n; ++j) {
            char c; cin >> c;
            a[i][j] = c == 'X';
        }
    clr(f, 0);
    f[m - 1][0] = true;
    for(int i = 1; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            if(a[j][i]) continue;
            if(j && f[j - 1][i - 1] ||
               j + 1 < m && f[j + 1][i - 1] ||
               j == 0 && f[j][i - 1] ||
               j == m - 1 && f[j][i - 1])
                    f[j][i] = true;
        }
    }
    int t = 0;
    for(; !f[t][n - 1]; ++t);
    vector<int> e(1, t);
    for(int i = n - 2; ~i; --i) {
        if(t == 0 && f[t][i]) {
            t;
        } ef(t == m - 1 && f[t][i]) {
            t;
        } ef(t + 1 < m && f[t + 1][i]) {
            ++t;
        } ef(t && f[t - 1][i]) {
            --t;
        }
        e.push_back(t);
    }
    reverse(bnd(e));
    int pr = -1, T = 0;
    vector<pii> ans;
    for(int i : e) {
        if(T) {
            if(i < pr || !max(i, pr)) {
                if(!ans.empty() && ans.back().sd + ans.back().ft + 1 == T) {
                    ans.back().sd++;
                } else {
                    ans.pb({T - 1, 1});
                }
            }
        }
        ++T;
        pr = i;
    }
    cout << sz(ans) << endl;
    for(pii i : ans) cout << i.ft _ i.sd << endl;
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
		cerr << "case #" << test << endl;
        solve();
        cerr << endl;
    }
#else
//    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

jetpack.cpp: In function 'int m_bpow(ll, ll)':
jetpack.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
                       ~~~^~~~~~~~~~~~~~~~~~~~
jetpack.cpp: In function 'void solve()':
jetpack.cpp:81:18: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
             if(j && f[j - 1][i - 1] ||
                ~~^~~~~~~~~~~~~~~~~~
jetpack.cpp:83:23: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
                j == 0 && f[j][i - 1] ||
                ~~~~~~~^~~~~~~~~~~~~~
jetpack.cpp:84:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
                j == m - 1 && f[j][i - 1])
                ~~~~~~~~~~~^~~~~~~~~~~~~~
jetpack.cpp:93:14: warning: statement has no effect [-Wunused-value]
             t;
              ^
jetpack.cpp:95:14: warning: statement has no effect [-Wunused-value]
             t;
              ^

• Subtask 1: 80 / 80