Submission #670545

#TimeUsernameProblemLanguageResultExecution timeMemory
670545birthdaycakeArranging Shoes (IOI19_shoes)C++17
10 / 100
41 ms3652 KiB
#include<bits/stdc++.h> #include "shoes.h" using namespace std; int vs[1001]; long long count_swaps(vector<int>s) { long long n = s.size(); long long ans = 0; for(int i = 0; i < n; i++){ int f = 0; for(int j = 0; j < i; j++){ if(!vs[j] && s[i] == -s[j]){ f = j + 1; break; } } if(f){ f--; vs[f] = 1; vs[f + 1] = 1; if(s[f] < 0) ans += (i - f - 1); else ans += (i - f); while(i != f + 1){ swap(s[i], s[i - 1]); i--; } if(s[f] > 0) swap(s[f], s[f + 1]); } } 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...