Submission #378482

#TimeUsernameProblemLanguageResultExecution timeMemory
378482autumn_eelArranging Shoes (IOI19_shoes)C++14
50 / 100
1073 ms3308 KiB
#include "shoes.h" #include <bits/stdc++.h> #define rep(i,n)for(int i=0;i<int(n);i++) using namespace std; typedef long long ll; long long count_swaps(std::vector<int> s) { ll ans=0; for(int i=0;i<(int)s.size();i+=2){ int idx=-1; for(int j=i+1;j<(int)s.size();j++){ if(s[j]==-s[i]){idx=j;break;} } while(idx!=i+1){ swap(s[idx-1],s[idx]); idx--; ans++; } if(s[i]>0){ swap(s[i],s[i+1]); ans++; } } 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...