Submission #867399

#	Time	Username	Problem	Language	Result	Execution time	Memory
867399		lolismek	Arranging Shoes (IOI19_shoes)	C++14	45 / 100	22 ms	4020 KiB

shoes

#include "shoes.h"
#include <queue>

#define pii pair <int, int>

using namespace std;

long long count_swaps(vector<int> s){
    int n = (int)s.size();

    for(int i = 0; i < n; i++){
        if(s[i] < 0){
            s[i] = -1;
        }else{
            s[i] = +1;
        }
    }

    long long ans = 0;
    queue <pii> St;
    for(int i = 0; i < n; i++){
        if(!St.empty() && St.front().first == -s[i]){
            ans += ((int)St.size() - (St.front().first < s[i]));
            St.pop();
        }else{
            St.push({s[i], i});
        }
    }

    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