제출 #401194

#제출 시각아이디문제언어결과실행 시간메모리
401194victoriadArranging Shoes (IOI19_shoes)C++14
45 / 100
36 ms3752 KiB
#include "shoes.h"
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;

long long count_swaps(std::vector<int> s) {
    long long int x=0;
    vector<int>menos;
    for(int i=0;i<(int)s.size();i++){
        if(s[i]<0)menos.push_back(i);
    }
    for(int i=0;i<(int)menos.size();i++){
        x+=abs(i*2-menos[i]);
    }
    return x;
}
#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...