結果

問題 No.2667 Constrained Permutation
ユーザー ecotteaecottea
提出日時 2024-03-08 23:26:24
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 211 ms / 2,000 ms
コード長 8,175 bytes
コンパイル時間 4,347 ms
コンパイル使用メモリ 277,988 KB
実行使用メモリ 22,044 KB
最終ジャッジ日時 2024-09-29 20:44:17
合計ジャッジ時間 10,098 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
ll naive(int n, vl l, vl r) {
vi p(n);
iota(all(p), 0);
ll res = 0;
repi(k, -10, 10) {
bool ok = false;
repp(p) {
bool ok2 = true;
rep(i, n) {
if (l[i] <= k + p[i] && k + p[i] <= r[i]) {
;
}
else {
ok2 = false;
break;
}
}
if (ok2) {
ok = true;
break;
}
}
if (ok) res++;
}
return res;
}
ll WA(int n, vl l, vl r) {
vector<pll> lr(n);
rep(i, n) lr[i] = { l[i], r[i] };
sort(all(lr));
rep(i, n) tie(l[i], r[i]) = lr[i];
dump(l); dump(r);
ll x_min = -INFL, x_max = INFL;
rep(i, n) {
chmax(x_min, l[i] - i);
chmin(x_max, r[i] - i);
}
dump(x_min, x_max);
if (x_min > x_max) return 0;
vector<pll> rl(n);
rep(i, n) rl[i] = { r[i], l[i] };
sort(all(rl));
rep(i, n) tie(r[i], l[i]) = rl[i];
dump(l); dump(r);
ll y_min = -INFL, y_max = INFL;
rep(i, n) {
chmax(y_min, l[i] - i);
chmin(y_max, r[i] - i);
}
dump(y_min, y_max);
if (y_min > y_max) return 0;
return max(y_max - x_min + 1, 0LL);
}
ll solve(int n, vl l, vl r) {
ll x0 = -1;
{
vector<pll> lr(n);
rep(i, n) lr[i] = { l[i], r[i] };
sort(all(lr));
rep(i, n) tie(l[i], r[i]) = lr[i];
dump(l); dump(r);
ll x = -INFL;
rep(i, n) {
chmax(x, l[i] - i);
}
dump(x);
set<ll, greater<ll>> rem;
rep(i, n) rem.insert(i);
repir(i, n - 1, 0) {
auto it = rem.lower_bound(r[i] - x);
if (it == rem.end()) return 0;
ll v = *it;
if (v < l[i] - x) return 0;
rem.erase(it);
}
x0 = x;
}
rep(i, n) l[i] *= -1;
rep(i, n) r[i] *= -1;
swap(l, r);
ll x1 = -1;
{
vector<pll> lr(n);
rep(i, n) lr[i] = { l[i], r[i] };
sort(all(lr));
rep(i, n) tie(l[i], r[i]) = lr[i];
dump(l); dump(r);
ll x = -INFL;
rep(i, n) {
chmax(x, l[i] - i);
}
dump(x);
set<ll, greater<ll>> rem;
rep(i, n) rem.insert(i);
repir(i, n - 1, 0) {
auto it = rem.lower_bound(r[i] - x);
if (it == rem.end()) return 0;
ll v = *it;
if (v < l[i] - x) return 0;
rem.erase(it);
}
x1 = -x - n + 1;
}
return max(x1 - x0 + 1, 0LL);
}
void bug_find() {
#ifdef _MSC_VER
//
mute_dump = true;
mt19937_64 mt;
mt.seed((int)time(NULL));
uniform_int_distribution<ll> rnd(0LL, 1LL << 60);
rep(hoge, 100) {
int n = rnd(mt) % 7 + 1;
vl l(n), r(n);
rep(i, n) {
l[i] = rnd(mt) % 10;
r[i] = rnd(mt) % 10;
if (l[i] > r[i]) swap(l[i], r[i]);
}
auto res_naive = naive(n, l, r);
auto res_solve = solve(n, l, r);
if (res_naive != res_solve) {
cout << "----------error!----------" << endl;
cout << "input:" << endl;
cout << n << endl;
cout << l << endl;
cout << r << endl;
cout << "results:" << endl;
cout << res_naive << endl;
cout << res_solve << endl;
cout << "--------------------------" << endl;
}
}
mute_dump = false;
exit(0);
#endif
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
bug_find();
int n;
cin >> n;
vl l(n), r(n);
rep(i, n) cin >> l[i] >> r[i];
dump(naive(n, l, r)); dump("----");
EXIT(solve(n, l, r));
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0