제출 #1320165

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