Submission #890304

#TimeUsernameProblemLanguageResultExecution timeMemory
890304svazArranging Shoes (IOI19_shoes)C++14
0 / 100
0 ms348 KiB
#include "shoes.h"
#include<iostream>
#include<vector>
using namespace std;
long long count_swaps(std::vector<int> S){
    long long sw=0;
    bool enc=false;
    int tam=S.size()-1;
    for(int i=0;i<tam;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;
}*/
#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...