Submission #1120258

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120258		hihihihaw	Untitled (POI11_rot)	C++17	0 / 100	92 ms	65536 KiB

Main

#pragma GCC optimize("O3,unroll-loops,fast-math")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define int long long
#define pb push_back
#define pii pair<int, int>
#define sz(v) (int)v.size()
#define fi first
#define se second
#define INF 999999992000000023
#define MOD 1000000007
#define cint(x) int x;cin >> x;
#define cinarr(a, n)  int a[n]; for (int i = 0; i < n; i++) cin >> a[i];
#define coutarr(a) for (auto d : a){cout << d << " ";} cout << endl;
#define coutarrD(a) for (auto d : a) {cout << d.fi << "," << d.se << " "; }cout << endl;
#define BERKAY_TUP  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
#define ld long double
#define mid (start + end) / 2
#define vvi vector<vector<int>>

int t=1;
int interactive=0;
int usaco=0;
int testCase=0;
int tre[800023];
ordered_set v[800023];
void get(int x){
    int a;
    cin>>a;
    tre[x]=a;
    if (a!=0) return;;
    get(2*x);
    get(2*x+1);
}
int ans;
void calc(int x){
    if (tre[x]!=0){
        v[x].insert(tre[x]);
        return;
    }
    calc(2*x);
    calc(2*x+1);
    if (sz(v[2*x])>sz(v[2*x+1])) v[2*x].swap(v[2*x+1]);
    int ans1=0,ans2=0;
    for (auto d:v[2*x]){
        int g=v[2*x+1].order_of_key(d);
        ans1+=g;
        ans2+=sz(v[2*x+1])-g;
    }
    ans+=min(ans1,ans2);
    v[x].swap(v[2*x+1]);
    for (auto d:v[2*x]){
        v[x].insert(d);
    }
}
void solve(){
    int n;
    cin>>n;
    get(1);
    calc(1);
    cout<<ans<<endl;
    

    

    



   
    

}

int32_t main(){
    BERKAY_TUP;
    if (usaco)
    {
        freopen("help.in", "r", stdin);
        freopen("help.out", "w", stdout);
    }
    if (!interactive)
    {
#ifdef Local
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        // freopen("wormsort.out", "w", stdout);
#endif
    }
    if (t == 1)
        solve();
    else
    {
        cin >> t;
        while (t--)
        {
            testCase++;
            solve();
        }
    }

    return 0;
}

Compilation message (stderr)

rot.cpp: In function 'int32_t main()':
rot.cpp:85:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         freopen("help.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
rot.cpp:86:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         freopen("help.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10