Submission #667784

#TimeUsernameProblemLanguageResultExecution timeMemory
667784coding_snorlaxArranging Shoes (IOI19_shoes)C++14
50 / 100
1083 ms3120 KiB
#include<bits/stdc++.h>
#include "shoes.h"
using namespace std;
long long int count_swaps(vector<int> s){
    int now=s[0];
    int time=0;
    long long int Count_answer=0;
    for(int k=0;k<(int)s.size()/2;k++){
        for(int i=time;i<(int)s.size();i++){
            if(s[i]==-now){
                //cout<<i<<" "<<time<<endl;
                if(s[time]>0) Count_answer+=i-time;
                else Count_answer+=i-time-1;
                for(int j=i-1;j>=time;j--){
                    int tmp=s[j];
                    s[j]=s[j+1];
                    s[j+1]=tmp;
                }
                break;
            }
        }
        time+=2;
        now=s[time];

    }
    return Count_answer;
}
#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...