Submission #305955

#TimeUsernameProblemLanguageResultExecution timeMemory
305955amunduzbaevArranging Shoes (IOI19_shoes)C++14
10 / 100
1083 ms384 KiB
#include "shoes.h" #include <bits/stdc++.h> //#include "grader.cpp" using namespace std; long long count_swaps(vector<int> a) { int n=a.size(); long long ns=0; for(int i=0;i<n;i++){ if(a[i]<0){ if(a[i+1]==a[i]*-1){ i++; continue; } int j=i+1; while(a[j]!=a[j-1]*-1){ swap(a[j],a[j-1]); j++; ns++; } i--; }else{ if(a[i-1]==a[i]*-1&&i>0){ continue; } int j=i+1; while(a[j]!=a[j-1]*-1){ swap(a[j],a[j-1]); j++; ns++; } swap(a[j],a[j-1]); ns++; i--; } } return ns; }
#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...