Submission #1292366

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292366		MMihalev	Arranging Shoes (IOI19_shoes)	C++20	45 / 100	24 ms	2740 KiB

shoes

#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include "shoes.h"
using namespace std;
const int MAX_N=1e5+5;
deque<int>pos[2];
long long count_swaps(std::vector<int> s)
{
    for(int i=0;i<s.size();i++)
    {
        if(s[i]<0)pos[0].push_back(i);
        else pos[1].push_back(i);
    }

    long long ans=0;
    for(int i=0;i<s.size();i++)
    {
        int wh=i%2;
        ans+=max(0,pos[wh].front()-i);
        pos[wh].pop_front();
    }
    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