Submission #1351385

#TimeUsernameProblemLanguageResultExecution timeMemory
1351385ElayV13Arranging Shoes (IOI19_shoes)C++20
50 / 100
1096 ms1960 KiB
#include "shoes.h"
#include "bits/stdc++.h"
using namespace std;

#define ll long long

ll count_swaps(vector<int>s)
{
      int n=(int)s.size();
      ll res=0;
      for(int i=0;i<n;i+=2){
            int fi=-1;
            for(int j=i+1;j<n;j++){
                  if(-s[j]==s[i]){
                        fi=j;
                        break;
                  }
            }
            while(fi!=i+1){
                  ++res;
                  swap(s[fi],s[fi-1]);
                  fi--;
            }
            if(s[i]>0){
                  ++res;
                  swap(s[i],s[i+1]);
            }
      }
      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...