Submission #1215813

#TimeUsernameProblemLanguageResultExecution timeMemory
1215813TaxiradioArranging Shoes (IOI19_shoes)C++20
0 / 100
0 ms328 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> s) { vector<int> a; int n = s.size()/2; for(int i = 0; i < n*2; i++){ if(s[i] < 0)a.push_back(s[i]); } sort(a.begin() , a.end()); int ans = 1e9; do{ int ans2 = 0; vector<int> u = s; for(int i = 0; i < n*2; i++){ for(int j = i; j < n*2; j++){ if(u[j] == (i%2)?a[i/2]:a[i/2]*(-1)){ for(int z = j; z > i; z--){ swap(u[z] , u[z-1]); ans2++; } break; } } } ans = min(ans , ans2); }while(next_permutation(a.begin() , a.end())); 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...