Submission #201730

#	Time	Username	Problem	Language	Result	Execution time	Memory
201730		a_player	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1091 ms	137848 KiB

shoes

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5;

deque<int> d[2*MAXN];
int sh[MAXN];
bitset<MAXN> v;

long long count_swaps(vector<int> s) {
    int N=s.size();
    long long ans=0;
	for(int i=0;i<N;i+=2){
        int j=i+1;
        for(;j<N;j++)if(s[j]+s[i]==0)break;
        for(int k=j;k>=i+2;k--)swap(s[k],s[k-1]),ans++;
        if(s[i]>s[i+1])swap(s[i],s[i+1]),ans++;
    }
    return ans;
}

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