結果

問題 No.1508 Avoid being hit
ユーザー yuto1115yuto1115
提出日時 2021-05-12 22:55:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 50 ms / 3,000 ms
コード長 6,081 bytes
コンパイル時間 2,572 ms
コンパイル使用メモリ 215,572 KB
実行使用メモリ 9,984 KB
最終ジャッジ日時 2024-10-02 07:06:42
合計ジャッジ時間 6,220 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
8,064 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 23 ms
8,704 KB
testcase_17 AC 15 ms
6,528 KB
testcase_18 AC 11 ms
5,632 KB
testcase_19 AC 20 ms
7,936 KB
testcase_20 AC 28 ms
9,472 KB
testcase_21 AC 19 ms
7,552 KB
testcase_22 AC 24 ms
8,448 KB
testcase_23 AC 25 ms
8,960 KB
testcase_24 AC 45 ms
9,984 KB
testcase_25 AC 41 ms
9,344 KB
testcase_26 AC 5 ms
5,248 KB
testcase_27 AC 22 ms
6,144 KB
testcase_28 AC 22 ms
6,272 KB
testcase_29 AC 43 ms
9,472 KB
testcase_30 AC 25 ms
6,528 KB
testcase_31 AC 39 ms
8,704 KB
testcase_32 AC 42 ms
9,088 KB
testcase_33 AC 13 ms
5,248 KB
testcase_34 AC 40 ms
8,704 KB
testcase_35 AC 6 ms
5,248 KB
testcase_36 AC 24 ms
6,400 KB
testcase_37 AC 12 ms
5,248 KB
testcase_38 AC 32 ms
7,552 KB
testcase_39 AC 22 ms
6,016 KB
testcase_40 AC 42 ms
8,960 KB
testcase_41 AC 24 ms
6,528 KB
testcase_42 AC 42 ms
8,832 KB
testcase_43 AC 50 ms
9,984 KB
testcase_44 AC 2 ms
5,248 KB
testcase_45 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(i, n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--)
#define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)
#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define SUM(a) accumulate(all(a),0LL)
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define popcount(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vp = vector<P>;
using vvp = vector<vp>;

template<class S, class T>
istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }

template<class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '{' << p.first << ", " << p.second << '}'; }

template<class S, class T, class U>
istream &operator>>(istream &is, tuple<S, T, U> &t) { return is >> get<0>(t) >> get<1>(t) >> get<2>(t); }

template<class S, class T, class U>
ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {
    return os << '{' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << '}';
}

template<class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &t:v) { is >> t; }
    return is;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '[';
    rep(i, v.size())os << v[i] << (i == int(v.size() - 1) ? "" : ", ");
    return os << ']';
}

template<class T>
void vecout(const vector<T> &v, char div = '\n') {
    rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div);
}

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

void scan() {}

template<class Head, class... Tail>
void scan(Head &head, Tail &... tail) {
    cin >> head;
    scan(tail...);
}

template<class T>
void print(const T &t) { cout << t << '\n'; }

template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail) {
    cout << head << ' ';
    print(tail...);
}

template<class... T>
void fin(const T &... a) {
    print(a...);
    exit(0);
}

struct Init_io {
    Init_io() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << boolalpha << fixed << setprecision(15);
        cerr << boolalpha << fixed << setprecision(15);
    }
} init_io;

const string yes[] = {"no", "yes"};
const string Yes[] = {"No", "Yes"};
const string YES[] = {"NO", "YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;

vvi graph(int n, int m, bool directed = false, int origin = 1) {
    vvi G(n);
    rep(_, m) {
        INT(u, v);
        u -= origin, v -= origin;
        G[u].pb(v);
        if (!directed) G[v].pb(u);
    }
    return G;
}

template<class T>
vector<vector<pair<int, T>>> weighted_graph(int n, int m, bool directed = false, int origin = 1) {
    vector<vector<pair<int, T>>> G(n);
    rep(_, m) {
        int u, v;
        T w;
        scan(u, v, w);
        u -= origin, v -= origin;
        G[u].eb(v, w);
        if (!directed) G[v].pb(u, w);
    }
    return G;
}

int main() {
    INT(n, q);
    vi a(q), b(q);
    cin >> a >> b;
    vvp ok(q + 1);
    ok[q].eb(1, n);
    rrep(i, q) {
        if (a[i] > b[i]) swap(a[i], b[i]);
        vp push;
        for (auto[l, r] : ok[i + 1]) {
            l = max(l - 1, 1);
            r = min(r + 1, n);
            if (l <= a[i] and a[i] <= r) {
                if (l <= b[i] and b[i] <= r) {
                    if (l < a[i]) push.eb(l, a[i] - 1);
                    if (a[i] + 1 < b[i]) push.eb(a[i] + 1, b[i] - 1);
                    if (b[i] < r) push.eb(b[i] + 1, r);
                } else {
                    if (l < a[i]) push.eb(l, a[i] - 1);
                    if (a[i] < r) push.eb(a[i] + 1, r);
                }
            } else {
                if (l <= b[i] and b[i] <= r) {
                    if (l < b[i]) push.eb(l, b[i] - 1);
                    if (b[i] < r) push.eb(b[i] + 1, r);
                } else {
                    push.eb(l, r);
                }
            }
        }
        for (auto[l, r] : push) {
            if (!ok[i].empty() and ok[i].back().second + 1 >= l) ok[i].back().second = r;
            else ok[i].eb(l, r);
        }
        debug(i, ok[i]);
    }
    if (ok[0].empty()) fin("NO");
    print("YES");
    int pos = ok[0][0].first;
    rep(_, 2) print(pos);
    rep(i, 1, q) {
        int nx = -1;
        rep(j, pos - 1, pos + 2) {
            auto it = upper_bound(all(ok[i]), P(j, inf));
            if (it == ok[i].begin()) continue;
            it--;
            if (it->second >= j) {
                nx = j;
                break;
            }
        }
        assert(nx != -1);
        print(nx);
        pos = nx;
    }
}
0