제출 #1320163

#제출 시각아이디문제언어결과실행 시간메모리
1320163marzuq01Arranging Shoes (IOI19_shoes)C++20
10 / 100
15 ms3092 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
	//same size;
	int n2 = s.size();
	int n = n2 / 2;
	vector<int> left,right;
	for (int i = 0; i < n2;i++) {
        if (s[i] < 0) left.push_back(i);
        else right.push_back(i);
	}
	int count = 0;
	for (int i = 0; i < n;i++) {
        count += abs((2*i) - left[i]);
	}
	return count;
}
#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...