Submission #227184

#TimeUsernameProblemLanguageResultExecution timeMemory
227184urd05Arranging Shoes (IOI19_shoes)C++14
25 / 100
36 ms3368 KiB
#include <bits/stdc++.h> #include "shoes.h" using namespace std; vector<int> pl; vector<int> mi; long long count_swaps(vector<int> v) { int n=v.size()/2; for(int i=0;i<2*n;i++) { if (v[i]>0) { pl.push_back(i); } else { mi.push_back(i); } } long long ret=0; int used=0; for(int i=0;i<n;i++) { if (pl[i]>mi[i]) { ret+=pl[i]-mi[i]-1; } else { ret+=mi[i]-pl[i]; } ret-=used; used++; } return ret; }
#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...