Submission #1311399

#TimeUsernameProblemLanguageResultExecution timeMemory
1311399putuputuArranging Shoes (IOI19_shoes)C++20
50 / 100
1096 ms1960 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(vector<int>a){ int m=a.size(); long long s=0; for(int pos=0; pos<m; pos+=2){ if(a[pos]>0){ int nl=-a[pos]; int j=pos+1; while(j<m and a[j]!=nl){ j++; } while(j>pos){ swap(a[j], a[j-1]); j--; s++; } } int nr=-a[pos]; int j=pos+1; while(j<m and a[j]!=nr){ j++; } while(j>pos+1){ swap(a[j], a[j-1]); j--; s++; } } return s; }
#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...