제출 #543075

#제출 시각아이디문제언어결과실행 시간메모리
543075Anas_AbuAmarArranging Shoes (IOI19_shoes)C++14
50 / 100
1084 ms3896 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
   long long ans = 0;
   deque<int>d;
   for (auto &i:s){
      d.push_back(i);
   }
   while(!d.empty()){
      int cur = d.front();
      auto next = find(d.begin() , d.end() ,cur*-1);
      ans += (next-d.begin())-1;
      if (cur > 0 ){
         ans++;
      }
      d.erase(next);
      d.pop_front();
   }
   return ans;
}
#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...