Submission #1219436

#TimeUsernameProblemLanguageResultExecution timeMemory
1219436moondarksideArranging Shoes (IOI19_shoes)C++20
50 / 100
1095 ms1864 KiB
#include <iostream> #include<bits/stdc++.h> using namespace std; int pushDown(int x, int y,vector<int>& S) { int vo=S[y]; for(int i=y; i>x; i--) { S[i]=S[i-1]; } S[x]=vo; return y-x; } int count_swaps(std::vector<int>S) { long long swaps=0; for(int i=0; i<S.size(); i+=2) { if(S[i]<0){ int k=i+1; for(;S[k]!=-S[i];k++){} swaps+=pushDown(i+1,k,S); } else{ int k=i+1; for(;S[k]!=-S[i];k++){} swaps+=pushDown(i,k,S); } } 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...