Submission #340611

#TimeUsernameProblemLanguageResultExecution timeMemory
340611israeladewuyiArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms364 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(); vector<ll> arr(n); for(int i = 0; i < n; i++){ arr[i] = s[i]; } ll swaps = 0; for(int i = 0; i < n-1; i++){ int y = abs(arr[i]); for(int j = i + 1; j< n; j++){ if(abs(arr[j]) == y){ while(abs(arr[i+1]) != y){ swap(arr[j],arr[j-1]); swaps++; j = j-1; } } } if(arr[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...