結果

問題 No.2029 Swap Min Max Min
ユーザー ecottea
提出日時 2022-08-05 23:55:03
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 9,819 bytes
コンパイル時間 4,059 ms
コンパイル使用メモリ 236,568 KB
実行使用メモリ 7,176 KB
最終ジャッジ日時 2024-09-15 21:50:41
合計ジャッジ時間 46,279 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 35 WA * 5 TLE * 2
権限があれば一括ダウンロードができます

ソースコード

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

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = 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 vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
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 = 4004004004004004004LL;
double EPS = 1e-16;
//
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 < (1 << int(d)); ++set) // d
#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);} //
//
template <class T> inline ll pow(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, 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; }
// Visual Studio
#ifdef _MSC_VER
#include "local.hpp"
// gcc
#else
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 gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
#endif //
//--------------AtCoder --------------
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
//----------------------------------------
// swap O(n)
/*
* s[0..n) swap t[0..n)
* swap INFL
*/
ll swap_distance(const string& s, const string& t, char one = '1') {
// verify : https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_b
int n = sz(s);
if (sz(t) != n) return INFL;
// a[i] : s[0..n) i 1
// b[i] : t[0..n) i 1
vi a, b;
rep(i, n) {
if (s[i] == one) a.push_back(i);
if (t[i] == one) b.push_back(i);
}
int m = sz(a);
if (sz(b) != m) return INFL;
ll res = 0;
// 1 swap 1
rep(j, m) res += abs(a[j] - b[j]);
return res;
}
pil naive(int n, vi a) {
int x = n / 2;
string s;
rep(i, n) s += '0' + (a[i] > x);
ll y = INFL;
if (n & 1) {
string t;
rep(i, n) t += '1' - i % 2;
y = swap_distance(s, t);
}
else {
for (int m = 0; m <= n; m += 2) {
string t;
rep(i, n) t += '1' - ((i % 2) ^ (i >= m));
dump(t);
chmin(y, swap_distance(s, t));
}
}
return make_pair(x, y);
}
pil WA(int n, vi a) {
int x = n / 2;
string s;
rep(i, n) s += '0' + (a[i] > x);
string t;
if (n & 1) {
rep(i, n) t += '1' - i % 2;
}
else {
if (s[0] == '0' && s[n - 1] == '1') {
rep(i, n) t += '0' + i % 2;
}
else if (s[0] == '1' && s[n - 1] == '0') {
rep(i, n) t += '1' - i % 2;
}
else {
bool fast = false; int ib = -1;
int m = x / 2 * 2; // even
rep(i, n) {
if (i & 1) {
if (s[i] == '1' && (fast || s[n - 1 - i] == '0')) {
if (fast) {
if (ib & 1) m = n - 1 - ib;
else m = n - ib;
}
else m = n - 1 - i;
break;
}
if (s[n - 1 - i] == '1' && (fast || s[i] == '0')) {
if (fast) {
if (ib & 1) m = ib - 1;
else m = ib;
}
else m = i - 1;
break;
}
if (s[i] == '1' && s[n - 1 - i] == '1') {
fast = true;
ib = i;
}
}
else {
if (s[i] == '0' && (fast || s[n - 1 - i] == '1')) {
if (fast) {
if (ib & 1) m = n - 1 - ib;
else m = n - ib;
}
else m = n - i;
break;
}
if (s[n - 1 - i] == '0' && (fast || s[i] == '1')) {
if (fast) {
if (ib & 1) m = ib - 1;
else m = ib;
}
else m = i;
break;
}
if (s[i] == '0' && s[n - 1 - i] == '0') {
fast = true;
ib = i;
}
}
}
rep(i, n) t += '0' + (i % 2) ^ (i < m);
}
}
dump(s); dump(t);
ll y = swap_distance(s, t);
return make_pair(x, y);
}
//O(log(r - l))
/*
* - → 0 → + f(x) (l, r) x
* x
*/
template <class T> ll random_ternary_search_lc(ll l, ll r, function<T(ll)>& f) {
static bool first_call = true;
mt19937 mt;
uniform_int_distribution<ll> rnd;
if (first_call) {
first_call = false;
mt.seed((int)time(NULL));
rnd = uniform_int_distribution<ll>(0, INFL);
}
while (r - l > 2) {
ll m1 = l + 1 + rnd(mt) % (r - l - 1);
ll m2 = l + 1 + rnd(mt) % (r - l - 1);
if (m1 > m2) swap(m1, m2);
if (f(m1) > f(m2)) l = m1;
else r = m2;
}
return l + 1;
/* f
function<ll(ll)> f = [&](ll x) {
return x;
};
*/
}
pil solve(int n, vi a) {
auto start = chrono::system_clock::now();
int x = n / 2;
string s;
rep(i, n) s += '0' + (a[i] > x);
ll y = INFL;
if (n & 1) {
string t;
rep(i, n) t += '1' - i % 2;
y = swap_distance(s, t);
}
else {
while (1) {
function<ll(ll)> f = [&](ll hm) {
string t;
rep(i, n) t += '1' - ((i % 2) ^ (i >= hm * 2));
return swap_distance(s, t);
};
ll hm = random_ternary_search_lc(-1LL, n / 2 + 1LL, f);
string t;
rep(i, n) t += '1' - ((i % 2) ^ (i >= hm * 2));
if(chmin(y, swap_distance(s, t))) dump(y);
auto now = chrono::system_clock::now();
auto msec = chrono::duration_cast<std::chrono::milliseconds>(now - start).count();
if (msec >= 1850) break;
}
}
return make_pair(x, y);
}
void find_bug() {
#ifdef _MSC_VER
//
mt19937_64 mt;
mt.seed((int)time(NULL));
uniform_int_distribution<ll> rnd(0LL, 1LL << 62);
mute_dump = true;
int n = 6;
vi a(n);
iota(all(a), 1);
repp(a) {
auto res_naive = naive(n, a);
auto res_solve = solve(n, a);
if (res_naive != res_solve) {
cout << "----------error!----------" << endl;
cout << "input:" << endl;
cout << a << endl;
cout << "results:" << endl;
cout << res_naive << endl;
cout << res_solve << endl;
cout << "--------------------------" << endl;
}
}
mute_dump = false;
#endif
}
/*
----------error!----------
input:
1 4 2 5 6 3
results:
(3,1)
(3,3)
--------------------------
*/
int main() {
input_from_file("input.txt");
// output_to_file("output.txt");
// find_bug(); return 0;
int n;
cin >> n;
vi a(n);
cin >> a;
dump(naive(n, a));
int x; ll y;
tie(x, y) = solve(n, a);
cout << x << " " << y << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0