# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
57455 | leejseo | 공장 (KOI13_factory) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long lld;
int X[1000001], N;
vector<int> L;
vector<int> temp;
void input(){
scanf("%d", &N);
int val;
for (int i=0; i<N; i++){
scanf("%d", &val);
X[val] = i;
}
for (int i=0; i<N; i++){
scanf("%d", &val);
L.push_back(X[val]);
}
L.push_back((int) 1e9);
}
lld merge_sort(int fr, int ed){
if (ed <= fr+3){
lld ans = 0;
for (int i=fr; i<=ed; i++){
for (int j=fr; j<i; j++){
if (L[j] > L[i]) ans++;