# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889516 | svaz | Arranging Shoes (IOI19_shoes) | C++14 | 1 ms | 440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#include "shoes.h"
#include<iostream>
#include<vector>
using namespace std;
long long count_swaps(std::vector<int> S){
vector<bool>visitados(S.size(),false);
long long sw=0;
int buscado;
for(int i=0;i<S.size();i++){
if(!visitados[i]){
buscado=S[i]*-1;
for(int j=i+1;j<S.size();j++){
if(S[j]==buscado){
sw+=j-i;
if(buscado>0)sw--;
visitados[i]=visitados[j]=true;
break;
}
}
}
}
return sw;
}
/*int main(){
int n,zap;
cin>>n;
vector<int>zapatos;
for(int i=0;i<(n*2);i++){
cin>>zap;
zapatos.push_back(zap);
}
cout<<count_swaps(zapatos)<<"\n";
return 0;
}*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |