제출 #1067861

#제출 시각아이디문제언어결과실행 시간메모리
1067861LittleOrangeArranging Shoes (IOI19_shoes)C++17
10 / 100
1098 ms3416 KiB
#include "shoes.h" #include<bits/stdc++.h> using namespace std; using ll = long long; long long count_swaps(std::vector<int> s) { ll n = s.size()/2; ll ans = n*n*10; vector<ll> p(n*2); iota(p.begin(),p.end(),0); do{ ll ok = 1; for(ll i = 0;i<n;i++){ if (s[p[i*2]]>0||s[p[i*2+1]]<0||s[p[i*2]]+s[p[i*2+1]]!=0) { ok = 0; break; } } if(ok){ ll cur = 0; for(ll i = 0;i<n*2&&cur<ans;i++) for(ll j = i+1;j<n*2&&cur<ans;j++){ cur += p[i]>p[j]; } ans = min(ans,cur); } }while(next_permutation(p.begin(),p.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...