제출 #1203819

#제출 시각아이디문제언어결과실행 시간메모리
1203819AvianshArranging Shoes (IOI19_shoes)C++20
50 / 100
1095 ms1968 KiB
#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

long long count_swaps(vector<int> s) {
    long long ans = 0;
    while(s.size()){
        int par = -1;
        for(int i = 1;i<s.size();i++){
            if(1LL*s[0]*s[i]<0){
                if(abs(s[0])==abs(s[i])){
                    par=i;
                    break;
                }
            }
        }
        if(s[0]<0){
            ans+=par-1;
        }
        else{
            ans+=par;
        }
        s.erase(s.begin()+par);
        s.erase(s.begin());
    }
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...