Submission #1287365

#TimeUsernameProblemLanguageResultExecution timeMemory
1287365eri16Arranging Shoes (IOI19_shoes)C++20
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> using namespace std; long long count_swaps(vector <int> v){ long long cnt=0; long long cur=0; for (int i=0; i<v.size(); i++){ if (i%2==0){ cur=(v[i])*(-1); int k=v[i]; v[i]=k; } else{ for (int j=i; j<v.size(); j++){ if (v[j]==cur){ cnt+=(j-i); int k=v[j]; for (int ii=j; ii>i; ii--){ v[ii]=v[ii-1]; } v[i]=k; break; } } if (v[i]<v[i-1]){ cnt++; } } for (int i=0; i<v.size(); i++){ cout<<v[i]<<' '; } cout<<"\n"; } 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...