제출 #900672

#제출 시각아이디문제언어결과실행 시간메모리
900672ozner77Arranging Shoes (IOI19_shoes)C++17
0 / 100
1 ms600 KiB
#include "shoes.h" #include <bits/stdc++.h> #include <vector> #include <iostream> #include <string> #include <algorithm> using namespace std; long long count_swaps(vector<int> s) { vector<int>::iterator it; int e=s.size(),k; long long swaps=0; for(int i=0;i<e;i++){ if(s[i]>0){ swaps++; } it=find(s.begin(),s.end(),-i); k=(int)*it; swaps+=(k-(i+1)); s.erase(s.begin()+k); e=s.size(); } return swaps; }
#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...