#958739 (C++17) No.2667 Constrained Permutation

提出ソース

結果

問題	No.2667 Constrained Permutation
ユーザー	otera
提出日時	2024-03-08 22:45:55
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,781 ms / 2,000 ms
コード長	7,861 bytes
コンパイル時間	2,371 ms
コンパイル使用メモリ	212,872 KB
実行使用メモリ	15,448 KB
最終ジャッジ日時	2024-03-08 22:46:19
合計ジャッジ時間	22,259 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	3 ms 6,676 KB
testcase_03	AC	4 ms 6,676 KB
testcase_04	AC	5 ms 6,676 KB
testcase_05	AC	3 ms 6,676 KB
testcase_06	AC	4 ms 6,676 KB
testcase_07	AC	2 ms 6,676 KB
testcase_08	AC	5 ms 6,676 KB
testcase_09	AC	4 ms 6,676 KB
testcase_10	AC	3 ms 6,676 KB
testcase_11	AC	3 ms 6,676 KB
testcase_12	AC	357 ms 7,404 KB
testcase_13	AC	10 ms 6,676 KB
testcase_14	AC	1,203 ms 13,296 KB
testcase_15	AC	522 ms 11,504 KB
testcase_16	AC	267 ms 10,120 KB
testcase_17	AC	72 ms 6,676 KB
testcase_18	AC	1,394 ms 14,424 KB
testcase_19	AC	1,645 ms 15,448 KB
testcase_20	AC	1,781 ms 13,656 KB
testcase_21	AC	707 ms 14,296 KB
testcase_22	AC	684 ms 13,656 KB
testcase_23	AC	632 ms 13,656 KB
testcase_24	AC	512 ms 7,812 KB
testcase_25	AC	1,027 ms 11,832 KB
testcase_26	AC	1,454 ms 13,272 KB
testcase_27	AC	1,161 ms 13,272 KB
testcase_28	AC	78 ms 11,208 KB
testcase_29	AC	73 ms 10,896 KB
testcase_30	AC	82 ms 11,680 KB
testcase_31	AC	52 ms 8,156 KB
testcase_32	AC	12 ms 6,676 KB
testcase_33	AC	611 ms 13,492 KB
testcase_34	AC	247 ms 9,108 KB
testcase_35	AC	292 ms 9,712 KB
testcase_36	AC	284 ms 9,280 KB
testcase_37	AC	339 ms 10,168 KB
testcase_38	AC	414 ms 11,328 KB
testcase_39	AC	6 ms 6,676 KB
testcase_40	AC	216 ms 9,228 KB
testcase_41	AC	418 ms 12,496 KB
testcase_42	AC	322 ms 9,768 KB
testcase_43	AC	510 ms 12,568 KB
testcase_44	AC	463 ms 7,532 KB
testcase_45	AC	13 ms 6,676 KB

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

ソースコード

raw source code

/**
 *    author:  otera
 *    created: 03.08.2024 21:39:35
**/
// l_i - k < = p_i <= r_i - k
// 値が小さい順にみると、区間スケジューリングみたいな感じか
//　つまり、各kに対して、\tilde{O}(n)で解ける
// okなkは区間になるのでは？
// 二分探索で上界、下界を求めたい？

#include<bits/stdc++.h>

namespace otera {}
using namespace std;
using namespace otera;

struct io_setup {
    io_setup(int precision = 20) {
        ios::sync_with_stdio(false);
        cin.tie(0);
        cout << fixed << setprecision(precision);
    }
} io_setup_ {};

// #define int long long

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
#define repa(i, n) for(int i = 0; i < (n); ++ i)
#define repb(i, a, b) for(int i = (a); i < (b); ++ i)
#define repc(i, a, b, c) for(int i = (a); i < (b); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)
#define rep1a(i, n) for(int i = 1; i <= (n); ++ i)
#define rep1b(i, a, b) for(int i = (a); i <= (b); ++ i)
#define rep1c(i, a, b, c) for(int i = (a); i <= (b); i += (c))
#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)
#define rev_repa(i, n) for(int i=(n)-1;i>=0;i--)
#define rev_repb(i, a, b) for(int i=(b)-1;i>=(a);i--)
#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)
#define rev_rep1a(i, n) for(int i=(n);i>=1;i--)
#define rev_rep1b(i, a, b) for(int i=(b);i>=(a);i--)
#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)
#define for_subset(t, s) for(ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define mkp make_pair
#define mkt make_tuple
#define fr first
#define sc second
#define all(c) std::begin(c), std::end(c)
#define rall(c) std::rbegin(c), std::rend(c)
#define lb(c, x) distance(std::begin(c), lower_bound(all(c), (x)))
#define ub(c, x) distance(std::begin(c), upper_bound(all(c), (x)))
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));(a).erase(unique(all(a)),std::end(a))
#define si(c) (int)(c).size()
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
#define kth_bit(x, k) ((x>>k)&1)
#define unless(A) if(!(A))
#define elif else if
ll modulo(ll n, ll d){ return (n % d + d) % d; };
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> constexpr inline int pow_m1(T n) { return -(n & 1) | 1; }
template <typename T> constexpr inline T fld(const T x, const T y) { return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y; }
template <typename T> constexpr inline T cld(const T x, const T y) { return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y; }
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> using umap = unordered_map<T, U>;
template<class T> void scan(T& a){ cin >> a; }
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ cout << ' '; }
template<class T> void print(const T& a){ cout << a; }
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }
int out(){ cout << '\n'; return 0; }
template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...)
#define dump(...)
#endif

const int inf = 1e9 + 7;

void solve() {
    INT(n);
    vc<int> l(n), r(n);
    rep(i, n) {
        in(l[i], r[i]);
        -- l[i];
    }
    // [l[i], r[i])

    auto check = [&](int k) -> int {
        pqg<P> pque;
        vvc<int> g(n);
        rep(i, n) {
            if(l[i] - k < 0) {
                pque.emplace(r[i] - k, i);
            } else if(l[i] - k < n) {
                g[l[i] - k].eb(i);
            }
        }
        rep(i, n) {
            for(int id: g[i]) {
                pque.emplace(r[id] - k, id);
            }
            if(pque.empty()) return 1; 
            auto [val, id] = pque.top(); 
            pque.pop();
            unless(i < val) {
                return -1;
            }
        }
        return 0;
    };

    int le = -inf, ri = inf;
    bool flag = 0;
    int ok = -1;

    assert(check(le) == 1);
    assert(check(ri) == -1);

    while(ri - le > 1) {
        int mid = (le + ri) / 2;
        int val = check(mid);

        if(val == 0) {
            flag = 1;
            ok = mid;
            break;
        } else if(val == 1) {
            le = mid;
        } else {
            ri = mid;
        }
    }

    if(check(le) == 0) {
        flag = 1;
        ok = le;
    }
    if(check(ri) == 0) {
        flag = 1;
        ok = ri;
    }

    if(!flag) {
        out(0);
        return;
    }

    int ple = le, pri = ri;

    int mi = -1, ma = -1;

    {
        le = ple, ri = ok;
        while(ri - le > 1) {
            int mid = (le + ri) / 2;
            if(check(mid) == 0) ri = mid;
            else le = mid;
        }
        mi = ri;
    }

    {
        le = ok, ri = pri;
        while(ri - le > 1) {
            int mid = (le + ri) / 2;
            if(check(mid) == 0) le = mid;
            else ri = mid;
        }
        ma = le;
    }

    int ans = ma - mi + 1;
    out(ans);
}

signed main() {
    int testcase = 1;
    // in(testcase);
    while(testcase--) solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード