Submission #340184

#TimeUsernameProblemLanguageResultExecution timeMemory
340184israeladewuyiArranging Shoes (IOI19_shoes)C++17
10 / 100
1082 ms3180 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<string> vs; #define PB push_back #define pb pop_back #define in insert #define endl "\n" const unsigned int M = 1000000007; ll count_swaps(vi s){ ll n = s.size(); ll swaps = 0; for(int i = 0; i < n-1; i+=2){ int y = abs(s[i]); for(int j = i + 1; j< n; j++){ if(abs(s[j]) == y){ while(abs(s[i+1]) != y){ swap(s[j],s[j-1]); swaps++; j = j-1; } } } if(s[i] > 0)swaps++; } return swaps; } //int main(){ // vi v; // v.PB(2); // v.PB(-2); // v.PB(2); // v.PB(-2); // cout<<count_swaps(v); //}
#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...