Submission #304867

#TimeUsernameProblemLanguageResultExecution timeMemory
304867azberjibiouArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms256 KiB
#include "shoes.h" #include <bits/stdc++.h> #define ll long long using namespace std; const int mxN=1010; bool Chk[2*mxN]; int N; ll ans; long long count_swaps(vector<int> s) { N=s.size()/2; for(int i=0;i<2*N;i+=2) { for(int j=i+1;j<2*N;j++) { if(s[i]!=-s[j]) continue; for(int k=j;k>=i+2;k--) { swap(s[k], s[k-1]); ans++; } if(s[i]>0) ans++; } } return ans; }
#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...