#657942 (C++17) No.1508 Avoid being hit

提出ソース

結果

問題	No.1508 Avoid being hit
ユーザー	rniya
提出日時	2021-05-15 20:10:40
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	27 ms / 3,000 ms
コード長	5,202 bytes
コンパイル時間	2,375 ms
コンパイル使用メモリ	198,964 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-04-14 10:21:13
合計ジャッジ時間	6,196 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	23 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	16 ms 6,944 KB
testcase_17	AC	10 ms 6,940 KB
testcase_18	AC	9 ms 6,940 KB
testcase_19	AC	13 ms 6,944 KB
testcase_20	AC	20 ms 6,944 KB
testcase_21	AC	14 ms 6,940 KB
testcase_22	AC	16 ms 6,944 KB
testcase_23	AC	18 ms 6,944 KB
testcase_24	AC	24 ms 6,940 KB
testcase_25	AC	22 ms 6,940 KB
testcase_26	AC	4 ms 6,944 KB
testcase_27	AC	12 ms 6,944 KB
testcase_28	AC	12 ms 6,940 KB
testcase_29	AC	22 ms 6,940 KB
testcase_30	AC	13 ms 6,940 KB
testcase_31	AC	20 ms 6,940 KB
testcase_32	AC	21 ms 6,940 KB
testcase_33	AC	7 ms 6,940 KB
testcase_34	AC	22 ms 6,940 KB
testcase_35	AC	3 ms 6,944 KB
testcase_36	AC	13 ms 6,944 KB
testcase_37	AC	7 ms 6,944 KB
testcase_38	AC	18 ms 6,944 KB
testcase_39	AC	12 ms 6,940 KB
testcase_40	AC	23 ms 6,940 KB
testcase_41	AC	14 ms 6,940 KB
testcase_42	AC	23 ms 6,940 KB
testcase_43	AC	27 ms 6,940 KB
testcase_44	AC	2 ms 6,940 KB
testcase_45	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, Q;
    cin >> N >> Q;
    vector<int> A(Q), B(Q);
    for (int& x : A) cin >> x, x--;
    for (int& x : B) cin >> x, x--;

    vector<int> L(Q + 1), R(Q + 1);
    L[0] = 0, R[0] = N;

    for (int i = 0; i < Q; i++) {
        if (A[i] > B[i]) swap(A[i], B[i]);
        int l = L[i] - 1, r = R[i] + 1;

        while (l < 0 || l == A[i] || l == B[i]) {
            l++;
            if (l >= N) break;
        }
        while (r > N || r == A[i] + 1 || r == B[i] + 1) {
            r--;
            if (r == 0) break;
        }

        if (l >= r) {
            cout << "NO" << '\n';
            return 0;
        }
        L[i + 1] = l, R[i + 1] = r;
    }

    vector<int> ans;
    ans.emplace_back(L[Q]);
    for (int i = Q - 1; i >= 0; i--) {
        int cur = ans.back(), nxt = -1;
        for (int pre : {cur - 1, cur, cur + 1}) {
            if (pre < L[i] || R[i] <= pre) continue;
            if (i && (pre == A[i - 1] || pre == B[i - 1])) continue;
            nxt = pre;
        }
        ans.emplace_back(nxt);
    }
    reverse(ans.begin(), ans.end());

    cout << "YES" << '\n';
    for (int& x : ans) cout << x + 1 << '\n';
    return 0;
}

yukicoder

結果

テストケース

ソースコード