제출 #717493

#제출 시각아이디문제언어결과실행 시간메모리
717493josanneo22Arranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms484 KiB
#include<shoes.h> #include<bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> s) { int n=s.size(); int cnt=0; for(int i=0;i<n;i++){ int change=0; if(s[i]>0){ int j=i; if(j==0){ swap(s[j],s[j+1]); cnt++; change=1; j++; } while(s[j]!=-s[j-1]){ swap(s[j],s[j+1]);j++; change=1; cnt++; } } if(change) i--; } return cnt; }
#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...