제출 #971790

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

shoes

#include <bits/stdc++.h>

#include "shoes.h"

using namespace std;

long long count_swaps(std::vector<int> s) {
	int n = s.size();
	map<int,int> M, M1;
	vector<int> a = s;
	for(int i = 0 ; i < n; i++) {
        if(a[i] > 0) {
            M[a[i]] += 1;
        }
        else {
            M1[a[i]] += 1;
        }
	}
	int ok = 0;
	for(int i = 0; i < n; i++) {
        if(a[i] > 0) {
            if(M[a[i]] != M1[-a[i]]) {
                ok = 1;
            }
        }
	}
	if(ok) {
        return - 1;
	}
	vector<int> izracunao(n, 0);
	int ans = 0;
	for(int i = 0; i < n; i++) {
        if(izracunao[i]) {
            continue;
        }
        if(a[i] > 0) {
            int idx = - 1;
            for(int j = i + 1; j < n; j++) {
                if(izracunao[j]) {
                    continue;
                }
                if(a[i] == - a[j]) {
                    idx = j;
                    break;
                }
            }
            ans += idx - i;
            izracunao[idx] = 1;
            //cout << "1 :::" << i << " " << idx << "\n";
        }
        else {
            int idx = - 1;
            for(int j = i; j < n; j++) {
                if(izracunao[j]) {
                    continue;
                }
                if(a[i] == - a[j]) {
                    idx = j;
                    break;
                }
            }
            ans += idx - i - 1;
            izracunao[idx] = 1;
            //cout << "2 :::" << i << " " << idx << "\n";
        }
	}
	return ans;
}

/*
int main() {
    cout << count_swaps({- 2, 2, 2, - 2, - 2, 2});
}*/

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