oj.uz

Submission #714337

# Submission time Handle Problem Language Result Execution time Memory
714337 2023-03-24T09:06:04 Z vjudge1 Art Collections (BOI22_art) C++17
5 / 100
 54 ms 208 KB 
#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;
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);
}
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), rng);
    }
}
/*

*/
// 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

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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 20 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 20 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 54 ms 208 KB Security violation!
10 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 20 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 54 ms 208 KB Security violation!
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 20 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 54 ms 208 KB Security violation!
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 20 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 54 ms 208 KB Security violation!
10 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 20 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 54 ms 208 KB Security violation!
10 Halted 0 ms 0 KB -