제출 #888562

#제출 시각아이디문제언어결과실행 시간메모리
888562Lincito_31Arranging Shoes (IOI19_shoes)C++14
10 / 100
1043 ms5560 KiB
#include <bits/stdc++.h> #include "shoes.h" using namespace std; long long x=0; long long count_swaps(vector<int> s) { while(!s.empty()){ int i=0; while(s[i]>0){ i++; } x+=i; int abso=-1*s[i]; vector<int> ant(s.begin(),s.begin()+i); vector<int> pos(s.begin()+i+1,s.end()); ant.insert(ant.end(),pos.begin(),pos.end()); s=ant; i=0; while(s[i]!=abso){ i++; } x+=i; vector<int> ante(s.begin(),s.begin()+i); vector<int> post(s.begin()+i+1,s.end()); ante.insert(ante.end(),post.begin(),post.end()); s=ante; } return x; }
#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...