# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890299 | svaz | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 348 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;
bool enc=false;
for(int i=0;i<S.size()-1;i++){
if((S[i]*-1)==S[i+1] ){
if(S[i]<0 && S[i+1]>0)enc=true;
else sw++;
if(i%2==0)i++;
}
else sw++;
}
if(!enc)sw++;
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... |