Submission #727359

#	Time	Username	Problem	Language	Result	Execution time	Memory
727359		shadow_sami	Art Collections (BOI22_art)	C++17	0 / 100	1 ms	208 KiB

art

#include<bits/stdc++.h>
#include "art.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

// #ifndef ONLINE_JUDGE
// #define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
// #else
// #define debug(x)
// #endif

// void _printn(ll x){ cerr<<x<<" "; }
// void _printn(int x){ cerr<<x<<" "; }
// void _printn(ld x){ cerr<<x<<" "; }
// void _printn(double x){ cerr<<x<<" "; }
// void _printn(string x){ cerr<<x<<" "; }
// void _printn(char x){ cerr<<x<<" "; }
// void _printn(bool x){ cerr<<x<<" "; }
// template<class T,class V>void _printn(pair<T,V> vv);
// template<class T> void _printn(vector<T> vv);
// template<class T> void _printn(set<T> vv);
// template<class T,class V> void _printn(map<T,V> vv);
// template<class T> void _printn(multiset<T> vv);
// template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
// template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
// template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

// ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
// ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
// ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
// ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
// ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll prime;

// ll publish(vector<int> v){
//     ll pt;
//     cin>>pt;
//     return pt;
// }

// vi ve;
// void answer(vector<int> v){
//     fip(0,n-1){
//         if(v[i]!=ve[i]){
//             cout<<"NO\n";
//             return;
//         }
//     }
//     cout<<"YES"<<nli;
// }


void merge(ll l,ll r,vector<int> &aa,vector<int> &init){
    if(l==r)
        return;
    ll mid = l + (r-l) / 2;
    merge(l,mid,aa,init);
    merge(mid+1,r,aa,init);
    vector<int> v;
    ll ptr1,ptr2;
    ptr1 = l;
    ptr2 = mid+1;
    while(ptr1 < mid+1 && ptr2 < r + 1){
        swap(init[aa[ptr1]-1],init[aa[ptr2]-1]);
        tp = publish(init);
        swap(init[aa[ptr1]-1],init[aa[ptr2]-1]);
        if(tp<prime){
            v.push_back(aa[ptr2]);    
            ptr2++;
        }else{
            v.push_back(aa[ptr1]);
            ptr1++;
        }
    }
    while(ptr1<mid+1){
        v.push_back(aa[ptr1]);
        ptr1++;
    }
    while(ptr2<r+1){
        v.push_back(aa[ptr2]);
        ptr2++;
    }
    fip(0,r-l+1)
        aa[l+i] = v[i];
    return;
}

ll fincc(vector<int> &v2){
    ll pt;
    pt = publish(v2);
    return pt;
}

void solve(int k){
    vector<int> v2,vv;    
    fip(1,n+1){
        v2.push_back(i);
        vv.push_back(i);
    }
    
    prime  = fincc(v2);
    merge(0,k-1,v2,vv);
    vector<int> v = v2;
    answer(v);
    return ;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         n = 5;
//         ve = {5 , 4 , 3 , 2 , 1 };
//         debug(ve);
//         solve(n);
//         cout<<"OK";
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

Compilation message (stderr)

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: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30