Submission #836173

#	Time	Username	Problem	Language	Result	Execution time	Memory
836173		Denkata	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	79 ms	134928 KiB

shoes

#include<bits/stdc++.h>
#include "shoes.h"
//#include "grader.cpp"
using namespace std;
const int maxn = 1e5+3;
long long i,j,ans,p;
deque <int> pos[maxn*2];
long long count_swaps(vector<int> s)
{
    ans = 0;
    j = 1;
    for(auto i:s)
    {
        if(pos[-i+maxn].empty())
            pos[i+maxn].push_back(j);
        else
        {
            p = pos[-i+maxn].front();
            pos[-i+maxn].pop_front();
            ans+=j-p-1;
            if(i<0)
                ans++;
        }
        j++;
    }
    return ans;
}

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