Submission #305983

#TimeUsernameProblemLanguageResultExecution timeMemory
305983amunduzbaevArranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms256 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(vector<int> a) { int n=a.size()/2; long long ns=0; for(int i=0;i<n;i++){ if(a[i*2]+a[i*2+1]==0){ if(a[i*2]>a[i*2+1]){ swap(a[i*2],a[i*2+1]); ns++; } continue; } int j; for(j=2*i+1;j<2*n;j++){ if(a[j]+a[i*2]==0) break; } int r=a[j]; a.erase(a.begin()+j); if(r<0) a.insert(a.begin()+(i*2),r); else a.insert(a.begin()+(i*2)+1,r); ns+=j-(2*i); } return ns; }
#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...