제출 #301931

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301931		NicolaAbusaad2014	Arranging Shoes (IOI19_shoes)	C++14	45 / 100	39 ms	6132 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

long long count_swaps(std::vector<int> s) {
    long n=s.size();
    vector<long>left;
    vector<long>right;
    bool ok[n]={};
    long now=0,arr[n]={},x=0,z,ans=0;
    for(long i=0;i<n;i++){
    if(s[i]<0){
    left.push_back(i);
    }
    else{
    right.push_back(i);
    }
    }
    for(long i=0;i<n;i++){
    x+=arr[i];
    if(!ok[i]){
    if(s[i]<0){
    z=right[now];
    ok[right[now]]=true;
    now++;
    arr[i+1]++;
    arr[z]--;
    ans+=z-x-i-1;
    }
    else{
    ans++;
    z=left[now];
    ok[left[now]]=true;
    now++;
    arr[i+1]++;
    arr[z]--;
    ans+=z-x-i-1;
    }
    }
    }
    return ans;
}

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