제출 #1287361

#제출 시각아이디문제언어결과실행 시간메모리
1287361eri16Arranging Shoes (IOI19_shoes)C++20
10 / 100
1096 ms1960 KiB
#include <bits/stdc++.h>
using namespace std;

long long count_swaps(vector <int> v){
    
    long long cnt=0;
    
    long long cur=0;    
    
    for (int i=0; i<v.size(); i++){
        if (i%2==0){
        
            for (int j=i; j<v.size(); j++){
                if (v[j]<0){
                    cnt+=(j-i);
                    cur=abs(v[j]);
                    
                    int k=v[j];
                    
                    for (int ii=j; ii>i; ii--){
                        v[ii]=v[ii-1];
                    }
                    
                    v[i]=k;
                    
                    break;
                } 
            }
        }    
        
        else{
            for (int j=i; j<v.size(); j++){
                if (v[j]==cur){
                    cnt+=(j-i);
                    
                    int k=v[j];
                    
                    for (int ii=j; ii>i; ii--){
                        v[ii]=v[ii-1];
                    }
                    
                    v[i]=k;
                    
                    break;                    
                }    
            }
        }
        /*
        for (int i=0; i<v.size(); i++){
            cout<<v[i]<<' ';
        }
        cout<<"\n";
        */
    }
    return cnt;
}
#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...