Submission #1047245

#TimeUsernameProblemLanguageResultExecution timeMemory
1047245vjudge1Arranging Shoes (IOI19_shoes)C++17
50 / 100
1098 ms3284 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> s) { int n= s.size(); int ans=0; for(int i = 0;i<n;i+=2) { int idx=-1; for(int j = i+1;j<n;j++) { if(s[j] == -s[i]){ idx=j; break; } } if(idx==-1)continue; while(idx > i+1) { swap(s[idx], s[idx-1]); ans++; idx--; } if(s[i] > 0){ swap(s[idx], s[idx-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...