Submission #1311419

#TimeUsernameProblemLanguageResultExecution timeMemory
1311419putuputuArranging Shoes (IOI19_shoes)C++20
50 / 100
1095 ms1976 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; int n=m/2; //bool ok=true; int cnt=0; for(int i=0; i<n; i++){ if(!(a[i]<0 && abs(a[i])==a[i+n] && a[i+n]>0)){ cnt++; } // if(a[i]!=a[i+n]){ // ok=false; // } } if(cnt==0){ return(n*(n-1)/2); } 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...