제출 #144177

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
144177		FelixMP	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	3 ms	376 KiB

shoes

#include "shoes.h"

using namespace std;

typedef long long int ll;

long long count_swaps(std::vector<int> s) {
	int n = s.size();
    vector<ll> open = vector<ll>(n+1, 0);
    vector<bool> openR = vector<bool>(n+1, false);
    ll copen = 0;
    ll inv = 0;
    ll sol = 0;
    for(int i=0; i < n; ++i) {
        ll cs = (s[i] > 0) ? s[i] : -s[i]; 
        if(s[i] > 0) {
            if(open[cs] > 0 and !openR[cs]) {
                copen--;
                open[cs]--;
                sol += copen;
                if(open[cs] == 0) {
                    
                }
            }
            else {
                open[cs]++;
                sol += copen;
                copen++;
                if(open[cs] == 1) {
                    openR[cs] = true;
                }
            }
        }
        else {
            if(open[cs] > 0 and openR[cs]) {
                copen--;
                open[cs]--;
                sol += copen;
                inv++;
                if(open[cs] == 0) {
                    openR[cs] = false;
                }
            }
            else {
                open[cs]++;
                sol += copen;
                copen++;
            }
        }
    }
    return sol+inv;
}

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