Submission #147075

#TimeUsernameProblemLanguageResultExecution timeMemory
147075youssan_williamArranging Shoes (IOI19_shoes)C++14
0 / 100
3 ms504 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; bool v[100005]; ll count_swaps( vector<int>s ) { ll n = s.size()/2 ; ll ans=0; for(int i = 1 ; i <=2*n ; i++) { if(!v[abs(s[i])]) { v[abs(s[i])]=1; for(int j =i+1 ; j <= 2 * n ;j++) { if(abs(s[i])==abs(s[j])) { for(int k=j-1 ; k>i ;k--) { swap(s[k],s[k+1]); ans++; } break; } } } } for(int i = 1 ; i <=2*n ;i++ ) { if(i%2==1&&s[i]>s[i+1]) 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...