oj.uz

답안 #727364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
727364 2023-04-20T13:37:33 Z shadow_sami Art Collections (BOI22_art) C++17
50 / 100
 775 ms 588 KB 
#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;
}

void solve(int k){
    vector<int> aa(k),init(k);
    fip(0,k){
        init[i] = aa[i] = i+1;
    }    
    prime = publish(aa);
    merge(0,k-1,aa,init);
    vector<int> v = aa;
    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

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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Correct 3 ms 208 KB Output is correct
26 Correct 29 ms 284 KB Output is correct
27 Correct 28 ms 208 KB Output is correct
28 Correct 53 ms 284 KB Output is correct
29 Correct 50 ms 208 KB Output is correct
30 Correct 51 ms 280 KB Output is correct
31 Correct 49 ms 284 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 2 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Correct 3 ms 208 KB Output is correct
26 Correct 29 ms 284 KB Output is correct
27 Correct 28 ms 208 KB Output is correct
28 Correct 53 ms 284 KB Output is correct
29 Correct 50 ms 208 KB Output is correct
30 Correct 51 ms 280 KB Output is correct
31 Correct 49 ms 284 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 2 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 2 ms 208 KB Output is correct
42 Correct 2 ms 208 KB Output is correct
43 Correct 2 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 31 ms 208 KB Output is correct
46 Correct 26 ms 208 KB Output is correct
47 Correct 46 ms 288 KB Output is correct
48 Correct 49 ms 284 KB Output is correct
49 Correct 51 ms 208 KB Output is correct
50 Correct 52 ms 328 KB Output is correct
51 Correct 0 ms 208 KB Output is correct
52 Correct 92 ms 208 KB Output is correct
53 Correct 83 ms 208 KB Output is correct
54 Correct 154 ms 208 KB Output is correct
55 Correct 159 ms 208 KB Output is correct
56 Correct 156 ms 208 KB Output is correct
57 Correct 155 ms 208 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 1 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 2 ms 208 KB Output is correct
64 Correct 2 ms 208 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Correct 3 ms 208 KB Output is correct
26 Correct 29 ms 284 KB Output is correct
27 Correct 28 ms 208 KB Output is correct
28 Correct 53 ms 284 KB Output is correct
29 Correct 50 ms 208 KB Output is correct
30 Correct 51 ms 280 KB Output is correct
31 Correct 49 ms 284 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 2 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 2 ms 208 KB Output is correct
42 Correct 2 ms 208 KB Output is correct
43 Correct 2 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 31 ms 208 KB Output is correct
46 Correct 26 ms 208 KB Output is correct
47 Correct 46 ms 288 KB Output is correct
48 Correct 49 ms 284 KB Output is correct
49 Correct 51 ms 208 KB Output is correct
50 Correct 52 ms 328 KB Output is correct
51 Correct 0 ms 208 KB Output is correct
52 Correct 92 ms 208 KB Output is correct
53 Correct 83 ms 208 KB Output is correct
54 Correct 154 ms 208 KB Output is correct
55 Correct 159 ms 208 KB Output is correct
56 Correct 156 ms 208 KB Output is correct
57 Correct 155 ms 208 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 1 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 2 ms 208 KB Output is correct
64 Correct 2 ms 208 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 3 ms 208 KB Output is correct
67 Correct 2 ms 208 KB Output is correct
68 Correct 3 ms 208 KB Output is correct
69 Correct 3 ms 208 KB Output is correct
70 Correct 32 ms 280 KB Output is correct
71 Correct 31 ms 296 KB Output is correct
72 Correct 52 ms 280 KB Output is correct
73 Correct 54 ms 280 KB Output is correct
74 Correct 53 ms 208 KB Output is correct
75 Correct 54 ms 288 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 95 ms 208 KB Output is correct
78 Correct 89 ms 332 KB Output is correct
79 Correct 152 ms 208 KB Output is correct
80 Correct 147 ms 208 KB Output is correct
81 Correct 155 ms 208 KB Output is correct
82 Correct 163 ms 208 KB Output is correct
83 Incorrect 775 ms 588 KB Not correct
84 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Correct 3 ms 208 KB Output is correct
26 Correct 29 ms 284 KB Output is correct
27 Correct 28 ms 208 KB Output is correct
28 Correct 53 ms 284 KB Output is correct
29 Correct 50 ms 208 KB Output is correct
30 Correct 51 ms 280 KB Output is correct
31 Correct 49 ms 284 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 2 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 2 ms 208 KB Output is correct
42 Correct 2 ms 208 KB Output is correct
43 Correct 2 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 31 ms 208 KB Output is correct
46 Correct 26 ms 208 KB Output is correct
47 Correct 46 ms 288 KB Output is correct
48 Correct 49 ms 284 KB Output is correct
49 Correct 51 ms 208 KB Output is correct
50 Correct 52 ms 328 KB Output is correct
51 Correct 0 ms 208 KB Output is correct
52 Correct 92 ms 208 KB Output is correct
53 Correct 83 ms 208 KB Output is correct
54 Correct 154 ms 208 KB Output is correct
55 Correct 159 ms 208 KB Output is correct
56 Correct 156 ms 208 KB Output is correct
57 Correct 155 ms 208 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 1 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 2 ms 208 KB Output is correct
64 Correct 2 ms 208 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 3 ms 208 KB Output is correct
67 Correct 2 ms 208 KB Output is correct
68 Correct 3 ms 208 KB Output is correct
69 Correct 3 ms 208 KB Output is correct
70 Correct 32 ms 280 KB Output is correct
71 Correct 31 ms 296 KB Output is correct
72 Correct 52 ms 280 KB Output is correct
73 Correct 54 ms 280 KB Output is correct
74 Correct 53 ms 208 KB Output is correct
75 Correct 54 ms 288 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 95 ms 208 KB Output is correct
78 Correct 89 ms 332 KB Output is correct
79 Correct 152 ms 208 KB Output is correct
80 Correct 147 ms 208 KB Output is correct
81 Correct 155 ms 208 KB Output is correct
82 Correct 163 ms 208 KB Output is correct
83 Incorrect 775 ms 588 KB Not correct
84 Halted 0 ms 0 KB -