| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 427148 | dreezy | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*
long long count_swaps(vector<int> s) {
ll ans = 0;
int n = s.size();
int first = 0;
for(int i =0; i<n; i++){
if(s[i] < 0){
ans += abs(i - first);
first +=2;
}
}
return ans;
}
*/
/*SUBTASK 2*/
//something is wrong, ill come back to it later
//i need to think more
long long count_swaps(vector<int> s) {
ll ans = 1e18;
int n = s.size();
vector<int> lefts(n/2);
int cntleft = 0;
vector<pair<int, int>> sortlefts(n/2);
vector<bool> ava(n, 1);
for(int i =0; i<n; i++){
if(s[i] < 0){
lefts[cntleft++] = i;
int firstright = -1;
for(int j =0; j<n ;j++){
if(ava[j] and s[j] == -s[i]){
ava[j] = false;
firstright = j;
break;
}
}
sortlefts[cntleft - 1] = {(i+firstright)/2, i};
}
}
sort(sortlefts.begin(), sortlefts.end());
for(int i =0; i<n/2; i++){
lefts[i] = sortlefts[i].second;
}
do{
ll posans = 0;
vector<bool> available(n, 1);
vector<int> inds(n);
for(int i =0; i<n ;i++) inds[i] = i;
//for(int i =0; i<n/ 2; i++) cout << lefts[i]<<", "; cout <<endl;
for(int l =0; l<n/2; l++){
//get first availabe
int firstright =-1;
for(int i =0; i<n ;i++){
//cout <<s[lefts[l]]<<": "<<s[i]<<' ';
if(available[i] and s[i] == -s[lefts[l]]){
firstright = i;
available[i] = false;
break;
}
}
//cout <<endl;
ll dist1 = abs(inds[lefts[l]] - 2 * l);
for(int k = 0; k<n ;k++){
if(inds[k] >= 2 * l && inds[k] < inds[lefts[l]])
inds[k]++;
}
ll dist2 = abs(inds[firstright] -( 2 * l + 1));
for(int k =0;k<n; k++){
if(inds[k] >=2* l + 1 and inds[k] < inds[firstright])
inds[k]++;
}
//cout << inds[lefts[l]]<<", "<<inds[firstright]<<": ";
//cout << lefts[l]<<", "<<firstright<<": "<<dist1<<", "<<dist2<<endl;
posans += dist1 + dist2;
}
ans = min(ans, posans);
//cout << posans<<endl<<endl;
}while(next_permutation(lefts.begin(), lefts.end()));
return ans;
}
/***********/