Submission #714430

#	Time	Username	Problem	Language	Result	Execution time	Memory
714430		vjudge1	Art Collections (BOI22_art)	C++17	100 / 100	1629 ms	63644 KiB

art

#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) R, ans;
mm(vv(int), ll) mp;
void solve(ll l, ll r)
{
    if (l >= r)
        return;
    if (l + 1 == r)
    {
        ll val;
        if (!mp.count(ans))
            mp[ans] = publish(ans);
        val = mp[ans];
        swap(ans[l], ans[l + 1]);
        if (!mp.count(ans))
            mp[ans] = publish(ans);
        if (mp[ans] >= val)
            swap(ans[l], ans[l + 1]);
        return;
    }
    ll mid = (l + r) >> 1, val;
    solve(l, mid);
    solve(mid + 1, r);
    if (!mp.count(ans))
        mp[ans] = publish(ans);
    val = mp[ans];

}
void solve(int n)
{
    for (ll i = 0; i < n; i++)
        R.pb(i + 1);
    ans.resize(n, 0);
    for (ll i = 1; i < n; i++)
    {
        if (!mp.count(R))
            mp[R] = publish(R);
        ll val = mp[R];
        R.pb(R.front());
        R.erase(R.begin());
        if (!mp.count(R))
            mp[R] = publish(R);
        ll x = mp[R] - val;
        ans[n - ((n - 1 + x) >> 1) - 1] = i;
    }
    ll ind[n + 1];
    memset(ind, -1, sizeof(ind));
    for (ll i = 0; i < n; i++)
        ind[ans[i]] = i;
    ll idx;
    for (idx = 1; idx <= n; idx++)
        if (ind[idx] == -1)
            break;
    ans[ind[0]] = idx;
    answer(ans);
}
/*

*/
// 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";
// }

Compilation message (stderr)

art.cpp: In function 'void solve(long long int, long long int)':
art.cpp:64:28: warning: variable 'val' set but not used [-Wunused-but-set-variable]
   64 |     ll mid = (l + r) >> 1, val;
      |                            ^~~
interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30