# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1120297 | hihihihaw | 무제 (POI11_rot) | C++17 | 29 ms | 19660 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
ordered_set v[100023];
int ans;
void calc(int x){
int a;
cin>>a;
if (a!=0){
v[x].insert(a);
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;
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;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |