제출 #153784

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
153784		asifthegreat	Arranging Shoes (IOI19_shoes)	C++14	65 / 100	140 ms	12152 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
#include "shoes.h"

const int N = 300000;


long long subtask3(std::vector<int>s){
	set<int>st;
	for(auto i: s)st.insert(i);
	if(st.size() != 2)return 0ll;
	queue<int>q;
	for(int i = 0; i < (int)s.size();i++){
		if(s[i] < 0)q.push(i);
	}
	long long ans = 0;
	for(int i = 0; i < (int)s.size();i+=2){
		ans += (long long)q.front()-i;
		q.pop();
	}
	return ans;
}


long long count_swaps(std::vector<int> s) {
	int n = s.size();
	if(true and n > 2000){
		int ans_3 = subtask3(s);
		if(ans_3)return ans_3;
	}
	if(true){
		int papa = n/2;
		bool ok = true;
		for(int i = 0; 	i < papa;i++){
			if(s[i] == -s[i+papa] and s[i] < 0)continue;
			ok = false;break;
		}
		if(ok){
			long long nn = (int)s.size()/2ll;
			return nn*(nn-1ll)/2ll;
		}
	}
	int cnt = 0;
	for(int i = 0; i < n;i+=2){
		int k = -69;
		for(int j = i+1; j < n;j++){
			if(s[i] == -s[j]){k = j;break;}
		}
		while(k != i+1){
			swap(s[k],s[k-1]);
			k--;
			cnt++;
		}
		if(s[i] > 0){
			swap(s[i],s[i+1]);cnt++;
		}
	}
	return cnt;
}

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