제출 #1349409

#제출 시각아이디문제언어결과실행 시간메모리
1349409cpismayilmmdv985Arranging Shoes (IOI19_shoes)C++20
0 / 100
0 ms344 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

long long count_swaps(vector<int> S) {
   int64_t N = (int)S.size() >> 1, res = 0;
   vector<int> sorted = S; sort(sorted.begin(), sorted.end());
   for (int i = 0; i < (N << 1); i++)  res += (sorted[i] != S[i]);
   return res;
}
#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...