제출 #890304

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890304		svaz	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	0 ms	348 KiB

shoes

#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;
}*/

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15