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

提出ソース

結果

問題	No.2667 Constrained Permutation
ユーザー	dyktr_06
提出日時	2024-03-08 22:34:47
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,921 bytes
コンパイル時間	2,681 ms
コンパイル使用メモリ	222,736 KB
実行使用メモリ	31,360 KB
最終ジャッジ日時	2024-09-29 20:03:56
合計ジャッジ時間	10,129 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	36 ms 6,816 KB
testcase_29	AC	34 ms 6,816 KB
testcase_30	AC	38 ms 6,816 KB
testcase_31	AC	24 ms 6,820 KB
testcase_32	AC	7 ms 6,820 KB
testcase_33	AC	215 ms 23,168 KB
testcase_34	AC	97 ms 14,336 KB
testcase_35	AC	115 ms 15,872 KB
testcase_36	AC	110 ms 15,104 KB
testcase_37	AC	127 ms 16,896 KB
testcase_38	WA	-
testcase_39	WA	-
testcase_40	AC	91 ms 12,288 KB
testcase_41	AC	164 ms 17,920 KB
testcase_42	AC	478 ms 10,324 KB
testcase_43	AC	658 ms 13,208 KB
testcase_44	WA	-
testcase_45	WA	-

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

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
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 T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; 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 S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll n;
vll l, r;

void input(){
    in(n);
    l.resize(n);
    r.resize(n);
    rep(i, n) in(l[i], r[i]);
}

void solve(){
    ll mn = min(l), mx = max(r) - (n - 1);
    rep(i, n){
        chmax(mn, l[i] - (n - 1));
        chmin(mx, r[i] + (n - 1));
    }
    if(mn > mx){
        out(0);
        return;
    }
    map<ll, vll> mp;
    rep(i, n){
        mp[l[i]].push_back(r[i]);
    }

    auto check = [&](ll x){
        priority_queue<ll, vll, greater<>> q;
        rep(i, n){
            if(l[i] <= x && x <= r[i]){
                q.push(r[i]);
            }
        }

        rep(i, x, x + n){
            if(q.empty()){
                return false;
            }
            if(q.top() < i){
                return false;
            }
            q.pop();
            if(mp.count(i + 1)){
                for(auto x : mp[i + 1]){
                    q.push(x);
                }
            }
        }
        return true;
    };
    vector<P> p(n);
    rep(i, n){
        p[i] = {r[i], l[i]};
    }
    Sort(p);
    ll resl = p[0].second, resr = p[0].first;
    rep(i, 1, n){
        auto [pr, pl] = p[i];
        chmax(resl, pl - i);
        chmin(resr, pr - i);
    }
    if(resl > resr){
        out(0);
        return;
    }
    
    ll okl = resr, okr = resr;
    {
        ll ng = 0;
        while(abs(okl - ng) > 1){
            ll mid = (okl + ng) / 2;
            if(check(mid)){
                okl = mid;
            }else{
                ng = mid;
            }
        }
    }
    {
        ll ng = 1e9 + 1;
        while(abs(okr - ng) > 1){
            ll mid = (okr + ng) / 2;
            if(check(mid)){
                okr = mid;
            }else{
                ng = mid;
            }
        }
    }
    out(okr - okl + 1);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード