| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 714338 | vjudge1 | Art Collections (BOI22_art) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "art.h"
/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vv(int) ans;
vv(int) us;
const ll mod = 1e9 + 7, mod1 = 998777773;
void dac(ll l, ll r)
{
if (l > r)
return;
ll mid = (l + r) >> 1, val = publish(ans), tmp = 0, best = mid;
vv(int) recover = ans;
for (int i : us)
{
if (i >= mid)
break;
swap(ans[i], ans[mid]);
tmp = publish(ans);
if (tmp < val)
val = tmp, best = i;
swap(ans[i], ans[mid]);
}
ans = recover;
for (int i : us)
{
if (i <= mid)
continue;
swap(ans[i], ans[mid]);
tmp = publish(ans);
if (tmp < val)
val = tmp, best = i;
swap(ans[i], ans[mid]);
}
for (ll i : ans)
cout << i << ' ';
cout << endl;
ans = recover;
swap(ans[mid], ans[best]);
cout << best << ' ' << mid << ' ' << l << ' ' << r << endl;
us.erase(find(allc(us), mid));
dac(l, mid - 1);
dac(mid + 1, r);
}
int random()
{
return (int)(rng() % mod * (rng() % mod1) % 998244353);
}
void solve(int n)
{
for (ll i = 0; i < n; i++)
us.pb(i), ans.pb(i + 1);
for (ll cur = 0; cur < 4000; cur++)
{
if (publish(ans) == 0)
{
answer(ans);
return;
}
shuffle(allc(ans), random);
}
}
/*
*/
// int main()
// {
// sync
// // precomp();
// ll t = 1;
// cin >> t;
// for (ll i = 1; i <= t; i++)
// // cout << "Case " << i << ": ",
// solve();
// cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
// }